blob: bd27780e99907249b35ebdcd4b5329badab1814f (
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
55
|
/******************************************************************************
* Top contributors (to current version):
* Andrew Reynolds
*
* 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.
* ****************************************************************************
*
* Variadic trie utility
*/
#include "expr/variadic_trie.h"
namespace cvc5 {
bool VariadicTrie::add(Node n, const std::vector<Node>& i)
{
VariadicTrie* curr = this;
for (const Node& ic : i)
{
curr = &(curr->d_children[ic]);
}
if (curr->d_data.isNull())
{
curr->d_data = n;
return true;
}
return false;
}
bool VariadicTrie::hasSubset(const std::vector<Node>& is) const
{
if (!d_data.isNull())
{
return true;
}
for (const std::pair<const Node, VariadicTrie>& p : d_children)
{
Node n = p.first;
if (std::find(is.begin(), is.end(), n) != is.end())
{
if (p.second.hasSubset(is))
{
return true;
}
}
}
return false;
}
} // namespace cvc5
|
