未验证 提交 e533593a 编写于 作者: Z zhuwenxing 提交者: GitHub

Update search de-dup cases (#11639)

Signed-off-by: Nzhuwenxing <wenxing.zhu@zilliz.com>
上级 ce7c1637
......@@ -827,7 +827,8 @@ class TestCollectionSearch(TestcaseBase):
assert hits.distances[0] == 0.0
@pytest.mark.tags(CaseLabel.L1)
def test_search_with_dup_primary_key(self, dim, auto_id, _async):
@pytest.mark.parametrize("dup_times", [1,2,3])
def test_search_with_dup_primary_key(self, dim, auto_id, _async, dup_times):
"""
target: test search with duplicate primary key
method: 1.insert same data twice
......@@ -840,9 +841,10 @@ class TestCollectionSearch(TestcaseBase):
collection_w, insert_data, _, insert_ids = self.init_collection_general(prefix, True, nb,
auto_id=auto_id,
dim=dim)[0:4]
# insert data again
insert_res, _ = collection_w.insert(insert_data[0])
insert_ids.extend(insert_res.primary_keys)
# insert dup data multi times
for i in range(dup_times):
insert_res, _ = collection_w.insert(insert_data[0])
insert_ids.extend(insert_res.primary_keys)
# search
vectors = [[random.random() for _ in range(dim)] for _ in range(default_nq)]
search_res, _ = collection_w.search(vectors[:nq], default_search_field,
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册