File: Valuation.C

package info (click to toggle)
maria 1.3.5-1
  • links: PTS
  • area: main
  • in suites: etch, etch-m68k, lenny
  • size: 3,952 kB
  • ctags: 5,458
  • sloc: cpp: 43,402; yacc: 8,080; sh: 460; ansic: 436; lisp: 395; makefile: 292; perl: 21
file content (197 lines) | stat: -rw-r--r-- 4,835 bytes parent folder | download | duplicates (6)
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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
// Valuation (value distribution for variables) -*- c++ -*-

#ifdef __GNUC__
# pragma implementation
#endif // __GNUC__
#include "Valuation.h"
#include "Value.h"
#include "VariableDefinition.h"
#ifndef NDEBUG
# include "Type.h"
#endif // NDEBUG

/** @file Valuation.C
 * Assignment of variables to values
 */

/* Copyright  1999-2001 Marko Mkel (msmakela@tcs.hut.fi).

   This file is part of MARIA, a reachability analyzer and model checker
   for high-level Petri nets.

   MARIA is free software; you can redistribute it and/or modify it
   under the terms of the GNU General Public License as published by
   the Free Software Foundation; either version 2, or (at your option)
   any later version.

   MARIA is distributed in the hope that it will be useful, but
   WITHOUT ANY WARRANTY; without even the implied warranty of
   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
   General Public License for more details.

   The GNU General Public License is often shipped with GNU software, and
   is generally kept in a file called COPYING or LICENSE.  If you do not
   have a copy of the license, write to the Free Software Foundation,
   59 Temple Place, Suite 330, Boston, MA 02111 USA. */

Valuation::Valuation () :
  myValues (), myError (errNone), myExpr (0), myGlobalMarking (0)
{
}

Valuation::Valuation (const class Valuation& old) :
  myValues (), myError (old.myError), myExpr (old.myExpr),
  myGlobalMarking (old.myGlobalMarking)
{
  for (const_iterator i = old.myValues.begin (); i != old.myValues.end ();
       i++) {
    assert (i->second != NULL);
    myValues[i->first] = i->second->copy ();
  }
}

Valuation::~Valuation ()
{
  for (iterator i = myValues.begin (); i != myValues.end (); i++)
    delete i->second;
}

const class Value*
Valuation::getValue (const class VariableDefinition& var) const
{
  const_iterator i = myValues.find (&var);
  if (i == myValues.end ())
    return NULL;

  return i->second;
}

void
Valuation::setValue (const class VariableDefinition& var, class Value& value)
{
  assert (var.getType ().isConstrained (value));
  Map::value_type p (&var, &value);
  std::pair<iterator, bool> status = myValues.insert (p);
  if (!status.second) {
    delete status.first->second;
    myValues.erase (status.first);
    status = myValues.insert (p);
    assert (status.second);
  }
}

bool
Valuation::increment (const class VariableDefinition& var)
{
  const_iterator i = myValues.find (&var);
  assert (i != myValues.end ());
  return i->second->increment ();
}

bool
Valuation::decrement (const class VariableDefinition& var)
{
  const_iterator i = myValues.find (&var);
  assert (i != myValues.end ());
  return i->second->decrement ();
}

bool
Valuation::undefine (const class VariableDefinition& var)
{
  iterator i = myValues.find (&var);
  if (i == myValues.end ())
    return false;
  delete i->second;
  myValues.erase (i);
  return true;
}

const char*
Valuation::msg (enum Error err)
{
  switch (err) {
  case errNone:
    return "noError";
  case errConst:
    return "constraintViolation";
  case errVar:
    return "undefinedVariable";
  case errUndef:
    return "undefinedExpression";
  case errFatal:
    return "fatalExpression";
  case errDiv0:
    return "divisionByZero";
  case errOver:
    return "overflow";
  case errMod:
    return "modulusError";
  case errShift:
    return "shiftError";
  case errUnion:
    return "unionViolation";
  case errBuf:
    return "bufferViolation";
  case errCard:
    return "cardinalityOverflow";
  case errComp:
    return "unificationError";
  }
  assert (false);
  return 0;
}

#include "Printer.h"
#include "Expression.h"
void
Valuation::display (const class Printer& printer,
		    bool hide) const
{
  printer.delimiter ('<')++;
  if (myError) {
    printer.printRaw (msg (myError));
    if (myExpr) {
      printer.delimiter (':');
      printer++.linebreak ();
      myExpr->display (printer);
      printer--;
    }
  }
  else
    assert (!myExpr);

  for (const_iterator i = myValues.begin (); i != myValues.end (); i++) {
    if (hide && i->first->isHidden ())
      continue;
    printer.linebreak ();
    printer.print (i->first->getName ());
    printer.delimiter (':')++;
    i->second->display (printer);
    printer--;
  }

  printer--.linebreak ();
  printer.delimiter ('>');
}

void
Valuation::displayEscaped (class StringBuffer& out,
			   bool hide) const
{
  assert (!myError);
  class Printer printer;
  printer.setOutput (&out);
  for (const_iterator v = myValues.begin (); v != myValues.end (); v++) {
    if (hide && v->first->isHidden ())
      continue;
    out.append ('_', 2);
    unsigned i = out.getLength ();
    out.append (v->first->getName ());
    out.escape (i);
    out.append ('_', 2);
    i = out.getLength ();
    v->second->display (printer);
    out.escape (i);
  }
}