Expand description
Auto-generated module
🤖 Generated with SplitRS
Functions§
- all_
patterns - Returns all notation patterns in a registry as strings.
- compare_
prec - A precedence-based comparison between two operators.
- count_
placeholders - Counts the number of placeholder slots
_in a notation pattern. - find_
conflicts - Find conflicts in a notation registry.
- fixity_
to_ kind - Convert a
Fixityto the correspondingNotationKind. - kind_
to_ fixity - Convert a
NotationKindto aFixity(where applicable). - left_
assoc_ rules - Returns all left-associative notation rules in a registry.
- make_
infix - Build a simple infix notation entry from symbol, precedence, associativity.
- make_
postfix - Build a simple postfix notation entry.
- make_
prefix - Build a simple prefix notation entry.
- merge_
registries - Merge two notation registries.
- notation_
rule_ count - Returns the total number of notation rules registered.
- parse_
notation_ pattern - Parse a notation pattern string into parts.
- parse_
notation_ pattern_ ext - Parse a notation pattern into token kinds (extended variant).
- registry_
has_ pattern - Returns true if the registry contains a rule for the given pattern.
- registry_
is_ empty - Returns true if a registry is empty.
- right_
assoc_ rules - Returns all right-associative notation rules in a registry.
- rules_
in_ prec_ range - Returns rules with precedence in a given range.
- same_
pattern - Returns true if two notation rules have the same pattern.
- sorted_
patterns - Returns all notation rule patterns as a sorted vector.
- unique_
patterns - Returns all unique patterns across a list of registries.
- validate_
notation - Validates that a notation pattern and expansion have consistent hole counts.