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
|
#ifndef BIT_VECTOR_INT_SET_H
#define BIT_VECTOR_INT_SET_H
#include "list.h"
#include "slang-math.h"
#include "common.h"
#include "exception.h"
#include <memory.h>
namespace CoreLib
{
namespace Basic
{
class IntSet
{
private:
List<int> buffer;
public:
IntSet()
{}
IntSet(const IntSet & other)
{
buffer = other.buffer;
}
IntSet(IntSet && other)
{
*this = (_Move(other));
}
IntSet & operator = (IntSet && other)
{
buffer = _Move(other.buffer);
return *this;
}
IntSet & operator = (const IntSet & other)
{
buffer = other.buffer;
return *this;
}
int GetHashCode()
{
int rs = 0;
for (auto val : buffer)
rs ^= val;
return rs;
}
IntSet(int maxVal)
{
SetMax(maxVal);
}
int Size() const
{
return buffer.Count()*32;
}
void SetMax(int val)
{
Resize(val);
Clear();
}
void SetAll()
{
for (int i = 0; i<buffer.Count(); i++)
buffer[i] = 0xFFFFFFFF;
}
void Resize(int size)
{
int oldBufferSize = buffer.Count();
buffer.SetSize((size+31)>>5);
if (buffer.Count() > oldBufferSize)
memset(buffer.Buffer()+oldBufferSize, 0, (buffer.Count()-oldBufferSize) * sizeof(int));
}
void Clear()
{
for (int i = 0; i<buffer.Count(); i++)
buffer[i] = 0;
}
void Add(int val)
{
int id = val>>5;
if (id < buffer.Count())
buffer[id] |= (1<<(val&31));
else
{
int oldSize = buffer.Count();
buffer.SetSize(id+1);
memset(buffer.Buffer() + oldSize, 0, (buffer.Count()-oldSize)*sizeof(int));
buffer[id] |= (1<<(val&31));
}
}
void Remove(int val)
{
if ((val>>5) < buffer.Count())
buffer[(val>>5)] &= ~(1<<(val&31));
}
bool Contains(int val) const
{
if ((val>>5) >= buffer.Count())
return false;
return (buffer[(val>>5)] & (1<<(val&31))) != 0;
}
void UnionWith(const IntSet & set)
{
for (int i = 0; i<Math::Min(set.buffer.Count(), buffer.Count()); i++)
{
buffer[i] |= set.buffer[i];
}
if (set.buffer.Count() > buffer.Count())
buffer.AddRange(set.buffer.Buffer()+buffer.Count(), set.buffer.Count()-buffer.Count());
}
bool operator == (const IntSet & set)
{
if (buffer.Count() != set.buffer.Count())
return false;
for (int i = 0; i<buffer.Count(); i++)
if (buffer[i] != set.buffer[i])
return false;
return true;
}
bool operator != (const IntSet & set)
{
return !(*this == set);
}
void IntersectWith(const IntSet & set)
{
if (set.buffer.Count() < buffer.Count())
memset(buffer.Buffer() + set.buffer.Count(), 0, (buffer.Count()-set.buffer.Count())*sizeof(int));
for (int i = 0; i<Math::Min(set.buffer.Count(), buffer.Count()); i++)
{
buffer[i] &= set.buffer[i];
}
}
static void Union(IntSet & rs, const IntSet & set1, const IntSet & set2)
{
rs.buffer.SetSize(Math::Max(set1.buffer.Count(), set2.buffer.Count()));
rs.Clear();
for (int i = 0; i<set1.buffer.Count(); i++)
rs.buffer[i] |= set1.buffer[i];
for (int i = 0; i<set2.buffer.Count(); i++)
rs.buffer[i] |= set2.buffer[i];
}
static void Intersect(IntSet & rs, const IntSet & set1, const IntSet & set2)
{
rs.buffer.SetSize(Math::Min(set1.buffer.Count(), set2.buffer.Count()));
for (int i = 0; i<rs.buffer.Count(); i++)
rs.buffer[i] = set1.buffer[i] & set2.buffer[i];
}
static void Subtract(IntSet & rs, const IntSet & set1, const IntSet & set2)
{
rs.buffer.SetSize(set1.buffer.Count());
for (int i = 0; i<Math::Min(set1.buffer.Count(), set2.buffer.Count()); i++)
rs.buffer[i] = set1.buffer[i] & (~set2.buffer[i]);
}
static bool HasIntersection(const IntSet & set1, const IntSet & set2)
{
for (int i = 0; i<Math::Min(set1.buffer.Count(), set2.buffer.Count()); i++)
{
if (set1.buffer[i] & set2.buffer[i])
return true;
}
return false;
}
};
}
}
#endif
|
