Files
fejkdata/node.go
T

414 lines
12 KiB
Go

package fejkdata
import (
"encoding/json"
"fmt"
"math"
"strconv"
"github.com/larvit/fejkdata/internal/datafiles"
"github.com/larvit/fejkdata/internal/grammar"
"github.com/larvit/fejkdata/internal/invariant"
"github.com/larvit/fejkdata/internal/jsonvalue"
"github.com/larvit/fejkdata/internal/proven"
)
// node is a compiled element of the namespace tree: a folder, choice, null,
// template, table, column or row.
type node interface{ isNode() }
// folder is a namespace of named children, built from a directory of JSON files
// and subdirectories. It has no value of its own: descend into a named child by
// dot path; rendering one is an error (see Fake).
type folder struct {
children map[string]node
unloaded map[string]shippedEntry // the shipped categories here a call has not reached yet
}
func (*folder) isNode() {}
// choice draws one of its items. cum holds cumulative weights for a weighted
// draw; when nil the choice is uniform and selection is O(1). shared is the set of
// relative dot paths every item can address, into a repeat too, which carriedByAll reads.
type choice struct {
items []node
cum []float64
shared map[string]bool
nameScope *nameScope // where its items look a name up, set by bindNames
}
func (*choice) isNode() {}
// nullItem is a column's missing value, rendered ""; sized so two nulls are two map keys.
type nullItem struct{ _ byte }
func (*nullItem) isNode() {}
// template renders a format string, substituting {tokens} from fields. A bare
// JSON string is a template with no fields. repeat (default 1) renders that format
// that many times and joins the results with separator (default ""), each render
// an independent draw. Every format compiles in `resolveTemplates`.
type template struct {
// Filled by `compileString`, `compileTemplate` and `table.compileRowFormat`:
format string
tokens []grammar.Token
fields map[string]node
repeat int
separator string
datatype *DataType // the "datatype" it carries, which wins over that of a column it reads; nil where none
fromString bool // written as a JSON string rather than an object
isRecord bool // compiled at the top without a repeat, so its fields are record columns
unbound []unboundRead // the heads its tokens read that no field holds
// Filled by `bindNames`, from the compiled category:
nameScope *nameScope // where its tokens look a name up
// Filled by `resolveTemplates`, from the assembled tree:
refs templateRefs
compiled formatOps
// readsColumn is set when the format only reads one reference or name, and that read is a
// record's column. checkColumns, itemDatatype, proveColumnItem and renderLeaf each read it: change
// them together.
readsColumn *columnRead
// Filled by `settleRecords`, once the load refused every cycle:
columns []recordColumn // a record's, where it has fields, in name order
}
// templateRefs is what a template resolves to in the assembled tree.
type templateRefs struct {
byName map[string]resolvedRef // each reference the format reads -> what it resolves to
categories map[string]node // each resolvedRef.head -> the category it names
}
func (*template) isNode() {}
// startOf is the node an arm's head names: a sibling field, or a reference's category.
func (t *template) startOf(name string) node {
if grammar.IsRef(name) {
return t.refs.categories[name]
}
return t.fields[name]
}
// compile converts parsed JSON — a category or an inline template — into a node tree,
// validating structure up front.
func compile(v jsonvalue.Value) (node, error) { return compileFrom(v, atTop) }
// compileFrom is compile with the root at pos: atTop, or atGoTop for a struct's tags.
func compileFrom(v jsonvalue.Value, pos position) (node, error) {
n, err := compileItem(v.Any(), pos)
if err != nil {
return nil, err
}
return n, bindNames(n)
}
// compileCategory compiles a data file's value, which may be a table over a rows
// file beside it.
func compileCategory(c datafiles.Category) (node, error) {
if m, ok := c.JSON.Any().(map[string]any); ok {
if _, isTable := m["rows"]; isTable {
return compileTable(m, c.Folders, c.Name, c.ReadRows)
}
}
return compile(c.JSON)
}
// position is where a JSON value sits, which decides whether it may carry a datatype or
// be null.
type position int
const (
inFormat position = iota // rendered by a format, so neither
atTop // a category or an inline template, whose fields may be columns
inColumn // a column, or a choice item standing in for one
atGoTop // a struct's tags, whose fields are columns a Go type types
inGoColumn // a column a struct field's Go type types, or a choice item in one
)
// column reports a position that is a record column.
func (p position) column() bool { return p == inColumn || p == inGoColumn }
// compileItem compiles one node; a weight on it skews only a choice drawing it.
func compileItem(v any, pos position) (node, error) {
if _, err := weightOf(v); err != nil {
return nil, err
}
switch v := v.(type) {
case string:
t, err := compileString(v)
if err != nil {
return nil, err
}
return t, nil
case []any:
return compileChoice(v, pos)
case map[string]any:
return compileTemplate(v, pos)
case nil:
if !pos.column() {
return compileString("")
}
return &nullItem{}, nil
case json.Number:
if pos == inColumn {
return nil, typedOrText(string(v), DataTypeInteger, DataTypeNumber)
}
return compileString(string(v))
case bool:
if pos == inColumn {
return nil, typedOrText(strconv.FormatBool(v), DataTypeBoolean)
}
return compileString(strconv.FormatBool(v))
}
panic(invariant.Broken("compileItem has no case for the JSON value %T", v))
}
// typedOrText refuses a bare JSON number or boolean in a record column, which could be the
// text it spells or a typed value, naming the text and the first of ds that holds it.
func typedOrText(text string, ds ...DataType) error {
held := proven.Literal(text)
for _, d := range ds {
if held.Not[d] == "" {
return fmt.Errorf(`%s in a record column could be text or a value of datatype %s; write %q for text, or {"format":%q,"datatype":%q}`, text, d, text, text, d)
}
}
return fmt.Errorf(`%s in a record column fits no datatype; write %q for text`, text, text)
}
// jsonKind names the kind of a JSON value an option cannot take, in the data format's own
// terms rather than the decoding library's.
func jsonKind(v any) string {
switch v.(type) {
case json.Number:
return "a number"
case bool:
return "a boolean"
case string:
return "a string"
case []any:
return "a list"
case map[string]any:
return "an object"
}
return fmt.Sprintf("%T", v)
}
func compileString(s string) (*template, error) {
toks, unbound, err := parseChecked(s, nil)
if err != nil {
return nil, err
}
return &template{format: s, tokens: toks, repeat: 1, fromString: true, unbound: unbound}, nil
}
// fixedText is one render's output when the format holds no token; repeat is the caller's.
func (t *template) fixedText() (string, bool) {
switch {
case len(t.tokens) == 0:
return "", true
case len(t.tokens) == 1 && t.tokens[0].Kind == grammar.LiteralRun:
return t.tokens[0].Lit, true
}
return "", false
}
func compileChoice(items []any, pos position) (node, error) {
itemPos := inFormat
if pos.column() {
itemPos = pos
}
switch len(items) {
case 0:
return nil, fmt.Errorf("empty choice")
case 1:
w, err := weightOf(items[0])
if err != nil {
return nil, err
}
if w == 0 {
return nil, fmt.Errorf("every weight is 0, so the choice has nothing to draw")
}
return compileItem(items[0], pos)
}
c := &choice{items: make([]node, len(items))}
cum := make([]float64, len(items))
var total float64
weighted := false
for i, raw := range items {
w, err := weightOf(raw)
if err != nil {
return nil, err
}
if w != 1 {
weighted = true
}
total += w
cum[i] = total
n, err := compileItem(raw, itemPos)
if err != nil {
return nil, err
}
c.items[i] = n
}
if weighted { // uniform choices skip the weight table and draw in O(1)
if math.IsInf(total, 1) {
return nil, fmt.Errorf("choice weights must sum to a finite number, got %v", total)
}
if total == 0 {
return nil, fmt.Errorf("every weight is 0, so the choice has nothing to draw")
}
c.cum = cum
}
c.shared = sharedPaths(c.items, true)
return c, nil
}
func compileTemplate(m map[string]any, pos position) (node, error) {
if _, isTable := m["rows"]; isTable {
return nil, fmt.Errorf("rows names a TSV beside a category's file, so only a category is a table; an inline template has no file beside it")
}
o, err := readOptions(m, pos)
if err != nil {
return nil, err
}
fieldPos := inFormat
if o.repeat == 1 {
switch pos {
case atTop:
fieldPos = inColumn
case atGoTop:
fieldPos = inGoColumn
}
}
fields, err := compileFields(m, fieldPos)
if err != nil {
return nil, err
}
toks, unbound, err := parseChecked(o.format, fields)
if err != nil {
return nil, err
}
return &template{format: o.format, tokens: toks, fields: fields, repeat: o.repeat, separator: o.separator, datatype: o.datatype, isRecord: fieldPos.column(), unbound: unbound}, nil
}
// templateOptions is what a template object's option keys say.
type templateOptions struct {
datatype *DataType
format string
repeat int
separator string
}
func readOptions(m map[string]any, pos position) (templateOptions, error) {
var o templateOptions
format, ok := m["format"].(string)
if !ok {
return o, fmt.Errorf("template object missing string \"format\"")
}
o.format = format
repeat, err := repeatOf(m)
if err != nil {
return o, err
}
o.repeat = repeat
if o.datatype, err = datatypeOf(m, pos); err != nil {
return o, err
}
if sv, ok := m["separator"]; ok {
if o.separator, ok = sv.(string); !ok {
return o, fmt.Errorf("separator must be a string, not %s", jsonKind(sv))
}
}
return o, nil
}
func compileFields(m map[string]any, pos position) (map[string]node, error) {
fields := make(map[string]node, len(m))
for _, k := range sortedNames(m) {
if isOption(k) {
continue
}
if err := grammar.CheckIdentifier(k); err != nil {
return nil, fmt.Errorf("field %w", err)
}
n, err := compileItem(m[k], pos)
if err != nil {
return nil, fmt.Errorf("field %q: %w", k, err)
}
fields[k] = n
}
return fields, nil
}
// repeatOf reads a template's "repeat" (default 1): how many times its format
// is rendered and concatenated. A present one must be an integer of 0 or more.
func repeatOf(m map[string]any) (int, error) {
rv, ok := m["repeat"]
if !ok {
return 1, nil
}
r, ok := numberOf(rv)
if !ok {
return 0, fmt.Errorf("repeat must be a number, not %s", jsonKind(rv))
}
if err := notTiny("repeat", rv, r); err != nil {
return 0, err
}
if math.IsNaN(r) || math.IsInf(r, 0) || r < 0 || r != math.Trunc(r) {
return 0, fmt.Errorf("repeat must be an integer of 0 or more, got %v", rv)
}
if r > MaxRepeat { // caps the renders one repeat asks for; repeatCheck bounds what nested ones multiply to
return 0, fmt.Errorf("repeat %v exceeds the maximum %d", rv, MaxRepeat)
}
return int(r), nil
}
// weightOf reads a node's "weight" (default 1) from its raw JSON form. Only
// template objects carry weight; a present one must be finite and not negative.
func weightOf(raw any) (float64, error) {
m, ok := raw.(map[string]any)
if !ok {
return 1, nil
}
wv, ok := m["weight"]
if !ok {
return 1, nil
}
w, ok := numberOf(wv)
if !ok {
return 0, fmt.Errorf(`weight is an option and takes a number, not %s; a field cannot be named "weight"`, jsonKind(wv))
}
if w < 0 || math.IsInf(w, 0) {
return 0, fmt.Errorf("weight must be a finite number of 0 or more, got %v", wv)
}
return w, notTiny("weight", wv, w)
}
// notTiny refuses the number v of option name where grammar.Underflows does.
func notTiny(name string, v any, f float64) error {
if grammar.Underflows(string(v.(json.Number)), f) {
return fmt.Errorf("%s %s is too close to 0 to tell from it", name, v)
}
return nil
}
// numberOf reads a JSON number, one too large for a float64 as an infinity.
func numberOf(v any) (float64, bool) {
n, ok := v.(json.Number)
if !ok {
return 0, false
}
f, _ := n.Float64()
return f, true
}
func isOption(name string) bool {
switch name {
case "datatype", "format", "repeat", "separator", "weight":
return true
}
return false
}