Ray points out this can usefully be an AtomicInteger.

git-svn-id: svn+ssh://src.earth.threerings.net/narya/trunk@6155 542714f4-19e9-0310-aa3c-eee0fc999fb1
This commit is contained in:
Par Winzell
2010-09-13 17:35:23 +00:00
parent 6f7101404b
commit c2ebf2884b
@@ -25,6 +25,7 @@ import java.util.Collections;
import java.util.List;
import java.util.Map;
import java.util.Set;
import java.util.concurrent.atomic.AtomicInteger;
import java.util.concurrent.atomic.AtomicLong;
import java.io.ByteArrayInputStream;
@@ -504,7 +505,7 @@ public abstract class PeerManager
final Map<String, T> results = Maps.newHashMap();
final Map<String, String> failures = Maps.newHashMap();
final Set<String> completedNodes = Sets.newHashSet();
final AtomicInteger completedNodes = new AtomicInteger();
for (final String node : nodes) {
invokeNodeRequest(node, requestBytes, new InvocationService.ResultListener() {
public void requestProcessed (Object result) {
@@ -519,8 +520,7 @@ public abstract class PeerManager
nodeDone(node);
}
protected void nodeDone (String node) {
completedNodes.add(node);
if (nodes.size() == completedNodes.size()) {
if (completedNodes.incrementAndGet() == nodes.size()) {
// if all nodes have responded, let caller know
listener.requestsProcessed(new NodeRequestsResultImpl<T>(results, failures));
}