a55327c7ef
Adds a sparkline(array|map) built-in that renders numeric values as a Unicode block-character string (▁▂▃▄▅▆▇█), plus a new `mlr sparkline` verb that summarizes each field's values in record order -- useful for eyeballing trends without external plotting tools. Also adds `-s` to `mlr histogram` to sparkline a field's binned counts (its distribution shape) rather than emitting one record per bin. This is a different chart from `mlr sparkline` (order-independent binning vs. record-order values), and the docs for each cross-reference the other to avoid conflating them. Co-authored-by: Claude Sonnet 5 <noreply@anthropic.com> |
||
|---|---|---|
| .. | ||
| assignments.go | ||
| ast_types.go | ||
| block_exit.go | ||
| blocks.go | ||
| builtin_function_manager.go | ||
| builtin_function_manager_json.go | ||
| builtin_functions.go | ||
| collections.go | ||
| cond.go | ||
| doc.go | ||
| dump.go | ||
| emit1.go | ||
| emit_emitp.go | ||
| emitf.go | ||
| env.go | ||
| evaluable.go | ||
| filter.go | ||
| for.go | ||
| functions.go | ||
| hofs.go | ||
| if.go | ||
| keyword_usage.go | ||
| keyword_usage_json.go | ||
| leaves.go | ||
| lvalues.go | ||
| print.go | ||
| README.md | ||
| root.go | ||
| signature.go | ||
| statements.go | ||
| subroutines.go | ||
| tee.go | ||
| types.go | ||
| udf.go | ||
| uds.go | ||
| validate.go | ||
| warn.go | ||
| while.go | ||
See ../dsl/README.md for more information about Miller's use of abstract syntax trees (ASTs) and concrete syntax trees (CSTs) within the Miller put/filter domain-specific language (DSL).
Files
types.gois a starting point for seeing datatypes involved in the concrete syntax tree.IExecutableis the interface for executable nodes, such as assignment statements, or statement blocks (if-bodies, etc.).IEvaluableis the interface for evaluable expressions (e.g. right-hand sides of assignment statements).
root.gocontains the top-level logic for building a CST from an AST at parse time (cstRoot, err := cst.Build(astRoot)), as well as executing the CST on a per-record basis (cstRoot.Execute(runtimeState)). See also theputtransformer.
Notes
Go is a strongly typed language, but the AST is polymorphic. This results in if/else or switch statements as an AST is walked.
Also, when we modify code, there can be changes in the BNF grammar not yet reflected in the AST. Likewise, there can be AST changes not yet reflected here. (Example: you are partway through adding a new binary operator to the grammar.)
As a result, throughout the code, there are error checks which may seem redundant but which are in place to make incremental development more pleasant and robust.
During CST build from an AST, one starts from the AST root and walks down through the nodes of the AST. Within a caller method, there is an if/else or switch statement on the AST node type. (Example: is this a leaf node, like the string literal "abcd", int literal 3, field-name $x? Or a binary operator like +, or function call like cos?).
Different builder methods are invoked for leaves, operators, etc. There is also, redundantly, a precondition assertion within each builder method: the leaf-builder method checks to make sure it's given an AST leaf node to build from; the operator-builder method checks to make sure it's given an AST operator node to build from; etc. The caller and the callee are doing the same kinds of check, which might seem redundant. The callees return Go error in case there is something new in the caller which has not yet been implemented in the callee.
This is all done to make development more happy: when you see things like CST build: AST unary operator node unhandled you can check the code here and see what you need to do next to continue development.