arrlist 0.1.5

A generic, heap-allocated dynamic array
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

//! Tests for `IntoIter`, `Iter`, and `IterMut`.

extern crate alloc;
use alloc::vec::Vec;

use arrlist::ArrayList;

#[test]
fn into_iter_yields_all_elements_in_order()
{
	let list = ArrayList::from_array([1, 2, 3]);
	let collected: Vec<i32> = list.into_iter().collect();
	assert_eq!(collected, [1, 2, 3]);
}

#[test]
fn into_iter_empty_list()
{
	let list: ArrayList<i32> = ArrayList::new();
	let collected: Vec<i32> = list.into_iter().collect();
	assert!(collected.is_empty());
}

#[test]
fn into_iter_for_loop()
{
	let list = ArrayList::from_array([10, 20, 30]);
	let mut sum = 0;
	for val in list
	{
		sum += val;
	}
	assert_eq!(sum, 60);
}

#[test]
fn into_iter_single_element()
{
	let list = ArrayList::from_array([42]);
	let mut iter = list.into_iter();
	assert_eq!(iter.next(), Some(42));
	assert_eq!(iter.next(), None);
}

#[test]
fn into_iter_next_returns_none_when_exhausted()
{
	let list = ArrayList::from_array([1]);
	let mut iter = list.into_iter();
	iter.next();
	assert_eq!(iter.next(), None);
	assert_eq!(iter.next(), None); // repeated calls must stay None
}

#[test]
fn iter_yields_shared_refs_in_order()
{
	let list = ArrayList::from_array([1, 2, 3]);
	let collected: Vec<&i32> = list.iter().collect();
	assert_eq!(collected, [&1, &2, &3]);
}

#[test]
fn iter_does_not_consume_list()
{
	let list = ArrayList::from_array([1, 2, 3]);
	let _ = list.iter().count();
	// list is still usable after iteration
	assert_eq!(list.len(), 3);
}

#[test]
fn iter_empty_list()
{
	let list: ArrayList<i32> = ArrayList::new();
	assert_eq!(list.iter().next(), None);
}

#[test]
fn iter_ref_for_loop()
{
	let list = ArrayList::from_array([1, 2, 3]);
	let mut sum = 0;
	for val in &list
	{
		sum += val;
	}
	assert_eq!(sum, 6);
}

#[test]
fn iter_can_be_called_multiple_times()
{
	let list = ArrayList::from_array([1, 2, 3]);
	assert_eq!(list.iter().count(), 3);
	assert_eq!(list.iter().count(), 3);
}

#[test]
fn iter_next_returns_none_when_exhausted()
{
	let list = ArrayList::from_array([1]);
	let mut iter = list.iter();
	iter.next();
	assert_eq!(iter.next(), None);
	assert_eq!(iter.next(), None);
}

#[test]
fn iter_mut_yields_mutable_refs_in_order()
{
	let mut list = ArrayList::from_array([1, 2, 3]);
	let collected: Vec<i32> = list.iter_mut().map(|x| *x).collect();
	assert_eq!(collected, [1, 2, 3]);
}

#[test]
fn iter_mut_allows_mutation()
{
	let mut list = ArrayList::from_array([1, 2, 3]);
	for val in list.iter_mut()
	{
		*val *= 10;
	}
	assert_eq!(list.get(0), Some(&10));
	assert_eq!(list.get(1), Some(&20));
	assert_eq!(list.get(2), Some(&30));
}

#[test]
fn iter_mut_empty_list()
{
	let mut list: ArrayList<i32> = ArrayList::new();
	assert_eq!(list.iter_mut().next(), None);
}

#[test]
fn iter_mut_ref_for_loop()
{
	let mut list = ArrayList::from_array([1, 2, 3]);
	for val in &mut list
	{
		*val += 100;
	}
	assert_eq!(list.get(0), Some(&101));
	assert_eq!(list.get(2), Some(&103));
}

#[test]
fn iter_mut_next_returns_none_when_exhausted()
{
	let mut list = ArrayList::from_array([1]);
	let mut iter = list.iter_mut();
	iter.next();
	assert_eq!(iter.next(), None);
	assert_eq!(iter.next(), None);
}