47 |
idset_contains(idset, 2) == true |
idset_contains(idset, 2) == true |
48 |
idset_contains(idset, 3) == false |
idset_contains(idset, 3) == false |
49 |
|
|
50 |
close_idset(idset) [] |
idset_close(idset) [] |
51 |
*/ |
*/ |
52 |
/* |
/* |
53 |
* Allocate memory for new idset. |
* Allocate memory for new idset. |
100 |
(idset->set[id / CHAR_BIT] & (1 << (id % CHAR_BIT))); |
(idset->set[id / CHAR_BIT] & (1 << (id % CHAR_BIT))); |
101 |
} |
} |
102 |
/* |
/* |
103 |
|
* Return bits of idset. |
104 |
|
* |
105 |
|
* i) idset idset structure |
106 |
|
* r) number of bits |
107 |
|
*/ |
108 |
|
int |
109 |
|
idset_count(idset) |
110 |
|
IDSET *idset; |
111 |
|
{ |
112 |
|
int id, count = 0; |
113 |
|
|
114 |
|
for (id = 0; id < idset->max; id++) |
115 |
|
if (idset->set[id / CHAR_BIT] & (1 << (id % CHAR_BIT))) |
116 |
|
count++; |
117 |
|
return count; |
118 |
|
} |
119 |
|
/* |
120 |
* Free memory for the idset. |
* Free memory for the idset. |
121 |
*/ |
*/ |
122 |
void |
void |