Java Collection Framework (JCF)


Type ImplemenetaionDescriptionExplore!
ArraysArrays
The array is a container which hold the same type of objects and primitive types with fixed length.
Explain Me
DequeArrayDeque
Array deque is a resizable array with the implementation of a doubly ended queue. Most ArrayDeque operations run in amortized constant time.
Explain Me
LinkedBlockingDeque
The LinkedBlockingDeque is a doubly ended queue which will block if a thread attempts to take elements out of it while it is empty. Most operations run in constant time.
Explain Me
LinkedList
Linked list is a Doubly-linked list implementation. Linked list is a data structure consisting of a group of nodes which together represent a sequence which each node link with previous and next node.
Explain Me
ListArrayList
ArrayList is a resizable array implementation of the ordered collection.
Explain Me
CopyOnWriteArrayList
Thread safe variant of ArrayList in which all the operations are implemented by making the new copy of array. CopyOnWriteArrayList is very expensive because it involves costly due to Array copy and it's very efficient if you have a List where Iteration outnumber mutation and do not throw concurrent modification Exception.
Explain Me
LinkedList
Linked list is a Doubly-linked list implementation. Linked list is a data structure consisting of a group of nodes which together represent a sequence which each node link with previous and next node.
Explain Me
Stack
The Stack class represents a last-in-first-out (LIFO) stack of objects. It extends Vector class.
Explain Me
Vector
Vector is a dynamic array which contains the elements that can be accessed using the index. Vector is a legacy class which support synchronization.
Explain Me
MapConcurrentHashMap
A hash table supporting full concurrency of retrievals and adjustable expected concurrency for updates from multiple threads. Iterators are designed to be used by only one thread at a time. ConcurrentHashMap does not guarantee the runtime of its operations as part of its contract. It also allows tuning for certain load factors.
Explain Me
ConcurrentSkipListMap
ConcurrentSkipListMap is a scalable concurrent class which uses concurrent variant of SkipLists. It do not throw ConcurrentModificationException and support execute the operations safely from multiple threads. ConcurrentSkipListMap guarantees average O(log(n)) performance on a wide variety of operations.
Explain Me
HashMap
Hashmap class uses hash table based implementation of the Map interface. It is roughly equivalent to Hashtable, except that it is unsynchronized and permits nulls.
Explain Me
Hashtable
Hashtable is a class which stores the keys and values. All the methods in the hash table are synchronized and thread safe. Hashtable implemented Dictionary which is obsolete now and Oracle recommends to implement the Map interface.
Explain Me
LinkedHashMap
LinkedHashMap is a Hash table and linked list implementation of the Map interface which will maintain the insertion order. It stores the insertion order using doubly linked list which will take more memory compare than the hash map.
Explain Me
Properties
Properties are configuration values managed as key/value pairs. the keys are not duplicated and used for retrieving the values from properties. The Properties can be saved to a stream or loaded from a stream. Each key and its corresponding value in the property list is a string.
Explain Me
TreeMap
Treemap is red black tree based tree which sort the elements according to the natural ordering or comparator interface implementation class.
Explain Me
WeakHashMap
Weakhashmap keys garbage collected automatically when its key is no longer referenced outside of the WeakHashMap. When a key has been discarded its entry is effectively removed from the map. It useful for creating the caches/lookup storage.
Explain Me
setConcurrentSkipListSet
A scalable concurrent NavigableSet implementation based on a ConcurrentSkipListMap. The elements of the set are kept sorted according to their natural ordering, or by a Comparator provided at set creation time, depending on which constructor is used.
Explain Me
CopyOnWriteArraySet
A Set that uses an internal CopyOnWriteArrayList for all of its operations.It is useful when the list share the data structure among several threads and have few writes and many reads.
Explain Me
EnumSet
An EnumSet is a Set which contains enum instance of a specific enum type, in a more efficient way than other Set implementations.
Explain Me
HashSet
HashSet is the implementation of Set Interface which does not allow duplicate value. This does not provide any guarantees for insertion order.
Explain Me
LinkedHashSet
A LinkedHashSet is an ordered version of HashSet that maintains a doubly-linked List across all elements and maintains insertion order. it provides constant-time performance for the basic operations.
Explain Me
TreeSet
TreeSet is implemented using a red-black tree structure. The elements are ordered using their natural ordering, or by a Comparator provided at set creation time, depending on which constructor is used.
Explain Me