public class FutureRemove extends FutureDHT<FutureRemove>
BaseFuture.FutureTypecompleted, lock, reason, type| Constructor and Description |
|---|
FutureRemove(DHTBuilder<?> builder) |
FutureRemove(DHTBuilder<?> builder,
int dataSize)
Default constructor.
|
FutureRemove(DHTBuilder<?> builder,
int min,
EvaluatingSchemeDHT evaluationScheme,
int dataSize)
Creates a new DHT future object that keeps track of the status of the DHT operations.
|
| Modifier and Type | Method and Description |
|---|---|
double |
getAvgStoredKeys() |
Map<Number640,Data> |
getDataMap()
Return the data from get() after evaluation.
|
Collection<Number640> |
getEvalKeys()
Returns the keys that have been stored or removed after evaluation.
|
Map<PeerAddress,Map<Number640,Data>> |
getRawData()
Returns the raw data from the get operation.
|
Map<PeerAddress,Map<Number640,Byte>> |
getRawKeys()
Returns the raw keys from the storage or removal operation.
|
Map<Number640,Integer> |
getResult()
Returns the keys that have been stored or removed after evaluation.
|
boolean |
isMinReached()
Checks if the minimum of expected results have been reached.
|
boolean |
isSuccess()
Returns the opposite of isFailed (returns !isFailed).
|
void |
setReceivedData(Map<PeerAddress,Map<Number640,Data>> rawData)
Finish the future and set the keys and data that have been received.
|
void |
setStoredKeys(Map<PeerAddress,Map<Number640,Byte>> rawKeys640)
Finish the future and set the keys that have been stored.
|
addFutureDHTReleaseListener, addRequests, builder, getFutureRequests, getFutureRouting, setFutureRoutingaddCancel, addListener, addListener, await, await, awaitListeners, awaitListenersUninterruptibly, awaitUninterruptibly, awaitUninterruptibly, cancel, getFailedReason, getType, isCompleted, isFailed, notifyListeners, removeCancel, removeListener, self, setCompletedAndNotify, setFailed, setFailed, setFailed, setFailed, setFailedpublic FutureRemove(DHTBuilder<?> builder)
public FutureRemove(DHTBuilder<?> builder, int dataSize)
public FutureRemove(DHTBuilder<?> builder, int min, EvaluatingSchemeDHT evaluationScheme, int dataSize)
min - The minimum of expected resultsevaluationScheme - The scheme to evaluate results from multiple peerspublic void setStoredKeys(Map<PeerAddress,Map<Number640,Byte>> rawKeys640)
getAvgStoredKeys()
or if the evaluation should be done by the user, use getRawKeys().domainKey - The domain keylocationKey - The location keyrawKeys - The keys that have been stored with information on which peer it has been storedrawKeys480 - The keys with locationKey and domainKey Flag if the user requested putIfAbsentpublic double getAvgStoredKeys()
public void setReceivedData(Map<PeerAddress,Map<Number640,Data>> rawData)
rawData - The keys and data that have been received with information from which peer it has been received.public Map<PeerAddress,Map<Number640,Byte>> getRawKeys()
public boolean isMinReached()
public Collection<Number640> getEvalKeys()
getEvalKeys() instead of this method.public Map<PeerAddress,Map<Number640,Data>> getRawData()
public Map<Number640,Data> getDataMap()
public Map<Number640,Integer> getResult()
FuturePut#getEvalKeys() instead of this method.public boolean isSuccess()
BaseFutureisSuccess in interface BaseFutureisSuccess in class BaseFutureImpl<FutureRemove>Copyright © 2014. All rights reserved.