Skip to content

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

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
longway-code wants to merge 2 commits into
base: main
Choose a base branch
from
Open

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

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
feeba82
chore(flat): replace std::map with std::unordered_map for key_id_mapp…
longway-code Feb 20, 2026
b14d66a
Merge branch 'main' into chore/flat-key-id-mapping-unordered-map
iaojnh Feb 26, 2026
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions src/core/algorithm/flat/flat_searcher.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -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"
Expand Down Expand Up @@ -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};
Expand Down