Examples of BitVector

cern.colt.bitvector.BitVector
Fixed sized (non resizable) bitvector. Upon instance construction a bitvector is told to hold a fixed number of bits - it's size. The size can be any number (need not be a power of 2 or so). The bits of a BitVector are indexed by nonnegative integers. Any attempt to access a bit at an index<0 || index>=size() will throw an IndexOutOfBoundsException.
Individual indexed bits can be examined, set, or cleared. Subranges can quickly be extracted, copied and replaced. Quick iteration over subranges is provided by optimized internal iterators (forEach() methods). One BitVector may be used to modify the contents of another BitVector through logical AND, OR, XOR and other similar operations.
All operations consider the bits 0..size()-1 and nothing else. Operations involving two bitvectors (like AND, OR, XOR, etc.) will throw an IllegalArgumentException if the secondary bit vector has a size smaller than the receiver.
A BitVector is never automatically resized, but it can manually be grown or shrinked via setSize(...).
For use cases that need to store several bits per information entity, quick accessors are provided that interpret subranges as 64 bit long integers.
Why this class? Fist, boolean[] take one byte per stored bit. This class takes one bit per stored bit. Second, many applications find the semantics of java.util.BitSet not particularly helpful for their needs. Third, operations working on all bits of a bitvector are extremely quick. For example, on NT, Pentium Pro 200 Mhz, SunJDK1.2.2, java -classic, for two bitvectors A,B (both much larger than processor cache), the following results are obtained.
- A.and(B) i.e. A=A & B --> runs at about 35 MB/sec
- A.cardinality(), i.e. determining the selectivity, the number of bits in state "true" --> runs at about 80 MB/sec
- Similar performance for or, xor, andNot, not, copy, replace, partFromTo, indexOf, clear etc.
If you need extremely quick access to individual bits: Although getting and setting individual bits with methods get(...), set(...) and put(...)is quick, it is even quicker (but not safe) to use getQuick(...) and putQuick(...) or even QuickBitVector.
Note that this implementation is not synchronized. @author wolfgang.hoschek@cern.ch @version 1.01, 11/10/99 @see QuickBitVector @see BitMatrix @see java.util.BitSet
com.google.uzaygezen.core.BitVector
Represents a fixed-size bit set. Two bit vectors are equal iff they have the same size and they represent the same bit pattern. In general a bit vector can talk to any other bit vector as long as they have the same size; with the exception of {@link #equals}, {@link #hashCode}, {@link #copyFromSection(BitVector,int)}, {@link #copySectionFrom} and {@link #grayCodeRank}, all other methods accepting a {@link BitVector} parameterfail if the bit vector parameter has a different size. @author Mehmet Akin @author Daniel Aioanei
de.lmu.ifi.dbs.elki.data.BitVector
Provides a BitVector wrapping a BitSet. @author Arthur Zimek
lupos.misc.BitVector
net.agkn.hll.util.BitVector
A vector (array) of bits that is accessed in units ("registers") of width bits which are stored as 64bit "words" (longs). In this context a register is at most 64bits. @author rgrzywinski
net.wimpi.modbus.util.BitVector
Class that implements a collection for bits, storing them packed into bytes. Per default the access operations will index from the LSB (rightmost) bit. @author Dieter Wimberger @version 1.2rc1 (09/11/2004)
net.wimpi.modbusme.util.BitVector
Class that implements a collection for bits, storing them packed into bytes. Per default the access operations will index from the LSB (rightmost) bit. @author Dieter Wimberger @version 1.2rc1 (09/11/2004)
org.apache.drill.exec.vector.BitVector
Bit implements a vector of bit-width values. Elements in the vector are accessed by position from the logical start of the vector. The width of each element is 1 bit. The equivalent Java primitive is an int containing the value '0' or '1'.
org.apache.lucene.util.BitVector
Optimized implementation of a vector of bits. This is more-or-less like java.util.BitSet, but also includes the following:
- a count() method, which efficiently computes the number of one bits;
- optimized read from and write to disk;
- inlinable get() method;
- store and load, as bit set or d-gaps, depending on sparseness;
plan_runner.storage.BitVector
Optimized implementation of a vector of bits. This is more-or-less like java.util.BitSet, but also includes the following: a count() method, which efficiently computes the number of one bits; optimized read from and write to disk; inlinable get() method; @author Doug Cutting @version $Id: BitVector.java,v 1.4 2004/03/29 22:48:05 cutting Exp $
uk.ac.ucl.panda.indexing.io.BitVector
Optimized implementation of a vector of bits. This is more-or-less like java.util.BitSet, but also includes the following:
- a count() method, which efficiently computes the number of one bits;
- optimized read from and write to disk;
- inlinable get() method;
- store and load, as bit set or d-gaps, depending on sparseness;
@version $Id: BitVector.java 564236 2007-08-09 15:21:19Z gsingers $
umontreal.iro.lecuyer.util.BitVector
This class implements vectors of bits and the operations needed to use them. The vectors can be of arbitrary length. The operations provided are all the binary operations available to the int and long primitive types in Java.
All bit operations are present in two forms: a normal form and a self form. The normal form returns a newly created object containing the result, while the self form puts the result in the calling object (this). The return value of the self form is the calling object itself. This is done to allow easier manipulation of the results, making it possible to chain operations.

Examples of org.apache.lucene.util.BitVector


    tis = new TermInfosReader(cfsDir, segment, fieldInfos);


    // NOTE: the bitvector is stored using the regular directory, not cfs
    if (hasDeletions(si))
      deletedDocs = new BitVector(directory(), segment + ".del");


    // make sure that all index files have been read or are kept open
    // so that if an index update removes them we'll still have them
    freqStream = cfsDir.openFile(segment + ".frq");
    proxStream = cfsDir.openFile(segment + ".prx");

View Full Code Here

Examples of org.apache.lucene.util.BitVector

    return si.dir.fileExists(si.name + ".cfs");
  }


  protected final synchronized void doDelete(int docNum) throws IOException {
    if (deletedDocs == null)
      deletedDocs = new BitVector(maxDoc());
    deletedDocsDirty = true;
    deletedDocs.set(docNum);
  }

View Full Code Here

Examples of org.apache.lucene.util.BitVector

  }


  private void loadDeletedDocs() throws IOException {
    // NOTE: the bitvector is stored using the regular directory, not cfs
    if (hasDeletions(si)) {
      deletedDocs = new BitVector(directory(), si.getDelFileName());
      deletedDocsRef = new Ref();
      assert checkDeletedCounts();
    } else
      assert si.getDelCount() == 0;
  }

View Full Code Here

Examples of org.apache.lucene.util.BitVector

  }


  @Override
  protected void doDelete(int docNum) {
    if (deletedDocs == null) {
      deletedDocs = new BitVector(maxDoc());
      deletedDocsRef = new Ref();
    }
    // there is more than 1 SegmentReader with a reference to this
    // deletedDocs BitVector so decRef the current deletedDocsRef,
    // clone the BitVector, create a new deletedDocsRef

View Full Code Here

Examples of plan_runner.storage.BitVector

    final int[] hash = new int[discardingTaggedRelationStorage.size()
        + discardingTupleStorage.size()];
    final int[] addresses = new int[discardingTaggedRelationStorage.size()
        + discardingTupleStorage.size()];


    final BitVector isTagged = new BitVector(discardingTaggedRelationStorage.size()
        + discardingTupleStorage.size());
    isTagged.set(0, discardingTaggedRelationStorage.size());


    TupleStorage.preProcess(discardingTaggedRelationStorage, discardingTupleStorage, hash,
        addresses);


    final int bounds[] = Discard.keep(hash, addresses, isTagged, discardingParts,
        discardingIndex);


    for (int i = bounds[0]; i <= bounds[1]; i++) {
      final int address = addresses[i];
      final boolean isTaggedTuple = isTagged.get(i);
      String tupleString = "";
      if (isTaggedTuple)
        tupleString = discardingTaggedRelationStorage.get(address);
      else
        tupleString = discardingTupleStorage.get(address);

View Full Code Here

Examples of uk.ac.ucl.panda.indexing.io.BitVector

        message("commitMerge " + merge.segString(directory));


      // Carefully merge deletes that occurred after we
      // started merging:


      BitVector deletes = null;
      int docUpto = 0;


      final int numSegmentsToMerge = sourceSegments.size();
      for(int i=0;i<numSegmentsToMerge;i++) {
        final SegmentInfo previousInfo = sourceSegmentsClone.info(i);
        final SegmentInfo currentInfo = sourceSegments.info(i);


        assert currentInfo.docCount == previousInfo.docCount;


        final int docCount = currentInfo.docCount;


        if (previousInfo.hasDeletions()) {


          // There were deletes on this segment when the merge
          // started.  The merge has collapsed away those
          // deletes, but, if new deletes were flushed since
          // the merge started, we must now carefully keep any
          // newly flushed deletes but mapping them to the new
          // docIDs.


          assert currentInfo.hasDeletions();


          // Load deletes present @ start of merge, for this segment:
          BitVector previousDeletes = new BitVector(previousInfo.dir, previousInfo.getDelFileName());


          if (!currentInfo.getDelFileName().equals(previousInfo.getDelFileName())) {
            // This means this segment has had new deletes
            // committed since we started the merge, so we
            // must merge them:
            if (deletes == null)
              deletes = new BitVector(merge.info.docCount);


            BitVector currentDeletes = new BitVector(currentInfo.dir, currentInfo.getDelFileName());
            for(int j=0;j<docCount;j++) {
              if (previousDeletes.get(j))
                assert currentDeletes.get(j);
              else {
                if (currentDeletes.get(j))
                  deletes.set(docUpto);
                docUpto++;
              }
            }
          } else
            docUpto += docCount - previousDeletes.count();
        
        } else if (currentInfo.hasDeletions()) {
          // This segment had no deletes before but now it
          // does:
          if (deletes == null)
            deletes = new BitVector(merge.info.docCount);
          BitVector currentDeletes = new BitVector(directory, currentInfo.getDelFileName());


          for(int j=0;j<docCount;j++) {
            if (currentDeletes.get(j))
              deletes.set(docUpto);
            docUpto++;
          }


        } else

View Full Code Here

Examples of umontreal.iro.lecuyer.util.BitVector


         well.nextValue();
         for(int j = 0; j < R; j++)
            vect[j] = well.state[(well.state_i + j) & MASK];


         bv[i] = new BitVector(vect, 512);
      }


      STp0 = (new BitMatrix(bv)).transpose();


      STpw = STp0.power2e(200);

View Full Code Here

0 1 2 3 4 5

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.