Overview of the Java Base Collection collection map

Overview:

1,jse-collection classification, which mainly explains the subclasses of the collection and map interfaces and their interfaces and related tool classes (no thread-safe collection classes).

2, this section describes the structure of the overall collection framework.

First, about the basic data structure and algorithms related to the Java collection (try to give us some simple references here).

Array, which is inserted in an intermediate position, is inefficient, but is faster to find by position index.
Chain (Linked), in the middle position insertion, removal efficiency, by location index lookup inefficient.
Tree.
Hash.
---------------
Collection (set), unordered, non-repeating original collection.
List, a collection of data items arranged in a certain linear order.
Queue, FIFO (trailing insert, head out) queue collection.
Mapping (map), set of paired mappings for key, value

Second, collection overall structure diagram:

On the implementation of the collection collection framework diagram, red represents each interface, green represents each abstract class, black represents the implementation class.

Each implementation class inherits from an abstract class closest to it and implements an interface closest to him (no connection is marked for inheritance, inheriting and implementing the parent class or interface one by one, as described in the figure).

Third, the map structure: relatively not so complex, the figure represents a structure similar to collection.

Third, Other:

There are only a few tool classes around the Java Collection class. Examples: Iterator (iterators), Randomaccess, Arrays, collections, and so on.

Overview of the Java Base Collection collection map