未验证 提交 ac3d2b85 编写于 作者: Q Qdriving 提交者: GitHub

Update reader.py

yapf check
上级 f7fe635f
...@@ -95,13 +95,17 @@ class Reader(ReaderBase): ...@@ -95,13 +95,17 @@ class Reader(ReaderBase):
self.neg_candidate_item.extend(b[i][0]) self.neg_candidate_item.extend(b[i][0])
self.neg_candidate_cat.extend(b[i][1]) self.neg_candidate_cat.extend(b[i][1])
if len(self.neg_candidate_item) > self.max_neg_item: if len(self.neg_candidate_item) > self.max_neg_item:
self.neg_candidate_item = self.neg_candidate_item[0:self.max_neg_item] self.neg_candidate_item = self.neg_candidate_item[
self.neg_candidate_cat = self.neg_candidate_cat[0:self.max_neg_item] 0:self.max_neg_item]
self.neg_candidate_cat = self.neg_candidate_cat[
0:self.max_neg_item]
else: else:
len_seq = len(b[i][0]) len_seq = len(b[i][0])
start_idx = random.randint(0, self.max_neg_item - len_seq - 1) start_idx = random.randint(0, self.max_neg_item - len_seq - 1)
self.neg_candidate_item[start_idx:start_idx + len_seq + 1] = b[i][0] self.neg_candidate_item[start_idx:start_idx + len_seq +
self.neg_candidate_cat[start_idx:start_idx + len_seq + 1] = b[i][1] 1] = b[i][0]
self.neg_candidate_cat[start_idx:start_idx + len_seq +
1] = b[i][1]
for _ in range(len(b[i][0])): for _ in range(len(b[i][0])):
randindex = random.randint(0, len(self.neg_candidate_item) - 1) randindex = random.randint(0, len(self.neg_candidate_item) - 1)
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册