@Override public void reset() { iter = map.keySet().iterator(); } };
@Override public Iterator<LongWritable> fastKeyIterator() { return new ReusableIterator<LongIterator>(map.keySet().iterator()) { @Override public LongWritable next() { reusableKey.set(iter.nextLong()); return reusableKey; } @Override public void reset() { iter = map.keySet().iterator(); } }; }
@Override public Iterable<LongWritable> getPartitionDestinationVertices( int partitionId) { Long2ObjectOpenHashMap<T> partitionMap = map.get(partitionId); List<LongWritable> vertices = Lists.newArrayListWithCapacity(partitionMap.size()); LongIterator iterator = partitionMap.keySet().iterator(); while (iterator.hasNext()) { vertices.add(new LongWritable(iterator.nextLong())); } return vertices; } }
private HashMap<String, GroupedValue> convert(MapResult mapResult) { HashMap<String, GroupedValue> ret = new HashMap<String, GroupedValue>(mapResult.results.size()); String[] temp = new String[mapResult.dictionaries.length]; int[] numBits = new int[columns.length]; for (int i = 0; i < columns.length; i++) { numBits[i] = BitHacks.findLogBase2(mapResult.dictionaries[i].size()) + 1; } for (long key : mapResult.results.keySet()) { ret.put(decodeKey(temp, mapResult.dictionaries, numBits, key), mapResult.results.get(key)); } return ret; }
for (long key : currentResultsToMerge.keySet()) { GroupedValue groupedValue = currentMergedResults.get(key); if (groupedValue != null) {
serialize(out, map.values().toArray()); } else if (oCls.equals(Long2ObjectOpenHashMap.class)) { serialize(out, ((Long2ObjectOpenHashMap) map).keySet().toLongArray()); serialize(out, map.values().toArray()); } else if (oCls.equals(Byte2ObjectOpenHashMap.class)) {
serialize(out, map.values().toArray()); } else if (oCls.equals(Long2ObjectOpenHashMap.class)) { serialize(out, ((Long2ObjectOpenHashMap) map).keySet().toLongArray()); serialize(out, map.values().toArray()); } else if (oCls.equals(Byte2ObjectOpenHashMap.class)) {
LongIterator rightIter = hashtags.keySet().iterator(); while (rightIter.hasNext()) { if (userTweetBigraph.getRightNodeDegree(rightIter.nextLong()) != 0)