| 73 | } |
| 74 | |
| 75 | void RemoveDuplicateItems(const vec_int_t& pos_items, |
| 76 | const std::vector<vec_int_t>& neg_items_list, |
| 77 | vec_int_t* unique_items) { |
| 78 | set_int_t item_set; |
| 79 | item_set.insert(pos_items.begin(), pos_items.end()); |
| 80 | for (const auto& neg_items : neg_items_list) { |
| 81 | item_set.insert(neg_items.begin(), neg_items.end()); |
| 82 | } |
| 83 | |
| 84 | unique_items->clear(); |
| 85 | unique_items->assign(item_set.begin(), item_set.end()); |
| 86 | } |
| 87 | |
| 88 | void CheckLengthValid(const std::vector<vec_int_t>& seqs) { |
| 89 | DXCHECK(seqs.size() == 1u); |
no test coverage detected