Examples of BitSet

antlr.collections.impl.BitSet
A BitSet to replace java.util.BitSet. Primary differences are that most set operators return new sets as opposed to oring and anding "in place". Further, a number of operations were added. I cannot contain a BitSet because there is no way to access the internal bits (which I need for speed) and, because it is final, I cannot subclass to add functionality. Consider defining set degree. Without access to the bits, I must call a method n times to test the ith bit...ack! Also seems like or() from util is wrong when size of incoming set is bigger than this.bits.length. @author Terence Parr @author
Pete Wells
beaver.comp.util.BitSet
A set for elements 0..N
com.carrotsearch.hppc.BitSet
An "open" BitSet implementation that allows direct access to the array of words storing the bits.
Unlike java.util.bitset, the fact that bits are packed into an array of longs is part of the interface. This allows efficient implementation of other algorithms by someone other than the author. It also allows one to efficiently implement alternate serialization or interchange formats.

The index range for a bitset can easily exceed positive int range in Java (0x7fffffff), so many methods in this class accept or return a long. There are adapter methods that return views compatible with {@link LongLookupContainer} and {@link IntLookupContainer} interfaces.
@see #asIntLookupContainer() @see #asLongLookupContainer() @author "Original implementation from the Lucene project."
com.salesforce.phoenix.util.BitSet
BitSet that can be initialized with primitive types, which is only available in Java 7 or above. @author jtaylor @since 2.1.0
java.util.BitSet
This class implements a vector of bits that grows as needed. Each component of the bit set has a boolean value. The bits of a BitSet are indexed by nonnegative integers. Individual indexed bits can be examined, set, or cleared. One BitSet may be used to modify the contents of another BitSet through logical AND, logical inclusive OR, and logical exclusive OR operations.
By default, all bits in the set initially have the value false.
Every bit set has a current size, which is the number of bits of space currently in use by the bit set. Note that the size is related to the implementation of a bit set, so it may change with implementation. The length of a bit set relates to logical length of a bit set and is defined independently of implementation.
Unless otherwise noted, passing a null parameter to any of the methods in a BitSet will result in a NullPointerException.
A BitSet is not safe for multithreaded use without external synchronization. @author Arthur van Hoff @author Michael McCloskey @author Martin Buchholz @version 1.67, 04/07/06 @since JDK1.0
macromedia.asc.util.BitSet
The methods in java.util.BitSet modify the internal values. The class does not offer methods that return new values as BitSet. This simple class does that. @author Clement Wong
net.sf.jcontracts.antlr.collections.impl.BitSet
org.antlr.misc.BitSet
A BitSet to replace java.util.BitSet. Primary differences are that most set operators return new sets as opposed to oring and anding "in place". Further, a number of operations were added. I cannot contain a BitSet because there is no way to access the internal bits (which I need for speed) and, because it is final, I cannot subclass to add functionality. Consider defining set degree. Without access to the bits, I must call a method n times to test the ith bit...ack! Also seems like or() from util is wrong when size of incoming set is bigger than this.bits.length. @author Terence Parr
org.antlr.runtime.BitSet
A stripped-down version of org.antlr.misc.BitSet that is just good enough to handle runtime requirements such as FOLLOW sets for automatic error recovery.
org.apache.lucene.util.BitSet
org.apache.phoenix.util.BitSet
BitSet that can be initialized with primitive types, which is only available in Java 7 or above. @since 2.1.0
org.fastlsh.util.BitSet
A simplified and streamlined version of {@link java.util.BitSet}.
org.joni.BitSet
org.jostraca.comp.antlr.collections.impl.BitSet
A BitSet to replace java.util.BitSet. Primary differences are that most set operators return new sets as opposed to oring and anding "in place". Further, a number of operations were added. I cannot contain a BitSet because there is no way to access the internal bits (which I need for speed) and, because it is final, I cannot subclass to add functionality. Consider defining set degree. Without access to the bits, I must call a method n times to test the ith bit...ack! Also seems like or() from util is wrong when size of incoming set is bigger than this.bits.length. @author Terence Parr @author
Pete Wells
org.rascalmpl.parser.gtd.util.BitSet
persistence.antlr.collections.impl.BitSet
A BitSet to replace java.util.BitSet. Primary differences are that most set operators return new sets as opposed to oring and anding "in place". Further, a number of operations were added. I cannot contain a BitSet because there is no way to access the internal bits (which I need for speed) and, because it is final, I cannot subclass to add functionality. Consider defining set degree. Without access to the bits, I must call a method n times to test the ith bit...ack! Also seems like or() from util is wrong when size of incoming set is bigger than this.bits.length. @author Terence Parr @author
Pete Wells

Examples of java.util.BitSet

      }
    } else if(source == editChecklistTable) {
      if(event instanceof TableMultiSelectEvent) {
        TableMultiSelectEvent tmse = (TableMultiSelectEvent)event;
        if(tmse.getAction().equals("save")) {
          BitSet selection = tmse.getSelection();
          updateCheckpointsFor(selectedIdentity, selection);
          initManageTable(ureq);
        }
        cmc.deactivate();
      }

View Full Code Here

Examples of java.util.BitSet

          CloseableModalController manageParticipantsModalCntrl = new CloseableModalController(getWindowControl(), "close", participantsVC, true, translate("dates.table.participant.manage"));
          manageParticipantsModalCntrl.activate();
        }
      } else {
        TableMultiSelectEvent tmse = (TableMultiSelectEvent)event;
        BitSet selection = tmse.getSelection();
        //delete all users from the selected dates
        if(tmse.getAction().equals(DENListTableDataModel.DELETE_ACTION) && selection.cardinality() > 0) {
          removed = denManager.getSelectedEventParticipants(dateList, selection);
          dateList = denManager.deleteParticipants(ores, courseNode, denManager.getSelectedEventIDs(dateList, selection));
          listTableData.setObjects(dateList);
          //send notification mail
          createRemovedNotificationMail(ureq, dateList.get(0).getSubject());
        } else if(tmse.getAction().equals(DENListTableDataModel.MAIL_ACTION) && selection.cardinality() > 0) {
          //send email to all users from the selected dates
          List<Identity> participants = denManager.getSelectedEventParticipants(dateList, selection);
          createParticipantsMail(ureq, participants);
        } else if(selection.cardinality() == 0) {
          getWindowControl().setWarning(translate("participants.message.empty"));
        }
      }
    } else if(source == formManageParticipants && event == DENManageParticipantsForm.ADD_PARTICIPANTS) {
      //open user search controller to manually add users in date

View Full Code Here

Examples of java.util.BitSet

        }
        else if ((flags&FLAG_RETRIEVING_DETACHED_STATE)!=0)
        {
            // Retrieving the detached state from the detached object
            // Don't need the id or version since they can't change
            BitSet jdoLoadedFields = (BitSet)currentState[2];
            for (int i = 0; i < this.loadedFields.length; i++)
            {
                this.loadedFields[i] = jdoLoadedFields.get(i);
            }


            BitSet jdoModifiedFields = (BitSet)currentState[3];
            for (int i = 0; i < dirtyFields.length; i++)
            {
                dirtyFields[i] = jdoModifiedFields.get(i);
            }
            setVersion(currentState[1]);
            return currentState;
        }
        else
        {
            // Updating the detached state in the detached object with our state
            Object[] state = new Object[4];
            state[0] = myID;
            state[1] = getVersion(myPC);


            // Loaded fields
            BitSet loadedState = new BitSet();
            for (int i = 0; i < loadedFields.length; i++)
            {
                if (loadedFields[i])
                {
                    loadedState.set(i);
                }
                else
                {
                    loadedState.clear(i);
                }
            }
            state[2] = loadedState;


            // Modified fields
            BitSet modifiedState = new BitSet();
            for (int i = 0; i < dirtyFields.length; i++)
            {
                if (dirtyFields[i])
                {
                    modifiedState.set(i);
                }
                else
                {
                    modifiedState.clear(i);
                }
            }
            state[3] = modifiedState;


            return state;

View Full Code Here

Examples of java.util.BitSet

  public CollisionMap(final int width, final int height) {
    this.width = width;
    this.height = height;
    colls = new BitSet[width];
    for (int i = 0; i < width; i++) {
      colls[i] = new BitSet();
    }


  }

View Full Code Here

Examples of java.util.BitSet

    
    if (y < 0 || y - 1 + height >= this.height) {
      return true;
    }


    final BitSet result = new BitSet();
    for (int i = x; i < x + width; i++) {
      result.or(colls[i]);
    }


    return !result.get(y, y + height).isEmpty();
  }

View Full Code Here

Examples of macromedia.asc.util.BitSet

    return (items.size() != 0) ? items.last().pos() : 0;
  }


  public BitSet getGenBits()
  {
    BitSet genbits = null;


    for (Node n : items)
      genbits = reset_set(genbits, n.getKillBits(), n.getGenBits());


    return genbits;

View Full Code Here

Examples of net.sf.jcontracts.antlr.collections.impl.BitSet


    protected int markBitsetForGen(BitSet p)
    {
        for (int i = 0; i < bitsetsUsed.size(); i++)
        {
            BitSet set = (BitSet) bitsetsUsed.elementAt(i);
            if (p.equals(set))
            {
                return i;
            }
        }

View Full Code Here

Examples of org.antlr.misc.BitSet

    if ( follow.tokenTypeSet==null ) {
      words = new long[1];
            tokenTypeList = new ArrayList<Integer>();
        }
    else {
      BitSet bits = BitSet.of(follow.tokenTypeSet);
      words = bits.toPackedArray();
            tokenTypeList = follow.tokenTypeSet.toList();
        }
    // use the target to convert to hex strings (typically)
    String[] wordStrings = new String[words.length];
    for (int j = 0; j < words.length; j++) {

View Full Code Here

Examples of org.antlr.runtime.BitSet

     */
    protected void syncToSet() {
        // Compute the followset that is in context wherever we are in the
        // rule chain/stack
        //
        BitSet follow = state.following[state._fsp]; //computeContextSensitiveRuleFOLLOW();


        syncToSet( follow );
    }

View Full Code Here

Examples of org.apache.lucene.util.BitSet

                    if (nativeOrdinal != RandomAccessOrds.NO_MORE_ORDS) {
                        sLat.set(i, lat.get(nativeOrdinal));
                        sLon.set(i, lon.get(nativeOrdinal));
                    }
                }
                BitSet set = builder.buildDocsWithValuesSet();
                data = new GeoPointDoubleArrayAtomicFieldData.Single(sLon, sLat, set);
            } else {
                data = new GeoPointDoubleArrayAtomicFieldData.WithOrdinals(lon, lat, build, reader.maxDoc());
            }
            success = true;

View Full Code Here

0 1 2 3 4 5 6

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.