1 |
|
/****************************************************************************** |
2 |
|
* Top contributors (to current version): |
3 |
|
* Andrew Reynolds, Morgan Deters, Tim King |
4 |
|
* |
5 |
|
* This file is part of the cvc5 project. |
6 |
|
* |
7 |
|
* Copyright (c) 2009-2021 by the authors listed in the file AUTHORS |
8 |
|
* in the top-level source directory and their institutional affiliations. |
9 |
|
* All rights reserved. See the file COPYING in the top-level source |
10 |
|
* directory for licensing information. |
11 |
|
* **************************************************************************** |
12 |
|
* |
13 |
|
* Implementation of trigger trie class. |
14 |
|
*/ |
15 |
|
|
16 |
|
#include "theory/quantifiers/ematching/trigger_trie.h" |
17 |
|
|
18 |
|
namespace cvc5 { |
19 |
|
namespace theory { |
20 |
|
namespace quantifiers { |
21 |
|
namespace inst { |
22 |
|
|
23 |
31199 |
TriggerTrie::TriggerTrie() {} |
24 |
|
|
25 |
62388 |
TriggerTrie::~TriggerTrie() |
26 |
|
{ |
27 |
48891 |
for (size_t i = 0, ntriggers = d_tr.size(); i < ntriggers; i++) |
28 |
|
{ |
29 |
17697 |
delete d_tr[i]; |
30 |
|
} |
31 |
31194 |
} |
32 |
|
|
33 |
13915 |
inst::Trigger* TriggerTrie::getTrigger(std::vector<Node>& nodes) |
34 |
|
{ |
35 |
27830 |
std::vector<Node> temp; |
36 |
13915 |
temp.insert(temp.begin(), nodes.begin(), nodes.end()); |
37 |
13915 |
std::sort(temp.begin(), temp.end()); |
38 |
13915 |
TriggerTrie* tt = this; |
39 |
14123 |
for (const Node& n : temp) |
40 |
|
{ |
41 |
14028 |
std::map<TNode, TriggerTrie>::iterator itt = tt->d_children.find(n); |
42 |
14028 |
if (itt == tt->d_children.end()) |
43 |
|
{ |
44 |
13820 |
return nullptr; |
45 |
|
} |
46 |
|
else |
47 |
|
{ |
48 |
208 |
tt = &(itt->second); |
49 |
|
} |
50 |
|
} |
51 |
95 |
return tt->d_tr.empty() ? nullptr : tt->d_tr[0]; |
52 |
|
} |
53 |
|
|
54 |
17697 |
void TriggerTrie::addTrigger(std::vector<Node>& nodes, inst::Trigger* t) |
55 |
|
{ |
56 |
35394 |
std::vector<Node> temp(nodes.begin(), nodes.end()); |
57 |
17697 |
std::sort(temp.begin(), temp.end()); |
58 |
17697 |
TriggerTrie* tt = this; |
59 |
37045 |
for (const Node& n : temp) |
60 |
|
{ |
61 |
19348 |
std::map<TNode, TriggerTrie>::iterator itt = tt->d_children.find(n); |
62 |
19348 |
if (itt == tt->d_children.end()) |
63 |
|
{ |
64 |
19314 |
TriggerTrie* ttn = &tt->d_children[n]; |
65 |
19314 |
tt = ttn; |
66 |
|
} |
67 |
|
else |
68 |
|
{ |
69 |
34 |
tt = &(itt->second); |
70 |
|
} |
71 |
|
} |
72 |
17697 |
tt->d_tr.push_back(t); |
73 |
17697 |
} |
74 |
|
|
75 |
|
} // namespace inst |
76 |
|
} // namespace quantifiers |
77 |
|
} // namespace theory |
78 |
31125 |
} // namespace cvc5 |