1 line
2.3 KiB
JavaScript
1 line
2.3 KiB
JavaScript
searchState.loadedDescShard("bit_set", 0, "Description\nAn iterator for <code>BitSet</code>.\nReturns the capacity in bits for this bit vector. …\nClears all bits in this set\nReturns <code>true</code> if this set contains the specified integer.\nIterator over each usize stored in the <code>self</code> setminus <code>other</code>.\nMakes this bit vector the difference with the specified …\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nReturns the argument unchanged.\nCreates a new <code>BitSet</code> from the given bit vector.\nReturns a mutable reference to the underlying bit vector.\nReturns a reference to the underlying bit vector.\nAdds a value to the set. Returns <code>true</code> if the value was not …\nIntersects in-place with the specified other bit vector.\nIterator over each usize stored in <code>self</code> intersect <code>other</code>. …\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nCalls <code>U::from(self)</code>.\nConsumes this set to return the underlying bit vector.\nReturns <code>true</code> if the set has no elements in common with …\nReturns whether there are no bits set in this set\nReturns <code>true</code> if the set is a subset of another.\nReturns <code>true</code> if the set is a superset of another.\nIterator over each usize stored in the <code>BitSet</code>.\nReturns the number of set bits in this set.\nCreates a new empty <code>BitSet</code>.\nRemoves a value from the set. Returns <code>true</code> if the value was\nReserves capacity for the given <code>BitSet</code> to contain <code>len</code> …\nReserves the minimum capacity for the given <code>BitSet</code> to …\nTruncates the underlying vector to the least length …\nIterator over each usize stored in the symmetric …\nMakes this bit vector the symmetric difference with the …\nExcludes <code>element</code> and all greater elements from the <code>BitSet</code>.\nIterator over each usize stored in <code>self</code> union <code>other</code>. See …\nUnions in-place with the specified other bit vector.\nCreates a new <code>BitSet</code> with initially no contents, able to …") |