@Override public boolean cmnDrfDelete(long oplogId) { if (this.drfIds.remove(oplogId)) { this.ifLiveRecordCount--; this.ifTotalRecordCount++; return true; } else { return false; } }
@Override public boolean cmnCrfDelete(long oplogId) { if (this.krfIds.remove(oplogId)) { this.ifLiveRecordCount--; this.ifTotalRecordCount++; } if (this.crfIds.remove(oplogId)) { this.ifLiveRecordCount--; this.ifTotalRecordCount++; return true; } else { return false; } }
public boolean cmnDrfDelete(long oplogId) { if (this.drfIds.remove(oplogId)) { this.ifLiveRecordCount--; this.ifTotalRecordCount++; return true; } else { return false; } }
public boolean cmnCrfDelete(long oplogId) { if(this.krfIds.remove(oplogId)) { this.ifLiveRecordCount--; this.ifTotalRecordCount++; } if (this.crfIds.remove(oplogId)) { this.ifLiveRecordCount--; this.ifTotalRecordCount++; return true; } else { return false; } } public boolean cmnDrfDelete(long oplogId) {
@Override public void remove(LongWritable targetVertexId) { neighbors.remove(targetVertexId.get()); }
containsInAnyOrder(7L)); candidates.remove(7); recs = recommender.recommend(5, -1, candidates, null); assertTrue(recs.isEmpty()); containsInAnyOrder(6L, 7L)); candidates.remove(9); recs = recommender.recommend(6, -1, candidates, null); assertThat(recs, containsInAnyOrder(6L, 7L)); candidates.remove(8); recs = recommender.recommend(6, -1, candidates, null); assertThat(recs, containsInAnyOrder(6L, 7L)); candidates.remove(7); recs = recommender.recommend(6, -1, candidates, null); assertThat(recs, containsInAnyOrder(6L)); candidates.remove(6); recs = recommender.recommend(6, -1, candidates, null); assertTrue(recs.isEmpty());
containsInAnyOrder(6L, 7L)); candidates.remove(6); recs = recommender.recommend(6, -1, candidates, LongSets.EMPTY_SET); assertThat(recs, contains(7L)); candidates.remove(7); recs = recommender.recommend(6, -1, candidates, LongSets.EMPTY_SET); assertTrue(recs.isEmpty()); assertTrue(recs.isEmpty()); exclude.remove(6); recs = recommender.recommend(6, -1, candidates, exclude); assertThat(recs,
containsInAnyOrder(6L, 7L, 9L)); candidates.remove(6); recs = recommender.recommend(5, -1, candidates, null); assertThat(recs, containsInAnyOrder(7L, 9L)); candidates.remove(7); recs = recommender.recommend(5, -1, candidates, null); assertThat(recs, containsInAnyOrder(9L)); candidates.remove(9); recs = recommender.recommend(5, -1, candidates, null); assertThat(recs, hasSize(0));
candidates.remove(9); recs = recommender.recommend(2, -1, candidates, null); assertThat(recs, hasSize(0));
@Override public void remove() { if (last == -1) throw new IllegalStateException(); if (last == n) { LongOpenHashSet.this.containsNull = false; LongOpenHashSet.this.key[n] = (0); } else if (pos >= 0) shiftKeys(last); else { // We're removing wrapped entries. LongOpenHashSet.this.remove(wrapped.getLong(-pos - 1)); last = -1; // Note that we must not decrement size return; } size--; last = -1; // You can no longer remove this entry. if (ASSERTS) checkTable(); } }
items.remove(clickData.click.item.id);
items.remove(clickData.click.item.id);