easy_linked_list 0.1.4

easy linked list is easy to work
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

mod Linked_List;

use Linked_List::List;



#[test]
fn test_list() {
    ///struct example
    #[derive(Debug)]
    struct Person {
        name: String,
        age: i32,
    }

    let mut list = List::new();
    let mut persons = List::new();

    persons.add(Person { name: "saeed".to_string(), age: 25 });
    persons.add(Person { name: "reza".to_string(), age: 30 });
    persons.add(Person { name: "ali".to_string(), age: 45 });

    println!("persons before remove array:{:?}", persons.to_array());

    persons.remove_index(1);

    println!("persons after remove array:{:?}", persons.to_array());

    match persons.get_by_index(1) {
        Some(z) => println!("{:?}", z),
        None => println!("not found"),
    }

    /// i32 example
    list.add(1);
    list.add(2);
    list.add(4);
    list.add(7);
    list.add(89);

    println!("First: {:?}", list.first());
    println!("Last: {:?}", list.last());
    println!("Index of 2: {:?}", list.get_index(&2));
    println!("Next after 2: {:?}", list.next(&2));
    println!("Is 3 last index: {:?}", list.is_last_index(&3));
    println!("Is 3 last index: {:?}", list.is_last_index(&89));
    println!("Array: {:?}", list.to_array());
}