Expand description
Hashes for the DOM-maintained filter of local names, classes and
null-namespace attribute names in an element’s DOM subtree, including itself.
Shadow-tree contents are not included. This is separate from the ancestor
bloom and the wider, lazily constructed RelativeSelectorFilterMap.
Required hashes can be OR’d together: (filter & hashes) == hashes means
that a match remains possible. Zero never rejects. Removed names may leave
stale bits, so a hit cannot prove that a selector matches.
Constants§
Functions§
- hash_
for_ subtree_ filter - Turn a 32-bit atom hash into the bits it occupies in the subtree filter (k = 2 hash functions).