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
|
/*-------------------------------------------------------------------------
Compiler Generator Coco/R,
Copyright (c) 1990, 2004 Hanspeter Moessenboeck, University of Linz
extended by M. Loeberbauer & A. Woess, Univ. of Linz
ported to C++ by Csaba Balazs, University of Szeged
with improvements by Pat Terry, Rhodes University
This program 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.
This program 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.
You should have received a copy of the GNU General Public License along
with this program; if not, write to the Free Software Foundation, Inc.,
59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
As an exception, it is allowed to write an extension of Coco/R that is
used as a plugin in non-free software.
If not otherwise stated, any source code generated by Coco/R (other than
Coco/R itself) does not fall under the GNU General Public License.
-------------------------------------------------------------------------*/
#if !defined(COCO_SETS_H__)
#define COCO_SETS_H__
#include "BitArray.h"
namespace Coco {
class Sets {
public:
static int First(BitArray *s) {
int max = s->getCount();
for (int i=0; i<max; i++)
if ((*s)[i]) return i;
return -1;
}
static int Elements(BitArray *s) {
int max = s->getCount();
int n = 0;
for (int i=0; i<max; i++)
if ((*s)[i]) n++;
return n;
}
static bool Equals(BitArray *a, BitArray *b) {
int max = a->getCount();
for (int i=0; i<max; i++)
if ((*a)[i] != (*b)[i]) return false;
return true;
}
static bool Includes(BitArray *a, BitArray *b) { // a > b ?
int max = a->getCount();
for (int i=0; i<max; i++)
if ((*b)[i] && ! (*a)[i]) return false;
return true;
}
static bool Intersect(BitArray *a, BitArray *b) { // a * b != {}
int max = a->getCount();
for (int i=0; i<max; i++)
if ((*a)[i] && (*b)[i]) return true;
return false;
}
static void Subtract(BitArray *a, BitArray *b) { // a = a - b
BitArray *c = b->Clone();
c->Not();
a->And(c);
delete c;
}
};
}; // namespace
#endif // !defined(COCO_SETS_H__)
|
