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
|
/********************* */
/*! \file inst_match.cpp
** \verbatim
** Top contributors (to current version):
** Andrew Reynolds, Morgan Deters, Tim King
** This file is part of the CVC4 project.
** Copyright (c) 2009-2017 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 inst match class
**/
#include "theory/quantifiers/inst_match.h"
#include "theory/quantifiers/instantiate.h"
#include "theory/quantifiers/quant_util.h"
#include "theory/quantifiers/term_database.h"
#include "theory/quantifiers_engine.h"
namespace CVC4 {
namespace theory {
namespace inst {
InstMatch::InstMatch(TNode q)
{
d_vals.resize(q[0].getNumChildren());
Assert(!d_vals.empty());
// resize must initialize with null nodes
Assert(d_vals[0].isNull());
}
InstMatch::InstMatch( InstMatch* m ) {
d_vals.insert( d_vals.end(), m->d_vals.begin(), m->d_vals.end() );
}
void InstMatch::add(InstMatch& m)
{
for (unsigned i = 0, size = d_vals.size(); i < size; i++)
{
if( d_vals[i].isNull() ){
d_vals[i] = m.d_vals[i];
}
}
}
bool InstMatch::merge( EqualityQuery* q, InstMatch& m ){
Assert(d_vals.size() == m.d_vals.size());
for (unsigned i = 0, size = d_vals.size(); i < size; i++)
{
if( !m.d_vals[i].isNull() ){
if( d_vals[i].isNull() ){
d_vals[i] = m.d_vals[i];
}else{
if( !q->areEqual( d_vals[i], m.d_vals[i]) ){
clear();
return false;
}
}
}
}
return true;
}
void InstMatch::debugPrint( const char* c ){
for (unsigned i = 0, size = d_vals.size(); i < size; i++)
{
if( !d_vals[i].isNull() ){
Debug( c ) << " " << i << " -> " << d_vals[i] << std::endl;
}
}
}
bool InstMatch::isComplete() {
for (Node& v : d_vals)
{
if (v.isNull())
{
return false;
}
}
return true;
}
bool InstMatch::empty() {
for (Node& v : d_vals)
{
if (!v.isNull())
{
return false;
}
}
return true;
}
void InstMatch::clear() {
for( unsigned i=0; i<d_vals.size(); i++ ){
d_vals[i] = Node::null();
}
}
Node InstMatch::get(int i) const { return d_vals[i]; }
void InstMatch::getInst(std::vector<Node>& inst) const
{
inst.insert(inst.end(), d_vals.begin(), d_vals.end());
}
void InstMatch::setValue( int i, TNode n ) {
d_vals[i] = n;
}
bool InstMatch::set(EqualityQuery* q, int i, TNode n)
{
Assert( i>=0 );
if( !d_vals[i].isNull() ){
if (q->areEqual(d_vals[i], n))
{
return true;
}else{
return false;
}
}else{
d_vals[i] = n;
return true;
}
}
}/* CVC4::theory::inst namespace */
}/* CVC4::theory namespace */
}/* CVC4 namespace */
|
