Package io.usethesource.capsule.core
Class PersistentTrieSet.CompactSetNode<K>
java.lang.Object
io.usethesource.capsule.core.PersistentTrieSet.AbstractSetNode<K>
io.usethesource.capsule.core.PersistentTrieSet.CompactSetNode<K>
- All Implemented Interfaces:
Node
,SetNode<K,
,PersistentTrieSet.AbstractSetNode<K>> Serializable
,Iterable<K>
- Direct Known Subclasses:
PersistentTrieSet.CompactMixedSetNode
,PersistentTrieSet.HashCollisionSetNode
- Enclosing class:
PersistentTrieSet<K>
protected abstract static class PersistentTrieSet.CompactSetNode<K>
extends PersistentTrieSet.AbstractSetNode<K>
- See Also:
-
Field Summary
FieldsModifier and TypeFieldDescription(package private) static final int
(package private) static final int
(package private) static final int
Fields inherited from class io.usethesource.capsule.core.PersistentTrieSet.AbstractSetNode
TUPLE_LENGTH
Fields inherited from interface io.usethesource.capsule.core.trie.Node
SIZE_EMPTY, SIZE_MORE_THAN_ONE, SIZE_ONE
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescription(package private) static final int
bitpos
(int mask) boolean
contains
(K key, int keyHash, int shift, EqualityComparator<Object> cmp) (package private) abstract PersistentTrieSet.CompactSetNode
<K> copyAndInsertValue
(AtomicReference<Thread> mutator, int bitpos, K key) (package private) abstract PersistentTrieSet.CompactSetNode
<K> copyAndMigrateFromInlineToNode
(AtomicReference<Thread> mutator, int bitpos, PersistentTrieSet.AbstractSetNode<K> node) (package private) abstract PersistentTrieSet.CompactSetNode
<K> copyAndMigrateFromNodeToInline
(AtomicReference<Thread> mutator, int bitpos, PersistentTrieSet.AbstractSetNode<K> node) (package private) abstract PersistentTrieSet.CompactSetNode
<K> copyAndRemoveValue
(AtomicReference<Thread> mutator, int bitpos) (package private) abstract PersistentTrieSet.CompactSetNode
<K> copyAndSetNode
(AtomicReference<Thread> mutator, int bitpos, PersistentTrieSet.AbstractSetNode<K> node) (package private) int
dataIndex
(int bitpos) (package private) abstract int
dataMap()
findByKey
(K key, int keyHash, int shift, EqualityComparator<Object> cmp) (package private) abstract PersistentTrieSet.CompactSetNode
<K> getNode
(int index) (package private) static final int
index
(int bitmap, int bitpos) (package private) static final int
index
(int bitmap, int mask, int bitpos) (package private) static final int
mask
(int keyHash, int shift) (package private) static final <K> PersistentTrieSet.CompactSetNode
<K> mergeTwoKeyValPairs
(K key0, int keyHash0, K key1, int keyHash1, int shift) (package private) PersistentTrieSet.CompactSetNode
<K> nodeAt
(int bitpos) (package private) int
nodeIndex
(int bitpos) (package private) boolean
(package private) abstract int
nodeMap()
(package private) static final <K> PersistentTrieSet.CompactSetNode
<K> nodeOf
(AtomicReference<Thread> mutator) (package private) static final <K> PersistentTrieSet.CompactSetNode
<K> nodeOf
(AtomicReference<Thread> mutator, int nodeMap, int dataMap, Object[] nodes) (package private) static final <K> PersistentTrieSet.CompactSetNode
<K> nodeOf
(AtomicReference<Thread> mutator, int nodeMap, PersistentTrieSet.AbstractSetNode<K> node) (package private) static final <K> PersistentTrieSet.CompactSetNode
<K> nodeOf
(AtomicReference<Thread> mutator, int dataMap, K key, int keyHash) (package private) static final <K> PersistentTrieSet.CompactSetNode
<K> nodeOf
(AtomicReference<Thread> mutator, int dataMap, K key0, int keyHash0, K key1, int keyHash1) (package private) static byte
recoverMask
(int map, byte i_th) removed
(AtomicReference<Thread> mutator, K key, int keyHash, int shift, SetNodeResult<K> details, EqualityComparator<Object> cmp) toString()
updated
(AtomicReference<Thread> mutator, K key, int keyHash, int shift, SetNodeResult<K> details, EqualityComparator<Object> cmp) Methods inherited from class io.usethesource.capsule.core.PersistentTrieSet.AbstractSetNode
arity, dataArray, getSlot, hasNodes, hasSlots, isAllowedToEdit, iterator, localPayloadHashCode, nodeArity, nodeArray, nodeIterator, recursivePayloadHashCode, size, slotArity, spliterator, stream
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait
Methods inherited from interface io.usethesource.capsule.core.trie.Node
sizePredicate
Methods inherited from interface io.usethesource.capsule.core.trie.SetNode
equivalent, findFirst, getKey, getKeyHash, getPayload, hasPayload, intersect, payloadArity, subtract, union
-
Field Details
-
HASH_CODE_LENGTH
static final int HASH_CODE_LENGTH- See Also:
-
BIT_PARTITION_SIZE
static final int BIT_PARTITION_SIZE- See Also:
-
BIT_PARTITION_MASK
static final int BIT_PARTITION_MASK- See Also:
-
-
Constructor Details
-
CompactSetNode
protected CompactSetNode()
-
-
Method Details
-
mask
static final int mask(int keyHash, int shift) -
bitpos
static final int bitpos(int mask) -
nodeMap
abstract int nodeMap() -
dataMap
abstract int dataMap() -
getNode
- Specified by:
getNode
in classPersistentTrieSet.AbstractSetNode<K>
-
nodeInvariant
boolean nodeInvariant() -
copyAndInsertValue
abstract PersistentTrieSet.CompactSetNode<K> copyAndInsertValue(AtomicReference<Thread> mutator, int bitpos, K key) -
copyAndRemoveValue
abstract PersistentTrieSet.CompactSetNode<K> copyAndRemoveValue(AtomicReference<Thread> mutator, int bitpos) -
copyAndSetNode
abstract PersistentTrieSet.CompactSetNode<K> copyAndSetNode(AtomicReference<Thread> mutator, int bitpos, PersistentTrieSet.AbstractSetNode<K> node) -
copyAndMigrateFromInlineToNode
abstract PersistentTrieSet.CompactSetNode<K> copyAndMigrateFromInlineToNode(AtomicReference<Thread> mutator, int bitpos, PersistentTrieSet.AbstractSetNode<K> node) -
copyAndMigrateFromNodeToInline
abstract PersistentTrieSet.CompactSetNode<K> copyAndMigrateFromNodeToInline(AtomicReference<Thread> mutator, int bitpos, PersistentTrieSet.AbstractSetNode<K> node) -
mergeTwoKeyValPairs
static final <K> PersistentTrieSet.CompactSetNode<K> mergeTwoKeyValPairs(K key0, int keyHash0, K key1, int keyHash1, int shift) -
nodeOf
static final <K> PersistentTrieSet.CompactSetNode<K> nodeOf(AtomicReference<Thread> mutator, int nodeMap, int dataMap, Object[] nodes) -
nodeOf
-
nodeOf
static final <K> PersistentTrieSet.CompactSetNode<K> nodeOf(AtomicReference<Thread> mutator, int dataMap, K key, int keyHash) -
nodeOf
static final <K> PersistentTrieSet.CompactSetNode<K> nodeOf(AtomicReference<Thread> mutator, int dataMap, K key0, int keyHash0, K key1, int keyHash1) -
nodeOf
static final <K> PersistentTrieSet.CompactSetNode<K> nodeOf(AtomicReference<Thread> mutator, int nodeMap, PersistentTrieSet.AbstractSetNode<K> node) -
index
static final int index(int bitmap, int bitpos) -
index
static final int index(int bitmap, int mask, int bitpos) -
dataIndex
int dataIndex(int bitpos) -
nodeIndex
int nodeIndex(int bitpos) -
nodeAt
-
contains
-
findByKey
-
updated
public PersistentTrieSet.AbstractSetNode<K> updated(AtomicReference<Thread> mutator, K key, int keyHash, int shift, SetNodeResult<K> details, EqualityComparator<Object> cmp) -
removed
public PersistentTrieSet.AbstractSetNode<K> removed(AtomicReference<Thread> mutator, K key, int keyHash, int shift, SetNodeResult<K> details, EqualityComparator<Object> cmp) -
recoverMask
static byte recoverMask(int map, byte i_th) - Returns:
- 0 invalid input: '<'= mask invalid input: '<'= 2^BIT_PARTITION_SIZE - 1
-
toString
-