Method register_sorted_index

nodedb/src/engine/kv/engine_sorted.rs:19–43

Register a new sorted index with backfill from existing KV data. Scans the hash table for all entries, extracts sort key columns, and populates the order-statistic tree. Returns backfill count.

(
        &mut self,
        tenant_id: u64,
        collection: &str,
        def: SortedIndexDef,
    )

    /// Scans the hash table for all entries, extracts sort key columns,
    /// and populates the order-statistic tree. Returns backfill count.
    pub fn register_sorted_index(
        &mut self,
        tenant_id: u64,
        collection: &str,
        def: SortedIndexDef,
    ) -> u32 {
        let tkey = table_key(tenant_id, collection);
        let now_ms = super::current_ms();

        // Collect existing entries from the hash table for backfill.
        let entries: Vec<(Vec<u8>, Vec<u8>)> = self
            .tables
            .get(&tkey)
            .map(|t| {
                let (entries, _) = t.scan(0, usize::MAX, now_ms, None);
                entries
                    .into_iter()
                    .map(|(k, v)| (k.to_vec(), v.to_vec()))
                    .collect()
            })
            .unwrap_or_default();

        self.sorted_indexes
            .register(tenant_id, def, entries.into_iter())
    }

    /// Drop a sorted index. Returns `true` if it existed.
    pub fn drop_sorted_index(&mut self, tenant_id: u64, index_name: &str) -> bool {