public ServerSelector( DataSegment segment, TierSelectorStrategy strategy ) { this.segment = new AtomicReference<>(segment); this.strategy = strategy; this.historicalServers = new Int2ObjectRBTreeMap<>(strategy.getComparator()); this.realtimeServers = new Int2ObjectRBTreeMap<>(strategy.getComparator()); }
public IntTreeTopK(final int maxSize, final IntComparator greater) { this.maxSize = maxSize; this.size = 0; this.greater = greater; this.data = new Int2ObjectRBTreeMap<MutableInteger>(this.greater); }
public ServerSelector( DataSegment segment, TierSelectorStrategy strategy ) { this.segment = new AtomicReference<>(segment); this.strategy = strategy; this.historicalServers = new Int2ObjectRBTreeMap<>(strategy.getComparator()); this.realtimeServers = new Int2ObjectRBTreeMap<>(strategy.getComparator()); }
public ServerSelector( DataSegment segment, TierSelectorStrategy strategy ) { this.segment = new AtomicReference<>(segment); this.strategy = strategy; this.servers = new Int2ObjectRBTreeMap<>(strategy.getComparator()); }
/** * Memoize the given score for the given position * @param score initial score * @param start starting node * @return previously memoized values invalidated by this memoization */ public void memoize(TraversalNode node) { KmerPathSubnode sn = node.node; KmerPathNode pn = sn.node(); AbstractInt2ObjectSortedMap<TraversalNode> cache = memoized.get(pn); if (cache == null) { cache = new Int2ObjectRBTreeMap<TraversalNode>(); memoized.put(pn, cache); } memoize_fastutil_sortedmap(node, cache); assert(!cache.isEmpty()); if (Defaults.SANITY_CHECK_MEMOIZATION) { //sanityCheck(); } } private void memoize_fastutil_sortedmap(TraversalNode node, AbstractInt2ObjectSortedMap<TraversalNode> cache) {