What are the Java collections?
The collection classes used in the Java API all implement the Collection interface. A class inheritance structure is as follows:
Collection
Collection
Collection
Collection
Collection
Collection
Vector
1) The underlying data structure is an array, which is fast to query and slow to add and delete.
2) Thread-safe and low efficiency
List based on Array actually encapsulates some functions that Array does not have for our use. It cannot fall into the limitations of Array. It is impossible to surpass Array in performance. Therefore, where possible, we should use Array more. Another very important point is that Vector is "sychronized", which is also the only difference between Vector and ArrayList.
ArrayList
1). The underlying data structure is an array, which is fast to search and slow to add and delete.
2). Thread unsafe and high efficiency
Like Vector, it is a linked list based on Array, but the difference is that ArrayList is not synchronized. Therefore, it is superior to Vector in terms of performance, but when running in a multi-threaded environment, you need to manage the synchronization of threads yourself.
LinkedList
1) The underlying data structure is a linked list, which is slow to query and fast to add and delete
2) Thread-unsafe and high efficiency
LinkedList is different from the previous two Lists in that it is not based on Array, so it is not limited by Array performance. Each node (Node) contains two aspects of content:
1. The data of the node itself (data);
2. The information of the next node (nextNode). Therefore, when adding and deleting actions to a LinkedList, there is no need to move a large amount of data like an Array-based List. Just change the relevant information of nextNode and you can achieve it. This is the advantage of LinkedList.
Hashset collection:
1) The underlying data structure is a hash table, which relies on two methods hascode () and equals () method
2) The execution sequence of the two methods:
First determine whether the hascode() values ??are the same
Yes: continue to execute the equals() method and see its return value
Yes true: It means the element is repeated, no
is added. False: Just add the element directly
No: Just add it directly to the collection
Treeset collection:
1) The underlying data structure is a binary tree
Summary:
1. All Lists can only hold a single table composed of objects of different types. , rather than Key-Value key-value pairs. For example: [tom,1,c];
2. All Lists can have the same elements, for example, Vector can have [tom,koo,too,koo];
3 . All lists can have null elements, such as [tom,null,1];
4. Array-based List (Vector, ArrayList) is suitable for query, while LinkedList (linked list) is suitable for addition and deletion operations.
HashSet: Although Set and List both implement the Collection interface, their implementation methods are quite different. List is basically based on Array. But Set is implemented on the basis of HashMap. This is the fundamental difference between Set and List. The storage method of HashSet is to use the Key in HashMap as the corresponding storage item of Set.
php Chinese website, a large number of free Java introductory tutorials, welcome to learn online!
The above is the detailed content of What are java collections. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undress AI Tool
Undress images for free

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

To correctly handle JDBC transactions, you must first turn off the automatic commit mode, then perform multiple operations, and finally commit or rollback according to the results; 1. Call conn.setAutoCommit(false) to start the transaction; 2. Execute multiple SQL operations, such as INSERT and UPDATE; 3. Call conn.commit() if all operations are successful, and call conn.rollback() if an exception occurs to ensure data consistency; at the same time, try-with-resources should be used to manage resources, properly handle exceptions and close connections to avoid connection leakage; in addition, it is recommended to use connection pools and set save points to achieve partial rollback, and keep transactions as short as possible to improve performance.

Use classes in the java.time package to replace the old Date and Calendar classes; 2. Get the current date and time through LocalDate, LocalDateTime and LocalTime; 3. Create a specific date and time using the of() method; 4. Use the plus/minus method to immutably increase and decrease the time; 5. Use ZonedDateTime and ZoneId to process the time zone; 6. Format and parse date strings through DateTimeFormatter; 7. Use Instant to be compatible with the old date types when necessary; date processing in modern Java should give priority to using java.timeAPI, which provides clear, immutable and linear

Pre-formanceTartuptimeMoryusage, Quarkusandmicronautleadduetocompile-Timeprocessingandgraalvsupport, Withquarkusoftenperforminglightbetterine ServerLess scenarios.2.Thyvelopecosyste,

Java's garbage collection (GC) is a mechanism that automatically manages memory, which reduces the risk of memory leakage by reclaiming unreachable objects. 1.GC judges the accessibility of the object from the root object (such as stack variables, active threads, static fields, etc.), and unreachable objects are marked as garbage. 2. Based on the mark-clearing algorithm, mark all reachable objects and clear unmarked objects. 3. Adopt a generational collection strategy: the new generation (Eden, S0, S1) frequently executes MinorGC; the elderly performs less but takes longer to perform MajorGC; Metaspace stores class metadata. 4. JVM provides a variety of GC devices: SerialGC is suitable for small applications; ParallelGC improves throughput; CMS reduces

Networkportsandfirewallsworktogethertoenablecommunicationwhileensuringsecurity.1.Networkportsarevirtualendpointsnumbered0–65535,withwell-knownportslike80(HTTP),443(HTTPS),22(SSH),and25(SMTP)identifyingspecificservices.2.PortsoperateoverTCP(reliable,c

defer is used to perform specified operations before the function returns, such as cleaning resources; parameters are evaluated immediately when defer, and the functions are executed in the order of last-in-first-out (LIFO); 1. Multiple defers are executed in reverse order of declarations; 2. Commonly used for secure cleaning such as file closing; 3. The named return value can be modified; 4. It will be executed even if panic occurs, suitable for recovery; 5. Avoid abuse of defer in loops to prevent resource leakage; correct use can improve code security and readability.

Gradleisthebetterchoiceformostnewprojectsduetoitssuperiorflexibility,performance,andmoderntoolingsupport.1.Gradle’sGroovy/KotlinDSLismoreconciseandexpressivethanMaven’sverboseXML.2.GradleoutperformsMaveninbuildspeedwithincrementalcompilation,buildcac

ExecutorService is suitable for asynchronous execution of independent tasks, such as I/O operations or timing tasks, using thread pool to manage concurrency, submit Runnable or Callable tasks through submit, and obtain results with Future. Pay attention to the risk of unbounded queues and explicitly close the thread pool; 2. The Fork/Join framework is designed for split-and-governance CPU-intensive tasks, based on partitioning and controversy methods and work-stealing algorithms, and realizes recursive splitting of tasks through RecursiveTask or RecursiveAction, which is scheduled and executed by ForkJoinPool. It is suitable for large array summation and sorting scenarios. The split threshold should be set reasonably to avoid overhead; 3. Selection basis: Independent
