@Override public boolean contains(final long key) { return list.contains(key); } @Override
public boolean contains(long id) { return invalid.contains(id); }
@Test public void testUserIndex() { KeyIndex ind = snap.userIndex(); assertEquals(6, ind.size()); assertTrue(ind.getKeyList().contains(1)); assertTrue(ind.getKeyList().contains(3)); assertTrue(ind.getKeyList().contains(4)); assertTrue(ind.getKeyList().contains(5)); assertTrue(ind.getKeyList().contains(6)); assertTrue(ind.getKeyList().contains(7)); assertEquals(0, ind.getIndex(1)); assertEquals(1, ind.getIndex(3)); assertEquals(2, ind.getIndex(4)); assertEquals(3, ind.getIndex(5)); assertEquals(4, ind.getIndex(6)); assertEquals(5, ind.getIndex(7)); assertEquals(1, ind.getKey(0)); assertEquals(3, ind.getKey(1)); assertEquals(4, ind.getKey(2)); assertEquals(5, ind.getKey(3)); assertEquals(6, ind.getKey(4)); assertEquals(7, ind.getKey(5)); }
private void addSupport(int[] transitionSupport, KmerEvidence evidence, int offset) { for (Entry<Integer, ImmutableTriple<Integer, LongList, LongList>> entry : contigTransitionOffsetLookup.subMap(offset, offset + evidence.length() - 1).entrySet()) { long readKmerPreTransition = evidence.kmer(entry.getKey() - offset); long readKmerPostTransition = evidence.kmer(entry.getKey() - offset + 1); ImmutableTriple<Integer, LongList, LongList> transition = entry.getValue(); if (transition.middle.contains(readKmerPreTransition) && transition.right.contains(readKmerPostTransition)) { transitionSupport[transition.left]++; } } } /**
|| (tweetIds == null || !tweetIds.contains(rightNode))) {