Skip to main content

folded_filled

Function folded_filled 

Source
pub async fn folded_filled<K, S, Up, G>(
    folded: Vec<Folded<K, S>>,
    store: &mut G,
    filter: Option<&G::Filter>,
    limit: usize,
) -> Result<Vec<Folded<Up, S>>, G::Error>
where G: AsyncGather<K, Up>,
Available on crate feature engine only.
Expand description

The FILL LOOP AT THE SET GRAIN: filled over a Folded answer instead of a Ranked one.

Every word of filled’s note holds — the batch sizing, the positional contract, the short final page, and the rule that the numbers come from the KEY and never from the row. The two share [hydrated] rather than repeating the loop, because a loop written twice is a loop that can drift at one of them, and the only difference between these two roads is WHAT rides beside the key: two numbers on the single-vector road, and a folded score plus m per-stream sightings here.

§What is carried is the whole provenance, not a re-derivation

Folded::map_node is the one move, exactly as Ranked::map_node is one road over: the folded score and every StreamBest slot are the fold’s answer about the ADDRESS, and a row found under that address has nothing to say about either. A hit whose row the system of record no longer holds drops out here, and the ordinals its slots carried stay holes in the streams they came from — which is the same shape tier B already leaves in a rank.