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
//! # extended-collections-rs
//! [](https://crates.io/crates/extended-collections)
//! [](https://docs.rs/extended-collections)
//! [](https://opensource.org/licenses/MIT)
//! [](https://travis-ci.org/jeffrey-xiao/extended-collections-rs)
//! [](https://codecov.io/gh/jeffrey-xiao/extended-collections-rs)
//!
//! `extended-collections` contains various implementations of collections that are not found in the standard library.
//!
//! ## Usage
//! Add this to your `Cargo.toml`:
//! ```toml
//! [dependencies]
//! extended-collections = "*"
//! ```
//! and this to your crate root:
//! ```rust
//! extern crate extended_collections;
//! ```
//!
//! ## References
//! - [Fast set operations using treaps](https://dl.acm.org/citation.cfm?id=277660)
//! > Blelloch, Guy E., and Margaret Reid-Miller. 1998. “Fast Set Operations Using Treaps.” In *Proceedings of the Tenth Annual Acm Symposium on Parallel Algorithms and Architectures*, 16–26. SPAA ’98. New York, NY, USA: ACM. doi:[10.1145/277651.277660](https://doi.org/10.1145/277651.277660).
//! - [A Skip List Cookbook.](https://dl.acm.org/citation.cfm?id=93711)
//! > Pugh, William. 1990a. “A Skip List Cookbook.” College Park, MD, USA: University of Maryland at College Park.
//! - [Skip Lists: A Probabilistic Alternative to Balanced Trees](https://dl.acm.org/citation.cfm?id=78977)
//! > Pugh, William. 1990b. “Skip Lists: A Probabilistic Alternative to Balanced Trees.” *Commun. ACM* 33 (6). New York, NY, USA: ACM: 668–76. doi:[10.1145/78973.78977](https://doi.org/10.1145/78973.78977).
extern crate bincode;
extern crate byteorder;
extern crate crossbeam_epoch as epoch;
extern crate probabilistic_collections;
extern crate rand;
extern crate serde;
extern crate serde_derive;