1 files changed, 118 insertions, 0 deletions

diff --git a/rust/simple-linked-list/tests/simple-linked-list.rs b/rust/simple-linked-list/tests/simple-linked-list.rs
new file mode 100644
index 0000000..c89f8b5
--- /dev/null
+++ b/rust/simple-linked-list/tests/simple-linked-list.rs
@@ -0,0 +1,118 @@
+use simple_linked_list::SimpleLinkedList;
+
+#[test]
+fn test_new_list_is_empty() {
+    let list: SimpleLinkedList<u32> = SimpleLinkedList::new();
+    assert_eq!(list.len(), 0, "list's length must be 0");
+}
+
+#[test]
+fn test_push_increments_length() {
+    let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
+    list.push(1);
+    assert_eq!(list.len(), 1, "list's length must be 1");
+    list.push(2);
+    assert_eq!(list.len(), 2, "list's length must be 2");
+}
+
+#[test]
+fn test_pop_decrements_length() {
+    let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
+    list.push(1);
+    list.push(2);
+    list.pop();
+    assert_eq!(list.len(), 1, "list's length must be 1");
+    list.pop();
+    assert_eq!(list.len(), 0, "list's length must be 0");
+}
+
+#[test]
+fn test_is_empty() {
+    let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
+    assert!(list.is_empty(), "List wasn't empty on creation");
+    for inserts in 0..100 {
+        for i in 0..inserts {
+            list.push(i);
+            assert!(
+                !list.is_empty(),
+                "List was empty after having inserted {}/{} elements",
+                i,
+                inserts
+            );
+        }
+        for i in 0..inserts {
+            assert!(
+                !list.is_empty(),
+                "List was empty before removing {}/{} elements",
+                i,
+                inserts
+            );
+            list.pop();
+        }
+        assert!(
+            list.is_empty(),
+            "List wasn't empty after having removed {} elements",
+            inserts
+        );
+    }
+}
+
+#[test]
+fn test_pop_returns_head_element_and_removes_it() {
+    let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
+    list.push(1);
+    list.push(2);
+    assert_eq!(list.pop(), Some(2), "Element must be 2");
+    assert_eq!(list.pop(), Some(1), "Element must be 1");
+    assert_eq!(list.pop(), None, "No element should be contained in list");
+}
+
+#[test]
+fn test_peek_returns_reference_to_head_element_but_does_not_remove_it() {
+    let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
+    assert_eq!(list.peek(), None, "No element should be contained in list");
+    list.push(2);
+    assert_eq!(list.peek(), Some(&2), "Element must be 2");
+    assert_eq!(list.peek(), Some(&2), "Element must be still 2");
+    list.push(3);
+    assert_eq!(list.peek(), Some(&3), "Head element is now 3");
+    assert_eq!(list.pop(), Some(3), "Element must be 3");
+    assert_eq!(list.peek(), Some(&2), "Head element is now 2");
+    assert_eq!(list.pop(), Some(2), "Element must be 2");
+    assert_eq!(list.peek(), None, "No element should be contained in list");
+}
+
+#[test]
+fn test_from_slice() {
+    let mut array = vec!["1", "2", "3", "4"];
+    let mut list: SimpleLinkedList<_> = array.drain(..).collect();
+    assert_eq!(list.pop(), Some("4"));
+    assert_eq!(list.pop(), Some("3"));
+    assert_eq!(list.pop(), Some("2"));
+    assert_eq!(list.pop(), Some("1"));
+}
+
+#[test]
+fn test_reverse() {
+    let mut list: SimpleLinkedList<u32> = SimpleLinkedList::new();
+    list.push(1);
+    list.push(2);
+    list.push(3);
+    let mut rev_list = list.rev();
+    assert_eq!(rev_list.pop(), Some(1));
+    assert_eq!(rev_list.pop(), Some(2));
+    assert_eq!(rev_list.pop(), Some(3));
+    assert_eq!(rev_list.pop(), None);
+}
+
+#[test]
+fn test_into_vector() {
+    let mut v = Vec::new();
+    let mut s = SimpleLinkedList::new();
+    for i in 1..4 {
+        v.push(i);
+        s.push(i);
+    }
+    let s_as_vec: Vec<i32> = s.into();
+    assert_eq!(v, s_as_vec);
+}