Expand description
Recursive CEL type expressions plus the small resolver boundary they need.
Parsing stays in cel-parser, while leaf-name lookup is delegated to a TypeResolver.
This keeps CEL independent of adam-lang while still allowing a host to register custom
types for typed arrays and future typed CEL surfaces.
Structs§
- Resolved
Array Type - The resolved descriptor for one complete array type annotation.
- Resolved
Leaf Type - One resolved scalar leaf type.
Enums§
- Resolved
Type - A resolved recursive CEL type expression.
- Type
Expr type_expression = identifier [ "(" [ type_expression { "," type_expression } ] ")" ] | "[" type_expression "]" | "(" [ type_expression ["," [ type_expression { "," type_expression } ]] ] ")".
Traits§
- Type
Resolver - Resolves one named leaf type for CEL type expressions.
Functions§
- builtin_
type_ resolver - Returns
cel-parser’s own built-in type resolver — every scalar name recognized bybuiltin_scalar_type, plus every built-in generic type recognized bybuiltin_generic_type(theRangefamily). - resolve_
builtin_ named_ type - Resolves
name/argsagainstcel-parser’s own built-in type resolver, without allocating aTypeResolvertrait object.