bend-kit-regex

Search uses release 0.8.0.0 · 316 definitions

Releases (10)

0.8.0.0 indexed
0.7.0.0 unindexed
0.6.0.4 unindexed
0.6.0.3 unindexed
0.6.0.2 unindexed
0.6.0.0 unindexed
0.5.0.0 unindexed
0.4.0.0 unindexed
0.3.0.0 unindexed
0.2.1.0 unindexed

Definitions (316)

regex.bend

def sym.srcThe index in the last slot.
def sym.savesThe slots before the last that hold a position.
def sym.outs
def sym.fresh
def op.same
def ops.same
def tr.of
def sym.lr
def sym.hit
def sym.closeThe closure after the char, inside the text: prev and next are any chars, and start is None so the seed always runs; replay.vm skips a fresh start the way seed.skip does.
def sym.bestOnce a match is found no seed starts, so a done state scans with some best.
def learn
def caps.at
def caps.of.if
def caps.of
def saves.put
def replay
def replay.best
def replay.freshfresh: no match yet and every thread starts at the seed; skip it when next cannot start a match.
def replay.vmA learned transition on the real threads; next is the char after the new position.
type RqThe DFA over Bytes: the buffer, the transitions by state and ASCII char, the interned states, the current state, the offset i of the next char, that char, and the threads waiting on it.
def rq.ik
def rq.of
def rq.store
def rq.learn
def rq.realWith a full cache, skip building the key too.
type SpinA same transition leaves the VM and state id intact.
type SpinStep
def spin.byte
def spin.tr
def spin.state.tr
def spin.state
def spin
type ArCached DFA steps reuse two thread buffers; the Pike VM handles learning and text boundaries.
def ar.fill
def ar.reset.size
def ar.reset.put
def ar.reset
def ar.new
def ar.list.go
def ar.vm.put
def ar.vm
def ar.src.get
def ar.src
def ar.put
def ar.replay
def ar.best.get
def ar.best.none
def ar.replay.best
def ar.cached.fresh
def ar.cachedA cached transition was learned in this run, so the buffers already fit its outputs.
type Qst
def qa.status.if
def qa.status
type Qa
def qa.seed
def qa.from.state
def qa.from
def qa.learn.vm
def qa.real.vm
def qa.real
def qa.cached
def qa.pick
def qa.step
def qa.spin.read
def qa.spin.dec
def qa.spin.at
def qa.spin.if
def qa.spin
def qa.end.vm
def qa.end
def qa.end.status
def runqaEach step consumes a byte; after the cache fills, continue in the plain Pike VM.
def exec.bytes.fin
def exec.bytes.go.ifShort large programs use the plain VM; long large programs can use 2048 states.
def exec.bytes.go
def exec.bytes.run
def rev.best
type Rv
type RevBits
def rev.bits.after
def rev.bits.char
def rev.bits.read
def rev.bits.walk
def rev.bits.result
def rev.bits.run
type RevPhase
type RevFound
def rev.min
def rev.seek
def rev.abort
def rev.candidates
def exec.bytes.at
def rev.confirm.best
def rev.confirm
def exec.bytes.candidate
def exec.bytes.reverse
def exec.bytes.select
def exec.bytes.must.hit
def exec.bytes.must