Why set doesn t allow duplicates?

docs.oracle.com - The Set Interface - Java™ Tutorials

What are 7 instruments?

The 7 Types of Musical Instruments Children Love to Learn Piano. There's no doubt that the piano is the best musical instrument for kids to learn....

Last updated Sep 30, 2019

Should a keyboard be flat or angled?

Typing with your keyboard on a flat surface is better than angled. Using the keyboard kickstands increases the stress on your wrists and chance of...

Last updated Feb 4, 2020

Join almost HALF A MILLION Happy Students Worldwide

Pianoforall is one of the most popular online piano courses online and has helped over 450,000 students around the world achieve their dream of playing beautiful piano for over a decade.

Learn More »

Promotion

Trail: Collections

Lesson: Interfaces

The Java Tutorials have been written for JDK 8. Examples and practices described in this page don't take advantage of improvements introduced in later releases and might use technology no longer available. See Java Language Changes for a summary of updated language features in Java SE 9 and subsequent releases. See JDK Release Notes for information about new features, enhancements, and removed or deprecated options for all JDK releases.

The Set Interface

A Set is a Collection that cannot contain duplicate elements. It models the mathematical set abstraction. The Set interface contains only methods inherited from Collection and adds the restriction that duplicate elements are prohibited. Set also adds a stronger contract on the behavior of the equals and hashCode operations, allowing Set instances to be compared meaningfully even if their implementation types differ. Two Set instances are equal if they contain the same elements. The Java platform contains three general-purpose Set implementations: HashSet , TreeSet , and LinkedHashSet . HashSet , which stores its elements in a hash table, is the best-performing implementation; however it makes no guarantees concerning the order of iteration. TreeSet , which stores its elements in a red-black tree, orders its elements based on their values; it is substantially slower than HashSet . LinkedHashSet , which is implemented as a hash table with a linked list running through it, orders its elements based on the order in which they were inserted into the set (insertion-order). LinkedHashSet spares its clients from the unspecified, generally chaotic ordering provided by HashSet at a cost that is only slightly higher. Here's a simple but useful Set idiom. Suppose you have a Collection , c , and you want to create another Collection containing the same elements but with all duplicates eliminated. The following one-liner does the trick.

Collection noDups = new HashSet(c);

It works by creating a Set (which, by definition, cannot contain duplicates), initially containing all the elements in c . It uses the standard conversion constructor described in the The Collection Interface section. Or, if using JDK 8 or later, you could easily collect into a Set using aggregate operations:

c.stream() .collect(Collectors.toSet()); // no duplicates

Here's a slightly longer example that accumulates a Collection of names into a TreeSet :

Set set = people.stream() .map(Person::getName) .collect(Collectors.toCollection(TreeSet::new));

And the following is a minor variant of the first idiom that preserves the order of the original collection while removing duplicate elements:

Collection noDups = new LinkedHashSet(c);

The following is a generic method that encapsulates the preceding idiom, returning a Set of the same generic type as the one passed.

public static Set removeDups(Collection c) { return new LinkedHashSet(c); }

Set Interface Basic Operations

The size operation returns the number of elements in the Set (its cardinality). The isEmpty method does exactly what you think it would. The add method adds the specified element to the Set if it is not already present and returns a boolean indicating whether the element was added. Similarly, the remove method removes the specified element from the Set if it is present and returns a boolean indicating whether the element was present. The iterator method returns an Iterator over the Set . The following program prints out all distinct words in its argument list. Two versions of this program are provided. The first uses JDK 8 aggregate operations. The second uses the for-each construct.

What key is pretty when you cry in?

B♭ Minor Pretty When You Cry is written in the key of B♭ Minor.

Last updated May 10, 2021

What is a 7-part rondo?

The 7-part rondo typically has ABACABA form, although other designs exist. A diagram for 7-part Classical form is shown below. 🔗 The refrain (the A...

Last updated Aug 3, 2021

Promotion

Using JDK 8 Aggregate Operations:

import java.util.*; import java.util.stream.*; public class FindDups { public static void main(String[] args) { Set distinctWords = Arrays.asList(args).stream() .collect(Collectors.toSet()); System.out.println(distinctWords.size()+ " distinct words: " + distinctWords); } }

Using the for-each Construct:

import java.util.*; public class FindDups { public static void main(String[] args) { Set s = new HashSet(); for (String a : args) s.add(a); System.out.println(s.size() + " distinct words: " + s); } }

Now run either version of the program.

java FindDups i came i saw i left

The following output is produced:

4 distinct words: [left, came, saw, i]

Note that the code always refers to the Collection by its interface type ( Set ) rather than by its implementation type. This is a strongly recommended programming practice because it gives you the flexibility to change implementations merely by changing the constructor. If either of the variables used to store a collection or the parameters used to pass it around are declared to be of the Collection 's implementation type rather than its interface type, all such variables and parameters must be changed in order to change its implementation type. Furthermore, there's no guarantee that the resulting program will work. If the program uses any nonstandard operations present in the original implementation type but not in the new one, the program will fail. Referring to collections only by their interface prevents you from using any nonstandard operations. The implementation type of the Set in the preceding example is HashSet , which makes no guarantees as to the order of the elements in the Set . If you want the program to print the word list in alphabetical order, merely change the Set 's implementation type from HashSet to TreeSet . Making this trivial one-line change causes the command line in the previous example to generate the following output. java FindDups i came i saw i left 4 distinct words: [came, i, left, saw]

Set Interface Bulk Operations

Bulk operations are particularly well suited to Set s; when applied, they perform standard set-algebraic operations. Suppose s1 and s2 are sets. Here's what bulk operations do: s1.containsAll(s2) returns true if s2 is a subset of s1 . ( s2 is a subset of s1 if set s1 contains all of the elements in s2 .) returns if is a of . ( is a subset of if set contains all of the elements in .) s1.addAll(s2) transforms s1 into the union of s1 and s2 . (The union of two sets is the set containing all of the elements contained in either set.) transforms into the of and . (The union of two sets is the set containing all of the elements contained in either set.) s1.retainAll(s2) transforms s1 into the intersection of s1 and s2 . (The intersection of two sets is the set containing only the elements common to both sets.) transforms into the intersection of and . (The intersection of two sets is the set containing only the elements common to both sets.) s1.removeAll(s2) transforms s1 into the (asymmetric) set difference of s1 and s2 . (For example, the set difference of s1 minus s2 is the set containing all of the elements found in s1 but not in s2 .)

Who is the greatest female guitarist of all time?

1: Sister Rosetta Tharpe Heading this list of the best female guitarists in history, this early gospel artist really did invent a lot of the...

Last updated Oct 24, 2018

Why is the F chord so hard?

One of the reasons the F chord is difficult to play is because it's positioned on the 1st fret of your guitar. A good rule of thumb to remember is...

Last updated Apr 3, 2022

Join almost HALF A MILLION Happy Students Worldwide

Pianoforall is one of the most popular online piano courses online and has helped over 450,000 students around the world achieve their dream of playing beautiful piano for over a decade.

Learn More »

Promotion

To calculate the union, intersection, or set difference of two sets nondestructively (without modifying either set), the caller must copy one set before calling the appropriate bulk operation. The following are the resulting idioms. Set union = new HashSet(s1); union.addAll(s2); Set intersection = new HashSet(s1); intersection.retainAll(s2); Set difference = new HashSet(s1); difference.removeAll(s2); The implementation type of the result Set in the preceding idioms is HashSet , which is, as already mentioned, the best all-around Set implementation in the Java platform. However, any general-purpose Set implementation could be substituted. Let's revisit the FindDups program. Suppose you want to know which words in the argument list occur only once and which occur more than once, but you do not want any duplicates printed out repeatedly. This effect can be achieved by generating two sets one containing every word in the argument list and the other containing only the duplicates. The words that occur only once are the set difference of these two sets, which we know how to compute. Here's how the resulting program looks. import java.util.*; public class FindDups2 { public static void main(String[] args) { Set uniques = new HashSet(); Set dups = new HashSet(); for (String a : args) if (!uniques.add(a)) dups.add(a); // Destructive set-difference uniques.removeAll(dups); System.out.println("Unique words: " + uniques); System.out.println("Duplicate words: " + dups); } } When run with the same argument list used earlier ( i came i saw i left ), the program yields the following output.

Unique words: [left, saw, came] Duplicate words: [i]

A less common set-algebraic operation is the symmetric set difference the set of elements contained in either of two specified sets but not in both. The following code calculates the symmetric set difference of two sets nondestructively. Set symmetricDiff = new HashSet(s1); symmetricDiff.addAll(s2); Set tmp = new HashSet(s1); tmp.retainAll(s2); symmetricDiff.removeAll(tmp);

Set Interface Array Operations

docs.oracle.com - The Set Interface - Java™ Tutorials

Does Beethoven have syphilis?

But mercury was also used to treat a host of other diseases as well, and as Beethoven exhibited virtually no symptoms of syphilis, that diagnosis...

Last updated Oct 11, 2020

How old was Beethoven when he died?

Beethoven first noticed difficulties with his hearing decades earlier, sometime in 1798, when he was about 28. By the time he was 44 or 45, he was...

Last updated Sep 22, 2022

Promotion

How long is the Yousician free trial?

Yes, Yousician offers new users a free trial to their premium services when they first sign up. The free trial lasts for seven days, and you are...

Last updated Sep 22, 2018

Join almost HALF A MILLION Happy Students Worldwide

Pianoforall is one of the most popular online piano courses online and has helped over 450,000 students around the world achieve their dream of playing beautiful piano for over a decade.

Learn More »

Promotion

Should keyboard be flat or raised?

Your keyboard should be at a height that allows your elbows to be bent about 90 degrees and close to your sides. Many keyboards and keyboard trays...

Last updated Jun 7, 2020