Java Programming Ideas

The 11th chapter holds the object

11.1 Generic and type safe containers can be inserted in the Eg:list<string> container the generic class subclass can be placed in
11.2 Basic Concepts
(1) Collection. A sequence of independent elements that obey one or more rules. List must save elements in the order in which they are inserted, and set cannot have duplicate elements
Queue determines the order in which objects are produced by queuing rules
(2) Map. A "key-value pair" object that consists of pairs
11.3 Adding a set of elements
11.4 Printing of containers
ArrayList and LinkedList are list types that save elements in the order in which they are inserted; the ArrayList advantage is random access; The advantage of LinkedList is the insertion and removal of elements
HashSet is inserted according to the hash algorithm; TreeSet saves the object in ascending order of comparison; Linkedhashset saves the object in the sequence that is added
11.5 List

11.6 iterators

11.6.1 Listiterator is a more powerful sub-type of iterator, it can only be used for various list types of access; iterator can only move forward, listiterator
Bidirectional movement.
11.7 LinkedList
11.8 Stack
11.9 set can use set type to eliminate duplicate elements
11.10 Map
11.11 Queue
11.11.1 Priorityqueue
11.12 Collection and iterator
11.13 foreach and iterator
11.13.1 Adapter Method Customary method

12th Chapter

Java Programming Ideas