chore(flat): replace std::map with std::unordered_map for key_id_mapping_ (#153)

Reduces key lookup in get_id() from O(log N) to O(1) average, and index
load time from O(N log N) to O(N). Also lowers per-entry memory usage by
eliminating the three tree-node pointers (parent/left/right).

Co-authored-by: ZeFeng Yin <yinzefeng.yzf@alibaba-inc.com>
This commit is contained in:
longway
2026-02-28 13:10:38 +08:00
committed by GitHub
co-authored by ZeFeng Yin
parent 753e3a3fbd
commit 4e420311df
+2 -2
View File
@@ -12,7 +12,7 @@
// See the License for the specific language governing permissions and
// limitations under the License.
#pragma once
#include <unordered_map>
#include <zvec/ailego/container/params.h>
#include <zvec/core/framework/index_searcher.h>
#include "flat_distance_matrix.h"
@@ -163,7 +163,7 @@ class FlatSearcher : public IndexSearcher {
private:
//! Members
const uint64_t *keys_{nullptr};
std::map<key_t, node_id_t> key_id_mapping_;
std::unordered_map<key_t, node_id_t> key_id_mapping_;
uint32_t magic_{IndexContext::GenerateMagic()};
uint32_t read_block_size_{FLAT_DEFAULT_READ_BLOCK_SIZE};
bool column_major_order_{false};