private void addNodeKeySlots(String key) { long[] hashes = nodeKeyHashes.get(key); for (long hash : hashes) { nodeKeySlots.put(hash, key); } }
private void addNodeKeySlots(String key) { long[] hashes = nodeKeyHashes.get(key); for (long hash : hashes) { nodeKeySlots.put(hash, key); } }
private void addNodeKeySlots(String key) { long[] hashes = nodeKeyHashes.get(key); for (long hash : hashes) { nodeKeySlots.put(hash, key); } }
/** * Creates a new tree map using the elements of two parallel arrays and the * given comparator. * * @param k * the array of keys of the new tree map. * @param v * the array of corresponding values in the new tree map. * @param c * a (possibly type-specific) comparator. * @throws IllegalArgumentException * if {@code k} and {@code v} have different lengths. */ public Long2ObjectRBTreeMap(final long[] k, final V v[], final Comparator<? super Long> c) { this(c); if (k.length != v.length) throw new IllegalArgumentException( "The key array and the value array have different lengths (" + k.length + " and " + v.length + ")"); for (int i = 0; i < k.length; i++) this.put(k[i], v[i]); } /**
public static void updateData(Doc doc) { long uid = doc.getUid(); Map<String, String> m = doc.getFields(); Joiner joiner = Joiner.on("_"); String d = joiner.join(m.get(CREATED_FIELD), m.get(FAV_FIELD), m.get(FAVCTU_FIELD), m.get(EDITOR_FIELD)); data.put(uid, d); }
private Order add(Long2ObjectRBTreeMap<PriceLevel> levels, long orderId, Side side, long price, long size) { PriceLevel level = levels.get(price); if (level == null) { level = new PriceLevel(side, price); levels.put(price, level); } return level.add(orderId, size); }
public Order add(long orderId, long price, long size) { Level level = levels.get(price); if (level == null) { level = new Level(this, price); levels.put(price, level); } return level.add(orderId, size); }
private Order add( Long2ObjectRBTreeMap<PriceLevel> levels, long orderId, Side side, long price, long size) { PriceLevel level = levels.get(price); if (level == null) { level = new PriceLevel(side, price); levels.put(price, level); } return level.add(orderId, size); }
public Order add(long price, long size) { Level level = levels.get(price); if (level == null) { level = new Level(this, price); levels.put(price, level); } return level.add(size); }
map.put(hashKey, col.getString(mkRows.hashMap.get(hashKey))); return new MinKSet<String>(this.maxSize, map, Comparator.naturalOrder(), minString, maxString, numPresent, numMissing);
hMap.put(hashKey, new RowSnapshot(data, mkRows.hashMap.get(hashKey), schema)); RowSnapshot minRS = new RowSnapshot(data, minRow, schema); RowSnapshot maxRS = new RowSnapshot(data, maxRow, schema);