equal
deleted
inserted
replaced
1286 /// structure uses internally for store references. |
1286 /// structure uses internally for store references. |
1287 HeapUnionFind(ItemIntMap& _index) |
1287 HeapUnionFind(ItemIntMap& _index) |
1288 : index(_index), first_class(-1), |
1288 : index(_index), first_class(-1), |
1289 first_free_class(-1), first_free_node(-1) {} |
1289 first_free_class(-1), first_free_node(-1) {} |
1290 |
1290 |
|
1291 /// \brief Clears the union-find data structure |
|
1292 /// |
|
1293 /// Erase each item from the data structure. |
|
1294 void clear() { |
|
1295 nodes.clear(); |
|
1296 classes.clear(); |
|
1297 first_free_node = first_free_class = first_class = -1; |
|
1298 } |
|
1299 |
1291 /// \brief Insert a new node into a new component. |
1300 /// \brief Insert a new node into a new component. |
1292 /// |
1301 /// |
1293 /// Insert a new node into a new component. |
1302 /// Insert a new node into a new component. |
1294 /// \param item The item of the new node. |
1303 /// \param item The item of the new node. |
1295 /// \param prio The priority of the new node. |
1304 /// \param prio The priority of the new node. |