traverse 0.0.12

Proof-of-concept trait for internal iterators called traversals.
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

use std::collections::*;
use std::hash::Hash;
use super::*;

mod slice;
mod vec;

impl<T> FromTraversal<T> for VecDeque<T> {
	fn from_traversal<I: IntoTraversal<Item=T>>(traversable: I) -> Self {
		let trav = traversable.into_traversal();
		let mut new = Self::with_capacity(trav.size_hint().0);
		trav.run(|elem| {
			new.push_back(elem);
		});
		new
	}
}

impl<T> FromTraversal<T> for LinkedList<T> {
	fn from_traversal<I: IntoTraversal<Item=T>>(traversable: I) -> Self {
		let trav = traversable.into_traversal();
		let mut new = Self::new();
		trav.run(|elem| {
			new.push_back(elem);
		});
		new
	}
}

impl<K: Hash + Eq, V> FromTraversal<(K, V)> for HashMap<K, V> {
	fn from_traversal<I: IntoTraversal<Item=(K, V)>>(traversable: I) -> Self {
		let trav = traversable.into_traversal();
		let mut new = Self::with_capacity(trav.size_hint().0);
		trav.run(|(k, v)| {
			new.insert(k, v);
		});
		new
	}
}

impl<K: Ord, V> FromTraversal<(K, V)> for BTreeMap<K, V> {
	fn from_traversal<I: IntoTraversal<Item=(K, V)>>(traversable: I) -> Self {
		let trav = traversable.into_traversal();
		let mut new = Self::new();
		trav.run(|(k, v)| {
			new.insert(k, v);
		});
		new
	}
}