type Index

bolt@1.27.0.0 · src/lsp/semantic.bend:130

import Base

130# binders as a binary trie on the low bits of a key (a binder's line, or its
131# name's hash), a leaf holding the entries that reach it in source order: a
132# lookup is a walk down and a short scan, and finds what a scan of every
133# binder from the front would, as a miss down the path is a miss everywhere
134type Index is Data:
135  INone{}
136  ILeaf{es: List<&2, Entry>}
137  INode{lo: Index, hi: Index}