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
|
// Value base class -*- c++ -*-
#ifdef __GNUC__
# pragma implementation
#endif // __GNUC__
#include "allValues.h"
#include "UnionType.h"
/** @file Value.C
* Abstract base class for 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. */
bool
Value::operator< (const class Value& other) const
{
assert (other.getKind () == getKind ());
switch (getKind ()) {
case vLeaf:
return static_cast<const class LeafValue&>(*this) <
static_cast<const class LeafValue&>(other);
case vStruct:
return static_cast<const class StructValue&>(*this) <
static_cast<const class StructValue&>(other);
case vUnion:
return static_cast<const class UnionValue&>(*this) <
static_cast<const class UnionValue&>(other);
case vVector:
return static_cast<const class VectorValue&>(*this) <
static_cast<const class VectorValue&>(other);
case vBuffer:
return static_cast<const class BufferValue&>(*this) <
static_cast<const class BufferValue&>(other);
}
assert (false);
return false;
}
bool
Value::operator== (const class Value& other) const
{
assert (other.getKind () == getKind ());
switch (getKind ()) {
case vLeaf:
return static_cast<const class LeafValue&>(*this) ==
static_cast<const class LeafValue&>(other);
case vStruct:
return static_cast<const class StructValue&>(*this) ==
static_cast<const class StructValue&>(other);
case vUnion:
return static_cast<const class UnionValue&>(*this) ==
static_cast<const class UnionValue&>(other);
case vVector:
return static_cast<const class VectorValue&>(*this) ==
static_cast<const class VectorValue&>(other);
case vBuffer:
return static_cast<const class BufferValue&>(*this) ==
static_cast<const class BufferValue&>(other);
}
assert (false);
return false;
}
card_t
Value::operator- (const class Value& other) const
{
assert (other.getKind () == getKind ());
assert (!(*this < other));
switch (getKind ()) {
case vLeaf:
return static_cast<const class LeafValue&>(*this) -
static_cast<const class LeafValue&>(other);
case vStruct:
return static_cast<const class StructValue&>(*this) -
static_cast<const class StructValue&>(other);
case vUnion:
return static_cast<const class UnionValue&>(*this) -
static_cast<const class UnionValue&>(other);
case vVector:
return static_cast<const class VectorValue&>(*this) -
static_cast<const class VectorValue&>(other);
case vBuffer:
return static_cast<const class BufferValue&>(*this) -
static_cast<const class BufferValue&>(other);
}
assert (false);
return 0;
}
class Value*
Value::cast (const class Type& type)
{
if (type.getKind () == Type::tUnion)
return static_cast<const class UnionType&>(type).cast (*this);
if (getKind () != vLeaf ||
(type.getKind () == myType->getKind () ||
int_t (static_cast<class LeafValue&>(*this)) >= 0 ||
myType->getKind () != Type::tInt ||
type.getKind () == Type::tInt)) {
setType (type);
if (type.isConstrained (*this))
return this;
}
delete this;
return 0;
}
|
