| パッケージ | 説明 |
|---|---|
| org.piax.gtrans.ov.ddll | |
| org.piax.gtrans.ov.ring | |
| org.piax.gtrans.ov.ring.rq | |
| org.piax.gtrans.ov.sg |
| 修飾子とタイプ | フィールドと説明 |
|---|---|
Node.InsertPoint |
Node.InsertionResult.hint
an InsertPoint that can be used on the next insertion retry
|
| 修飾子とタイプ | メソッドと説明 |
|---|---|
static Node.InsertPoint |
NodeArray4Test.findInsertPoint(Comparable<?> k) |
static Node.InsertPoint |
NodeArray4Test.findLiveLeft2(Node me) |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
Node.InsertionResult |
Node.insert(Node.InsertPoint pos)
insert this node to a linked-list by specifying the immediate left and
right nodes.
|
protected Node.InsertionResult |
Node.insert0(Node.InsertPoint p)
insert a node between two nodes specified by an
Node.InsertPoint
instance. |
| コンストラクタと説明 |
|---|
InsertionResult(boolean success,
Node.InsertPoint hint) |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
Node.InsertPoint |
RingManager.find(E introducer,
DdllKey key,
boolean accurate,
Object query,
TransOptions opts)
find a location to insert `key'.
|
Node.InsertPoint |
RingManager.findImmedNeighbors(E introducer,
DdllKey key,
Object query,
TransOptions opts)
Find the contact nodes (the immediate left and right node)
for inserting a node.
|
| 修飾子とタイプ | メソッドと説明 |
|---|---|
Node.InsertPoint |
RQIf.findImmedNeighbors(E introducer,
DdllKey key,
Object query,
TransOptions opts) |
Node.InsertPoint |
RQManager.findImmedNeighbors(E introducer,
DdllKey key,
Object query,
TransOptions opts)
find a location to insert `key'.
|
| 修飾子とタイプ | メソッドと説明 |
|---|---|
Node.InsertPoint |
SkipGraph.find(E introducer,
DdllKey key,
boolean accurate)
find a location to insert `key'.
|
Node.InsertPoint |
SkipGraph.findOld(E introducer,
DdllKey key,
boolean accurate)
非推奨です。
|
Copyright © 2017. All rights reserved.