XWiki

Wiki code for JavaCollections

<style type="text/css">
.collTables {
    font-size: 70%;
}
</style>

<div class="collTables">
<table>
    <tr>
        <th>
        <th>containsKey
        <th>get
        <th>put
        <th>add
        <th>remove
        <th>size
        <th>iteration
        <th>bytes per node
    </tr>
    <tr>
        <th>ConcurrentHashMap
    	<td>1
    	<td>1
    	<td>1
    	<td> 
    	<td>1
    	<td>1
    	<td>n (of capacity, not size)
        <td>
    </tr>
    <tr>
        <th>ConcurrentSkipListMap
        <td>log(n)
        <td>log(n)
        <td>log(n)
        <td>
        <td>log(n)
        <td>n
        <td>n
        <td>
    </tr>
    <tr>
        <th>EnumMap
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    </tr>
    <tr>
        <th>HashMap
    	<td>1
    	<td>1
    	<td>1
    	<td> 
    	<td>1
    	<td>1
    	<td>n (of capacity, not size)
        <td>16=3*ref + int
    </tr>
    <tr>
        <th>Hashtable
    	<td colspan="8">All accesses are synchronized. Use HashMap or ConcurrentHashMap instead.
    </tr>
    <tr>
        <th>IdentityHashMap
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    </tr>
    <tr>
        <th>LinkedHashMap
    	<td>1
    	<td>1
    	<td>1
    	<td> 
    	<td>1
    	<td>1
    	<td>n (of size, not capacity)
        <td>
    </tr>
    <tr>
        <th>TreeMap
    	<td>log(n)
    	<td>log(n)
    	<td>log(n)
    	<td> 
    	<td>log(n)
    	<td>1
    	<td>n
        <td>
    </tr>
    <tr>
        <th>WeakHashMap
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    </tr>
</table>



<table>
    <tr>
        <th>
        <th>contains
        <th>get
        <th>set(i,e)<br/>add(i,e)
        <th>add(e)
        <th>remove
        <th>size
        <th>iteration
        <th>bytes per node
    </tr>
    <tr>
        <th>ArrayBlockingQueue
        <td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    </tr>
    <tr>
        <th>ArrayDeque
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    </tr>
    <tr>
        <th>ArrayList
    	<td>n
    	<td>1
    	<td>1 (n if resizing)
    	<td>1 (n if resizing)
    	<td>n
    	<td>1
    	<td>n
    	<td>0
    </tr>
    <tr>
        <th>ConcurrentLinkedQueue
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    </tr>
    <tr>
        <th>ConcurrentSkipListSet
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    </tr>
    <tr>
        <th>CopyOnWriteArrayList
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    </tr>
    <tr>
        <th>CopyOnWriteArraySet
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    </tr>
    <tr>
        <th>DelayQueue
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    </tr>
    <tr>
        <th>EnumSet
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    </tr>
    <tr>
        <th>HashSet<br/>(based on HashMap)
    	<td>1
    	<td>1
    	<td>1
    	<td> 
    	<td>1
    	<td>1
    	<td>n (of capacity, not size)
        <td>16=3*ref + int
    </tr>
    <tr>
        <th>LinkedBlockingDeque
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    </tr>
    <tr>
        <th>LinkedBlockingQueue
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    </tr>
    <tr>
        <th>LinkedHashSet
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    	<td>
    </tr>
    <tr>
        <th>LinkedList
    	<td>n
    	<td>n
    	<td>n
    	<td>1
    	<td>n (removal is 1 at\\either end of\\the list)
    	<td>1
    	<td>n
        <td>12 = 3*ref
    </tr>
    <tr>
        <th>PriorityBlockingQueue
    	<td>
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    	<td>
    </tr>
    <tr>
        <th>PriorityQueue
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    	<td>
    	<td>
    </tr>
    <tr>
        <th>Stack
    	<td colspan="8">Extends Vector. Use ArrayDeque instead.
    </tr>
    <tr>
        <th>SynchronousQueue
    	<td>
    	<td>
    	<td>
    	<td>
        <td>
    	<td>
    	<td>
    	<td>
    </tr>
    <tr>
        <th>TreeSet
    	<td>log(n)
    	<td>log(n)
    	<td>log(n)
    	<td>log(n)
    	<td>log(n)
    	<td>1
    	<td>n
        <td>
    </tr>
    <tr>
        <th>Vector
    	<td colspan="8">All accesses are synchronized. Use ArrayList instead.
    </tr>
</table>
</div>
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
