queues 1.1.0

Efficient FIFO Queue data structures
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
49
50
51
52
53
54
55
56
57

#[macro_use]
extern crate queues;

use queues::{IsQueue, Queue};

fn main() {
    println!("\nQueue - typical usage");
    println!("--");

    println!("\nCreate a new empty queue:");
    println!("let mut q: Queue<isize> = queue![];");
    let mut q: Queue<isize> = queue![];

    println!("\nAdd elements to it:");
    println!("q.add(1);");
    println!("> {:?}", q.add(1));
    println!("q.add(-2);");
    println!("> {:?}", q.add(-2));
    println!("q.add(3);");
    println!("> {:?}", q.add(3));

    println!("\nCheck the queue's size:");
    println!("q.size();  // Should be 3");
    println!("> {}", q.size());

    println!("\nRemove elements from it:");
    println!("q.remove();  // Should be Ok(1)");
    println!("> {:?}", q.remove());

    println!("\nCheck the queue's size:");
    println!("q.size();  // Should be 2");
    println!("> {}", q.size());

    println!("\nPeek at the next element to be removed:");
    println!("q.peek();  // Should be Ok(-2)");
    println!("> {:?}", q.peek());

    println!("\nCheck the queue's size:");
    println!("q.size();  // Should be 2");
    println!("> {}", q.size());

    println!("\nRemove more elements from it:");
    println!("q.remove();  // Should be Ok(-2)");
    println!("> {:?}", q.remove());
    println!("q.remove();  // Should be Ok(3)");
    println!("> {:?}", q.remove());

    println!("\nPeek at the next element to be removed:");
    println!("q.peek();  // Should raise an error");
    println!("> {:?}", q.peek());

    println!("\nAttempt to remove elements from it:");
    println!("q.remove();  // Should raise an error");
    println!("> {:?}", q.remove());

    println!("\n--\n")
}