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
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* 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
* of the License, 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
/*
* This code is based on Labyrinth of Time code with assistance of
*
* Copyright (c) 1993 Terra Nova Development
* Copyright (c) 2004 The Wyrmkeep Entertainment Co.
*
*/
#include "lab/stddefines.h"
#include "lab/labfun.h"
#include "lab/storage.h"
namespace Lab {
const uint32 LargeSetSIZE = sizeof(LargeSetRecord) - 2;
/*****************************************************************************/
/* Creates a large set. */
/*****************************************************************************/
bool createSet(LargeSet *set, uint16 last) {
last = (((last + 15) >> 4) << 4);
if (allocate((void **) set, (last >> 3) + LargeSetSIZE)) {
(*set)->lastElement = last;
return true;
} else /* Not Enough Memory! */
return false;
}
/*****************************************************************************/
/* Deletes a large set. */
/*****************************************************************************/
void deleteSet(LargeSet set) {
if (set != NULL)
deallocate(set, (set->lastElement >> 3) + LargeSetSIZE);
}
/*****************************************************************************/
/* Tests if an element is in the set. */
/*****************************************************************************/
bool In(LargeSet set, uint16 element) {
return ((1 << ((element - 1) % 16)) & (set->array[(element - 1) >> 4])) > 0;
}
/*****************************************************************************/
/* Sets an element in the Large set. */
/*****************************************************************************/
void inclElement(LargeSet set, uint16 element) {
INCL((set->array[(element - 1) >> 4]), (1 << ((element - 1) % 16)));
}
/*****************************************************************************/
/* Removes an element in the Large set. */
/*****************************************************************************/
void exclElement(LargeSet set, uint16 element) {
EXCL((set->array[(element - 1) >> 4]), (1 << ((element - 1) % 16)));
}
} // End of namespace Lab
|
