Package io.usethesource.capsule.core

Class PersistentTrieSet.HashCollisionSetNode<K>

java.lang.Object

io.usethesource.capsule.core.PersistentTrieSet.AbstractSetNode<K>

io.usethesource.capsule.core.PersistentTrieSet.CompactSetNode<K>

io.usethesource.capsule.core.PersistentTrieSet.HashCollisionSetNode<K>

All Implemented Interfaces:

Node, SetNode<K,PersistentTrieSet.AbstractSetNode<K>>, Serializable, Iterable<K>

Enclosing class:

PersistentTrieSet<K>

private static final class PersistentTrieSet.HashCollisionSetNode<K>
extends PersistentTrieSet.CompactSetNode<K>

Field Summary

Fields

Modifier and Type	Field	Description
private final int	hash
private final K[]	keys

Fields inherited from class io.usethesource.capsule.core.PersistentTrieSet.CompactSetNode

BIT_PARTITION_MASK, BIT_PARTITION_SIZE, HASH_CODE_LENGTH

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

Constructor	Description
HashCollisionSetNode(int hash, K[] keys)

Method Summary

Modifier and Type	Method	Description
(package private) int	arity()	The arity of this trie node (i.e.
boolean	contains(K key, int keyHash, int shift, EqualityComparator<Object> cmp)
(package private) PersistentTrieSet.CompactSetNode<K>	copyAndInsertValue(AtomicReference<Thread> mutator, int bitpos, K key)
(package private) PersistentTrieSet.CompactSetNode<K>	copyAndMigrateFromInlineToNode(AtomicReference<Thread> mutator, int bitpos, PersistentTrieSet.AbstractSetNode<K> node)
(package private) PersistentTrieSet.CompactSetNode<K>	copyAndMigrateFromNodeToInline(AtomicReference<Thread> mutator, int bitpos, PersistentTrieSet.AbstractSetNode<K> node)
(package private) PersistentTrieSet.CompactSetNode<K>	copyAndRemoveValue(AtomicReference<Thread> mutator, int bitpos)
(package private) PersistentTrieSet.CompactSetNode<K>	copyAndSetNode(AtomicReference<Thread> mutator, int bitpos, PersistentTrieSet.AbstractSetNode<K> node)
(package private) final int	dataMap()
boolean	equals(Object other)
boolean	equivalent(Object other, EqualityComparator<Object> cmp)
Optional<K>	findByKey(K key, int keyHash, int shift, EqualityComparator<Object> cmp)
K	getKey(int index)
int	getKeyHash(int index)
PersistentTrieSet.CompactSetNode<K>	getNode(int index)
(package private) Object	getSlot(int index)
int	hashCode()
(package private) boolean	hasNodes()
boolean	hasPayload()
(package private) boolean	hasSlots()
(package private) int	localPayloadHashCode()
(package private) int	nodeArity()
ArrayView<PersistentTrieSet.AbstractSetNode<K>>	nodeArray()
(package private) final int	nodeMap()
int	payloadArity()
PersistentTrieSet.AbstractSetNode<K>	removed(AtomicReference<Thread> mutator, K key, int keyHash, int shift, SetNodeResult<K> details, EqualityComparator<Object> cmp)
byte	sizePredicate()	Abstract predicate over a node's size.
(package private) int	slotArity()
PersistentTrieSet.AbstractSetNode<K>	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.CompactSetNode

bitpos, dataIndex, index, index, mask, mergeTwoKeyValPairs, nodeAt, nodeIndex, nodeInvariant, nodeOf, nodeOf, nodeOf, nodeOf, nodeOf, recoverMask, toString

Methods inherited from class io.usethesource.capsule.core.PersistentTrieSet.AbstractSetNode

dataArray, isAllowedToEdit, iterator, nodeIterator, recursivePayloadHashCode, size, spliterator, stream

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach

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

findFirst, getPayload, intersect, subtract, union

Field Details

keys

private final K[] keys

hash

private final int hash

Constructor Details

HashCollisionSetNode

HashCollisionSetNode(int hash,
 K[] keys)

Method Details

nodeArray

public ArrayView<PersistentTrieSet.AbstractSetNode<K>> nodeArray()

Specified by:

nodeArray in interface Node

Specified by:

nodeArray in class PersistentTrieSet.AbstractSetNode<K>

contains

public boolean contains(K key,
 int keyHash,
 int shift,
 EqualityComparator<Object> cmp)

Specified by:

contains in interface SetNode<K,PersistentTrieSet.AbstractSetNode<K>>

Overrides:

contains in class PersistentTrieSet.CompactSetNode<K>

findByKey

public Optional<K> findByKey(K key,
 int keyHash,
 int shift,
 EqualityComparator<Object> cmp)

Specified by:

findByKey in interface SetNode<K,PersistentTrieSet.AbstractSetNode<K>>

Overrides:

findByKey in class PersistentTrieSet.CompactSetNode<K>

updated

public PersistentTrieSet.AbstractSetNode<K> updated(AtomicReference<Thread> mutator,
 K key,
 int keyHash,
 int shift,
 SetNodeResult<K> details,
 EqualityComparator<Object> cmp)

Specified by:

updated in interface SetNode<K,PersistentTrieSet.AbstractSetNode<K>>

Overrides:

updated in class PersistentTrieSet.CompactSetNode<K>

removed

public PersistentTrieSet.AbstractSetNode<K> removed(AtomicReference<Thread> mutator,
 K key,
 int keyHash,
 int shift,
 SetNodeResult<K> details,
 EqualityComparator<Object> cmp)

Specified by:

removed in interface SetNode<K,PersistentTrieSet.AbstractSetNode<K>>

Overrides:

removed in class PersistentTrieSet.CompactSetNode<K>

hasPayload

public boolean hasPayload()

payloadArity

public int payloadArity()

hasNodes

boolean hasNodes()

Specified by:

hasNodes in class PersistentTrieSet.AbstractSetNode<K>

nodeArity

int nodeArity()

Specified by:

nodeArity in class PersistentTrieSet.AbstractSetNode<K>

arity

int arity()

Description copied from class: PersistentTrieSet.AbstractSetNode

The arity of this trie node (i.e. number of values and nodes stored on this level).

Overrides:

arity in class PersistentTrieSet.AbstractSetNode<K>

Returns:

sum of nodes and values stored within

sizePredicate

public byte sizePredicate()

Description copied from interface: Node

Abstract predicate over a node's size. Value can be either 0x0, 0x1, or 0x2.

Returns:

size predicate

getKey

public K getKey(int index)

getKeyHash

public int getKeyHash(int index)

getNode

public PersistentTrieSet.CompactSetNode<K> getNode(int index)

Specified by:

getNode in class PersistentTrieSet.CompactSetNode<K>

getSlot

Object getSlot(int index)

Specified by:

getSlot in class PersistentTrieSet.AbstractSetNode<K>

hasSlots

boolean hasSlots()

Specified by:

hasSlots in class PersistentTrieSet.AbstractSetNode<K>

slotArity

int slotArity()

Specified by:

slotArity in class PersistentTrieSet.AbstractSetNode<K>

localPayloadHashCode

int localPayloadHashCode()

Specified by:

localPayloadHashCode in class PersistentTrieSet.AbstractSetNode<K>

hashCode

public int hashCode()

Overrides:

hashCode in class Object

equals

public boolean equals(Object other)

Overrides:

equals in class Object

equivalent

public boolean equivalent(Object other,
 EqualityComparator<Object> cmp)

copyAndInsertValue

PersistentTrieSet.CompactSetNode<K> copyAndInsertValue(AtomicReference<Thread> mutator,
 int bitpos,
 K key)

Specified by:

copyAndInsertValue in class PersistentTrieSet.CompactSetNode<K>

copyAndRemoveValue

PersistentTrieSet.CompactSetNode<K> copyAndRemoveValue(AtomicReference<Thread> mutator,
 int bitpos)

Specified by:

copyAndRemoveValue in class PersistentTrieSet.CompactSetNode<K>

copyAndSetNode

PersistentTrieSet.CompactSetNode<K> copyAndSetNode(AtomicReference<Thread> mutator,
 int bitpos,
 PersistentTrieSet.AbstractSetNode<K> node)

Specified by:

copyAndSetNode in class PersistentTrieSet.CompactSetNode<K>

copyAndMigrateFromInlineToNode

PersistentTrieSet.CompactSetNode<K> copyAndMigrateFromInlineToNode(AtomicReference<Thread> mutator,
 int bitpos,
 PersistentTrieSet.AbstractSetNode<K> node)

Specified by:

copyAndMigrateFromInlineToNode in class PersistentTrieSet.CompactSetNode<K>

copyAndMigrateFromNodeToInline

PersistentTrieSet.CompactSetNode<K> copyAndMigrateFromNodeToInline(AtomicReference<Thread> mutator,
 int bitpos,
 PersistentTrieSet.AbstractSetNode<K> node)

Specified by:

copyAndMigrateFromNodeToInline in class PersistentTrieSet.CompactSetNode<K>

nodeMap

final int nodeMap()

Specified by:

nodeMap in class PersistentTrieSet.CompactSetNode<K>

dataMap

final int dataMap()

Specified by:

dataMap in class PersistentTrieSet.CompactSetNode<K>