Please enable JavaScript.

Coggle requires JavaScript to display documents.

Java Collections Framework - Coggle Diagram

- - - - LinkedHashSet
        
        Ordered
      - Unordered
      - Allow null element
      - Compared methods
        
        equals()
        
        hashCode()
      - Better performance & less memory usage
      - Methods
        
        clone()
        
        spliterator()
    - - Ordered & sorted
      - Not allow null element
      - Compared methods
        
        compare()
        
        compareTo()
      - Lower performance & take more memory usage
      - Methods
        
        first()
        
        last()
        
        lower(E e)
        
        higher(E e)
        
        subSet(E fromElement, E toElement)
        
        headSet(E toElement)
        
        tailSet(E fromElement)
        
        ceiling(E e)
- - - - Not syncrhonized
      - Easy to add or remove middle elements
      - Linked Structure
      - Poor random access performance
      - Compared methods
        
        equals()
        
        hashCode()
      - Methods
        
        addFirst()
        
        addLast()
        
        peek()
        
        clone()
        
        pop()
        
        push()
        
        poll()
    - - Not syncrhonized
      - Dynamic Sizing
      - Easy to add or remove last elements
      - High random access performance
      - Compared methods
        
        equals()
        
        hashCode()
      - Methods
        
        isEmpty()
        
        contains()
    - - Syncrhonized
- - - - LinkedHashMap
        
        Insertion order
      - Allow null key(K) & null value(V)
      - Unordered
      - Methods
        
        putIfAbsent(K key, V value)
        
        replace(K key, V oldValue, V newValue)
        
        replace(K key, V value)
    - - Can not have any null key
      - Maintains the elements in ascending key order
      - The value can be null
      - Methods
        
        higherEntry(K key)
        
        higherKey(K key)
        
        lowerEntry(K key)
        
        lowerKey(K key)
        
        pollFirstEntry()
        
        pollLastEntry()