com.github.pmerienne.trident.state

Interface SortedSetMultiMapState<K,V>

Type Parameters:

K - the type of keys

V - the type of values

All Superinterfaces:

ExtendedState<V>, storm.trident.state.State

All Known Implementing Classes:

MemorySortedSetMultiMapState, RedisSortedSetMultiMapState

public interface SortedSetMultiMapState<K,V>
extends ExtendedState<V>

A State which wrap access to a Multimap that cannot hold duplicate key-value pairs. Adding a key-value pair that's already in the multimap has no effect. This class is very similar to the SetMultiMapState. The difference is that every member is associated with score, that is used in order to take the sorted set ordered, from the smallest to the greatest score. While members are unique, scores may be repeated.

Author:

pmerienne

Nested Class Summary

Nested Classes

Modifier and Type	Interface and Description
static class	SortedSetMultiMapState.ScoredValue<V>

Method Summary

Methods

Modifier and Type	Method and Description
double	getScore(K key, V value) Returns the score of value in the sorted set at key.
List<SortedSetMultiMapState.ScoredValue<V>>	getSorted(K key, int count) Returns the specified range of elements in the sorted set stored at key.
boolean	put(K key, SortedSetMultiMapState.ScoredValue<V> value) Adds the specified value with the specified score to the sorted set stored at key.
long	sizeOf(K key) Returns the numbers of values which are mapped to a given key

Methods inherited from interface storm.trident.state.State

beginCommit, commit

Method Detail

sizeOf

long sizeOf(K key)

Returns the numbers of values which are mapped to a given key

Parameters:

key -

Returns:

put

boolean put(K key,
          SortedSetMultiMapState.ScoredValue<V> value)

Adds the specified value with the specified score to the sorted set stored at key. Stores a key-value pair in the multimap. If the specified value already exists in the sorted set, the score is updated and the element reinserted at the right position to ensure the correct ordering. If key does not exist, a new sorted set with the specified value as sole members is created, like if the sorted set was empty.

Parameters:

key - key to store

value - scored value to store

Returns:

true if this set changed as a result of the call

getSorted

List<SortedSetMultiMapState.ScoredValue<V>> getSorted(K key,
                                                    int count)

Returns the specified range of elements in the sorted set stored at key. The elements are considered to be ordered from the highest to the lowest score.

Parameters:

key - the key whose associated set is used

count - the maximum number of scored values returned

Returns:

getScore

double getScore(K key,
              V value)

Returns the score of value in the sorted set at key. If value does not exist in the sorted set, or key does not exist, 0.0 is returned.

Parameters:

key - the key whose associated set is used

value - the value whose score is searched

Returns: