blob: 11fe669c54a5aa63660723661dfe705205c2cd8b (
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
|
package de.lmu.ifi.dbs.elki.database.ids.integer;
import java.util.Iterator;
import gnu.trove.impl.hash.THashPrimitiveIterator;
import gnu.trove.impl.hash.TIntHash;
import gnu.trove.set.hash.TIntHashSet;
import de.lmu.ifi.dbs.elki.database.ids.DBID;
import de.lmu.ifi.dbs.elki.database.ids.DBIDIter;
import de.lmu.ifi.dbs.elki.database.ids.DBIDs;
import de.lmu.ifi.dbs.elki.database.ids.HashSetModifiableDBIDs;
/*
This file is part of ELKI:
Environment for Developing KDD-Applications Supported by Index-Structures
Copyright (C) 2012
Ludwig-Maximilians-Universität München
Lehr- und Forschungseinheit für Datenbanksysteme
ELKI Development Team
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Affero General Public License as published by
the Free Software Foundation, either version 3 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 Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
/**
* Implementation using GNU Trove Int Hash Sets.
*
* @author Erich Schubert
*
* @apiviz.has IntegerDBID
* @apiviz.has TroveIteratorAdapter
*/
class TroveHashSetModifiableDBIDs implements HashSetModifiableDBIDs {
/**
* The actual store.
*/
TIntHashSet store;
/**
* Constructor.
*
* @param size Initial size
*/
protected TroveHashSetModifiableDBIDs(int size) {
super();
this.store = new TIntHashSet(size);
}
/**
* Constructor.
*/
protected TroveHashSetModifiableDBIDs() {
super();
this.store = new TIntHashSet();
}
/**
* Constructor.
*
* @param existing Existing IDs
*/
protected TroveHashSetModifiableDBIDs(DBIDs existing) {
this(existing.size());
this.addDBIDs(existing);
}
@Override
public DBIDIter iter() {
return new DBIDItr(store);
}
@Override
public boolean addDBIDs(DBIDs ids) {
boolean success = false;
for(DBIDIter iter = ids.iter(); iter.valid(); iter.advance()) {
success |= store.add(iter.getIntegerID());
}
return success;
}
@Override
public boolean removeDBIDs(DBIDs ids) {
boolean success = false;
for(DBID id : ids) {
success |= store.remove(id.getIntegerID());
}
return success;
}
@Override
public boolean add(DBID e) {
return store.add(e.getIntegerID());
}
@Override
public boolean remove(DBID o) {
return store.remove(o.getIntegerID());
}
@Override
public boolean retainAll(DBIDs set) {
boolean modified = false;
Iterator<DBID> it = iterator();
while(it.hasNext()) {
if(!set.contains(it.next())) {
it.remove();
modified = true;
}
}
return modified;
}
@Override
public Iterator<DBID> iterator() {
return new TroveIteratorAdapter(store.iterator());
}
@Override
public int size() {
return store.size();
}
@Override
public boolean isEmpty() {
return store.isEmpty();
}
@Override
public void clear() {
store.clear();
}
@Override
public boolean contains(DBID o) {
return store.contains(o.getIntegerID());
}
/**
* Iterator over trove hashs.
*
* @author Erich Schubert
*
* @apiviz.exclude
*/
protected static class DBIDItr extends THashPrimitiveIterator implements DBIDIter {
/**
* The has we access
*/
private TIntHash hash;
/**
* Constructor.
*
* @param hash Trove hash
*/
public DBIDItr(TIntHash hash) {
super(hash);
this.hash = hash;
this._index = nextIndex(); // Find first element
}
@Override
public boolean valid() {
return _index >= 0;
}
@Override
public void advance() {
this._index = nextIndex();
}
@Override
public int getIntegerID() {
return hash._set[_index];
}
@Override
public DBID getDBID() {
return new IntegerDBID(hash._set[_index]);
}
}
}
|
