@ExpectWarning("GC") public void test() { LinkedList<Integer> lst = new LinkedList<Integer>(); lst.add(1); lst.add(2); lst.add(3); lst.removeFirstOccurrence("a"); lst.removeLastOccurrence("a"); Vector<Integer> v = new Vector<Integer>(); v.addAll(lst); v.indexOf((long) 1, 1); v.lastIndexOf((long) 1, 1); }
if (!p.bb.hasRemaining()) { sentCount++; outgoingQueue.removeFirstOccurrence(p); if (p.requestHeader != null && p.requestHeader.getType() != OpCode.ping
@Override public boolean removeFirstOccurrence(Object o) { return queue.removeFirstOccurrence(o); }
@Override public synchronized boolean removeFirstOccurrence(Object o) { return super.removeFirstOccurrence(o); }
@Override public boolean removeFirstOccurrence(Object o) { lock.lock(); try { return super.removeFirstOccurrence(o); } finally { lock.unlock(); } }
import java.util.LinkedList; class Sieve{ public static LinkedList<Long> sieve(long n){ if(n < 2) return new LinkedList<Long>(); LinkedList<Long> primes = new LinkedList<Long>(); LinkedList<Long> nums = new LinkedList<Long>(); for(long i = 2;i <= n;i++){ //unoptimized nums.add(i); } while(nums.size() > 0){ long nextPrime = nums.remove(); for(long i = nextPrime * nextPrime;i <= n;i += nextPrime){ nums.removeFirstOccurrence(i); } primes.add(nextPrime); } return primes; } }
/** * Adds the given element to the list. * @param target The item to add if not present. * @return The found element or <code>target</code> if absent. */ public E putIfAbsent(E target) { for (E element : list) { if (!element.equals(target)) { continue; } list.removeFirstOccurrence(element); list.addFirst(element); return element; } add(target); return target; } }
@Override public boolean removeFirstOccurrence(Object paramObject) { if (_directAccess) { return super.removeFirstOccurrence(paramObject); } if (isDelayLoad()) { load(); } Proxies.dirty(this, true); return super.removeFirstOccurrence(paramObject); }
@Override public boolean removeFirstOccurrence(Object paramObject) { if (_directAccess) { return super.removeFirstOccurrence(paramObject); } if (isDelayLoad()) { load(); } Proxies.dirty(this, true); return super.removeFirstOccurrence(paramObject); }
@Override public boolean removeFirstOccurrence(Object paramObject) { if (_directAccess) { return super.removeFirstOccurrence(paramObject); } if (isDelayLoad()) { load(); } Proxies.dirty(this, true); return super.removeFirstOccurrence(paramObject); }
@Override public boolean removeFirstOccurrence(Object paramObject) { if (_directAccess) { return super.removeFirstOccurrence(paramObject); } if (isDelayLoad()) { load(); } Proxies.dirty(this, true); return super.removeFirstOccurrence(paramObject); }
@Impure @Override @NonFrozenRecipient public boolean removeFirstOccurrence(@NonCaptured @Unmodified @Nullable Object object) { return super.removeFirstOccurrence(object); }
l1.removeFirstOccurrence(rand_val); l2.removeFirstOccurrence(rand_val);
l1.removeFirstOccurrence(rand_val); l2.removeFirstOccurrence(rand_val);
l1.removeFirstOccurrence(rand_val); l2.removeFirstOccurrence(rand_val);
l1.removeFirstOccurrence(randVal); l2.removeFirstOccurrence(randVal);