collect 0.0.8

An experimental extension of std::collections
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


//! collect-rs is intended as an experimental extension of the Rust standard library's
//! libcollections. Ideas that are too niche, crazy, or experimental to land in libcollections
//! can be gathered here where they can gain the maintenance and network-effect benefits that
//! libcollections enjoys, but without worrying about such ivory tower concepts as
//! "general usefulness" and "consistency".
//!
//! For the time being we plan to be highly volatile with a low barrier of entry. We want to
//! explore the space of data structuring in Rust. We want to prove out ideas and implementations
//! that could one day make their way into the standard library.
//!
//! Got a Concurrent, Immutable, or Persistent collection? Awesome! Crazy ideas for collection or
//! iterator adapters? Heck yeah!
//!
//! Come on in!
//!
//! -----------
//!
//! Note that anything include in collect-rs is theoretically a candidate for inclusion in
//! libcollections. As such, this project is licensed under the same terms as Rust itself.


#![feature(unsafe_destructor)]
#![feature(default_type_params)]
#![feature(unboxed_closures)]
#![feature(globs)]
#![feature(macro_rules)]
#![feature(slicing_syntax)]

#[cfg(test)] extern crate test;
extern crate core;
extern crate traverse;




// Re-Exports

pub use blist::BList;
pub use enum_set::EnumSet;
pub use immut_slist::ImmutSList;
pub use interval_heap::IntervalHeap;
pub use lru_cache::LruCache;
pub use tree_map::TreeMap;
pub use tree_set::TreeSet;
pub use trie_map::TrieMap;
pub use trie_set::TrieSet;




// privates

mod tree;
mod trie;
#[cfg(test)] mod bench;



// publics

pub mod iter;

pub mod blist;
pub mod enum_set;
pub mod immut_slist;
pub mod interval_heap;
pub mod lru_cache;

pub mod tree_map {
    pub use tree::map::*;
}

pub mod tree_set {
    pub use tree::set::*;
}

pub mod trie_map {
    pub use trie::map::*;
}

pub mod trie_set {
    pub use trie::set::*;
}



pub mod proto;