def close.seen

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

import Base

1043# ponytail: trie lookup and membership cost O(log m) per thread step, so a char costs
1044# O(m log m) for m instructions; a sparse set over an Array would make a step O(1).
1045def close.seen(hit: Bool, +prog: Trie<Inst>, +pc: U32, caps: List<&2, Maybe<&2, U32>>, stack: List<&2, Th>, seen: Trie<Unit>, out: List<&2, Th>, +pos: U32, +prev: Maybe<&2, Char>, +next: Maybe<&2, Char>) -> Cl:
1046  match hit:
1047    case True{}:
1048      Cl{stack, seen, out}
1049    case False{}:
1050      close.inst(trie.at(Inst, prog, pc), pc, caps, stack, trie.set(Unit, seen, pc, Unit{}), out, pos, prev, next)