public List<Set<Integer>> search(int from, final int bucketCount) { searchInternal(from); final double bucketSize = limit / bucketCount; final List<Set<Integer>> list = new ArrayList<>(bucketCount); for (int i = 0; i < bucketCount; i++) { list.add(new HashSet<Integer>()); } fromMap.forEach(new IntObjectProcedure<IsoLabel>() { @Override public void apply(int nodeId, IsoLabel label) { if (finished()) { return; } int bucketIndex = (int) (getExploreValue(label) / bucketSize); if (bucketIndex < 0) { throw new IllegalArgumentException("edge cannot have negative explore value " + nodeId + ", " + label); } else if (bucketIndex == bucketCount) { bucketIndex = bucketCount - 1; } else if (bucketIndex > bucketCount) { return; } list.get(bucketIndex).add(nodeId); } }); return list; }
fromMap.forEach(new IntObjectProcedure<IsoLabel>() {
void channelClosed(Throwable ex) { isOpen.set(false); if (ex != null) { final RpcException e = RpcException.mapException(ex); IntObjectHashMap<RpcOutcome<?>> clonedMap; synchronized (map) { clonedMap = map.clone(); map.clear(); } clonedMap.forEach(new SetExceptionProcedure(e)); } }
@Override public <T extends IntObjectProcedure<? super VType>> T forEach(T procedure) { return map.forEach(procedure); }
@Override public <T extends IntObjectPredicate<? super VType>> T forEach(T predicate) { return map.forEach(predicate); }
@Override public <T extends IntObjectProcedure<? super VType>> T forEach(T procedure) { return map.forEach(procedure); }
@Override public <T extends IntObjectPredicate<? super VType>> T forEach(T predicate) { return map.forEach(predicate); }
@Override public <T extends IntObjectPredicate<? super VType>> T forEach(T predicate) { return map.forEach(predicate); }
@Override public <T extends IntObjectProcedure<? super VType>> T forEach(T procedure) { return map.forEach(procedure); }
@Override public <T extends IntObjectPredicate<? super VType>> T forEach(T predicate) { return map.forEach(predicate); }
@Override public <T extends IntObjectProcedure<? super VType>> T forEach(T procedure) { return map.forEach(procedure); }
@Override public <T extends IntObjectProcedure<? super VType>> T forEach(T procedure) { return map.forEach(procedure); }
@Override public <T extends IntObjectProcedure<? super VType>> T forEach(T procedure) { return map.forEach(procedure); }
@Override public <T extends IntObjectPredicate<? super VType>> T forEach(T predicate) { return map.forEach(predicate); }
@Override public <T extends IntObjectPredicate<? super VType>> T forEach(T predicate) { return map.forEach(predicate); }
public List<Set<Integer>> search(int from, final int bucketCount) { searchInternal(from); final double bucketSize = limit / bucketCount; final List<Set<Integer>> list = new ArrayList<>(bucketCount); for (int i = 0; i < bucketCount; i++) { list.add(new HashSet<Integer>()); } fromMap.forEach(new IntObjectProcedure<IsoLabel>() { @Override public void apply(int nodeId, IsoLabel label) { if (finished()) { return; } int bucketIndex = (int) (getExploreValue(label) / bucketSize); if (bucketIndex < 0) { throw new IllegalArgumentException("edge cannot have negative explore value " + nodeId + ", " + label); } else if (bucketIndex == bucketCount) { bucketIndex = bucketCount - 1; } else if (bucketIndex > bucketCount) { return; } list.get(bucketIndex).add(nodeId); } }); return list; }
fromMap.forEach(new IntObjectProcedure<IsoLabel>() {
void channelClosed(Throwable ex) { isOpen.set(false); if (ex != null) { final IntObjectHashMap<RpcOutcome<?>> clonedMap; synchronized (map) { clonedMap = map.clone(); map.clear(); } final RpcException e = RpcException.mapException(ex); clonedMap.forEach(new SetExceptionProcedure(e)); } }
@Override public boolean apply(final int majorFragmentId, final IntObjectHashMap<FragmentData> minorMap) { final MajorFragmentProfile.Builder builder = MajorFragmentProfile.newBuilder().setMajorFragmentId(majorFragmentId); minorMap.forEach(new InnerIter(builder)); profileBuilder.addFragmentProfile(builder); return true; } }
fragmentDataMap.forEach(new OuterIter(profileBuilder));