Skip to main content

point_lookup_count_entries

drive::query::drive_document_count_query

Function point_lookup_count_entries 

Source 
pub fn point_lookup_count_entries(
    index: &Index,
    base_path_len: usize,
    has_in_clause: bool,
    elements: impl IntoIterator<Item = (Vec<Vec<u8>>, Vec<u8>, Option<Element>)>,
) -> Vec<SplitCountEntry>
Expand description

Turns the (path, key, element) triples a point-lookup count path query yields (see point_lookup_count_path_query) into one entry per count tree. For compound (In) shapes the In value sits at path[base_path_len] when the walk descended past the base path (the In + trailing Equals shape) and IS the key otherwise (the In-on-terminator shape); Equal-only shapes have no per-key dimension. The element’s document count (document_count_of_element) is the per-branch count; an absent element becomes count: None. ONE decoder for every reader of that layout — the proof verifier, the no-proof executor and composite queries — so the layout has one owner.