blob: 9286d6f56b57505b3d86748e173deff1f18e0a0c (
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
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
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
|
//-----------------------------------------------------------------------------
//
// Copyright (C) Microsoft Corporation. All Rights Reserved.
//
//-----------------------------------------------------------------------------
namespace Microsoft.Boogie
{
using System;
using System.IO;
using System.Collections;
using Microsoft.Contracts;
/// <summary>
/// A class representing a mathematical set.
/// </summary>
public class Set : ICloneable, IEnumerable
{
/*[Own]*/ Hashtable! ht;
public Set()
{
ht = new Hashtable();
base();
}
private Set(Hashtable! ht)
{
this.ht = ht;
base();
}
public Set(int capacity)
{
ht = new Hashtable(capacity);
base();
}
public readonly static Set! Empty = new Set();
public void Clear()
{
ht.Clear();
}
/// <summary>
/// This method idempotently adds "o" to the set.
/// In notation:
/// this.SetElements = this.SetElements_old \union {o};
/// </summary>
public void Add(object! o)
{
ht[o] = o;
}
/// <summary>
/// this.SetElements = this.SetElements_old \union s.SetElements;
/// </summary>
public void AddRange(Set! s)
{
foreach (object! o in s)
{
Add(o);
}
}
/// <summary>
/// this.SetElements = this.SetElements_old \setminus {o};
/// </summary>
public void Remove(object! o)
{
ht.Remove(o);
}
/// <summary>
/// this.SetElements = this.SetElements_old \setminus s.SetElements;
/// </summary>
public void RemoveRange(Set! s)
{
if (s == this)
{
ht.Clear();
}
else
{
foreach (object! o in s)
{
ht.Remove(o);
}
}
}
/// <summary>
/// Returns an arbitrary element from the set.
/// </summary>
public object! Choose()
requires Count > 0;
{
IEnumerator iter = GetEnumerator();
iter.MoveNext();
return (!)iter.Current;
}
/// <summary>
/// Picks an arbitrary element from the set, removes it, and returns it.
/// </summary>
public object! Take()
requires Count > 0;
ensures Count == old(Count) - 1;
{
object r = Choose();
Remove(r);
return r;
}
public void Intersect(Set! s)
{
Hashtable h = new Hashtable(ht.Count);
foreach (object! key in ht.Keys)
{
if (s.ht.ContainsKey(key))
{
h.Add(key, key);
}
}
ht = h;
}
/// <summary>
/// The getter returns true iff "o" is in the set.
/// The setter adds the value "o" (for "true") or removes "o" (for "false")
/// </summary>
public bool this[object! o]
{
get
{
return ht.ContainsKey(o);
}
set
{
if (value) {
Add(o);
} else {
Remove(o);
}
}
}
/// <summary>
/// Returns true iff "o" is an element of "this".
/// </summary>
/// <param name="o"></param>
/// <returns></returns>
[Pure]
public bool Contains(object! o)
{
if (!this.ht.ContainsKey(o))
{
return false;
}
return true;
}
/// <summary>
/// Returns true iff every element of "s" is an element of "this", that is, if
/// "s" is a subset of "this".
/// </summary>
/// <param name="s"></param>
/// <returns></returns>
public bool ContainsRange(Set! s)
{
if (s != this)
{
foreach (object! key in s.ht.Keys)
{
if (!this.ht.ContainsKey(key))
{
return false;
}
}
}
return true;
}
public object! Clone()
{
return new Set((Hashtable!)ht.Clone());
}
public virtual int Count
{
get
{
return ht.Count;
}
}
[Pure]
public IEnumerator! GetEnumerator()
{
return ht.Keys.GetEnumerator();
}
[Pure]
public override string! ToString()
{
string s = null;
foreach (object! key in ht.Keys)
{
if (s == null)
{
s = "{";
}
else
{
s += ", ";
}
s += key.ToString();
}
if (s == null)
{
return "{}";
}
else
{
return s + "}";
}
}
public bool AddAll(IEnumerable! objs){
foreach (object! o in objs){
this.Add(o);
}
return true;
}
//----------------------------- Static Methods ---------------------------------
// Functional Intersect
public static Set! Intersect(Set! a, Set! b)
// ensures Forall{ object x in result; a[x] && b[x] };
{
Set! res = (Set!) a.Clone();
res.Intersect(b);
return res;
}
// Functional Union
public static Set! Union(Set! a, Set! b)
// ensures Forall{ object x in result; a[x] || b[x] };
{
Set! res = (Set!) a.Clone();
res.AddRange(b);
return res;
}
public delegate bool SetFilter(object! obj);
public static Set! Filter(Set! a, SetFilter! filter)
{
Set inter = new Set();
foreach(object! elem in a)
{
if (filter(elem))
{
inter.Add(elem);
}
}
return inter;
}
}
public interface IWorkList: ICollection
{
bool Add(object o);
bool AddAll(IEnumerable objs);
bool IsEmpty();
object Pull();
}
}
|
