seq-set 0.0.2

A Set collection that maintains insertion order.
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
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221

use seq_set::SeqSet;

/// Test struct
#[derive(Debug, Copy, Clone, PartialEq, Eq, Hash)]
struct Point {
    x: i32,
    y: i32,
}

#[test]
fn insert_and_contains() {
    let mut set = SeqSet::new();
    assert!(set.insert(1));
    assert!(set.insert(2));
    assert!(set.insert(3));
    assert!(!set.insert(2)); // Intentional duplicate insertion

    assert!(set.contains(&1));
    assert!(set.contains(&2));
    assert!(set.contains(&3));
    assert!(!set.contains(&4));

    assert_eq!(set.len(), 3);
    assert!(!set.is_empty());
}

#[test]
fn remove() {
    let mut set = SeqSet::new();
    set.insert("apple");
    set.insert("banana");
    set.insert("cherry");

    assert!(set.remove(&"banana"));
    assert!(!set.contains(&"banana"));
    assert_eq!(set.len(), 2);
    assert!(!set.is_empty());

    // this should fail, since it is not in the set
    assert!(!set.remove(&"orange"));
    assert_eq!(set.len(), 2);
}

#[test]
fn iteration_order() {
    let mut set = SeqSet::new();
    set.insert("first");
    set.insert("second");
    set.insert("third");

    let elements: Vec<&str> = set.iter().cloned().collect();
    assert_eq!(elements, vec!["first", "second", "third"]);
}

#[test]
fn remove_and_iterate() {
    let mut set = SeqSet::new();
    set.insert("apple");
    set.insert("banana");
    set.insert("cherry");
    set.insert("orange");

    assert!(set.remove(&"banana"));

    let elements: Vec<&str> = set.iter().cloned().collect();
    assert_eq!(elements, vec!["apple", "cherry", "orange"]);
}

#[test]
fn clear() {
    let mut set = SeqSet::new();
    set.insert(10);
    set.insert(20);
    set.insert(30);

    assert_eq!(set.len(), 3);
    set.clear();
    assert_eq!(set.len(), 0);
    assert!(set.is_empty());

    assert!(!set.contains(&10));
    assert!(!set.contains(&20));
    assert!(!set.contains(&30));
}

#[test]
fn with_custom_struct() {
    let mut set = SeqSet::new();

    let p1 = Point { x: 1, y: 2 };
    let p2 = Point { x: 3, y: 4 };
    let p3 = Point { x: 5, y: 6 };

    assert!(set.insert(p1.clone()));
    assert!(set.insert(p2.clone()));
    assert!(set.insert(p3.clone()));
    assert!(!set.insert(p2.clone())); // Duplicate insertion

    assert!(set.contains(&p1));
    assert!(set.contains(&p2));
    assert!(set.contains(&p3));

    let elements: Vec<Point> = set.iter().cloned().collect();
    assert_eq!(elements, vec![p1, p2, p3]);

    assert!(set.remove(&p2));

    let elements: Vec<Point> = set.iter().cloned().collect();
    assert_eq!(elements, vec![p1, p3]);
}

#[test]
fn iterate_empty_set() {
    let set: SeqSet<i32> = SeqSet::new();
    let elements: Vec<&i32> = set.iter().collect();
    assert!(elements.is_empty());
}

#[test]
fn multiple_insertions_and_removals() {
    let mut set = SeqSet::new();

    for i in 1..=5 {
        assert!(set.insert(i));
    }

    assert!(set.remove(&2));
    assert!(set.remove(&4));

    assert!(set.insert(6));
    assert!(set.insert(7));

    let elements: Vec<i32> = set.iter().cloned().collect();
    assert_eq!(elements, vec![1, 3, 5, 6, 7]);

    assert!(!set.contains(&2));
    assert!(!set.contains(&4));
}

#[test]
fn insert_remove_insert() {
    let mut set = SeqSet::new();

    assert!(set.insert("alpha"));
    assert!(set.insert("beta"));
    assert!(set.insert("gamma"));

    assert!(set.remove(&"beta"));

    // Insert the removed element again
    assert!(set.insert("beta"));

    let elements: Vec<_> = set.iter().cloned().collect();
    assert_eq!(elements, vec!["alpha", "gamma", "beta"]);
}

#[test]
fn into_iter_consuming() {
    let mut set = SeqSet::new();
    set.insert(1);
    set.insert(2);
    set.insert(3);

    let mut iter = set.into_iter();
    assert_eq!(iter.next(), Some(1));
    assert_eq!(iter.next(), Some(2));
    assert_eq!(iter.next(), Some(3));
    assert_eq!(iter.next(), None);
}

#[test]
fn into_iter_references() {
    let mut set = SeqSet::new();
    set.insert("apple");
    set.insert("banana");
    set.insert("cherry");

    let elements: Vec<&str> = (&set).into_iter().cloned().collect();
    assert_eq!(elements, vec!["apple", "banana", "cherry"]);

    // Ensure the set is still intact
    assert!(set.contains(&"apple"));
    assert!(set.contains(&"banana"));
    assert!(set.contains(&"cherry"));
}

#[test]
fn into_iter_mutable_references() {
    let mut set = SeqSet::new();
    set.insert(11);
    set.insert(12);
    set.insert(13);

    for num in &mut set {
        *num += 1;
    }

    let elements: Vec<i32> = set.iter().cloned().collect();
    assert_eq!(elements, vec![12, 13, 14]);
}

#[test]
fn from_iterator() {
    let items = vec![
        "apple".to_string(),
        "banana".to_string(),
        "apple".to_string(), // Intentional duplicate
        "orange".to_string(),
    ];
    let seq_set: SeqSet<String> = items.into_iter().collect();

    assert_eq!(seq_set.len(), 3);

    let expected = vec![
        "apple".to_string(),
        "banana".to_string(),
        "orange".to_string(),
    ];

    assert_eq!(seq_set.to_vec(), expected);
}