| 59 | } |
| 60 | |
| 61 | void CreateIndexings(const vec_set_t& level_nodes, |
| 62 | std::vector<Indexing>* indexings) { |
| 63 | indexings->clear(); |
| 64 | indexings->resize(level_nodes.size()); |
| 65 | int k = 0; |
| 66 | for (int i = 0; i < (int)level_nodes.size(); ++i) { |
| 67 | (*indexings)[i].Clear(); |
| 68 | for (auto node : level_nodes[i]) { |
| 69 | (*indexings)[i].Emplace(node, k); |
| 70 | k += 1; |
| 71 | } |
| 72 | } |
| 73 | } |
| 74 | |
| 75 | void RemoveDuplicateItems(const vec_int_t& pos_items, |
| 76 | const std::vector<vec_int_t>& neg_items_list, |