pub enum Op {
}Variants§
LoadKey(Arc<str>)
Load a bitmap of every Key token whose name matches.
LoadDepth(u16)
Load a bitmap of every token at the given nesting depth.
LoadSubtree(TokenId)
Load a bitmap of every token in the subtree rooted at the given container.
LoadAll
Load a bitmap of every token in the document — identity for restrict.
LoadOne(TokenId)
Load a singleton bitmap containing a single token.
And(Box<Op>, Box<Op>)
Bitmap intersect of two op outputs (Roaring SIMD AND).
Or(Box<Op>, Box<Op>)
Bitmap union of two op outputs.
Sub(Box<Op>, Box<Op>)
Bitmap difference: a minus b.
FieldOf(Arc<str>)
For each token in state, drill into its named-key value token.
Descendants
For each token in state, expand to its full subtree.
AllChildren
For each container in state, expand to its immediate child tokens.
ValueEqLit(Vec<u8>)
Filter state to tokens whose byte span equals the given literal
(string-aware; honours surrounding quotes via json_string_eq).
First
Collapse state to its smallest token id (document-order first).
Last
Collapse state to its largest token id (document-order last).
Nth(u32)
Collapse state to the k-th token in document order.
Count
Collapse state to a singleton bitmap encoding the cardinality.
Implementations§
Source§impl Op
impl Op
Sourcepub fn card_class(&self) -> CardClass
pub fn card_class(&self) -> CardClass
Cardinality contract of this op — used by the optimiser.
Sourcepub fn supports_demand(&self) -> bool
pub fn supports_demand(&self) -> bool
Whether this op can short-circuit upstream work given a bound number of outputs (Reducer-class ops in particular).