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

#![deny(missing_docs, warnings, clippy::all, clippy::pedantic)]
#![doc = include_str!("../README.md")]

pub mod bag;
pub use bag::Bag;

#[cfg(not(feature = "equivalent"))]
mod equivalent;
pub use equivalent::{Comparable, Equivalent};

mod exit_guard;

pub mod hash_cache;
pub use hash_cache::HashCache;

pub mod hash_index;
pub use hash_index::HashIndex;

pub mod hash_map;
pub use hash_map::HashMap;

pub mod hash_set;
pub use hash_set::HashSet;

mod hash_table;

mod linked_list;
pub use linked_list::Entry as LinkedEntry;
pub use linked_list::LinkedList;

#[cfg(feature = "loom")]
mod maybe_std {
    pub(crate) use loom::sync::atomic::{AtomicU8, AtomicUsize};
    pub(crate) use loom::thread::yield_now;
}

#[cfg(not(feature = "loom"))]
mod maybe_std {
    pub(crate) use std::sync::atomic::{AtomicU8, AtomicUsize};
    pub(crate) use std::thread::yield_now;
}

pub mod queue;
pub use queue::Queue;

mod range_helper {
    use crate::Comparable;
    use std::ops::Bound::{Excluded, Included, Unbounded};
    use std::ops::RangeBounds;

    /// Emulates `RangeBounds::contains`.
    pub(crate) fn contains<K, Q, R: RangeBounds<Q>>(range: &R, key: &K) -> bool
    where
        Q: Comparable<K> + ?Sized,
    {
        (match range.start_bound() {
            Included(start) => start.compare(key).is_le(),
            Excluded(start) => start.compare(key).is_lt(),
            Unbounded => true,
        }) && (match range.end_bound() {
            Included(end) => end.compare(key).is_ge(),
            Excluded(end) => end.compare(key).is_gt(),
            Unbounded => true,
        })
    }
}

/// Re-exports the [`sdd`](https://crates.io/crates/sdd) crate for backward compatibility.
pub use sdd as ebr;

#[cfg(feature = "serde")]
mod serde;

pub mod stack;
pub use stack::Stack;

#[cfg(test)]
mod tests;

pub mod tree_index;
pub use tree_index::TreeIndex;

mod wait_queue;