com.stripe.bonsai

FullBinaryTree

class FullBinaryTree[A, B] extends AnyRef

This type represents a binary tree, where each branch is guaranteed to have two children (i.e. it is "full").

Members

- bitset: encodes the tree structure using a concept of internal
  and external nodes, e.g. a (potentially unbalanced) heap.  it's
  sort of complicated. basically, for non-balanced trees, we need
  to add "spacing" so that the heap addressing invariants are
  preserved.

- isLeaf: encodes whether an (internal) node is a leaf or branch
  node.

- branchLabels: a dense array of branch label values to index
  into. we use isLeaf to convert 'bitset indices' into
  'branchLabels' indices.

- leafLabels: a dense array of leaf label values to index into. we
  use isLeaf to convert 'bitset indices' into 'leafLabels' indices.

Examples

Example 1

a
     / \
    b   c
   / \ / \
  d  e f  g

(each leaf has two fake "external nodes" which are 0's in bitset)

bitset: 111111100000000
isLeaf: 0001111
branchLabels: a,b,c
leafLabels: d,e,f,g

Example 2

a
     / \
    b   c
       / \
       d  e

(each leaf has two fake "external nodes" which are 0's in bitset)

bitset: 11100110000
isLeaf: 01011
branchLabels: a,c
leafLabels: b,d,e
Self Type
FullBinaryTree[A, B]
Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. FullBinaryTree
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new FullBinaryTree(bitset: IndexedBitSet, isLeaf: IndexedBitSet, branchLabels: Vec[A], leafLabels: Vec[B])

Type Members

  1. final class BranchRef extends NodeRef

  2. final class LeafRef extends NodeRef

  3. sealed abstract class NodeRef extends AnyRef

Value Members

  1. final def !=(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any

  3. final def ##(): Int

    Definition Classes
    AnyRef → Any

  4. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  5. final def ==(arg0: Any): Boolean

    Definition Classes
    Any

  6. final def asInstanceOf[T0]: T0

    Definition Classes
    Any

  7. val bitset: IndexedBitSet

  8. final def branchLabel(index: Int): A

  9. val branchLabels: Vec[A]

  10. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  11. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  12. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any

  13. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  14. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any

  15. def hashCode(): Int

    Definition Classes
    AnyRef → Any

  16. final def isEmpty: Boolean

  17. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any

  18. val isLeaf: IndexedBitSet

  19. final def leafLabel(index: Int): B

  20. val leafLabels: Vec[B]

  21. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef

  22. final def nonEmpty: Boolean

  23. final def notify(): Unit

    Definition Classes
    AnyRef

  24. final def notifyAll(): Unit

    Definition Classes
    AnyRef

  25. final def reduce[X](f: (A, X, X) ⇒ X)(g: (B) ⇒ X): Option[X]

  26. final def root: Option[NodeRef]

  27. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef

  28. def toString(): String

    Definition Classes
    AnyRef → Any

  29. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  30. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  31. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped