public class RiakResponse extends Object implements Iterable<IRiakObject>
| Constructor and Description |
|---|
RiakResponse(byte[] vclock)
Create a response from the given vector clock.
|
RiakResponse(byte[] vclock,
IRiakObject[] riakObjects)
Create a response from the given vector clock and array.
|
| Modifier and Type | Method and Description |
|---|---|
static RiakResponse |
empty()
Generate the empty response
|
static RiakResponse |
empty(boolean unmodified)
Generate an empty response, with a value for the conditional get 'isUnmodified' response.
|
IRiakObject[] |
getRiakObjects()
Gets the actual array of
IRiakObject (not a clone or copy, so treat it well) |
VClock |
getVclock()
Get the vector clock as a
VClock |
byte[] |
getVclockBytes()
Get the vector clock bytes
|
boolean |
hasSiblings()
Does the response have sibling values?
|
boolean |
hasValue()
Does the response hav *any* values?
|
boolean |
isDeleted() |
boolean |
isUnmodified() |
Iterator<IRiakObject> |
iterator()
Unmodifiable iterator view of the values returned from Riak.
|
static RiakResponse |
matchFound() |
int |
numberOfValues()
How many values?
|
static RiakResponse |
unmodified() |
public RiakResponse(byte[] vclock,
IRiakObject[] riakObjects)
vclock - riakObjects - public RiakResponse(byte[] vclock)
vclock - public byte[] getVclockBytes()
public IRiakObject[] getRiakObjects()
IRiakObject (not a clone or copy, so treat it well)public boolean hasSiblings()
public boolean hasValue()
public int numberOfValues()
public boolean isUnmodified()
FetchObject.ifModified(VClock),
FetchObject.modifiedSince(java.util.Date),
FetchMeta.getIfModifiedSince(),
FetchMeta.getIfModifiedVClock()public boolean isDeleted()
FetchObject.returnDeletedVClock(boolean),
FetchMeta.getReturnDeletedVClock()public Iterator<IRiakObject> iterator()
iterator in interface Iterable<IRiakObject>public static RiakResponse empty()
public static RiakResponse empty(boolean unmodified)
public static RiakResponse unmodified()
unmodified - public static RiakResponse matchFound()
Copyright © 2012. All Rights Reserved.