diff options
author | Paul Masurel <paul.masurel@gmail.com> | 2018-09-06 10:10:40 +0900 |
---|---|---|
committer | GitHub <noreply@github.com> | 2018-09-06 10:10:40 +0900 |
commit | cec9956a01d922f6ce2e5dee3da003512597e3ed (patch) | |
tree | 3c0a29e68eb63a2d2b6f67adcdc2c0baa7835ae0 /src/common | |
parent | c64972e03966671c5e3983fe018758d20b9b32e9 (diff) |
Issue/389 (#405)
* Setting up the dependency.
* Completed README
Diffstat (limited to 'src/common')
-rw-r--r-- | src/common/bitset.rs | 6 |
1 files changed, 3 insertions, 3 deletions
diff --git a/src/common/bitset.rs b/src/common/bitset.rs index 73f03c4..326e7ce 100644 --- a/src/common/bitset.rs +++ b/src/common/bitset.rs @@ -266,14 +266,14 @@ mod tests { #[test] fn test_bitset_large() { - let arr = generate_nonunique_unsorted(1_000_000, 50_000); + let arr = generate_nonunique_unsorted(100_000, 5_000); let mut btreeset: BTreeSet<u32> = BTreeSet::new(); - let mut bitset = BitSet::with_max_value(1_000_000); + let mut bitset = BitSet::with_max_value(100_000); for el in arr { btreeset.insert(el); bitset.insert(el); } - for i in 0..1_000_000 { + for i in 0..100_000 { assert_eq!(btreeset.contains(&i), bitset.contains(i)); } assert_eq!(btreeset.len(), bitset.len()); |