blob: 2b0cc8a1be7111eb085f668288b03ae557505bdc (
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
|
/********************* */
/*! \file skolem_cache.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 a cache of skolems for theory of strings.
**/
#include "theory/strings/skolem_cache.h"
#include "theory/rewriter.h"
namespace CVC4 {
namespace theory {
namespace strings {
SkolemCache::SkolemCache() {}
Node SkolemCache::mkSkolemCached(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 = mkSkolem(c);
d_skolemCache[a][b][id] = sk;
return sk;
}
return it->second;
}
Node SkolemCache::mkSkolemCached(Node a, SkolemId id, const char* c)
{
return mkSkolemCached(a, Node::null(), id, c);
}
Node SkolemCache::mkSkolem(const char* c)
{
NodeManager* nm = NodeManager::currentNM();
Node n = nm->mkSkolem(c, nm->stringType(), "string skolem");
d_allSkolems.insert(n);
return n;
}
bool SkolemCache::isSkolem(Node n) const
{
return d_allSkolems.find(n) != d_allSkolems.end();
}
} // namespace strings
} // namespace theory
} // namespace CVC4
|