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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
|
/*
* Copyright (C) 2009, Google Inc.
* Copyright (C) 2008, Marek Zawirski <marek.zawirski@gmail.com>
* Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org> and others
*
* This program and the accompanying materials are made available under the
* terms of the Eclipse Distribution License v. 1.0 which is available at
* https://www.eclipse.org/org/documents/edl-v10.php.
*
* SPDX-License-Identifier: BSD-3-Clause
*/
package org.eclipse.jgit.lib;
import java.util.Iterator;
import java.util.NoSuchElementException;
/**
* Fast, efficient map specifically for {@link org.eclipse.jgit.lib.ObjectId}
* subclasses.
* <p>
* This map provides an efficient translation from any ObjectId instance to a
* cached subclass of ObjectId that has the same value.
* <p>
* If object instances are stored in only one map,
* {@link org.eclipse.jgit.lib.ObjectIdOwnerMap} is a more efficient
* implementation.
*
* @param <V>
* type of subclass of ObjectId that will be stored in the map.
*/
public class ObjectIdSubclassMap<V extends ObjectId>
implements Iterable<V>, ObjectIdSet {
private static final int INITIAL_TABLE_SIZE = 2048;
int size;
private int grow;
private int mask;
V[] table;
/**
* Create an empty map.
*/
public ObjectIdSubclassMap() {
initTable(INITIAL_TABLE_SIZE);
}
/**
* Remove all entries from this map.
*/
public void clear() {
size = 0;
initTable(INITIAL_TABLE_SIZE);
}
/**
* Lookup an existing mapping.
*
* @param toFind
* the object identifier to find.
* @return the instance mapped to toFind, or null if no mapping exists.
*/
public V get(AnyObjectId toFind) {
final int msk = mask;
int i = toFind.w1 & msk;
final V[] tbl = table;
V obj;
while ((obj = tbl[i]) != null) {
if (AnyObjectId.isEqual(obj, toFind)) {
return obj;
}
i = (i + 1) & msk;
}
return null;
}
/**
* {@inheritDoc}
* <p>
* Returns true if this map contains the specified object.
*/
@Override
public boolean contains(AnyObjectId toFind) {
return get(toFind) != null;
}
/**
* Store an object for future lookup.
* <p>
* An existing mapping for <b>must not</b> be in this map. Callers must
* first call {@link #get(AnyObjectId)} to verify there is no current
* mapping prior to adding a new mapping, or use
* {@link #addIfAbsent(ObjectId)}.
*
* @param newValue
* the object to store.
*/
public <Q extends V> void add(Q newValue) {
if (++size == grow)
grow();
insert(newValue);
}
/**
* Store an object for future lookup.
* <p>
* Stores {@code newValue}, but only if there is not already an object for
* the same object name. Callers can tell if the value is new by checking
* the return value with reference equality:
*
* <pre>
* V obj = ...;
* boolean wasNew = map.addIfAbsent(obj) == obj;
* </pre>
*
* @param newValue
* the object to store.
* @return {@code newValue} if stored, or the prior value already stored and
* that would have been returned had the caller used
* {@code get(newValue)} first.
*/
public <Q extends V> V addIfAbsent(Q newValue) {
final int msk = mask;
int i = newValue.w1 & msk;
final V[] tbl = table;
V obj;
while ((obj = tbl[i]) != null) {
if (AnyObjectId.isEqual(obj, newValue))
return obj;
i = (i + 1) & msk;
}
if (++size == grow) {
grow();
insert(newValue);
} else {
tbl[i] = newValue;
}
return newValue;
}
/**
* Get number of objects in map
*
* @return number of objects in map
*/
public int size() {
return size;
}
/**
* Whether {@link #size()} is 0.
*
* @return true if {@link #size()} is 0.
*/
public boolean isEmpty() {
return size == 0;
}
/** {@inheritDoc} */
@Override
public Iterator<V> iterator() {
return new Iterator<>() {
private int found;
private int i;
@Override
public boolean hasNext() {
return found < size;
}
@Override
public V next() {
while (i < table.length) {
final V v = table[i++];
if (v != null) {
found++;
return v;
}
}
throw new NoSuchElementException();
}
@Override
public void remove() {
throw new UnsupportedOperationException();
}
};
}
private void insert(V newValue) {
final int msk = mask;
int j = newValue.w1 & msk;
final V[] tbl = table;
while (tbl[j] != null)
j = (j + 1) & msk;
tbl[j] = newValue;
}
private void grow() {
final V[] oldTable = table;
final int oldSize = table.length;
initTable(oldSize << 1);
for (int i = 0; i < oldSize; i++) {
final V obj = oldTable[i];
if (obj != null)
insert(obj);
}
}
private void initTable(int sz) {
grow = sz >> 1;
mask = sz - 1;
table = createArray(sz);
}
@SuppressWarnings("unchecked")
private final V[] createArray(int sz) {
return (V[]) new ObjectId[sz];
}
}
|
