public final class HashOrderMixing
extends java.lang.Object
HashOrderMixingStrategy
.HashOrderMixingStrategy
Modifier and Type | Class and Description |
---|---|
static class |
HashOrderMixing.Strategy |
Modifier and Type | Field and Description |
---|---|
static java.lang.String |
PROPERTY_BIT_MIXER |
Modifier and Type | Method and Description |
---|---|
static HashOrderMixingStrategy |
constant(long seed)
A constant
HashOrderMixingStrategy . |
static HashOrderMixingStrategy |
defaultStrategy()
Returns the currently configured default
HashOrderMixingStrategy . |
static HashOrderMixingStrategy |
deterministic()
Deprecated.
Permanently deprecated as a warning signal.
|
static HashOrderMixingStrategy |
none()
Deprecated.
Permanently deprecated as a warning signal.
|
static HashOrderMixingStrategy |
randomized()
Returns a randomized
HashOrderMixingStrategy that issues unique
per-container seed. |
public static final java.lang.String PROPERTY_BIT_MIXER
public static HashOrderMixingStrategy randomized()
HashOrderMixingStrategy
that issues unique
per-container seed. This minimizes the chances of hash distribution conflicts.public static HashOrderMixingStrategy constant(long seed)
HashOrderMixingStrategy
. This is useful if one needs to have
deterministic key distribution but wishes to control it manually.
Do not use the same constant for more than one container.
Consider using scatter maps or sets instead
of constant hash order mixer.@Deprecated public static HashOrderMixingStrategy deterministic()
HashOrderMixingStrategy
will reorder keys depending
on the size of the container's buffer.
This is inherently unsafe with hash containers using linear conflict
addressing. The only use case when this can be useful is to count/ collect
unique keys (for which scatter tables should be used).@Deprecated public static HashOrderMixingStrategy none()
public static HashOrderMixingStrategy defaultStrategy()
HashOrderMixingStrategy
.Copyright © 2015 Carrot Search s.c.. All Rights Reserved.