public void remove( int offset, int length ) { synchronized( mutex ) { list.remove( offset, length ); } } public int removeAt( int offset ) {
@Override protected void removeAt(int index) { // Remove from order first since super.removeAt can trigger compaction // making the index invalid afterwards order.remove(index); super.removeAt(index); }
public static <T> void shiftIntegerMapKeys(int startKey, int shift, TIntObjectMap<T> intToObject) { if (shift == 0) { return; } TIntList keysToShift = new TIntArrayList(intToObject.keys()); // Exclude anything before and including startKey for (int currentKey : keysToShift.toArray()) { if (currentKey <= startKey) { keysToShift.remove(currentKey); } } keysToShift.sort(); if (shift > 0) { // Shifting keys up, so start at the end to avoid overwriting keys. keysToShift.reverse(); } for (int currentKey : keysToShift.toArray()) { T obj = intToObject.get(currentKey); intToObject.remove(currentKey); intToObject.put(currentKey + shift, obj); } } }
public void remove( int offset, int length ) { synchronized( mutex ) { list.remove( offset, length ); } } public int removeAt( int offset ) {
@Override public void remove( int offset, int length ) { synchronized( mutex ) { list.remove( offset, length ); } } @Override
public void remove( int offset, int length ) { synchronized( mutex ) { list.remove( offset, length ); } } public int removeAt( int offset ) {
public void remove( int offset, int length ) { synchronized( mutex ) { list.remove( offset, length ); } } public int removeAt( int offset ) {
@Override protected void removeAt(int index) { // Remove from order first since super.removeAt can trigger compaction // making the index invalid afterwards order.remove(index); super.removeAt(index); }
@Override protected void removeAt(int index) { // Remove from order first since super.removeAt can trigger compaction // making the index invalid afterwards order.remove(index); super.removeAt(index); }
public final boolean remove(Envelope envelope, final int item) { final AtomicInteger removedCount = new AtomicInteger(); visit(envelope, false, (bin, mapKey) -> { boolean removed = bin.remove(item); if (removed) { nEntries--; removedCount.addAndGet(1); } return removed; }); if (removedCount.get() > 0) { nObjects--; return true; } else { return false; } }
public final boolean remove(Envelope envelope, final int item) { final AtomicInteger removedCount = new AtomicInteger(); visit(envelope, false, (bin, mapKey) -> { boolean removed = bin.remove(item); if (removed) { nEntries--; removedCount.addAndGet(1); } return removed; }); if (removedCount.get() > 0) { nObjects--; return true; } else { return false; } }
private static void resize(TIntList l, int n) { if (l.size() > n) { while (l.size() > n) { l.remove(l.size() - 1); } } else { while (l.size() < n) { l.add(null); } } }
@Override public void onVectorRemoved(VectorSet evtSrc, int vecid) { if (evtSrc == this.target) { processDeletedEvt(vecid); } if (evtSrc == this.source) { for (int tgtId : this.sorters.get(vecid).vecids()) { if (this.reverseIndexer.containsKey(tgtId)) { this.reverseIndexer.get(tgtId).remove(vecid); } } this.sorters.remove(vecid); this.sorterKeys.remove(vecid); } } }
ps.remove(j, ps.size() - j);