Uses of Class
org.infinispan.multimap.impl.ScoredValue

Packages that use ScoredValue

Package	Description
org.infinispan.multimap.impl

Uses of ScoredValue in org.infinispan.multimap.impl

Methods in org.infinispan.multimap.impl that return ScoredValue

Modifier and Type	Method	Description
static <V> ScoredValue<V>	ScoredValue.of(double score)
static <V> ScoredValue<V>	ScoredValue.of(double score, V value)
ScoredValue	ScoredValue$___Marshaller_c3c7c2e6be2a4c5279f85b0aa0a0011f567d0b7f3446a69ef1f6ab02c230feac.read(org.infinispan.protostream.ProtobufTagMarshaller.ReadContext $1)

Methods in org.infinispan.multimap.impl that return types with arguments of type ScoredValue

Modifier and Type	Method	Description
CompletionStage<Collection<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.get(K key)	Get the value as a collection
List<ScoredValue<E>>	BaseSetBucket.getAsList()
List<ScoredValue<V>>	SetBucket.getAsList()
List<ScoredValue<V>>	SortedSetBucket.getAsList()
Set<ScoredValue<E>>	BaseSetBucket.getAsSet()
Set<ScoredValue<V>>	SetBucket.getAsSet()
Set<ScoredValue<V>>	SortedSetBucket.getAsSet()
CompletionStage<CacheEntry<K,Collection<ScoredValue<V>>>>	EmbeddedMultimapSortedSetCache.getEntry(K key)
Class<ScoredValue>	ScoredValue$___Marshaller_c3c7c2e6be2a4c5279f85b0aa0a0011f567d0b7f3446a69ef1f6ab02c230feac.getJavaClass()
SortedSet<ScoredValue<V>>	SortedSetBucket.getScoredEntries()	Returns a copy of the entries;
List<ScoredValue<V>>	SortedSetBucket.getScoredEntriesAsList()	Returns a copy of the entries;
CompletionStage<SortedSet<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.getValue(K key)	Returns the sorted set value if such exists.
CompletionStage<List<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.getValueAsList(K key)	Returns the sorted set value if such exists.
default Collection<ScoredValue<E>>	BaseSetBucket.inter(Collection<ScoredValue<E>> input, double weight, SortedSetBucket.AggregateFunction function)	Calculates the intersection of two sets.
CompletionStage<Collection<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.inter(K key, Collection<ScoredValue<V>> scoredValues, double weight, SortedSetBucket.AggregateFunction aggFunction)	Computes the intersection of the collection and the given sorted sets key, if such exist.
CompletionStage<Collection<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.pop(K key, boolean min, long count)	Pops the number of elements provided by the count parameter.
SortedSetBucket.SortedSetResult<Collection<ScoredValue<V>>,V>	SortedSetBucket.pop(boolean min, long count)
CompletionStage<List<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.randomMembers(K key, int count)	If the count argument is positive, return an array of distinct elements.
List<ScoredValue<V>>	SortedSetBucket.randomMembers(int count)
List<ScoredValue<V>>	ListBucket.sort(SortableBucket.SortOptions sortOptions)
List<ScoredValue<V>>	SetBucket.sort(SortableBucket.SortOptions sortOptions)
default List<ScoredValue<V>>	SortableBucket.sort(Stream<ScoredValue<V>> scoredValueStream, SortableBucket.SortOptions options)
List<ScoredValue<V>>	SortableBucket.sort(SortableBucket.SortOptions options)
List<ScoredValue<V>>	SortedSetBucket.sort(SortableBucket.SortOptions sortOptions)
List<ScoredValue<V>>	SortedSetBucket.subset(Double startScore, boolean includeStart, Double stopScore, boolean includeStop, boolean isRev, Long offset, Long count)
List<ScoredValue<V>>	SortedSetBucket.subset(V startValue, boolean includeStart, V stopValue, boolean includeStop, boolean isRev, Long offset, Long count)
CompletionStage<Collection<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.subsetByIndex(K key, SortedSetSubsetArgs<Long> args)	Subset elements in the sorted set by index.
List<ScoredValue<V>>	SortedSetBucket.subsetByIndex(long from, long to, boolean rev)
CompletionStage<Collection<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.subsetByLex(K key, SortedSetSubsetArgs<V> args)	Subset elements using the natural ordering of the values.
CompletionStage<Collection<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.subsetByScore(K key, SortedSetSubsetArgs<Double> args)	Subset elements using the score.
Collection<ScoredValue<V>>	SortedSetBucket.toTreeSet()
default Collection<ScoredValue<E>>	BaseSetBucket.union(Collection<ScoredValue<E>> input, double weight, SortedSetBucket.AggregateFunction function)	Calculates the union of two sets.
CompletionStage<Collection<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.union(K key, Collection<ScoredValue<V>> scoredValues, double weight, SortedSetBucket.AggregateFunction aggFunction)	Computes the union of the collection and the given sorted sets key, if such exist.

Methods in org.infinispan.multimap.impl with parameters of type ScoredValue

Modifier and Type	Method	Description
int	ScoredValue.compareTo(ScoredValue<V> other)
void	ScoredValue$___Marshaller_c3c7c2e6be2a4c5279f85b0aa0a0011f567d0b7f3446a69ef1f6ab02c230feac.write(org.infinispan.protostream.ProtobufTagMarshaller.WriteContext $1, ScoredValue $2)

Method parameters in org.infinispan.multimap.impl with type arguments of type ScoredValue

Modifier and Type	Method	Description
CompletionStage<Long>	EmbeddedMultimapSortedSetCache.addMany(K key, Collection<ScoredValue<V>> scoredValues, SortedSetAddArgs args)	Adds and/or updates, depending on the provided options, the value and the associated score.
SortedSetBucket.SortedSetResult<SortedSetBucket.AddOrUpdatesCounters,V>	SortedSetBucket.addMany(Collection<ScoredValue<V>> scoredValues, boolean addOnly, boolean updateOnly, boolean updateLessScoresOnly, boolean updateGreaterScoresOnly)
default Collection<ScoredValue<E>>	BaseSetBucket.inter(Collection<ScoredValue<E>> input, double weight, SortedSetBucket.AggregateFunction function)	Calculates the intersection of two sets.
CompletionStage<Collection<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.inter(K key, Collection<ScoredValue<V>> scoredValues, double weight, SortedSetBucket.AggregateFunction aggFunction)	Computes the intersection of the collection and the given sorted sets key, if such exist.
SortedSetBucket<V>	SortedSetBucket.replace(Collection<ScoredValue<V>> scoredValues)
default List<ScoredValue<V>>	SortableBucket.sort(Stream<ScoredValue<V>> scoredValueStream, SortableBucket.SortOptions options)
default Collection<ScoredValue<E>>	BaseSetBucket.union(Collection<ScoredValue<E>> input, double weight, SortedSetBucket.AggregateFunction function)	Calculates the union of two sets.
CompletionStage<Collection<ScoredValue<V>>>	EmbeddedMultimapSortedSetCache.union(K key, Collection<ScoredValue<V>> scoredValues, double weight, SortedSetBucket.AggregateFunction aggFunction)	Computes the union of the collection and the given sorted sets key, if such exist.