Class SparseBitSet.OrStrategy

java.lang.Object
com.zaxxer.sparsebits.SparseBitSet.AbstractStrategy
com.zaxxer.sparsebits.SparseBitSet.OrStrategy
Enclosing class:
SparseBitSet

protected static class SparseBitSet.OrStrategy extends SparseBitSet.AbstractStrategy
Or of two sets. Where the a set is one, it remains one. Similarly, where the b set is one, the a becomes one. If both sets have zeros in corresponding places, a zero results. Whole blocks or areas that are or become zero are replaced by null arrays.

If level1 of the a set is longer than level1 of the bit set b, then the unmatched entries of the a set (beyond the actual length of b) corresponding to these remain unchanged. *

   or| 0 1
    0| 0 1
    1| 1 1 
  • Constructor Details

    • OrStrategy

      protected OrStrategy()
  • Method Details

    • properties

      protected int properties()
      Description copied from class: SparseBitSet.AbstractStrategy
      Properties of this strategy.
      Specified by:
      properties in class SparseBitSet.AbstractStrategy
      Returns:
      the int containing the bits representing the properties of this strategy
    • start

      protected boolean start(SparseBitSet b)
      Description copied from class: SparseBitSet.AbstractStrategy
      Instances of this class are to be serially reusable. To start a particular use, an instance is (re-)started by calling this method. It is passed the reference to the other bit set (usually to allow a check on whether it is null or not, so as to simplify the implementation of the block() method.
      Specified by:
      start in class SparseBitSet.AbstractStrategy
      Parameters:
      b - the "other" set, for whatever checking is needed.
      Returns:
      true -> if the cache should be set to zero
    • word

      protected boolean word(int base, int u3, long[] a3, long[] b3, long mask)
      Description copied from class: SparseBitSet.AbstractStrategy
      Deal with a scan that include a partial word within a level3 block. All that is required is that the result be stored (if needed) into the given a set block at the correct position, and that the operation only affect those bits selected by 1 bits in the mask.
      Specified by:
      word in class SparseBitSet.AbstractStrategy
      Parameters:
      base - the base index of the block (to be used if needed)
      u3 - the index of the word within block
      a3 - the level3 block from the a set.
      b3 - the (nominal) level3 block from the b set (not null).
      mask - for the (partial) word
      Returns:
      true if the resulting word is zero
    • block

      protected boolean block(int base, int u3, int v3, long[] a3, long[] b3)
      Description copied from class: SparseBitSet.AbstractStrategy
      Deals with a part of a block that consists of whole words, starting with the given first index, and ending with the word before the last index. For the words processed, the return value should indicate whether all those resulting words were zero, or not.
      Specified by:
      block in class SparseBitSet.AbstractStrategy
      Parameters:
      base - the base index of the block (to be used if needed)
      u3 - the index of the first word within block to process
      v3 - the index of the last word, which may be within block
      a3 - the level3 block from the a set.
      b3 - the (nominal) level3 block from the b set (not null).
      Returns:
      true if the words scanned within the level3 block were all zero