| 
Rice Pastry API | ||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||
| Packages that use NodeSet | |
| rice.pastry | |
| rice.pastry.client | |
| rice.pastry.leafset | |
| rice.pastry.routing | |
| Uses of NodeSet in rice.pastry | 
| Constructors in rice.pastry with parameters of type NodeSet | |
NodeSet(NodeSet o)
Copy constructor.  | 
|
| Uses of NodeSet in rice.pastry.client | 
| Methods in rice.pastry.client that return NodeSet | |
 NodeSet | 
CommonAPIAppl.localLookup(Id key,
            int num,
            boolean safe)
This method produces a list of nodes that can be used as next hops on a route towards key, such that the resulting route satisfies the overlay protocol's bounds on the number of hops taken.  | 
 NodeSet | 
CommonAPIAppl.neighborSet(int num)
This method produces an unordered list of nodehandles that are neighbors of the local node in the ID space.  | 
 NodeSet | 
CommonAPIAppl.replicaSet(Id key,
           int max_rank)
This method returns an ordered set of nodehandles on which replicas of the object with key can be stored.  | 
| Uses of NodeSet in rice.pastry.leafset | 
| Methods in rice.pastry.leafset that return NodeSet | |
 NodeSet | 
LeafSet.neighborSet(int max)
compute an ordered set of nodes that are neighbors of this local node, in order of numerical closeness to the local node  | 
 NodeSet | 
LeafSet.replicaSet(Id key,
           int max)
compute an ordered set of nodes, in order of numerical closeness to a given key  | 
| Uses of NodeSet in rice.pastry.routing | 
| Methods in rice.pastry.routing that return NodeSet | |
 NodeSet | 
RoutingTable.alternateRoutes(Id key,
                int max)
Determines a set of alternate hops towards a given key.  | 
  | 
Rice Pastry API | ||||||||||
| PREV NEXT | FRAMES NO FRAMES | ||||||||||