@Override synchronized public boolean containsKey(Transaction tx, Key key) throws IOException { assertLoaded(); if (size.get() == 0) { return false; } for (Iterator<Map.Entry<Key,Value>> iterator = iterator(tx); iterator.hasNext(); ) { Map.Entry<Key,Value> candidate = iterator.next(); if (key.equals(candidate.getKey())) { return true; } } return false; }
@Override @SuppressWarnings({ "rawtypes", "unchecked" }) synchronized public Value get(Transaction tx, Key key) throws IOException { assertLoaded(); for (Iterator<Map.Entry<Key,Value>> iterator = iterator(tx); iterator.hasNext(); ) { Map.Entry<Key,Value> candidate = iterator.next(); if (key.equals(candidate.getKey())) { this.lastGetNodeCache = ((ListIterator) iterator).getCurrent(); this.lastGetEntryCache = candidate; this.lastCacheTxSrc = new WeakReference<Transaction>(tx); return candidate.getValue(); } } return null; }
private void addAckLocationForRetroactiveSub(Transaction tx, StoredDestination sd, String subscriptionKey) throws IOException { SequenceSet allOutstanding = new SequenceSet(); Iterator<Map.Entry<String, SequenceSet>> iterator = sd.ackPositions.iterator(tx); while (iterator.hasNext()) { SequenceSet set = iterator.next().getValue(); for (Long entry : set) { allOutstanding.add(entry); } } sd.ackPositions.put(tx, subscriptionKey, allOutstanding); }
Iterator<Map.Entry<Key, Value>> iterator = iterator(tx); while (iterator.hasNext() && ((ListIterator) iterator).getCurrent() != lastGetNodeCache) { Map.Entry<Key, Value> entry = iterator.next();
Iterator<Map.Entry<Key, Value>> iterator = iterator(tx); while (iterator.hasNext() && ((ListIterator) iterator).getCurrent() != lastGetNodeCache) { Map.Entry<Key, Value> entry = iterator.next();
Iterator<Entry<String, Location>> iter = entry.getValue().subLocations.iterator(tx); while (iter.hasNext()) { Entry<String, Location> subscription = iter.next();
Iterator<Entry<String, SequenceSet>> subscriptions = rc.ackPositions.iterator(tx); while (subscriptions.hasNext()) { Entry<String, SequenceSet> subscription = subscriptions.next();
Iterator<Entry<String, SequenceSet>> iter = sd.ackPositions.iterator(tx); while (iter.hasNext()) { Entry<String, SequenceSet> e = iter.next();
@Override synchronized public boolean containsKey(Transaction tx, Key key) throws IOException { assertLoaded(); if (size.get() == 0) { return false; } for (Iterator<Map.Entry<Key,Value>> iterator = iterator(tx); iterator.hasNext(); ) { Map.Entry<Key,Value> candidate = iterator.next(); if (key.equals(candidate.getKey())) { return true; } } return false; }
@Override synchronized public boolean containsKey(Transaction tx, Key key) throws IOException { assertLoaded(); if (size.get() == 0) { return false; } for (Iterator<Map.Entry<Key,Value>> iterator = iterator(tx); iterator.hasNext(); ) { Map.Entry<Key,Value> candidate = iterator.next(); if (key.equals(candidate.getKey())) { return true; } } return false; }
@Override synchronized public boolean containsKey(Transaction tx, Key key) throws IOException { assertLoaded(); if (size.get() == 0) { return false; } for (Iterator<Map.Entry<Key,Value>> iterator = iterator(tx); iterator.hasNext(); ) { Map.Entry<Key,Value> candidate = iterator.next(); if (key.equals(candidate.getKey())) { return true; } } return false; }
@Override @SuppressWarnings({ "rawtypes", "unchecked" }) synchronized public Value get(Transaction tx, Key key) throws IOException { assertLoaded(); for (Iterator<Map.Entry<Key,Value>> iterator = iterator(tx); iterator.hasNext(); ) { Map.Entry<Key,Value> candidate = iterator.next(); if (key.equals(candidate.getKey())) { this.lastGetNodeCache = ((ListIterator) iterator).getCurrent(); this.lastGetEntryCache = candidate; this.lastCacheTxSrc = new WeakReference<Transaction>(tx); return candidate.getValue(); } } return null; }
@Override @SuppressWarnings({ "rawtypes", "unchecked" }) synchronized public Value get(Transaction tx, Key key) throws IOException { assertLoaded(); for (Iterator<Map.Entry<Key,Value>> iterator = iterator(tx); iterator.hasNext(); ) { Map.Entry<Key,Value> candidate = iterator.next(); if (key.equals(candidate.getKey())) { this.lastGetNodeCache = ((ListIterator) iterator).getCurrent(); this.lastGetEntryCache = candidate; this.lastCacheTxSrc = new WeakReference<Transaction>(tx); return candidate.getValue(); } } return null; }
@Override @SuppressWarnings({ "rawtypes", "unchecked" }) synchronized public Value get(Transaction tx, Key key) throws IOException { assertLoaded(); for (Iterator<Map.Entry<Key,Value>> iterator = iterator(tx); iterator.hasNext(); ) { Map.Entry<Key,Value> candidate = iterator.next(); if (key.equals(candidate.getKey())) { this.lastGetNodeCache = ((ListIterator) iterator).getCurrent(); this.lastGetEntryCache = candidate; this.lastCacheTxSrc = new WeakReference<Transaction>(tx); return candidate.getValue(); } } return null; }
private void addAckLocationForRetroactiveSub(Transaction tx, StoredDestination sd, String subscriptionKey) throws IOException { SequenceSet allOutstanding = new SequenceSet(); Iterator<Map.Entry<String, SequenceSet>> iterator = sd.ackPositions.iterator(tx); while (iterator.hasNext()) { SequenceSet set = iterator.next().getValue(); for (Long entry : set) { allOutstanding.add(entry); } } sd.ackPositions.put(tx, subscriptionKey, allOutstanding); }
private void addAckLocationForRetroactiveSub(Transaction tx, StoredDestination sd, String subscriptionKey) throws IOException { SequenceSet allOutstanding = new SequenceSet(); Iterator<Map.Entry<String, SequenceSet>> iterator = sd.ackPositions.iterator(tx); while (iterator.hasNext()) { SequenceSet set = iterator.next().getValue(); for (Long entry : set) { allOutstanding.add(entry); } } sd.ackPositions.put(tx, subscriptionKey, allOutstanding); }
private void addAckLocationForRetroactiveSub(Transaction tx, StoredDestination sd, String subscriptionKey) throws IOException { SequenceSet allOutstanding = new SequenceSet(); Iterator<Map.Entry<String, SequenceSet>> iterator = sd.ackPositions.iterator(tx); while (iterator.hasNext()) { SequenceSet set = iterator.next().getValue(); for (Long entry : set) { allOutstanding.add(entry); } } sd.ackPositions.put(tx, subscriptionKey, allOutstanding); }
Iterator<Map.Entry<Key, Value>> iterator = iterator(tx); while (iterator.hasNext() && ((ListIterator) iterator).getCurrent() != lastGetNodeCache) { Map.Entry<Key, Value> entry = iterator.next();
Iterator<Map.Entry<Key, Value>> iterator = iterator(tx); while (iterator.hasNext() && ((ListIterator) iterator).getCurrent() != lastGetNodeCache) { Map.Entry<Key, Value> entry = iterator.next();
Iterator<Map.Entry<Key, Value>> iterator = iterator(tx); while (iterator.hasNext() && ((ListIterator) iterator).getCurrent() != lastGetNodeCache) { Map.Entry<Key, Value> entry = iterator.next();