test/milvus
1
0
Fork 0
mirror of https://gitee.com/milvus-io/milvus.git synced 2024-12-02 11:59:00 +08:00
Code Issues Actions 12 Packages Projects Releases Wiki Activity

Decide the final offset when repeated keys (#10671)

Browse Source 
Signed-off-by: fishpenguin <kun.yu@zilliz.com>
This commit is contained in:
yukun 2021-10-26 19:28:52 +08:00 committed by GitHub
parent fe8bfc3788
commit 471ddb07b2
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
internal/core/src/segcore/ScalarIndex.cpp
View File

@ -39,7 +39,7 @@ ScalarIndexVector::do_search_ids(const IdArray& ids) const {
}
// TODO: for repeated key, decide the final offset with Timestamp
// no repeated key, simplified logic
AssertInfo(iter_beg + 1 == iter_end, "There are no repeated keys in more than one results");
// AssertInfo(iter_beg + 1 == iter_end, "There are no repeated keys in more than one results");
auto [entry_id, entry_offset] = *iter_beg;
dst_ids->add_data(entry_id);
@ -65,7 +65,7 @@ ScalarIndexVector::do_search_ids(const std::vector<idx_t>& ids) const {
}
// TODO: for repeated key, decide the final offset with Timestamp
// no repeated key, simplified logic
AssertInfo(iter_beg + 1 == iter_end, "There are no repeated keys in more than one results");
// AssertInfo(iter_beg + 1 == iter_end, "There are no repeated keys in more than one results");
auto [entry_id, entry_offset] = *iter_beg;
dst_ids.push_back(entry_id);