emerging-eztoml

Search uses release 0.9.0.0 · 704 definitions

Releases (3)

0.9.0.0 indexed
0.8.0.0 unindexed
0.7.0.0 unindexed

Definitions (704)

main.bend

def num.digs.exp2a capital exponent, or a rejected character
def num.digs.expan exponent
def num.digs.dota dot or an exponent
def num.digs.usan underscore, a dot, or an exponent
def num.digs.goa decimal digit, an underscore, a dot, or an exponent
def num.digsa decimal digit, an underscore, a dot, or an exponent
def num.based.goan underscore, or a digit of the base
def num.baseda digit of a prefixed integer, or an underscore
def num.frac.exp2a capital exponent, or a rejected character
def num.frac.expan exponent in a fraction
def num.frac.usan underscore or an exponent in a fraction
def num.frac.goa fraction digit, an underscore, or an exponent
def num.fraca fraction digit, an underscore, or an exponent
def num.exp.signthe exponent sign is part of the spelling; digits follow
def num.expon.digita digit of the exponent
def num.expon.minusa minus or a digit in an exponent
def num.expon.gothe sign or the first digit of an exponent
def num.exponthe sign or the first digit of an exponent
def num.edig.usan underscore in an exponent
def num.edig.goan exponent digit or an underscore
def num.edigan exponent digit or an underscore
def num.onone character of a numeral
def num.step.goone character of a numeral
def num.stepone character of a numeral
def num.gothe walk over a numeral
def i64.limitthe positive limit is 2^63-1; the negative limit is 2^63
def i64.ordthe first differing digit stands; a tie takes the new order
def i64.stepa shorter digit string fits and a longer one does not.
def i64.fitswhether the integer fits in a signed 64-bit integer
def num.fin.rangean integer inside the signed 64-bit range
def num.fin.inta finished integer, rejected when it falls outside signed 64-bit
def num.fin.sawa numeral needs a digit in its last run
def num.signeda prefixed integer may not carry a sign
def num.fin.basea prefixed integer, rejected when a sign was written
def num.fin.nkthe kind of numeral the scan finished in
def num.fin.usa trailing underscore is rejected
def num.finthe value of a finished numeral
def word.numa numeral token
def word.route.datea datetime when the token has a colon or a dash, otherwise a numeral
def word.routea special word, or a numeral
def word.special.minus'-' can start a signed inf or nan
def word.special.plus'+' or '-'
def word.special.n'n', or a sign
def word.special.i'i', or nan, or a sign
def word.special.f'f', or inf, or nan, or a sign
def word.special.t't', or false, or inf, or nan, or a sign
def word.specialwhether this character can start a special bare word
def word.leadthe first character, when the word has one
def word.val.numa numeral or a datetime.
def word.val.picka special word, or a numeral.
def word.vala bare word: a special, a datetime, or a numeral
type Joba change applied at the end of a key path
type Frone table the walk has entered
type Twthe walk: the table being edited, and the frames above it
type Endthe root table after a walk
type Lookwhat a key in a table refers to
type Lastthe last element of an array of tables
def err.first.gothe first error is kept
def err.firstthe first error is kept
def find.stepa key found earlier wins
def rows.findthe first pair of this name
def getthe value written for a key, or Miss
def rows.repl.stepreplace the value of one pair
def rows.replreplace every pair of this name
def heads.oreither flag
def heads.by.headheads records each table the document has defined as its path behind one mark: `[` when a header defined it, `.` when dotted keys did
def heads.by.dota table dotted keys defined, as heads records it
def heads.haswhether a table path was defined, by a header or by dotted keys
def heads.headwhether a table path was defined by a header
def heads.drop.stepa recorded table under the prefix is dropped
def heads.dropforget every table whose path starts with the prefix.
def heads.define.newa table defined by a dotted key is recorded once
def heads.definea dotted key defines each table before its last segment
def tree.pre.goa dotted path from a prefix and one segment
def tree.prea dotted path from a prefix and one segment
def look.ofthe value a key already holds
def look.stepthe matching pair, or the rest of the table
def rows.lookwhat a key in this table refers to
def look.last.onethe newest element.
def look.lastthe newest element of an array of tables, and the older elements behind it
def tree.wrapput the child rows back into the parent table.
def tree.rebuildwalk the frames back to the root
def tree.leaf.puta key that is already present is a duplicate
def tree.leaf.def.headan explicit header for a table that already exists
def tree.leaf.def.hitopen a standard table
def tree.leaf.defopen a standard table
def tree.leaf.aot.hitappend one element of an array of tables
def tree.leaf.aotappend one element of an array of tables
def tree.leaf.jobthe key at the end of the path
def tree.leaf.bada failed walk rebuilds what it has
def tree.leafthe key at the end of the path
def tree.sub.aotsenter the last element of an array of tables
def tree.sub.joba prefix of the current table is navigation; a dotted segment defines a table
def tree.sub.dota segment of a dotted key, which defines tables as it goes
def tree.sub.head.goenter a table, unless a dotted key would add to a table a header defined
def tree.sub.heada dotted key asks whether a header defined the table; a header walk does not
def tree.sub.arra header enters the last element of an array of tables; a dotted key cannot add to an array of tables
def tree.sub.lookdescend into one key, or record why it cannot be entered
def tree.sub.baddescend into one key when the walk is still well
def tree.subdescend into one key