| パッケージ | 説明 |
|---|---|
| org.piax.gtrans.ov | |
| org.piax.gtrans.ov.ddll | |
| org.piax.gtrans.ov.ring | |
| org.piax.gtrans.ov.ring.rq | |
| org.piax.gtrans.ov.sg | |
| org.piax.gtrans.ov.szk |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
default Link[] |
RoutingTableAccessor.getAll() |
default Link |
RoutingTableAccessor.getLeft(Comparable<?> key) |
default Link |
RoutingTableAccessor.getLeft(Comparable<?> key,
int level) |
default Link[] |
RoutingTableAccessor.getLefts(Comparable<?> key) |
default Link[] |
RoutingTableAccessor.getLefts(Comparable<?> key,
int level) |
default Link |
RoutingTableAccessor.getLocal(Comparable<?> key) |
default Link |
RoutingTableAccessor.getRight(Comparable<?> key) |
default Link |
RoutingTableAccessor.getRight(Comparable<?> key,
int level) |
default Link[] |
RoutingTableAccessor.getRights(Comparable<?> key) |
default Link[] |
RoutingTableAccessor.getRights(Comparable<?> key,
int level) |
| 修飾子とタイプ | フィールドと説明 |
|---|---|
Link |
Node.InsertPoint.left |
Link |
Node.InsertPoint.right |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
Link |
Link.getIdChangedLink(String id) |
Link |
Node.getLeft() |
Link |
Node.getMyLink() |
Link |
Node.getRight() |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
Set<Link> |
NodeManager.getAllLinksById(String id) |
List<Link> |
Node.getNeighborSet() |
List<Link> |
NodeObserver.suppplyLeftCandidatesForFix() |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
int |
Link.compareTo(Link another)
compareTo() method.
|
void |
NodeManager.findNearest(DdllKey target,
Link sender,
int reqNo,
DdllKey searchKey,
Link prevKey) |
void |
NodeManagerIf.findNearest(DdllKey target,
Link sender,
int reqNo,
DdllKey searchKey,
Link prevKey) |
void |
Node.findNearest(Link sender,
int reqNo,
DdllKey searchKey,
Link prevKey) |
void |
NodeManager.getStat(DdllKey target,
Link sender,
int reqNo) |
void |
NodeManagerIf.getStat(DdllKey target,
Link sender,
int reqNo) |
void |
Node.getStat(Link sender,
int reqNo) |
Node.InsertionResult |
Node.insert(Link introducer,
int maxRetry)
insert this node to a linked-list by specifying an introducer node, which
is an arbitrary node that has been inserted to the linked-list.
|
void |
NodeObserver.onRightNodeChange(Link prevRight,
Link newRight,
Object payload)
called when the right link is changed by receiving a SetR message.
|
void |
NodeManager.setFindNext(DdllKey target,
int reqNo,
Link next,
Link prevKey) |
void |
NodeManagerIf.setFindNext(DdllKey target,
int reqNo,
Link next,
Link prevKey) |
void |
Node.setFindNext(int reqNo,
Link next,
Link prevKey) |
void |
NodeManager.setFindResult(DdllKey target,
int reqNo,
Link left,
Link right) |
void |
NodeManagerIf.setFindResult(DdllKey target,
int reqNo,
Link left,
Link right) |
void |
Node.setFindResult(int reqNo,
Link left,
Link right) |
void |
NodeManager.setL(DdllKey target,
Link lNew,
LinkNum lNewNum,
Link lPrev,
Set<Link> nbrs) |
void |
NodeManagerIf.setL(DdllKey target,
Link lNew,
LinkNum lNewNum,
Link d,
Set<Link> nbrs) |
void |
Node.setL(Link lNew,
LinkNum lNewNum,
Link prevL,
Set<Link> nbrs) |
protected void |
Node.setLeft(Link left) |
void |
NodeManager.setR(DdllKey target,
Link sender,
int reqNo,
Link rNew,
Link rCur,
LinkNum rNewNum,
int type,
Object payload) |
void |
NodeManagerIf.setR(DdllKey target,
Link sender,
int reqNo,
Link rNew,
Link rCur,
LinkNum rNewNum,
int type,
Object payload) |
void |
Node.setR(Link sender,
int reqNo,
Link rNew,
Link rCur,
LinkNum rNewNum,
int type,
Object payload)
SetR message handler.
|
void |
NodeManager.setRAck(DdllKey target,
Link sender,
int reqNo,
LinkNum val,
Set<Link> nbrs) |
void |
NodeManagerIf.setRAck(DdllKey target,
Link sender,
int reqNo,
LinkNum val,
Set<Link> nbrs) |
void |
Node.setRAck(Link sender,
int reqNo,
LinkNum zNum,
Set<Link> nbrs)
SetRAck message handler.
|
protected void |
Node.setRight(Link right) |
void |
NodeManager.setRNak(DdllKey target,
Link sender,
int reqNo,
Link curR) |
void |
NodeManagerIf.setRNak(DdllKey target,
Link sender,
int reqNo,
Link curR) |
void |
Node.setRNak(Link sender,
int reqNo,
Link curR)
SetRNak message handler.
|
void |
NodeManager.startFix(DdllKey target,
Link failedNode,
boolean force) |
void |
NodeManagerIf.startFix(DdllKey target,
Link failedNode,
boolean force) |
void |
Node.startFix(Link failed) |
void |
Node.startFix(Link failed,
boolean force)
start fixing a single failed link.
|
void |
NodeManager.unrefL(DdllKey target,
Link sender) |
void |
NodeManagerIf.unrefL(DdllKey target,
Link sender) |
void |
Node.unrefL(Link sender) |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
boolean |
NodeObserver.onNodeFailure(Collection<Link> failedLinks)
called when node failure is detected by DDLL's node monitor.
|
void |
NodeManager.propagateNeighbors(DdllKey src,
DdllKey target,
Set<Link> newset,
DdllKey limit) |
void |
NodeManagerIf.propagateNeighbors(DdllKey src,
DdllKey key,
Set<Link> newset,
DdllKey limit) |
void |
NodeManager.setL(DdllKey target,
Link lNew,
LinkNum lNewNum,
Link lPrev,
Set<Link> nbrs) |
void |
NodeManagerIf.setL(DdllKey target,
Link lNew,
LinkNum lNewNum,
Link d,
Set<Link> nbrs) |
void |
Node.setL(Link lNew,
LinkNum lNewNum,
Link prevL,
Set<Link> nbrs) |
void |
NodeManager.setRAck(DdllKey target,
Link sender,
int reqNo,
LinkNum val,
Set<Link> nbrs) |
void |
NodeManagerIf.setRAck(DdllKey target,
Link sender,
int reqNo,
LinkNum val,
Set<Link> nbrs) |
void |
Node.setRAck(Link sender,
int reqNo,
LinkNum zNum,
Set<Link> nbrs)
SetRAck message handler.
|
void |
Node.startFix(Collection<Link> failedLinks)
start fixing set of failed links.
|
void |
Node.startfix(Collection<Link> failedLinks,
Object payload) |
void |
Node.startfix(Collection<Link> failedLinks,
Object payload,
boolean force)
start fixing `failedLinks'.
|
| コンストラクタと説明 |
|---|
InsertPoint(Link left,
Link right) |
| 修飾子とタイプ | フィールドと説明 |
|---|---|
Link |
RingManager.RightNodeMismatch.curRight |
Link |
RingManager.ExecQueryReturn.left |
Link |
RingManager.LinkContainer.link |
protected Link |
RequestMessage.receiver |
Link |
RingManager.ExecQueryReturn.right |
Link |
RingManager.LinkContainer.rightLink |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
Link |
RingManager.findLeftLink(DdllKey key)
find the closest left link of `key' from the local routing table.
|
Link[] |
RingVNode.getAllLinks() |
Link[] |
RingIf.getClosestLinks(DdllKey key) |
Link[] |
RingManager.getClosestLinks(DdllKey key)
get the closest left and right links of `key' in the local routing
table.
|
Link |
RingVNode.getLocalLink() |
Link[] |
RingIf.getLocalLinks() |
Link[] |
RingManager.getLocalLinks() |
Link |
RingVNode.getPredecessor() |
Link |
RingVNode.getSuccessor() |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
protected NavigableMap<DdllKey,Link> |
RingManager.getAvailableLinks()
gather all links from all virtual nodes.
|
List<Link> |
RingVNode.suppplyLeftCandidatesForFix() |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
void |
RingVNode.fixLeftLinks(Link link,
List<Link> failedLinks,
RQMessage msg,
List<CircularRange<DdllKey>> failedRanges) |
void |
RingVNode.onRightNodeChange(Link prevRight,
Link newRight,
Object payload) |
void |
RequestMessage.send(Link dst)
send this message to the specified destination.
|
| 修飾子とタイプ | メソッドと説明 |
|---|---|
void |
RingVNode.fixLeftLinks(Link link,
List<Link> failedLinks,
RQMessage msg,
List<CircularRange<DdllKey>> failedRanges) |
void |
RingManager.fixRoutingTables(Collection<Link> failedNodes,
RQMessage parentMsg,
Collection<CircularRange<DdllKey>> ranges) |
boolean |
RingVNode.onNodeFailure(Collection<Link> failedLinks) |
| コンストラクタと説明 |
|---|
LinkContainer(Link link,
Link rightLink,
boolean isImmedPred) |
RightNodeMismatch(Link curRight) |
| 修飾子とタイプ | フィールドと説明 |
|---|---|
Link |
RQManager.FIXLEFT
pseudo Link instance that represents the link should be fixed
|
| 修飾子とタイプ | メソッドと説明 |
|---|---|
Link |
DKRangeLink.getLink() |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
RingManager.ExecQueryReturn |
RQIf.invokeExecQuery(Comparable<?> target,
Link curRight,
QueryId qid,
boolean doAction,
Object query,
TransOptions opts) |
RingManager.ExecQueryReturn |
RQManager.invokeExecQuery(Comparable<?> rawkey,
Link curRight,
QueryId qid,
boolean doAction,
Object query,
TransOptions opts)
Range Query実行時にRPCで呼び出されるメソッド.
|
void |
RQReturn.sendChildMessage(Link dest,
RQMessage m) |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
List<SubRange> |
RQAlgorithm.assignDelegate(Object query,
SubRange queryRange,
NavigableMap<DdllKey,Link> allLinks,
Collection<Endpoint> failedLinks)
split the given query range and assign an appropriate delegation node
for each subrange.
|
void |
RQManager.rqDisseminate(RQMessage msg,
NavigableMap<DdllKey,Link> allLinks) |
protected List<SubRange> |
RQManager.rqSplit(Object query,
SubRange range0,
NavigableMap<DdllKey,Link> allLinks,
Collection<Endpoint> failedLinks,
List<DKRangeRValue<?>> rvals,
RQAlgorithm rqAlgo)
Split a range into subranges, by the keys in allLinks.
|
protected RQReturn |
RQManager.rqStartRawRange(Collection<? extends Range<?>> ranges,
Object query,
TransOptions opts,
int retransPeriod,
NavigableMap<DdllKey,Link> allLinks,
RQAlgorithm rqAlgo)
perform a range query (internal).
|
List<SubRange> |
SubRange.split(NavigableMap<DdllKey,Link> ents) |
| コンストラクタと説明 |
|---|
DKRangeLink(Link link,
DdllKey from,
boolean fromInclusive,
DdllKey to,
boolean toInclusive) |
DKRangeLink(Link link,
Range<DdllKey> range) |
SubRange(Link aux,
DdllKey from,
boolean fromInclusive,
DdllKey to,
boolean toInclusive) |
SubRange(Link aux,
DdllKey from,
boolean fromInclusive,
DdllKey to,
boolean toInclusive,
Integer[] ids) |
SubRange(Link aux,
Range<DdllKey> subRange) |
SubRange(Link aux,
Range<DdllKey> subRange,
Integer[] ids) |
| 修飾子とタイプ | フィールドと説明 |
|---|---|
Link |
SkipGraph.RightNodeMismatch.curRight |
Link |
SkipGraph.ExecQueryReturn.left |
Link |
SkipGraph.ExecQueryReturn.right |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
Link[] |
MSkipGraph.getAll() |
Link |
MSkipGraph.getLeft(Comparable<?> key) |
Link |
MSkipGraph.getLeft(Comparable<?> key,
int level) |
Link[] |
MSkipGraph.getLefts(Comparable<?> key) |
Link[] |
MSkipGraph.getLefts(Comparable<?> key,
int level) |
Link |
MSkipGraph.getLocal(Comparable<?> key) |
Link[] |
SkipGraph.getLocalLinks() |
Link[] |
SkipGraphIf.getLocalLinks() |
Link |
MSkipGraph.getRight(Comparable<?> key) |
Link |
MSkipGraph.getRight(Comparable<?> key,
int level) |
Link[] |
MSkipGraph.getRights(Comparable<?> key) |
Link[] |
MSkipGraph.getRights(Comparable<?> key,
int level) |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
List<Link> |
SGNode.suppplyLeftCandidatesForFix() |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
void |
SkipGraph.fixAndPropagateSingle(Comparable<?> target,
Link failedLink,
Collection<Link> failedLinks,
DdllKey rLimit) |
void |
SkipGraphIf.fixAndPropagateSingle(Comparable<?> primaryKey,
Link failedLink,
Collection<Link> failedLinks,
DdllKey rLimit) |
SkipGraph.ExecQueryReturn |
SkipGraph.invokeExecQuery(Comparable<?> rawkey,
Link curRight,
org.piax.gtrans.ov.sg.SkipGraph.QueryId qid,
boolean doAction,
Object query)
Range Query実行時にRPCで呼び出されるメソッド.
|
SkipGraph.ExecQueryReturn |
SkipGraphIf.invokeExecQuery(Comparable<?> target,
Link curRight,
org.piax.gtrans.ov.sg.SkipGraph.QueryId qid,
boolean doAction,
Object query) |
void |
SGNode.onRightNodeChange(Link prevRight,
Link newRight,
Object payload) |
void |
SGMessagingFramework.SGRequestMessage.send(Link dst)
send this message to the specified destination.
|
| 修飾子とタイプ | メソッドと説明 |
|---|---|
void |
SkipGraph.fixAndPropagateSingle(Comparable<?> target,
Link failedLink,
Collection<Link> failedLinks,
DdllKey rLimit) |
void |
SkipGraphIf.fixAndPropagateSingle(Comparable<?> primaryKey,
Link failedLink,
Collection<Link> failedLinks,
DdllKey rLimit) |
boolean |
SGNode.onNodeFailure(Collection<Link> failedLinks) |
| コンストラクタと説明 |
|---|
BestLink(Link link,
Link rightLink,
boolean isImmedPred) |
RightNodeMismatch(Link curRight) |
SGNodeInfo(Link me,
Link left,
Link right) |
| 修飾子とタイプ | フィールドと説明 |
|---|---|
protected Link |
FTEntry.link |
protected Link[] |
FTEntry.successors |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
Link[] |
Suzaku.getAll() |
Link[] |
ChordSharpVNode.getAllLinks() |
protected Link |
ChordSharp.getClosestPredecessor(DdllKey key,
List<List<Link>> goodNodes,
List<List<Link>> allNodes,
Set<Endpoint> maybeFailed)
ftlist (非故障ノードリスト) から,指定されたkeyのclosest predecessorを求める.
|
Link |
Suzaku.getLeft(Comparable<?> key) |
Link |
Suzaku.getLeft(Comparable<?> key,
int level) |
Link[] |
Suzaku.getLefts(Comparable<?> key) |
Link[] |
Suzaku.getLefts(Comparable<?> key,
int level) |
Link |
FTEntry.getLink() |
Link |
Suzaku.getLocal(Comparable<?> key) |
Link |
Suzaku.getRight(Comparable<?> key) |
Link |
Suzaku.getRight(Comparable<?> key,
int level) |
Link[] |
Suzaku.getRights(Comparable<?> key) |
Link[] |
Suzaku.getRights(Comparable<?> key,
int level) |
Link[] |
FTEntry.getSuccessors() |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
List<Link> |
FTEntry.allLinks() |
protected List<Link> |
ChordSharp.filterFailedNodes(FTEntry ftlist) |
NavigableMap<DdllKey,List<Link>> |
ChordSharp.fragmentPoints(CircularRange<DdllKey> queryRange,
List<List<Link>> goodNodes,
List<SubRange[]> closeRanges,
Set<Endpoint> maybeFailed)
queryRangeを分割する.
|
List<Link> |
ChordSharpVNode.getSuccessorList() |
List<Link> |
ChordSharpVNode.suppplyLeftCandidatesForFix() |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
void |
ChordSharpVNode.onRightNodeChange(Link prevRight,
Link newRight,
Object payload) |
void |
FTEntry.setSuccessors(Link[] successors) |
| 修飾子とタイプ | メソッドと説明 |
|---|---|
List<SubRange> |
ChordSharpRQAlgorithm.assignDelegate(Object unused,
SubRange queryRange,
NavigableMap<DdllKey,Link> allLinks,
Collection<Endpoint> unusedFailedLinks) |
NavigableMap<DdllKey,List<Link>> |
ChordSharp.fragmentPoints(CircularRange<DdllKey> queryRange,
List<List<Link>> goodNodes,
List<SubRange[]> closeRanges,
Set<Endpoint> maybeFailed)
queryRangeを分割する.
|
protected Link |
ChordSharp.getClosestPredecessor(DdllKey key,
List<List<Link>> goodNodes,
List<List<Link>> allNodes,
Set<Endpoint> maybeFailed)
ftlist (非故障ノードリスト) から,指定されたkeyのclosest predecessorを求める.
|
protected Link |
ChordSharp.getClosestPredecessor(DdllKey key,
List<List<Link>> goodNodes,
List<List<Link>> allNodes,
Set<Endpoint> maybeFailed)
ftlist (非故障ノードリスト) から,指定されたkeyのclosest predecessorを求める.
|
void |
ChordSharp.rqDisseminate(RQMessage msg,
NavigableMap<DdllKey,Link> unused) |
| コンストラクタと説明 |
|---|
FTEntry(Link link) |
Copyright © 2017. All rights reserved.