type Trie

bend-kit-regex@0.8.0.0 · regex.bend:665

import Base

665# A binary trie keyed by n >= 1: the path is the bits of n below its top bit, low bit
666# first, so key n costs log2(n) steps and small keys stay near the root.
667type Trie<-V: Data> is Data:
668  TTip{}
669  TNode{val: Maybe<&2, V>, lo: Trie<V>, hi: Trie<V>}