me.prettyprint.cassandra.model.thrift
Class ThriftSliceCounterQuery<K,N>
java.lang.Object
me.prettyprint.cassandra.model.AbstractBasicQuery<K,N,T>
me.prettyprint.cassandra.model.AbstractQuery<K,N,V,T>
me.prettyprint.cassandra.model.AbstractSliceQuery<K,N,Long,CounterSlice<N>>
me.prettyprint.cassandra.model.thrift.ThriftSliceCounterQuery<K,N>
- Type Parameters:
N
-
- All Implemented Interfaces:
- Query<CounterSlice<N>>, SliceCounterQuery<K,N>
public final class ThriftSliceCounterQuery<K,N>
- extends AbstractSliceQuery<K,N,Long,CounterSlice<N>>
- implements SliceCounterQuery<K,N>
A query for the thrift call get_slice
- Author:
- patricioe (Patricio Echague)
ThriftSliceCounterQuery
public ThriftSliceCounterQuery(Keyspace k,
Serializer<K> keySerializer,
Serializer<N> nameSerializer)
setKey
public SliceCounterQuery<K,N> setKey(K key)
- Specified by:
setKey
in interface SliceCounterQuery<K,N>
execute
public QueryResult<CounterSlice<N>> execute()
- Specified by:
execute
in interface Query<CounterSlice<N>>
toString
public String toString()
- Overrides:
toString
in class Object
setColumnNames
public SliceCounterQuery<K,N> setColumnNames(N... columnNames)
- Description copied from class:
AbstractSliceQuery
- Sets the column names to be retrieved by this query
- Specified by:
setColumnNames
in interface SliceCounterQuery<K,N>
- Overrides:
setColumnNames
in class AbstractSliceQuery<K,N,Long,CounterSlice<N>>
setRange
public SliceCounterQuery<K,N> setRange(N start,
N finish,
boolean reversed,
int count)
- Description copied from class:
AbstractSliceQuery
- Set a predicate of start/finish to retrieve a list of columns in this range.
- Specified by:
setRange
in interface SliceCounterQuery<K,N>
- Overrides:
setRange
in class AbstractSliceQuery<K,N,Long,CounterSlice<N>>
- Parameters:
start
- Start keyfinish
- End key
setColumnFamily
public SliceCounterQuery<K,N> setColumnFamily(String cf)
- Specified by:
setColumnFamily
in interface SliceCounterQuery<K,N>
- Overrides:
setColumnFamily
in class AbstractBasicQuery<K,N,CounterSlice<N>>
Copyright © 2011. All Rights Reserved.