Liking cljdoc? Tell your friends :D
meander.match.ir.epsilon
Functions for working with the Meander's match compiler intermediate representation (IR).
Functions for working with the Meander's match compiler intermediate representation (IR).
- branch?
- breadth-first?
- check?
- children
- compile
- compile*
- def-remove-unused
- defop
- do-merge
- drop-form
- fail-form
- height
- js-array-equals-form
- make-node
- merge
- merge*
- merge-all
- node?
- nodes
- op
- op-apply
- op-bind
- op-branch
- op-case
- op-check
- op-check-array
- op-check-array-equals
- op-check-boolean
- op-check-bounds
- op-check-empty
- op-check-equal
- op-check-lit
- op-check-map
- op-check-seq
- op-check-set
- op-check-vector
- op-drop
- op-eval
- op-fail
- op-fail?
- op-find
- op-load
- op-lookup
- op-lvr-bind
- op-lvr-check
- op-mut-bind
- op-mvr-append
- op-mvr-bind
- op-mvr-init
- op-nth
- op-pass
- op-pass?
- op-plus
- op-return
- op-save
- op-search
- op-star
- op-take
- op=
- postwalk
- prewalk
- rewrite
- rewrite*
- rewrite-branch-check-lits-to-case
- rewrite-case-duplicate-actions
- rewrite-move-mvr-init-to-top-level
- take-form
- ungroup-case
- walk
- zipper
meander.match.runtime.epsilon
Functions used by the pattern matcher at runtime.
Functions used by the pattern matcher at runtime.
meander.match.syntax.epsilon
This namespace defines the match syntax special forms, and AST transformations and queries.
This namespace defines the match syntax special forms, and AST transformations and queries.
- analyze
- and-symbol
- apply-symbol
- expand-ast
- expand-map
- expand-map-rest
- expand-not
- expand-or
- expand-prt
- expand-seq
- expand-set
- expand-set-rest
- expand-vec
- flatten-and
- flatten-or
- guard-symbol
- let-symbol
- not-symbol
- or-symbol
- parse
- parse-and
- parse-apply
- parse-guard
- parse-let
- parse-not
- parse-or
- parse-pred
- parse-re
- pred-symbol
- re-symbol
meander.matrix.epsilon
Operators for pattern matrices.
Operators for pattern matrices.
meander.strategy.epsilon
Rewrite strategy combinators.
A strategy is a unary function of a term (any object) and returns the term rewritten.
Notation:
t ∈ Term p, q, r, s ∈ Strategy
Rewrite strategy combinators. A strategy is a unary function of a term (any object) and returns the term rewritten. Notation: t ∈ Term p, q, r, s ∈ Strategy
- *fail*
- *pass*
- all
- all-bu
- all-td
- at
- attempt
- bottom-up
- branch
- breadth-first
- build
- choice
- extract
- fail
- fail?
- find
- guard
- iall?
- innermost
- ione?
- iretain?
- iseq-all-body
- isome?
- match
- n-times
- once-bu
- once-td
- one
- outermost
- pass
- pass?
- pipe
- pred
- repeat
- retain
- rewrite
- rewrites
- search
- some
- some-bu
- some-td
- spine-bu
- spine-td
- spread
- top-down
- top-down-until
- top-down-while
- trace
- tuple
- until
- while
meander.substitute.syntax.epsilon
This namespace defines the substition syntax special forms, and AST transformations and queries.
This namespace defines the substition syntax special forms, and AST transformations and queries.
meander.syntax.epsilon
- *env*
- *form*
- any-node?
- children
- consolidate-with
- default-env
- defsyntax
- empty-cat-node?
- expand-form
- expand-seq
- expander-registry
- fold
- global-expander-registry
- global-parser-registry
- ground?
- lit-form
- literal?
- logic-variables
- lvr-node?
- make-ref-map
- make-variable-rename-map
- max-length
- max-length?
- memory-variables
- min-length
- min-length?
- mvr-node?
- node?
- parse
- parse-all
- parse-seq
- parse-set
- parser-registry
- partition-node?
- postwalk
- postwalk-replace
- prewalk
- prewalk-replace
- proper-subnodes
- ref-node?
- references
- register-expander
- register-parser
- rename-refs
- resolve-expander
- resolve-parser
- search?
- subnodes
- substitute-refs
- tag
- tail-node?
- top-level
- unparse
- variable-length?
- variable-node?
- variables
- walk
- window
- with-node?
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close