tick-queue 0.0.3

Tick ordered queue
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154

/*
 * Copyright (c) Peter Bjorklund. All rights reserved. https://github.com/piot/tick-queue
 * Licensed under the MIT License. See LICENSE in the project root for license information.
 */
use tick_id::TickId;
use tick_queue::Queue;

#[derive(Debug, Clone, PartialEq, Eq)] // Debug is needed for asserts in tests
pub enum GameInput {
    #[allow(unused)]
    Jumping(bool),
    #[allow(unused)]
    MoveHorizontal(i32),
}

#[test_log::test]
fn add_step() {
    let mut items = Queue::new(TickId(23));
    items
        .push(TickId(23), GameInput::MoveHorizontal(-2))
        .expect("Expected a move horizontal tick");
    assert_eq!(items.len(), 1);
    assert_eq!(items.front_tick_id().unwrap().value(), 23)
}

#[test_log::test]
fn push_and_pop_step() {
    let mut items = Queue::new(TickId(23));
    items
        .push(TickId(23), GameInput::Jumping(true))
        .expect("Expected a jumping tick");
    items
        .push(TickId(24), GameInput::MoveHorizontal(42))
        .expect("Expected a move horizontal tick");
    assert_eq!(items.len(), 2);
    assert_eq!(items.front_tick_id().unwrap().value(), 23);
    assert_eq!(items.pop().unwrap().item, GameInput::Jumping(true));
    assert_eq!(items.front_tick_id().unwrap().value(), 24);
}

#[test_log::test]
fn default_queue() {
    let mut items = Queue::<GameInput>::default();
    items
        .push(TickId(0), GameInput::Jumping(true))
        .expect("Expected a jumping tick");
    items
        .push(TickId(1), GameInput::MoveHorizontal(42))
        .expect("Expected a move horizontal tick");
    assert_eq!(items.len(), 2);
    items.discard_count(8);
    assert_eq!(items.len(), 0);
}

#[test_log::test]
fn push_and_discard_count() {
    let mut items = Queue::new(TickId(23));
    items
        .push(TickId(23), GameInput::Jumping(true))
        .expect("Expected a jumping tick");
    items
        .push(TickId(24), GameInput::MoveHorizontal(42))
        .expect("Expected a move horizontal tick");
    assert_eq!(items.len(), 2);
    items.discard_count(8);
    assert_eq!(items.len(), 0);
}

#[test_log::test]
fn push_and_discard_up_to_lower() {
    let mut items = Queue::new(TickId(23));
    items
        .push(TickId(23), GameInput::Jumping(true))
        .expect("Expected a jumping tick");
    items
        .push(TickId(24), GameInput::MoveHorizontal(42))
        .expect("Expected a move horizontal tick");
    assert_eq!(items.len(), 2);
    items.discard_up_to(TickId(1));
    assert_eq!(items.len(), 2);
}

#[test_log::test]
fn push_and_discard_up_to_equal() {
    let mut items = Queue::new(TickId(23));
    items
        .push(TickId(23), GameInput::Jumping(true))
        .expect("Expected a jumping tick");
    items
        .push(TickId(24), GameInput::MoveHorizontal(42))
        .expect("Expected a move horizontal tick");
    assert_eq!(items.len(), 2);
    items.discard_up_to(TickId::new(24));
    assert_eq!(items.len(), 1);
}

#[test_log::test]
fn iterator_over_items() {
    let mut items = Queue::new(TickId::new(0));
    items.push(TickId::new(0), "Move 1").unwrap();
    items.push(TickId::new(1), "Move 2").unwrap();
    items.push(TickId::new(2), "Move 3").unwrap();

    let mut iter = items.iter();
    assert_eq!(iter.next().unwrap().item, "Move 1");
    assert_eq!(iter.next().unwrap().item, "Move 2");
    assert_eq!(iter.next().unwrap().item, "Move 3");
    assert!(iter.next().is_none());
}

#[test_log::test]
fn iterator_from_index() {
    let mut items = Queue::default();
    items.push(TickId::new(0), "Move 1").unwrap();
    items.push(TickId::new(1), "Move 2").unwrap();
    items.push(TickId::new(2), "Move 3").unwrap();

    let mut iter = items.iter_index(1); // Start from index 1 (second item)
    assert_eq!(iter.next().unwrap().item, "Move 2");
    assert_eq!(iter.next().unwrap().item, "Move 3");
    assert!(iter.next().is_none());
}

#[test_log::test]
fn iterator_empty_queue() {
    let items: Queue<String> = Queue::default();

    let mut iter = items.iter();
    assert!(iter.next().is_none());
}

#[test_log::test]
fn iterator_from_index_out_of_bounds() {
    let mut items = Queue::default();
    items.push(TickId::new(0), "Move 1").unwrap();
    items.push(TickId::new(1), "Move 2").unwrap();

    let mut iter = items.iter_index(10); // Start index out of bounds
    assert!(iter.next().is_none()); // No items to iterate over
}

#[test_log::test]
fn into_iter() {
    let mut items = Queue::default();
    items.push(TickId::new(0), "Move 1").unwrap();
    items.push(TickId::new(1), "Move 2").unwrap();
    items.push(TickId::new(2), "Move 3").unwrap();

    let mut iter = items.into_iter();
    assert_eq!(iter.next().unwrap().item, "Move 1");
    assert_eq!(iter.next().unwrap().item, "Move 2");
    assert_eq!(iter.next().unwrap().item, "Move 3");
    assert!(iter.next().is_none());
}