Interface Node

All Known Subinterfaces:
MapNode<K,V,R>, MultimapNode<K,V,C,R>, SetNode<K,R>
All Known Implementing Classes:
PersistentTrieMap.AbstractMapNode, PersistentTrieMap.BitmapIndexedMapNode, PersistentTrieMap.CompactMapNode, PersistentTrieMap.CompactMixedMapNode, PersistentTrieMap.HashCollisionMapNode, PersistentTrieSet.AbstractSetNode, PersistentTrieSet.BitmapIndexedSetNode, PersistentTrieSet.CompactMixedSetNode, PersistentTrieSet.CompactSetNode, PersistentTrieSet.HashCollisionSetNode, PersistentTrieSetMultimap.AbstractHashCollisionNode, PersistentTrieSetMultimap.AbstractSetMultimapNode, PersistentTrieSetMultimap.BitmapIndexedSetMultimapNode, PersistentTrieSetMultimap.CompactMixedSetMultimapNode, PersistentTrieSetMultimap.CompactSetMultimapNode, PersistentTrieSetMultimap.HashCollisionNode
public interface Node

  • Field Summary

    Fields
    Modifier and Type
    Field
    Description
    static final byte
    SIZE_EMPTY
     
    static final byte
    SIZE_MORE_THAN_ONE
     
    static final byte
    SIZE_ONE
     

  • Method Summary

    Modifier and Type
    Method
    Description
    <T> ArrayView<T>
    dataArray(int category, int component)
    Creates an array abstraction for a subset of data stored in a node.
    ArrayView<? extends Node>
    nodeArray()
     
    byte
    sizePredicate()
    Abstract predicate over a node's size.

  • Field Details

  • Method Details

    • sizePredicate

      byte sizePredicate()
      Abstract predicate over a node's size. Value can be either 0x0, 0x1, or 0x2.
      Returns:
      size predicate

    • dataArray

      <T> ArrayView<T> dataArray(int category, int component)
      Creates an array abstraction for a subset of data stored in a node.
      Type Parameters:
      T - dynamic cast type of projected on view
      Parameters:
      category - the bit pattern of the (heterogeneous) data category
      component - the index to address into tuple

    • nodeArray

      ArrayView<? extends Node> nodeArray()