Inheritance diagram for hazelcast::client::EntryArray< K, V >:
Public Member Functions | |
| virtual void | sort (query::IterationType iterationType, const util::Comparator< std::pair< const K *, const V *> > *comparator=0)=0 |
| Sorts the entries using the comparator if comparator is not null. More... | |
| Public Member Functions inherited from hazelcast::client::LazyEntryArray< K, V > | |
| virtual size_t | size () const =0 |
| virtual const K * | getKey (size_t index)=0 |
| Please note that this operation is costly due to de-serialization. More... | |
| virtual std::auto_ptr< K > | releaseKey (size_t index)=0 |
| Please note that this operation MAY(if not deserialized previously) be costly due to de-serialization. More... | |
| virtual const V * | getValue (size_t index)=0 |
| Please note that this operation is costly due to de-serialization. More... | |
| virtual std::auto_ptr< V > | releaseValue (size_t index)=0 |
| Please note that this operation is costly due to de-serialization. More... | |
| virtual std::pair< const K *, const V * > | operator[] (size_t index)=0 |
Member Function Documentation
◆ sort()
template<typename K , typename V >
|
pure virtual |
Sorts the entries using the comparator if comparator is not null.
Otherwise, sorts based on the provided iterationType value.
- Parameters
-
iterationType if null comparator is provided then iteration type is query::VALUE, the entry value should not be null and the entries shall be sorted by value, otherwise the entries shall be sorted by key.
The documentation for this class was generated from the following file:
- hazelcast/include/hazelcast/client/EntryArray.h
