XWiki

Wiki code for JavaCollections

1: <style type="text/css">
2: .collTables {
3:     font-size: 70%;
4: }
5: </style>
6: 
7: <div class="collTables">
8: <table>
9:     <tr>
10:         <th>
11:         <th>containsKey
12:         <th>get
13:         <th>put
14:         <th>add
15:         <th>remove
16:         <th>size
17:         <th>iteration
18:         <th>bytes per node
19:     </tr>
20:     <tr>
21:         <th>ConcurrentHashMap
22:     	<td>1
23:     	<td>1
24:     	<td>1
25:     	<td> 
26:     	<td>1
27:     	<td>1
28:     	<td>n (of capacity, not size)
29:         <td>
30:     </tr>
31:     <tr>
32:         <th>ConcurrentSkipListMap
33:         <td>log(n)
34:         <td>log(n)
35:         <td>log(n)
36:         <td>
37:         <td>log(n)
38:         <td>n
39:         <td>n
40:         <td>
41:     </tr>
42:     <tr>
43:         <th>EnumMap
44:     	<td>
45:     	<td>
46:     	<td>
47:     	<td>
48:     	<td>
49:     	<td>
50:     	<td>
51:         <td>
52:     </tr>
53:     <tr>
54:         <th>HashMap
55:     	<td>1
56:     	<td>1
57:     	<td>1
58:     	<td> 
59:     	<td>1
60:     	<td>1
61:     	<td>n (of capacity, not size)
62:         <td>16=3*ref + int
63:     </tr>
64:     <tr>
65:         <th>Hashtable
66:     	<td colspan="8">All accesses are synchronized. Use HashMap or ConcurrentHashMap instead.
67:     </tr>
68:     <tr>
69:         <th>IdentityHashMap
70:     	<td>
71:     	<td>
72:     	<td>
73:     	<td>
74:     	<td>
75:     	<td>
76:         <td>
77:     	<td>
78:     </tr>
79:     <tr>
80:         <th>LinkedHashMap
81:     	<td>1
82:     	<td>1
83:     	<td>1
84:     	<td> 
85:     	<td>1
86:     	<td>1
87:     	<td>n (of size, not capacity)
88:         <td>
89:     </tr>
90:     <tr>
91:         <th>TreeMap
92:     	<td>log(n)
93:     	<td>log(n)
94:     	<td>log(n)
95:     	<td> 
96:     	<td>log(n)
97:     	<td>1
98:     	<td>n
99:         <td>
100:     </tr>
101:     <tr>
102:         <th>WeakHashMap
103:     	<td>
104:     	<td>
105:     	<td>
106:     	<td>
107:     	<td>
108:     	<td>
109:     	<td>
110:         <td>
111:     </tr>
112: </table>
113: 
114: 
115: 
116: <table>
117:     <tr>
118:         <th>
119:         <th>contains
120:         <th>get
121:         <th>set(i,e)<br/>add(i,e)
122:         <th>add(e)
123:         <th>remove
124:         <th>size
125:         <th>iteration
126:         <th>bytes per node
127:     </tr>
128:     <tr>
129:         <th>ArrayBlockingQueue
130:         <td>
131:     	<td>
132:     	<td>
133:     	<td>
134:     	<td>
135:     	<td>
136:     	<td>
137:     	<td>
138:     </tr>
139:     <tr>
140:         <th>ArrayDeque
141:     	<td>
142:     	<td>
143:     	<td>
144:     	<td>
145:     	<td>
146:     	<td>
147:         <td>
148:     	<td>
149:     </tr>
150:     <tr>
151:         <th>ArrayList
152:     	<td>n
153:     	<td>1
154:     	<td>1 (n if resizing)
155:     	<td>1 (n if resizing)
156:     	<td>n
157:     	<td>1
158:     	<td>n
159:     	<td>0
160:     </tr>
161:     <tr>
162:         <th>ConcurrentLinkedQueue
163:     	<td>
164:     	<td>
165:     	<td>
166:     	<td>
167:     	<td>
168:     	<td>
169:         <td>
170:     	<td>
171:     </tr>
172:     <tr>
173:         <th>ConcurrentSkipListSet
174:     	<td>
175:     	<td>
176:     	<td>
177:     	<td>
178:     	<td>
179:     	<td>
180:         <td>
181:     	<td>
182:     </tr>
183:     <tr>
184:         <th>CopyOnWriteArrayList
185:     	<td>
186:     	<td>
187:     	<td>
188:     	<td>
189:     	<td>
190:     	<td>
191:         <td>
192:     	<td>
193:     </tr>
194:     <tr>
195:         <th>CopyOnWriteArraySet
196:     	<td>
197:     	<td>
198:     	<td>
199:     	<td>
200:     	<td>
201:     	<td>
202:         <td>
203:     	<td>
204:     </tr>
205:     <tr>
206:         <th>DelayQueue
207:     	<td>
208:     	<td>
209:     	<td>
210:     	<td>
211:     	<td>
212:     	<td>
213:         <td>
214:     	<td>
215:     </tr>
216:     <tr>
217:         <th>EnumSet
218:     	<td>
219:     	<td>
220:     	<td>
221:     	<td>
222:     	<td>
223:     	<td>
224:         <td>
225:     	<td>
226:     </tr>
227:     <tr>
228:         <th>HashSet<br/>(based on HashMap)
229:     	<td>1
230:     	<td>1
231:     	<td>1
232:     	<td> 
233:     	<td>1
234:     	<td>1
235:     	<td>n (of capacity, not size)
236:         <td>16=3*ref + int
237:     </tr>
238:     <tr>
239:         <th>LinkedBlockingDeque
240:     	<td>
241:     	<td>
242:     	<td>
243:     	<td>
244:     	<td>
245:     	<td>
246:         <td>
247:     	<td>
248:     </tr>
249:     <tr>
250:         <th>LinkedBlockingQueue
251:     	<td>
252:     	<td>
253:     	<td>
254:     	<td>
255:     	<td>
256:     	<td>
257:         <td>
258:     	<td>
259:     </tr>
260:     <tr>
261:         <th>LinkedHashSet
262:     	<td>
263:     	<td>
264:     	<td>
265:     	<td>
266:     	<td>
267:         <td>
268:     	<td>
269:     	<td>
270:     </tr>
271:     <tr>
272:         <th>LinkedList
273:     	<td>n
274:     	<td>n
275:     	<td>n
276:     	<td>1
277:     	<td>n (removal is 1 at\\either end of\\the list)
278:     	<td>1
279:     	<td>n
280:         <td>12 = 3*ref
281:     </tr>
282:     <tr>
283:         <th>PriorityBlockingQueue
284:     	<td>
285:     	<td>
286:     	<td>
287:     	<td>
288:     	<td>
289:         <td>
290:     	<td>
291:     	<td>
292:     </tr>
293:     <tr>
294:         <th>PriorityQueue
295:     	<td>
296:     	<td>
297:     	<td>
298:     	<td>
299:         <td>
300:     	<td>
301:     	<td>
302:     	<td>
303:     </tr>
304:     <tr>
305:         <th>Stack
306:     	<td colspan="8">Extends Vector. Use ArrayDeque instead.
307:     </tr>
308:     <tr>
309:         <th>SynchronousQueue
310:     	<td>
311:     	<td>
312:     	<td>
313:     	<td>
314:         <td>
315:     	<td>
316:     	<td>
317:     	<td>
318:     </tr>
319:     <tr>
320:         <th>TreeSet
321:     	<td>log(n)
322:     	<td>log(n)
323:     	<td>log(n)
324:     	<td>log(n)
325:     	<td>log(n)
326:     	<td>1
327:     	<td>n
328:         <td>
329:     </tr>
330:     <tr>
331:         <th>Vector
332:     	<td colspan="8">All accesses are synchronized. Use ArrayList instead.
333:     </tr>
334: </table>
335: </div>
336:
JavaCollections

Top Menu

Wiki code for JavaCollections

Search

Halloween Costumes

My Projects

My Interests

My Stuff

Programming

Backlinks

Navigation

Blog

Main

Photos

Sandbox

Scheduler

Stats
