Package io.usethesource.capsule.core.trie

Interface SetNode<K,R extends SetNode<K,R>>

All Superinterfaces:

Node

All Known Implementing Classes:

PersistentTrieSet.AbstractSetNode, PersistentTrieSet.BitmapIndexedSetNode, PersistentTrieSet.CompactMixedSetNode, PersistentTrieSet.CompactSetNode, PersistentTrieSet.HashCollisionSetNode

public interface SetNode<K,R extends SetNode<K,R>>
extends Node

Field Summary

Fields inherited from interface io.usethesource.capsule.core.trie.Node

SIZE_EMPTY, SIZE_MORE_THAN_ONE, SIZE_ONE

Method Summary

Modifier and Type	Method	Description
boolean	contains(K key, int keyHash, int shift, EqualityComparator<java.lang.Object> cmp)
boolean	equivalent(java.lang.Object other, EqualityComparator<java.lang.Object> cmp)
java.util.Optional<K>	findByKey(K key, int keyHash, int shift, EqualityComparator<java.lang.Object> cmp)
default java.util.Optional<K>	findFirst()
K	getKey(int index)
int	getKeyHash(int index)
default ImmutablePayloadTuple<K>	getPayload(int index)
boolean	hasPayload()
default R	intersect(java.util.concurrent.atomic.AtomicReference<java.lang.Thread> mutator, R that, int shift, EqualityComparator<java.lang.Object> cmp)
int	payloadArity()
int	recursivePayloadHashCode()
R	removed(java.util.concurrent.atomic.AtomicReference<java.lang.Thread> mutator, K key, int keyHash, int shift, SetNodeResult<K> details, EqualityComparator<java.lang.Object> cmp)
int	size()
default R	subtract(java.util.concurrent.atomic.AtomicReference<java.lang.Thread> mutator, R that, int shift, EqualityComparator<java.lang.Object> cmp)
default R	union(java.util.concurrent.atomic.AtomicReference<java.lang.Thread> mutator, R that, int shift, EqualityComparator<java.lang.Object> cmp)
R	updated(java.util.concurrent.atomic.AtomicReference<java.lang.Thread> mutator, K key, int keyHash, int shift, SetNodeResult<K> details, EqualityComparator<java.lang.Object> cmp)

Methods inherited from interface io.usethesource.capsule.core.trie.Node

dataArray, nodeArray, sizePredicate

Method Detail

contains

boolean contains(K key,
                 int keyHash,
                 int shift,
                 EqualityComparator<java.lang.Object> cmp)

findByKey

java.util.Optional<K> findByKey(K key,
                                int keyHash,
                                int shift,
                                EqualityComparator<java.lang.Object> cmp)

updated

R updated(java.util.concurrent.atomic.AtomicReference<java.lang.Thread> mutator,
          K key,
          int keyHash,
          int shift,
          SetNodeResult<K> details,
          EqualityComparator<java.lang.Object> cmp)

removed

R removed(java.util.concurrent.atomic.AtomicReference<java.lang.Thread> mutator,
          K key,
          int keyHash,
          int shift,
          SetNodeResult<K> details,
          EqualityComparator<java.lang.Object> cmp)

equivalent

boolean equivalent(java.lang.Object other,
                   EqualityComparator<java.lang.Object> cmp)

hasPayload

boolean hasPayload()

payloadArity

int payloadArity()

getKey

K getKey(int index)

getKeyHash

int getKeyHash(int index)

getPayload

default ImmutablePayloadTuple<K> getPayload(int index)

findFirst

default java.util.Optional<K> findFirst()

size

int size()

recursivePayloadHashCode

int recursivePayloadHashCode()

union

default R union(java.util.concurrent.atomic.AtomicReference<java.lang.Thread> mutator,
                R that,
                int shift,
                EqualityComparator<java.lang.Object> cmp)

intersect

default R intersect(java.util.concurrent.atomic.AtomicReference<java.lang.Thread> mutator,
                    R that,
                    int shift,
                    EqualityComparator<java.lang.Object> cmp)

subtract

default R subtract(java.util.concurrent.atomic.AtomicReference<java.lang.Thread> mutator,
                   R that,
                   int shift,
                   EqualityComparator<java.lang.Object> cmp)