| Package | Description |
|---|---|
| net.tomp2p.futures | |
| net.tomp2p.p2p | |
| net.tomp2p.storage |
| Modifier and Type | Method and Description |
|---|---|
SortedMap<PeerAddress,DigestInfo> |
FutureRouting.directHitsDigest()
The direct hits map contains those peers that reported to have the key
(Number160) we were looking for including its digest (size of the result
set and its xored hashes).
|
| Modifier and Type | Method and Description |
|---|---|
void |
FutureRouting.neighbors(SortedMap<PeerAddress,DigestInfo> directHits,
NavigableSet<PeerAddress> potentialHits,
SortedSet<PeerAddress> routingPath,
boolean isBootstrap,
boolean isRoutingToOther)
Sets the result of the routing process and finishes the future.
|
| Modifier and Type | Method and Description |
|---|---|
SortedMap<PeerAddress,DigestInfo> |
RoutingMechanism.directHits() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
RoutingMechanism.evaluateSuccess(PeerAddress remotePeer,
DigestInfo digestBean,
Collection<PeerAddress> newNeighbors,
boolean last,
Number160 locationkey) |
| Modifier and Type | Method and Description |
|---|---|
RoutingMechanism |
RoutingMechanism.directHits(SortedMap<PeerAddress,DigestInfo> directHits) |
| Modifier and Type | Method and Description |
|---|---|
DigestInfo |
DigestStorage.digest(Collection<Number640> number640s) |
DigestInfo |
DigestTracker.digest(Number160 locationKey,
Number160 domainKey,
Number160 contentKey) |
DigestInfo |
Digest.digest(Number320 key,
SimpleBloomFilter<Number160> keyBloomFilter,
SimpleBloomFilter<Number160> contentBloomFilter)
Calculates a digest over a specific location and domain.
|
DigestInfo |
DigestStorage.digest(Number320 locationAndDomainKey,
SimpleBloomFilter<Number160> keyBloomFilter,
SimpleBloomFilter<Number160> contentBloomFilter,
int limit,
boolean ascending,
boolean isBloomFilterAnd) |
DigestInfo |
Digest.digest(Number640 from,
Number640 to)
Calculates a digest over a specific location and domain.
|
DigestInfo |
DigestStorage.digest(Number640 from,
Number640 to,
int limit,
boolean ascending) |
Copyright © 2014. All rights reserved.