sparse.rs
SHA-25604e70bb0bd006f806e8c9cf19825625e907036304823bc03b6c8f2e5046a38ef
Malecule∅
Evidence
1use std::ops::Deref;
2use std::slice;
3
4/// A sparse set used for representing ordered NFA states.
5///
6/// This supports constant time addition and membership testing. Clearing an
7/// entire set can also be done in constant time. Iteration yields elements
8/// in the order in which they were inserted.
9///
10/// The data structure is based on: http://research.swtch.com/sparse
11/// Note though that we don't actually use unitialized memory. We generally
12/// reuse allocations, so the initial al …
76:44…
77 fn into_iter(self) -> Self::IntoIter { self.iter() }
78}