blob: 19ae573d852d4c69ba4297ced10efcae765d547f (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
|
/******************************************************************************
* Top contributors (to current version):
* Morgan Deters
*
* This file is part of the cvc5 project.
*
* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS
* in the top-level source directory and their institutional affiliations.
* All rights reserved. See the file COPYING in the top-level source
* directory for licensing information.
* ****************************************************************************
*
* Path-compressing, backtrackable union-find using an undo
* stack. Refactored from the UF union-find.
*/
#include <iostream>
#include "expr/node.h"
#include "theory/arrays/union_find.h"
using namespace std;
namespace cvc5 {
namespace theory {
namespace arrays {
template <class NodeType, class NodeHash>
void UnionFind<NodeType, NodeHash>::notify() {
Trace("arraysuf") << "arraysUF cancelling : " << d_offset << " < " << d_trace.size() << " ?" << endl;
while(d_offset < d_trace.size()) {
pair<TNode, TNode> p = d_trace.back();
if(p.second.isNull()) {
d_map.erase(p.first);
Trace("arraysuf") << "arraysUF " << d_trace.size() << " erasing " << p.first << endl;
} else {
d_map[p.first] = p.second;
Trace("arraysuf") << "arraysUF " << d_trace.size() << " replacing " << p << endl;
}
d_trace.pop_back();
}
Trace("arraysuf") << "arraysUF cancelling finished." << endl;
}
// The following declarations allow us to put functions in the .cpp file
// instead of the header, since we know which instantiations are needed.
template void UnionFind<Node, NodeHashFunction>::notify();
template void UnionFind<TNode, TNodeHashFunction>::notify();
} // namespace arrays
} // namespace theory
} // namespace cvc5
|
