Merge pull request #69 from heitor582/main

[rust] Adiciona estrutura de dados fila.rs

Author: kelvins

README.md

@@ -35,7 +35,7 @@ Com o objetivo de alcançar uma abrangência maior e encorajar novas pessoas a c
 | [Árvore Binária][4] | C/C++ | Java | [Python](./src/python/binary_tree.py) | Go | Ruby | JS | Pascal | Swift | Rust |
 | [Árvore Binária de Busca][3] | [C/C++](./src/c/ArvoreBinariaDeBusca.c) | [Java](./src/java/ArvoreDeBuscaBinaria.java) | [Python](./src/python/arvore_binaria_de_busca.py) | Go | Ruby | [JS](./src/javascript/ArvoreDeBuscaBinaria.js) | Pascal | Swift | Rust |
 | [Deque][54] | C/C++ | Java | Python | Go | Ruby | [JS](./src/javascript/Deque.js) | Pascal | Swift | [Rust](./src/rust/deque.rs) |
-| [Fila][18] | [C/C++](./src/c/Fila.c) | [Java](./src/java/Fila.java) | [Python](./src/python/fila.py) | Go | [Ruby](./src/ruby/Fila.rb) | [JS](./src/javascript/Fila.js) | Pascal | Swift | Rust |
+| [Fila][18] | [C/C++](./src/c/Fila.c) | [Java](./src/java/Fila.java) | [Python](./src/python/fila.py) | Go | [Ruby](./src/ruby/Fila.rb) | [JS](./src/javascript/Fila.js) | Pascal | Swift | [Rust](./src/rust/fila.rs) |
 | [Fila Encadeada Dinâmica][19] | [C/C++](./src/c/FilaEncadeadaDinamica.c) | Java | Python | Go | Ruby | JS | Pascal | Swift | Rust |
 | [Grafo][20] | [C/C++](./src/c/Grafos.c) | Java | Python | Go | Ruby | JS | Pascal | Swift | Rust |
 | [Lista Circular Ligada][52] | [C/C++](./src/c/ListaCircularLigada.c) | Java | [Python](./src/python/lista_encadeada_circular.py) | Go | Ruby | JS | Pascal | Swift | Rust |

src/rust/deque.rs

@@ -1,3 +1,4 @@
+#[derive(Debug)]
 struct Deque<T> {
  deque: Vec<T>
 }
@@ -38,4 +39,20 @@ impl<T> Deque<T> {
  fn peek_last(&self) -> Option<&T> {
  self.deque.last()
  } 
+}
+
+fn main(){
+ let mut deque: Deque<i32> = Deque::<i32>::new();
+ deque.add_first(1);
+ deque.add_last(2);
+ deque.add_first(3);
+ println!("{:?}", deque);
+ deque.remove_last();
+ deque.remove_first();
+ println!("{:?}", deque);
+ println!("length: {:?}, is empty? {:?}", deque.length(), deque.is_empty());
+ deque.add_first(1);
+ deque.add_last(2);
+ deque.add_first(3);
+ println!("{:?}, {:?}", deque.peek(), deque.peek_last());
 }

src/rust/fila.rs

@@ -0,0 +1,41 @@
+#[derive(Debug)]
+struct Fila<T> {
+ fila: Vec<T>
+}
+
+impl<T> Fila<T> {
+ fn new() -> Self {
+ Fila { fila: Vec::new() }
+ }
+
+ fn length(&self) -> usize {
+ self.fila.len()
+ }
+
+ fn enqueue(&mut self, item: T) {
+ self.fila.push(item)
+ }
+
+ fn dequeue(&mut self) -> T {
+ self.fila.remove(0)
+ }
+ fn is_empty(&self) -> bool {
+ self.fila.is_empty()
+ }
+
+ fn peek(&self) -> Option<&T> {
+ self.fila.first()
+ }
+}
+
+fn main(){
+ let mut fila: Fila<i32> = Fila::<i32>::new();
+ fila.enqueue(1);
+ println!("{:?}", fila);
+ fila.dequeue();
+ println!("length: {:?}, is empty? {:?}", fila.length(), fila.is_empty());
+ fila.enqueue(1);
+ fila.enqueue(2);
+ fila.enqueue(3);
+ println!("{:?}", fila.peek());
+}