bend-toon-codec

Search uses release 0.1.0.0 · 412 definitions

Releases (1)

def kvThe key text before the colon at `ci`, and the value after it.
def key.opt.pick
def key.opt
def hdr.badA header that did not parse: with no colon at all the line is no entry; with one, strict mode reports the header and lenient mode reads a literal key.
def hdr.at
def bare.pick
def bare
def parse.pick
def parseParse a line's content (after indentation or after a list hyphen).

def all_ident
def eligibleA bare key with a dot and only identifier segments expands.
def segs.bare
def segs.pick
def segs_of
def snoc
def buildThe nested objects for a path ending in `leaf`.
def conflict
def empty_obj
def same.pickAn existing object met by the end of a path: only an empty object leaf agrees.
def wrap.obj
def cellA cell of a field chain: replace the value when the key is the path's head, else look further along the chain.
def insInsert `leaf` at `segs` inside `e`: an object value, a field chain, or whatever sits at the path (then it conflicts unless the path has ended).
def ins.r
def fl.pickFlatten an expanded value at `segs` into leaf assignments, inserted in order.
def fl
def init
def fl.r
def arr.r
def cons.r
def nil
def ex`acc` is the object under construction while walking a field chain, and Done{JNil} while walking an array's elements.
def stripRemove the quoted-key markers (path expansion off).
def expand

type CiA chain: how many segments, the folded key, the value after the last segment, and whether every segment is an identifier.
type PlanWhat to do with one field: the key to write, the value after any folding, that value's fields, their sibling keys, the budget and the path to carry into them.
def alnum
def ident_tail
def identAn IdentifierSegment.
def member
def keys
def has_dot
def dotted.pick
def dottedKeys that hold a dot.
def sizeNodes in a value: the fuel for the fold.
def chain.step
def chainWalk single-key objects from `v`, at most `budget` segments in all.
def path
def ci.n
def ci.key
def ci.tail
def ci.ok
def foldableDoes this field fold?
def pick.s
def pick.j
def pick.u
def fields.ofThe fields of an object value, or none.
def rebuildAn object value with its folded fields, other values unchanged.
def plan.go
def plan
def plan.fs
def plan.sibs
def plan.nb
def plan.np
def field.mkThe field with its folded inside, followed by the folded rest.
def foldf`fs` is a field chain.
def fold.obj
def fold.if
def foldFold keys of a value with at most `depth` segments per dotted key; a depth below 2 folds nothing.

type Att
type Fr
type StThe stack (top first), the finished root once there is one, and the shallowest array that had a blank line inside it since the last content line.
def stk.of
def bmin.of
def fr.depth
def fr.att
def rev.items
def rev.fields
def has_key
def set.pick
def setReplace the value under `k`, keeping its place.
def add.if
def add_fieldAdd a field to a reversed field chain.
def count.ok
def fin.arr
def finish
def put.field.done
def put.field
def attach.topAttach a finished value to the frame beneath, or make it the root.
def attach
def close.go
def closeClose the top frame into the one beneath it.
def close.if
def should_popIs the top frame at or below depth `t`?
def popClose every frame whose child depth is at least `t`.
def arr.depth.if
def arr.depth
def arr.minShallowest array frame that already has an item or row.
def blank.noteA blank line: remember the shallowest array it falls inside.
def blank.if
def blank.checkA content line at depth `d` after a blank: it is inside the array when the array's child depth is at most `d`.