| 
Rice Pastry API | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||
| Packages that use IdRange | |
|---|---|
| rice.pastry | |
| rice.pastry.client | |
| rice.pastry.leafset | |
| rice.pastry.testing | |
| Uses of IdRange in rice.pastry | 
|---|
| Methods in rice.pastry that return IdRange | |
|---|---|
 IdRange | 
IdRange.ccwHalf()
get counterclockwise half of the range  | 
 IdRange | 
IdRange.complement()
get the complement of this range on the ring  | 
 IdRange | 
IdRange.cwHalf()
get clockwise half of the range  | 
 IdRange | 
IdRange.diff(IdRange o)
compute the difference between two ranges (exclusive or of keys in the two ranges) two ranges may differ in two ranges on the circle; this method produces one such range of difference if one exists the other range of difference can be computed by invoking o.diff(this)  | 
 IdRange | 
IdRange.intersect(IdRange o)
intersect two ranges returns an empty range if the ranges don't intersect two ranges may intersect in two ranges on the circle; this method produces one such range of intersection if one exists the other range of intersection can be computed by invoking o.intersect(this)  | 
 IdRange | 
IdRange.merge(IdRange o)
merge two ranges if this and other don't overlap, are not adjacent, and this is not empty, then the result is this  | 
 IdRange | 
IdRange.subtract(IdRange o,
         boolean cwPart)
subtract the other range from this computes the ranges of keys that are in this but not in o subtracting a range may produce two ranges on the circle; this method produces one such ranges under control of the cwPart parameter  | 
| Methods in rice.pastry with parameters of type IdRange | |
|---|---|
 IdRange | 
IdRange.diff(IdRange o)
compute the difference between two ranges (exclusive or of keys in the two ranges) two ranges may differ in two ranges on the circle; this method produces one such range of difference if one exists the other range of difference can be computed by invoking o.diff(this)  | 
 IdRange | 
IdRange.intersect(IdRange o)
intersect two ranges returns an empty range if the ranges don't intersect two ranges may intersect in two ranges on the circle; this method produces one such range of intersection if one exists the other range of intersection can be computed by invoking o.intersect(this)  | 
 boolean | 
IdRange.isAdjacent(IdRange o)
test if this range is adjacent to another range  | 
 IdRange | 
IdRange.merge(IdRange o)
merge two ranges if this and other don't overlap, are not adjacent, and this is not empty, then the result is this  | 
 IdSet | 
IdSet.subSet(IdRange range)
return a subset of this set, consisting of the member ids in a given range  | 
 IdRange | 
IdRange.subtract(IdRange o,
         boolean cwPart)
subtract the other range from this computes the ranges of keys that are in this but not in o subtracting a range may produce two ranges on the circle; this method produces one such ranges under control of the cwPart parameter  | 
| Constructors in rice.pastry with parameters of type IdRange | |
|---|---|
IdRange(IdRange o)
Copy constructor.  | 
|
| Uses of IdRange in rice.pastry.client | 
|---|
| Methods in rice.pastry.client that return IdRange | |
|---|---|
 IdRange | 
CommonAPIAppl.range(NodeHandle n,
      int r,
      Id key)
This method provides information about ranges of keys for which the node n is currently a r-root.  | 
 IdRange | 
CommonAPIAppl.range(NodeHandle n,
      int r,
      Id key,
      boolean cumulative)
This method provides information about ranges of keys for which the node n is currently a r-root.  | 
| Uses of IdRange in rice.pastry.leafset | 
|---|
| Methods in rice.pastry.leafset that return IdRange | |
|---|---|
 IdRange | 
LeafSet.range(NodeHandle n,
      int r)
range computes the range of keys for which node n is a i-root, 0<=i<=r a node is the r-root for a key of the node becomes the numerically closest node to the key when i-roots for the key fail, O<=i  | 
 IdRange | 
LeafSet.range(NodeHandle n,
      int r,
      boolean cw)
range computes the ranges of keys for which node n is a r-root a node is the r-root for a key of the node becomes the numerically closest node to the key when i-roots for the key fail, O<=i  | 
| Uses of IdRange in rice.pastry.testing | 
|---|
| Methods in rice.pastry.testing that return IdRange | |
|---|---|
 IdRange | 
IdRangeUnit.createEmptyIdRange()
 | 
 IdRange | 
IdRangeUnit.createFullIdRange()
 | 
 IdRange | 
IdRangeUnit.createIdRangeEndingIn(Id cw)
 | 
 IdRange | 
IdRangeUnit.createIdRangeStartingWith(Id ccw)
 | 
 IdRange | 
IdRangeUnit.createRandomIdRange()
 | 
| Methods in rice.pastry.testing with parameters of type IdRange | |
|---|---|
 void | 
IdRangeUnit.diffSubtractTest(IdRange r1,
                 IdRange r2)
 | 
 void | 
IdRangeUnit.equalityTest(IdRange r1,
             IdRange r2)
 | 
 void | 
IdRangeUnit.mergeIntersectTest(IdRange r1,
                   IdRange r2)
 | 
 void | 
IdRangeUnit.mergeTest(IdRange r1,
          IdRange r2)
 | 
  | 
Rice Pastry API | |||||||||
| PREV NEXT | FRAMES NO FRAMES | |||||||||