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
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
/********************* */
/*! \file normal_form.h
** \verbatim
** Top contributors (to current version):
** Kshitij Bansal, Andrew Reynolds, Tim King
** This file is part of the CVC4 project.
** Copyright (c) 2009-2020 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 Normal form for set constants.
**
** Normal form for set constants.
**/
#include "cvc4_private.h"
#ifndef CVC4__THEORY__SETS__NORMAL_FORM_H
#define CVC4__THEORY__SETS__NORMAL_FORM_H
namespace CVC4 {
namespace theory {
namespace sets {
class NormalForm {
public:
template <bool ref_count>
static Node elementsToSet(const std::set<NodeTemplate<ref_count> >& elements,
TypeNode setType)
{
typedef typename std::set<NodeTemplate<ref_count> >::const_iterator
ElementsIterator;
NodeManager* nm = NodeManager::currentNM();
if (elements.size() == 0)
{
return nm->mkConst(EmptySet(setType));
}
else
{
ElementsIterator it = elements.begin();
Node cur = nm->mkNode(kind::SINGLETON, *it);
while (++it != elements.end())
{
cur = nm->mkNode(kind::UNION, cur, nm->mkNode(kind::SINGLETON, *it));
}
return cur;
}
}
static bool checkNormalConstant(TNode n) {
Debug("sets-checknormal") << "[sets-checknormal] checkNormal " << n << " :"
<< std::endl;
if (n.getKind() == kind::EMPTYSET) {
return true;
} else if (n.getKind() == kind::SINGLETON) {
return n[0].isConst();
} else if (n.getKind() == kind::UNION) {
// assuming (union ... (union {SmallestNodeID} {BiggerNodeId}) ...
// {BiggestNodeId})
// store BiggestNodeId in prvs
if (n[1].getKind() != kind::SINGLETON) return false;
if (!n[1][0].isConst()) return false;
Debug("sets-checknormal")
<< "[sets-checknormal] frst element = " << n[1][0] << " "
<< n[1][0].getId() << std::endl;
TNode prvs = n[1][0];
n = n[0];
// check intermediate nodes
while (n.getKind() == kind::UNION) {
if (n[1].getKind() != kind::SINGLETON) return false;
if (!n[1].isConst()) return false;
Debug("sets-checknormal")
<< "[sets-checknormal] element = " << n[1][0] << " "
<< n[1][0].getId() << std::endl;
if (n[1][0] >= prvs) return false;
prvs = n[1][0];
n = n[0];
}
// check SmallestNodeID is smallest
if (n.getKind() != kind::SINGLETON) return false;
if (!n[0].isConst()) return false;
Debug("sets-checknormal")
<< "[sets-checknormal] lst element = " << n[0] << " "
<< n[0].getId() << std::endl;
if (n[0] >= prvs) return false;
// we made it
return true;
} else {
return false;
}
}
static std::set<Node> getElementsFromNormalConstant(TNode n) {
Assert(n.isConst());
std::set<Node> ret;
if (n.getKind() == kind::EMPTYSET) {
return ret;
}
while (n.getKind() == kind::UNION) {
Assert(n[1].getKind() == kind::SINGLETON);
ret.insert(ret.begin(), n[1][0]);
n = n[0];
}
Assert(n.getKind() == kind::SINGLETON);
ret.insert(n[0]);
return ret;
}
//AJR
static void getElementsFromBop( Kind k, Node n, std::vector< Node >& els ){
if( n.getKind()==k ){
for( unsigned i=0; i<n.getNumChildren(); i++ ){
getElementsFromBop( k, n[i], els );
}
}else{
if( std::find( els.begin(), els.end(), n )==els.end() ){
els.push_back( n );
}
}
}
static Node mkBop( Kind k, std::vector< Node >& els, TypeNode tn, unsigned index = 0 ){
if( index>=els.size() ){
return NodeManager::currentNM()->mkConst(EmptySet(tn));
}else if( index==els.size()-1 ){
return els[index];
}else{
return NodeManager::currentNM()->mkNode( k, els[index], mkBop( k, els, tn, index+1 ) );
}
}
};
}
}
}
#endif
|
