Rust implementation of the CVM algorithm for counting distinct elements in a stream
Switch to StdRng
author
Stephan Hügel
date
(Jun 25, 2024, 11:39 AM +0100)
commit
8f65db5d
8f65db5df5b6b5a6d3c06d8278b5203a25654a2e
parent
977a179e
977a179ecd9827d2dbb3ef5cc64d04317eb24fb9
+5
-5
+1
-1
Cargo.toml
+1
-1
Cargo.toml
+4
-4
src/lib.rs
+4
-4
src/lib.rs
···
1
1
//! An implementation of the CVM fast element counting algorithm presented in
2
2
//! Chakraborty, S., Vinodchandran, N. V., & Meel, K. S. (2022). *Distinct Elements in Streams: An Algorithm for the (Text) Book*. 6 pages, 727571 bytes. <https://doi.org/10.4230/LIPIcs.ESA.2022.34>
3
3
4
-
use rand::rngs::ThreadRng;
5
-
use rand::Rng;
4
+
use rand::rngs::StdRng;
5
+
use rand::{Rng, SeedableRng};
6
6
7
7
use rustc_hash::FxHashSet;
8
8
use std::hash::Hash;
···
14
14
buf_size: usize,
15
15
buf: FxHashSet<T>,
16
16
probability: f64,
17
-
rng: ThreadRng,
17
+
rng: StdRng,
18
18
}
19
19
20
20
impl<T: PartialEq + Eq + Hash> CVM<T> {
···
38
38
buf_size: bufsize,
39
39
buf: FxHashSet::with_capacity_and_hasher(bufsize, Default::default()),
40
40
probability: 1.0,
41
-
rng: rand::thread_rng(),
41
+
rng: StdRng::from_entropy(),
42
42
}
43
43
}
44
44
/// Add an element, potentially updating the unique element count