blob: 5a63024b820ea3f6df4fcb8f906aeb597355d627 (
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
56
57
58
59
60
61
62
63
64
65
|
/********************* */
/*! \file lazy_trie.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** This file is part of the CVC4 project.
** Copyright (c) 2009-2018 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.\endverbatim
**
** \brief Implementation of lazy trie
**/
#include "theory/quantifiers/lazy_trie.h"
namespace CVC4 {
namespace theory {
namespace quantifiers {
Node LazyTrie::add(Node n,
LazyTrieEvaluator* ev,
unsigned index,
unsigned ntotal,
bool forceKeep)
{
LazyTrie* lt = this;
while (lt != NULL)
{
if (index == ntotal)
{
// lazy child holds the leaf data
if (lt->d_lazy_child.isNull() || forceKeep)
{
lt->d_lazy_child = n;
}
return lt->d_lazy_child;
}
std::vector<Node> ex;
if (lt->d_children.empty())
{
if (lt->d_lazy_child.isNull())
{
// no one has been here, we are done
lt->d_lazy_child = n;
return lt->d_lazy_child;
}
// evaluate the lazy child
Node e_lc = ev->evaluate(lt->d_lazy_child, index);
// store at next level
lt->d_children[e_lc].d_lazy_child = lt->d_lazy_child;
// replace
lt->d_lazy_child = Node::null();
}
// recurse
Node e = ev->evaluate(n, index);
lt = <->d_children[e];
index = index + 1;
}
return Node::null();
}
} /* CVC4::theory::quantifiers namespace */
} /* CVC4::theory namespace */
} /* CVC4 namespace */
|
