@Override public boolean isEmpty() { return bitmap.isEmpty(); }
/** return false if any revisions have been recorded in the range of this exception */ @Override public boolean isEmpty() { return (this.received == null) || (this.received.isEmpty()); }
boolean hasUnresolvedTypes() { if (preparedTypes == null) { return true; } return this.unspecifiedParams != null && !this.unspecifiedParams.isEmpty(); }
private boolean checkAllProposesReceived() { return receivedPropose.isEmpty(); }
public synchronized boolean ackCumulative(int batchIndex) { // +1 since to argument is exclusive bitSet.clear(0, batchIndex + 1); return bitSet.isEmpty(); }
public synchronized boolean ackIndividual(int batchIndex) { bitSet.clear(batchIndex); return bitSet.isEmpty(); }
public List<Integer> getSlots() { if (slots == null || slots.isEmpty()) { return Collections.emptyList(); } List<Integer> slots = new ArrayList<>(); for (int i = 0; i < SlotHash.SLOT_COUNT; i++) { if (this.slots.get(i)) { slots.add(i); } } return slots; }
private static boolean subset(BitSet sub, BitSet sup) { BitSet subcopy = (BitSet) sub.clone(); subcopy.andNot(sup); return subcopy.isEmpty(); }
private static boolean usedArgAssign(InsnNode insn, BitSet args) { if (args.isEmpty()) { return false; } RegisterArg result = insn.getResult(); if (result == null || result.isField()) { return false; } return args.get(result.getRegNum()); }
private void propagateChanges(@Nonnull BitSet changedInstructions, int registerNumber, boolean override) { //Using a for loop inside the while loop optimizes for the common case of the successors of an instruction //occurring after the instruction. Any successors that occur prior to the instruction will be picked up on //the next iteration of the while loop. //This could also be done recursively, but in large methods it would likely cause very deep recursion. while (!changedInstructions.isEmpty()) { for (int instructionIndex=changedInstructions.nextSetBit(0); instructionIndex>=0; instructionIndex=changedInstructions.nextSetBit(instructionIndex+1)) { changedInstructions.clear(instructionIndex); propagateRegisterToSuccessors(analyzedInstructions.valueAt(instructionIndex), registerNumber, changedInstructions, override); } } }
public ServiceIndex setModificationTimeNull() { boolean changed = m_modificationTime.setNull(); if (changed) { if (m_dirtyFlags.isEmpty()) GenOrmDataSource.getGenOrmConnection().addToTransaction(this); m_dirtyFlags.set(MODIFICATION_TIME_FIELD_META.getDirtyFlag()); } return ((ServiceIndex)this); }
public Metric setNameNull() { boolean changed = m_name.setNull(); if (changed) { if (m_dirtyFlags.isEmpty()) GenOrmDataSource.getGenOrmConnection().addToTransaction(this); m_dirtyFlags.set(NAME_FIELD_META.getDirtyFlag()); } return ((Metric)this); }
public Metric setTypeNull() { boolean changed = m_type.setNull(); if (changed) { if (m_dirtyFlags.isEmpty()) GenOrmDataSource.getGenOrmConnection().addToTransaction(this); m_dirtyFlags.set(TYPE_FIELD_META.getDirtyFlag()); } return ((Metric)this); }
public DataPoint setValueNull() { boolean changed = m_value.setNull(); if (changed) { if (m_dirtyFlags.isEmpty()) GenOrmDataSource.getGenOrmConnection().addToTransaction(this); m_dirtyFlags.set(VALUE_FIELD_META.getDirtyFlag()); } return ((DataPoint)this); }
public ServiceIndex setValueNull() { boolean changed = m_value.setNull(); if (changed) { if (m_dirtyFlags.isEmpty()) GenOrmDataSource.getGenOrmConnection().addToTransaction(this); m_dirtyFlags.set(VALUE_FIELD_META.getDirtyFlag()); } return ((ServiceIndex)this); }
public ServiceModification setModificationTimeNull() { boolean changed = m_modificationTime.setNull(); if (changed) { if (m_dirtyFlags.isEmpty()) GenOrmDataSource.getGenOrmConnection().addToTransaction(this); m_dirtyFlags.set(MODIFICATION_TIME_FIELD_META.getDirtyFlag()); } return ((ServiceModification)this); }
/** Returns true if there are dead states that reach an accept state. */ public static boolean hasDeadStatesToAccept(Automaton a) { BitSet reachableFromInitial = getLiveStatesFromInitial(a); BitSet reachableFromAccept = getLiveStatesToAccept(a); reachableFromAccept.andNot(reachableFromInitial); return reachableFromAccept.isEmpty() == false; }
public DataPoint setMetricRef(Metric table) { //We add the record to the transaction if one of the key values change if (m_metricId.setValue(table.getId())) { if ((m_dirtyFlags.isEmpty()) && (GenOrmDataSource.getGenOrmConnection() != null)) GenOrmDataSource.getGenOrmConnection().addToTransaction(this); m_dirtyFlags.set(METRIC_ID_FIELD_META.getDirtyFlag()); } return ((DataPoint)this); }
public MetricTag setMetricRef(Metric table) { //We add the record to the transaction if one of the key values change if (m_metricId.setValue(table.getId())) { if ((m_dirtyFlags.isEmpty()) && (GenOrmDataSource.getGenOrmConnection() != null)) GenOrmDataSource.getGenOrmConnection().addToTransaction(this); m_dirtyFlags.set(METRIC_ID_FIELD_META.getDirtyFlag()); } return ((MetricTag)this); }
assertTrue(ArbitraryInstances.get(Queue.class).isEmpty()); assertTrue(ArbitraryInstances.get(PriorityQueue.class).isEmpty()); assertTrue(ArbitraryInstances.get(BitSet.class).isEmpty()); assertTrue(ArbitraryInstances.get(TreeSet.class).isEmpty()); assertTrue(ArbitraryInstances.get(TreeMap.class).isEmpty());