It seems that the result of hash algorithm used in bloom filter depends on the pointer length. On 64bit platforms, there are 135 false positives in the first part of that test, and 8 in the second part. However, on 32bit platforms, the numbers become 157 and 16 correspondingly. 16 is still less than 20% in the second part, so all fine, but 157 is slightly larger than 15% in the test assertion. Given it is what we are shipping, we probably should just accept this and loosen the assertion. Bug: 1457524 Reviewed-by: heycam MozReview-Commit-ID: 9kFXBzLFAzE |
||
---|---|---|
.. | ||
attr.rs | ||
bloom.rs | ||
build.rs | ||
builder.rs | ||
Cargo.toml | ||
context.rs | ||
lib.rs | ||
matching.rs | ||
nth_index_cache.rs | ||
parser.rs | ||
README.md | ||
sink.rs | ||
tree.rs | ||
visitor.rs |
rust-selectors
CSS Selectors library for Rust. Includes parsing and serilization of selectors, as well as matching against a generic tree of elements. Pseudo-elements and most pseudo-classes are generic as well.
Warning: breaking changes are made to this library fairly frequently (13 times in 2016, for example). However you can use this crate without updating it that often, old versions stay available on crates.io and Cargo will only automatically update to versions that are numbered as compatible.
To see how to use this library with your own tree representation,
see Kuchiki’s src/select.rs
.
(Note however that Kuchiki is not always up to date with the latest rust-selectors version,
so that code may need to be tweaked.)
If you don’t already have a tree data structure,
consider using Kuchiki itself.