SortedSet addAll() method in Java with Examples

A SortedSet's addAll() method preserves the set's uniqueness and order by adding every element from a given collection. All of the elements from the specified collection are appended to the current set using the addAll(Collection C) function. There is no set order in which the elements are inserted; they are added at random. Technically, when addAll() is called, the add() function is used to iterate through the elements of the supplied collection and add each one to the set one at a time. The insertion operation maintains the items' natural order or custom comparator-defined order since SortedSet implementations, such as TreeSet, depend on a self-balancing binary search tree. Furthermore, as a set does not permit duplicates, duplicate elements in the collection are immediately ignored.

Syntax:

Parameters: The collection of any kind that is to be added to the set is the parameter C.

Return Value: If the elements of the collection C are successfully appended to this Set, the process returns true; if not, it returns False.

Example 1:

The code shows how to use the addAll() method with a SortedSet that has been converted to a TreeSet. The TreeSet precludes duplication and guarantees that the components in the set are arranged in their lexicographical order, which is the set's natural order for strings. The addAll() method is used in this example to combine all of the members of set2 into set1 after two sets (set1 and set2) have been established. To keep the set unique, duplicate items like "World" are ignored. After the combination, the merged set is still sorted and contains every unique element from both sets. The sorted and unique attributes of a SortedSet are preserved while sets are efficiently combined using the addAll() method, as demonstrated by this code.

Implementation:

Output:

 The initial Set is given by: [TpointTech, TreeSet, Welcome, World, the, to] The Set after applying addAll() method: [Hello, TpointTech, TreeSet, Welcome, World, the, to] 

Example 2:

The following example stores elements in a sorted way without duplicates using a SortedSet (implemented by TreeSet). We can include aspects from another collection (an ArrayList) in the set by using the addAll() method. All of the elements are entered in the proper sorted order when addAll() is called. SortedSet ensures uniqueness; therefore, duplicates between the set and the collection being added are avoided. The set's parts are consistently kept in ascending order thanks to the TreeSet. The code shows how addAll() facilitates the effective merging of another collection into the set while maintaining uniqueness and sorting.

Implementation:

Output:

 The initial Set is given by: [TpointTech, TreeSet, Welcome, World, the, to] The Set after applying addAll() method: [Hello, TpointTech, TreeSet, Welcome, Welcome!!!!, World, the, to]