public boolean add(Element element) { return elementSet.add(element); }
public boolean add(Element element) { return elementSet.add(element); }
private void add(final BaseRowSnapshot row) { this.rowSet.add(row); }
@Override public void hideRecord(BaseInformationRecords.BaseInformation record) { this.hideSet.add(record); }
public void hideRecord(BaseInformationRecords.BaseInformation record) { hideSet.add(record); } }
@Override public void receive( Job job ) { if ( accept( job.uri ) && enqueued.add( job.uri ) ) visitQueue.add( job.uri ); }
if ( numberOfDocuments == -1 ) numberOfDocuments = index[ i ].numberOfDocuments; if ( numberOfDocuments != index[ i ].numberOfDocuments ) throw new IllegalArgumentException( "All indices must have the same number of documents" ); indices.add( index[ i ].field ); if ( index[ i ].termProcessor != null ) termProcessors.put( index[ i ].field, index[ i ].termProcessor ); havePositions &= index[ i ].hasPositions;
if ( numberOfDocuments == -1 ) numberOfDocuments = index[ i ].numberOfDocuments; if ( numberOfDocuments != index[ i ].numberOfDocuments ) throw new IllegalArgumentException( "All indices must have the same number of documents" ); indices.add( index[ i ].field ); if ( index[ i ].termProcessor != null ) termProcessors.put( index[ i ].field, index[ i ].termProcessor ); havePositions &= index[ i ].hasPositions;
private ObjectArrayList<BaseInformationRecords.CountInfo.Builder> aggregateCounts(ObjectArrayList<BaseInformationRecords.CountInfo.Builder> countsToKeep) { toRemove.clear(); Collections.sort(countsToKeep, comparator); BaseInformationRecords.CountInfo.Builder previous = null; for (BaseInformationRecords.CountInfo.Builder count : countsToKeep) { if (previous != null) { if (comparator.compare(previous, count) == 0) { int sumForward = previous.getGenotypeCountForwardStrand() + count.getGenotypeCountForwardStrand(); int sumReverse = previous.getGenotypeCountReverseStrand() + count.getGenotypeCountReverseStrand(); previous.setGenotypeCountForwardStrand(sumForward); previous.setGenotypeCountReverseStrand(sumReverse); previous.setMatchesReference(previous.getFromSequence().equals(previous.getToSequence())); toRemove.add(count); } } previous = count; } countsToKeep.removeAll(toRemove); return countsToKeep; }
@Override public boolean retainAll(final Collection<?> c) { checkCollection(c); if (!c.isEmpty()) { ObjectSet<NodeImpl> set = new ObjectOpenHashSet(c.size()); for (Object o : c) { checkNonNullObject(o); checkNodeExists((NodeImpl) o); set.add((NodeImpl) o); } boolean changed = false; NodeStoreIterator itr = iterator(); while (itr.hasNext()) { NodeImpl e = itr.next(); if (!set.contains(e)) { itr.remove(); changed = true; } } return changed; } else { clear(); } return false; }
@Override public boolean retainAll(Collection<?> c) { checkCollection(c); if (!c.isEmpty()) { ObjectSet<EdgeImpl> set = new ObjectOpenHashSet(c.size()); for (Object o : c) { checkNonNullObject(o); checkEdgeExists((EdgeImpl) o); set.add((EdgeImpl) o); } boolean changed = false; EdgeStoreIterator itr = iterator(); while (itr.hasNext()) { EdgeImpl e = itr.next(); if (!set.contains(e)) { itr.remove(); changed = true; } } return changed; } else { clear(); } return false; }
public void addEntity( Entity entity ) { if ( !this.visible.contains( entity ) && !this.player.equals( entity ) ) { LOGGER.debug( "Spawning entity {} for {}", entity, this.player.getName() ); io.gomint.server.entity.Entity implEntity = (io.gomint.server.entity.Entity) entity; implEntity.preSpawn( this.player.getConnection() ); this.player.getConnection().addToSendQueue( implEntity.createSpawnPacket( this.player ) ); implEntity.postSpawn( this.player.getConnection() ); implEntity.attach( this.player ); this.visible.add( entity ); } }
@Override public boolean retainAll(Collection<?> c) { checkCollection(c); if (!c.isEmpty()) { ObjectSet<EdgeImpl> set = new ObjectOpenHashSet(c.size()); for (Object o : c) { checkNonNullObject(o); checkEdgeExists((EdgeImpl) o); set.add((EdgeImpl) o); } boolean changed = false; EdgeStoreIterator itr = iterator(); while (itr.hasNext()) { EdgeImpl e = itr.next(); if (!set.contains(e)) { itr.remove(); changed = true; } } return changed; } else { clear(); } return false; }
@Override public boolean retainAll(final Collection<?> c) { checkCollection(c); if (!c.isEmpty()) { ObjectSet<NodeImpl> set = new ObjectOpenHashSet(c.size()); for (Object o : c) { checkNonNullObject(o); checkNodeExists((NodeImpl) o); set.add((NodeImpl) o); } boolean changed = false; NodeStoreIterator itr = iterator(); while (itr.hasNext()) { NodeImpl e = itr.next(); if (!set.contains(e)) { itr.remove(); changed = true; } } return changed; } else { clear(); } return false; }
distinctTrueGenotypes.add(formattedTrueGenotype);
chromosomeSeen.contains(a.getChr())); previousChr = a.getChr(); chromosomeSeen.add(a.getChr());