Working with arrays of data and their structuring, searching for correspondences between them, filtering—all of this is the basis of any program written in Java. This is why it is essential for programmers to have tools in their arsenal that make working with this data as easy and structured as possible. This is where collections of Java frameworks come into play. What is the Collections Framework? Collections allow you to manipulate arrays, queues, lists, maps, and other object types. This is a set of different interfaces for working with groups of objects in Java programming. All collections in Java are strictly structured: some interfaces subordinate others, while the latter extends the functionality of their "big brothers" in the hierarchy. The hierarchical structure of the Java Collections Framework is based on the Collection interface, which is the overarching interface. A general collection accommodates all other types of collections and allows you to work with groups of objects thanks to the main methods, which include: add(…); remove(…); clear(…). The Collection interface inherits from Iterable, which means that Because of this, you can get an iterator in Collection that allows you to iterate through other collection interfaces. all collections subordinate to it are iterable regardless of their implementation type. The Collection interface has three primary interfaces: - allows you to work with data sets Set - interacts with lists of data List - works with queue Queue The interface works with key-value data. It's listed separately, and I'll explain later why that's the case. For now, let's go through the main types of collections and find out what each is responsible for. Map The List Interface and its Implementations: ArrayList and LinkedList A list is an ordered collection, most commonly used in the Java Collections Framework. This interface controls where each list item is inserted. When working with List, the user accesses list items by their integer index (position in the list). The List interface has two standard implementations: ArrayList and LinkedList. The point is that you can write other implementations, but the JDK already has two that are available out of the box. ArrayList contains an array whose length will increase automatically when new elements are added to it. The second implementation of the List interface is the LinkedList class. This is a list with two links, where each element contains a link to the preceding and the following elements of the list. They can both add and extract elements from any part of the list. So what's the difference? The main difference between them is the cyclomatic complexity of operations—the number of linearly independent routing points that pass through the program code. The smaller the number of route points each individual command passes through, the faster the program will run. ArrayList and LinkedList are identical; that is, their methods are exactly the same. To illustrate the differences in cyclomatic complexity between the two classes, consider this table: As you can see, the main advantages of the LinkedList class are related to the operations (iterator.remove() and ListIterator.add(E element). Their cyclomatic complexity will always be O(1). In case of add(E element) it is better to use LinkedList, but for get(int index), ArrayList is better. The same applies to the add(int index, E element) operator. The cyclomatic complexity of this operation for LinkedList is lower only if the index itself is zero. For all other cases, it is more reasonable to use ArrayList. The same applies to the remove operation: for the LinkedList class, its cyclomatic complexity will be half as much as for ArrayList. Looking ahead, it is ArrayList that is used in the vast majority of the List interface operations. Interface Set Set is a collection that contains no repeating elements. This interface is designed to model abstractions of a mathematical set. The Set hierarchy includes two interfaces, SortedSet and NavigableSet, and three main classes. I will describe the latter in more detail: is a collection that does not allow storage of identical elements due to the HashMap object it contains. It uses hash tables to store data. HashSet is similar to a HashSet, in which the elements are combined with each other in an ordered list. In this case, the elements are stored in the same order in which they are added (due to the LinkedHashMap object's contents). LinkedHashSet is a collection that uses a value-ordered tree to store items. TreeSet contains , a collection that uses a balanced red-black binary tree to store its elements. Because of this, the add, remove and contains operations in this collection take a guaranteed time equal to log(n). This is TreeSet TreeMap a significant advantage over other implementations of the Set interface. Interface Queue We all don't like queues—who likes wasting their time waiting for something? But you will definitely like queues if you learn how to work with them 🙂 In Java Collections Framework the Queue interface is responsible for working with queues, which has a reasonably simple hierarchy: The queue can order the elements in the queue according to two basic types: Using the Comparator interface obtained in the constructor, which compares the new objects in the queue with the previous ones Using the Comparable interface, which is necessary to arrange elements according to their natural order Interface Map This is a collection designed to handle key-value data. By key, we mean the object we use to retrieve the data it contains. Structurally, Map does not inherit the Iterable collection and has several unique methods that are unique to it. This interface has a class hierarchy similar to Set. Map is implemented using four implementations: HashMap, TreeMap (I wrote about this above), LinkedHashMap, and WeakHashMap: LinkedHashMap extends the functionality of HashMap and can organize the enumeration of elements in the original order. That is, when iterating on the LinkedHashMap method, all objects will be returned in strict order of their addition. WeakHashMap is a class that organizes weak object references with their keys. It is used for dynamic objects. For example, when building systems with garbage collection functions. It is not included in the list of objects to be deleted because it is ignored by the garbage collector when detecting objects it contains. Collections in Java are pretty extensive. They contain a lot of interfaces and implementations, each of which deserves its own article. At the same time, the Java Collections Framework includes all the functionality needed to write multitasking code of any complexity. A proper understanding of the principles of working with collections will remain one of the primary skills for quality Java programming. , a Florida-based software development company, has in its team experienced Java programmers that would be happy to answer your questions regarding Java Collections Framework. NIX United

Different

What Next-Gen Users Expect from Mobile Apps of Tomorrow

17 of the Best Amazon Web Services (AWS) for Web Developers to Learn

More about NIX United software development

Good Code Collector: What You Need to Know About the Java Collections Framework

About Author

Comments

TOPICS

THIS ARTICLE WAS FEATURED IN

Related Stories

17 of the Best Amazon Web Services (AWS) for Web Developers to Learn

3 JavaScript Performance Mistakes You Should Stop Doing

A Simple Introduction to Arrays In JavaScript

Array Filter vs Array Reduce vs For Loop

Arrays in Ruby: Benefits and Costs to Use Them

Arrays vs. Linked Lists: Which Is Better?

17 of the Best Amazon Web Services (AWS) for Web Developers to Learn

3 JavaScript Performance Mistakes You Should Stop Doing

A Simple Introduction to Arrays In JavaScript

Array Filter vs Array Reduce vs For Loop

Arrays in Ruby: Benefits and Costs to Use Them

Arrays vs. Linked Lists: Which Is Better?

Light-Mode

Classic

Newspaper

Minty

Dark-Mode

Neon Noir

Minty

HN StartUps