stackvec 0.2.1

A crate to use stack-allocated Vectors (performance and/or no-std)
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

use super::*;

use self::prelude::*;

#[test]
fn build_stackvec ()
{
	let array = StackVec::<[_; 10]>::from_iter(
		[3, 4, 6, 8].iter().cloned()
	);
    println!("{:?}", array);
}

#[test]
fn build_array ()
{
	let array: [_; 4] =
		[3, 4, 6, 8]
		.iter().cloned()
		.try_collect()
		.expect("Missing elements to collect");
    println!("{:?}", array);
}

#[test]
#[should_panic]
fn build_array_but_incomplete ()
{
	let _array: [_; 10] =
		[3, 4, 6, 8]
		.iter().cloned()
		.try_collect()
		.expect("Missing elements to collect");
}

#[test]
fn array_into_iter ()
{
	assert_eq!(
		[3, 4, 6, 8].into_iter().collect::<Vec<_>>(),
		vec![3, 4, 6, 8],
	);
}

#[test]
fn array_into_iter_dropped ()
{
	let _ = [3, 4, 6, 8].into_iter();
}

#[test]
fn array_map ()
{
	let array: [_; 4] =
		[3, 4, 6, 8]
		.into_iter()
		.map(|x| 2 * x)
		.try_collect()
		.expect("Missing elements to collect");
	let mut array_map_in_place = [3, 4, 6, 8];
	array_map_in_place.iter_mut().for_each(|x| *x *= 2);
	assert_eq!(
		array,
		array_map_in_place,
	);
}

#[test]
#[should_panic]
fn try_push_to_full_stackvec ()
{
	let mut stackvec: StackVec<[_; 1]> = Default::default();
	stackvec.try_push(0).unwrap();
	stackvec.try_push(0).unwrap();
}