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
|
/********************* */
/*! \file skolem_cache.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds
** This file is part of the CVC4 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.\endverbatim
**
** \brief Implementation of a cache of skolems for theory of sets.
**/
#include "theory/sets/skolem_cache.h"
#include "theory/rewriter.h"
using namespace CVC5::kind;
namespace CVC5 {
namespace theory {
namespace sets {
SkolemCache::SkolemCache() {}
Node SkolemCache::mkTypedSkolemCached(
TypeNode tn, Node a, Node b, SkolemId id, const char* c)
{
a = a.isNull() ? a : Rewriter::rewrite(a);
b = b.isNull() ? b : Rewriter::rewrite(b);
std::map<SkolemId, Node>::iterator it = d_skolemCache[a][b].find(id);
if (it == d_skolemCache[a][b].end())
{
Node sk = mkTypedSkolem(tn, c);
d_skolemCache[a][b][id] = sk;
return sk;
}
return it->second;
}
Node SkolemCache::mkTypedSkolemCached(TypeNode tn,
Node a,
SkolemId id,
const char* c)
{
return mkTypedSkolemCached(tn, a, Node::null(), id, c);
}
Node SkolemCache::mkTypedSkolem(TypeNode tn, const char* c)
{
Node n = NodeManager::currentNM()->mkSkolem(c, tn, "sets skolem");
d_allSkolems.insert(n);
return n;
}
bool SkolemCache::isSkolem(Node n) const
{
return d_allSkolems.find(n) != d_allSkolems.end();
}
} // namespace sets
} // namespace theory
} // namespace CVC5
|
