java collections

Collections means the process of which the objects are handled by your program.

We use FindElements here to return a collection of anchor tags.

The java.lang.IndexOutOfBoundsException is an exception class in Java that is thrown when an index used to access an array, list, or other collection is either negative or greater than or equal to the size of the collection. This usually indicates an attempt to access an element at an invalid index that does not exist in the collection.

The Treemap is a component of the Java Collections Framework that implements the SortedMap interface. It keeps its elements ordered according to the natural ordering of keys or a defined comparator.

HashMap is a component of the Java Collections Framework that implements the Map interface. It offers a key-value pair data structure in which elements are stored as a combination of keys and their corresponding values. HashMap does not support duplicate keys, but it does support mapping multiple values to the same key. It provides constant-time performance for simple operations like as element addition, removal, and retrieval.

TreeSet is a Java Collections Framework class that implements the SortedSet interface. It returns a set that is sorted in natural order or by a provided comparator. TreeSet, unlike HashSet, does not allow duplicate elements and delivers fast performance for simple operations like adding, removing, and searching for elements.

The Java Collections Framework's LinkedHashSet is an implementation of the Set interface. It combines the advantages of LinkedList and HashSet. The order in which the elements were added to the set is the iteration order that the LinkedHashSet preserves. It offers constant-time performance for fundamental operations and disallows duplicate elements, just like HashSet.

HashSet is a Java Collections Framework class that implements the Set interface. It gives a collection with no duplicate elements and no set order for its elements. HashSet is built on a hash table data structure, which allows it to add, remove, and search for elements in constant time (O(1)).

A dynamic array implementation that is a part of the Java Collections Framework is the Vector class in Java. It offers a resizable array that can expand or contract as necessary. Similar to ArrayLists, vectors are thread-safe for use in multi-threaded situations since they are synchronised.

In Java, the LinkedList class implements the List interface and provides a doubly-linked list data structure. It provides a versatile means of storing and manipulating a collection of items. A LinkedList, unlike an ArrayList, uses references to connect components rather than contiguous memory allocation.

In Java, the ArrayList class implements the List interface as a resizable array. It offers dynamic arrays that can expand or contract in size as needed. ArrayLists are a component of the Java Collections Framework and provide a variety of methods for modifying the elements contained in them.

The String Joiner class in Java makes it easy to connect several strings with a defined delimiter. It is very useful for concatenating strings in a loop or dealing with string collections.