Options
All
  • Public
  • Public/Protected
  • All
Menu

External module "bst"

file

A binary search tree implementation for finding ranges within the tree and finding neighboring nodes. The documentation for this is, erm, not super amazing.

author

Nathan Pennie kb1rd@kb1rd.net

Index

Type aliases

BstNodePtr

BstNodePtr<T>: MemberPtr<BstNode<T>, "left"> | MemberPtr<BstNode<T>, "right"> | MemberPtr<Bst<T, any>, "bst_root">

The pointer type either to a leaf of the BST or the root. By using MemberPtr, methods in the BST can re-assign the node value simply through this 'pointer' object.

Type parameters

  • T

DBstSearchable

DBstSearchable: object

Type declaration

  • value: number

NodeOp

NodeOp<T>: function

The type of a function that operates on nodes of the BST.

Type parameters

  • T

Type declaration

Point

Point<T>: [T, boolean, string]

A single point in a RangeSearch. The first element is the point value, the second element is a boolean that is true if the point is inclusive, and the third element the bucket string, or undefined to drop elements.

Type parameters

  • T

Generated using TypeDoc