//! This file contains benchmarks for the ops traits implemented by HashSet. //! Each test is intended to have a defined larger and smaller set, //! but using a larger size for the "small" set works just as well. //! //! Each assigning test is done in the configuration that is faster. Cheating, I know. //! The exception to this is Sub, because there the result differs. So I made two benchmarks for Sub. use criterion::Criterion; use hashbrown::HashSet;
/// The number of items to generate for the larger of the sets. const LARGE_SET_SIZE: usize = 1000;
/// The number of items to generate for the smaller of the sets. const SMALL_SET_SIZE: usize = 100;
/// The number of keys present in both sets. const OVERLAP: usize =
[LARGE_SET_SIZE, SMALL_SET_SIZE][(LARGE_SET_SIZE < SMALL_SET_SIZE) as usize] / 2;
/// Creates a set containing end - start unique string elements. fn create_set(start: usize, end: usize) -> HashSet<String> {
(start..end).map(|nr| format!("key{nr}")).collect()
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.