In Java, there are a number of data types that are used to store values. Each data type stores values in a different way, and offers a range of methods which can be used to manipulate the stored values. For instance, numbers can be manipulated using mathematical functions in Java.
<\/p>\n\n\n\n
HashSet is a data type in Java that is used to create a mathematical set. HashSet is part of the Java Collections framework and allows you to store data using the hash table data type.
<\/p>\n\n\n\n
This tutorial will discuss the basics of the Java HashSet class and how it can be used. We will also walk through the main methods offered by HashSet to retrieve and manipulate the data stored within a set.
<\/p>\n\n\n\n
Sets are Java Collections that cannot contain duplicate elements. Whereas a list can contain the same value multiple times, sets can only contain a specific value once.
<\/p>\n\n\n\n
Sets can be useful in a wide range of situations. For instance, if you are creating a program for a local coffee shop that stores the phone numbers of their loyalty customers, you would only want the same phone number to appear once on the list.
<\/p>\n\n\n\n
In Java, the Set type is an interface, and so to utilize it, we have to use one of the classes associated with the data type. The HashSet class implements the Set data type and is used to create a set that uses the hash table data structure.
<\/p>\n\n\n\n
Before we can start working with HashSets, we have to import the HashSet package into our code. Here\u2019s the code we can use to import HashSet into our code:
<\/p>\n\n\n\n
Now we have imported HashSet, we can start working with the data type. Here is the syntax you can use to create a Java HashSet: The main components of a HashSet are as follows: Suppose we want to create a HashSet that stores the list of fruits sold at our fruit stand. We could do so using the following code: In our code, we have created a HashSet called The add() method adds a specified element to a HashSet in Java. Suppose we wanted to add the values When we run our code, the following response is returned: Let\u2019s break down our code. First, we import the HashSet class from Then we use the add() method to add three values to our The remove() method can be used to remove an item from a HashSet. Suppose that our fruit stand has decided to stop selling mango due to a lack of demand. As a result, we want to remove the Our code returns: Our code has removed Additionally, the removeAll() method is used to remove all the elements from a set. So, if we decided that we wanted to start from scratch and build a new list of fruits, we could use removeAll() to delete all the items in our set. Here\u2019s the code we could use to remove all the items in our \u201cfruits\u201d HashSet: Our code returns an empty hash set: Unlike Java arrays, Sets are not indexed. So, if we want to access the values in our set, we need to use the iterator() method and iterate through each value. iterator() is part of the \u201cjava.util.Iterator\u201d package, so we\u2019ll have to import the Iterator package before we can use the iterator() method. Here\u2019s a program we could use to iterate through every fruit in our Our code returns: In our code, we first import the HashSet and Iterator libraries from On the next line, we initialize an iterator, which allows us to iterate through every element in our HashSet. Then we create a while loop that goes through every item in the The HashSet class is a Set, and so the class can access the various set operations offered by the Set data type. There are four main set operations that can be used with the HashSet class: union, intersection, subset, and difference. Let\u2019s walk through how each of these methods works individually. The addAll() method can be used to perform a union between two sets. In other words, addAll() allows you to merge the contents of two sets together. Suppose we have been storing our fruits in two hash sets. The first hash set, We can merge our two sets by using the following code: The addAll() method returns: As you can see, our code has merged our The intersection is used to find common values in two data sets. We can use retainAll() to perform an intersection on two data sets. Suppose we have our lists of Our code returns: Instead of using addAll(), we use retainAll() to perform an intersection. As you can see, because there are no common values between our The containsAll() method is used to check whether a set is a subset of another set. In other words, containsAll() checks whether a set contains only values from another set. Suppose we wanted to check whether our Our code returns: false. The values in The removeAll() method is used to calculate the difference between two sets. Suppose we have a list of fruits and a list of summer fruits and winter berries, and we want to know the difference between the two. We could use this code to calculate the difference: Our code returns: We performed a difference search on the The HashSet class implements the Set interface with hash tables in Java. HashSet is commonly used if you want to access elements randomly or store a list of items which cannot contain duplicate values. This tutorial discussed the basics of Java HashSets and, with reference to examples, explored how to declare and manipulate a Java HashSet. Now you\u2019re ready to start using the Java HashSet class like a pro!<\/p>\n","protected":false},"excerpt":{"rendered":"In Java, there are a number of data types that are used to store values. Each data type stores values in a different way, and offers a range of methods which can be used to manipulate the stored values. For instance, numbers can be manipulated using mathematical functions in Java. HashSet is a data type…","protected":false},"author":240,"featured_media":13379,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_acf_changed":false,"footnotes":""},"categories":[17289],"tags":[],"class_list":{"0":"post-13378","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-java"},"acf":{"post_sub_title":"","sprint_id":"","query_class":"Java","school_sft":"","parent_sft":"","school_privacy_policy":"","has_review":"","is_sponser_post":"","is_guest_post":""},"yoast_head":"\nimport java.util.HashSet;
<\/code><\/p>\n\n\n\n
<\/p>\n\n\n\nJava Create a HashSet<\/h2>\n\n\n\n
<\/p>\n\n\n\nHashSet<DataType> variable_name = new HashSet<>(capacity, loadFactor);
<\/code><\/p>\n\n\n\n
<\/p>\n\n\n\n\n
variable_name<\/code>.<\/li>\n\n\n\n
<\/p>\n\n\n\nimport java.util.HashSet;\nHashSet<String> fruits = new HashSet<>();\n<\/pre><\/div>\n\n\n\n
fruits<\/code> which will store string values. Now we have a HashSet ready, we can start working with it using the HashSet methods.
<\/p>\n\n\n\nAdd an Item<\/h2>\n\n\n\n
Pear<\/code>, Grapefruit<\/code> and Mango<\/code> to our list of fruits. We could do so using this code:
<\/p>\n\n\n\nimport java.util.HashSet;\nclass AddFruits {\n\tpublic static void main(String[] args) {\n\t\tHashSet<String> fruits = new HashSet<>();\n\t\tfruits.add(\"Pear\");\n\t\tfruits.add(\"Grapefruit\");\n\t\tfruits.add(\"Mango\");\n\t\tSystem.out.println(fruits);\n\t}\n}\n<\/pre><\/div>\n\n\n\n
<\/p>\n\n\n\n[\u201cPear\u201d, \u201cGrapefruit\u201d, \u201cMango\u201d]
<\/code><\/p>\n\n\n\njava.util<\/code>, then we initialize a class called AddFruits, which stores the code for our program. On the next line, we declare a HashSet called fruits<\/code> which will store string values.
<\/p>\n\n\n\nfruits<\/code> hash set: Pear, Grapefruit, and Mango. Finally, we print out the contents of the fruits<\/code> hash set to the console.
<\/p>\n\n\n\nRemove an Item<\/h2>\n\n\n\n
<\/p>\n\n\n\nMango<\/code> entry from the HashSet we created earlier. We could do so using this code:
<\/p>\n\n\n\n\u2026\n\t\tfruits.remove(\"Mango\");\n\t\tSystem.out.println(fruits);\n\u2026\n<\/pre><\/div>\n\n\n\n
<\/p>\n\n\n\n[\u201cPear\u201d, \u201cGrapefruit\u201d]
<\/code><\/p>\n\n\n\nMango<\/code> from our original HashSet and returns the revised HashSet with the two remaining values.
<\/p>\n\n\n\n
<\/p>\n\n\n\n\u2026\n\t\tfruits.removeAll();\n\t\tSystem.out.println(fruits);\n\u2026\n<\/pre><\/div>\n\n\n\n
[]<\/code>.
<\/p>\n\n\n\nAccess Elements<\/h2>\n\n\n\n
<\/p>\n\n\n\nfruits<\/code> array from earlier and print it out to the console:
<\/p>\n\n\n\nimport java.util.HashSet;\nimport java.util.Iterator;\nclass RetrieveFruits {\n\tpublic static void main(String[] args) {\n\t\tHashSet<String> fruits = new HashSet<>();\n\t\tfruits.add(\"Pear\");\n\t\tfruits.add(\"Grapefruit\");\n\t\tfruits.add(\"Mango\");\n\t\tIterator<String> iterate = fruits.iterator();\n\t\twhile(iterate.hasNext()) {\n\t\t\tSystem.out.println(iterate.next());\n\t\t}\n\t}\n}\n<\/pre><\/div>\n\n\n\n
<\/p>\n\n\n\nPear<\/code><\/p>\n\n\n\nGrapefruit<\/code><\/p>\n\n\n\nMango
<\/code><\/p>\n\n\n\njava.util<\/code>. Then we declare a class called RetrieveFruits in which the code for our program is located. Next, we initialize a HashSet called fruits<\/code> and assign it three values: Pear, Grapefruit, and Mango.
<\/p>\n\n\n\nfruits<\/code> hashset and prints it out to the console.
<\/p>\n\n\n\nSet Operations<\/h2>\n\n\n\n
<\/p>\n\n\n\nHashSet Union<\/h3>\n\n\n\n
<\/p>\n\n\n\nfruits<\/code>, stores a list of general fruits that we sell at our stand. The second hash set, berries<\/code>, stores the berries that we sell. We have decided that we want to merge these two sets together.
<\/p>\n\n\n\n
<\/p>\n\n\n\nimport java.util.HashSet;\nclass UnionFruits {\n\tpublic static void main(String[] args) {\nHashSet<String> fruits = new HashSet<>();\n\t\tfruits.add(\"Pear\");\n\t\tfruits.add(\"Grapefruit\");\n\t\tfruits.add(\"Mango\");\nHashSet<String> berries = new HashSet<>();\n\t\tberries.add(\"Strawberry\");\n\t\tberries.add(\"Raspberry\");\n\t\tberries.add(\"Blueberry\");\n\t\tfruits.addAll(berries);\n\t\tSystem.out.println(fruits);\n\t}\n}\n<\/pre><\/div>\n\n\n\n
<\/p>\n\n\n\n[Pear, Grapefruit, Mango, Strawberry, Raspberry, Blueberry]
<\/code><\/p>\n\n\n\nfruits<\/code> and berries<\/code> hash sets into the fruits<\/code> hash set. Then, our code prints out the revised hash set to the console.
<\/p>\n\n\n\nHashSet Intersection<\/h3>\n\n\n\n
<\/p>\n\n\n\nberries<\/code> and fruits<\/code> and we want to make sure there are no common values. We could use the code from our Union<\/code> example with one change to accomplish this task:
<\/p>\n\n\n\n\u2026\n\t\tfruits.retainAll(berries);\n\t\tSystem.out.println(fruits);\n\u2026 \n<\/pre><\/div>\n\n\n\n
[].<\/code>
<\/p>\n\n\n\nfruits<\/code> and berries<\/code> lists, an empty hash set is returned. This tells us that there are no duplicate values in our lists, which is exactly what we wanted.
<\/p>\n\n\n\nHashSet Subset<\/h3>\n\n\n\n
<\/p>\n\n\n\nberries<\/code> list was a subset of our fruits<\/code> list. We could do so using this code:
<\/p>\n\n\n\n\u2026\n\t\tfruits.containsAll(berries);\n\t\tSystem.out.println(fruits);\n\u2026 \n<\/pre><\/div>\n\n\n\n
berries<\/code> that we defined in our Union<\/code> example are not the same as those in fruits<\/code>. So, our code returns false.
<\/p>\n\n\n\nHashSet Difference<\/h3>\n\n\n\n
<\/p>\n\n\n\nclass DifferenceFruits {\n\tpublic static void main(String[] args) {\nHashSet<String> summer_fruits = new HashSet<>();\n\t\tsummer_fruits.add(\"Pear\");\n\t\tsummer_fruits.add(\"Grapefruit\");\n\t\tsummer_fruits.add(\"Grape\");\nHashSet<String> winter_fruits = new HashSet<>();\n\t\twinter_fruits.add(\"Grapefruit\");\n\t\twinter_fruits.add(\"Plum\");\n\t\twinter_fruits.add(\"Grape\");\n\t\tsummer_fruits.removeAll(winter_fruits);\n\t\tSystem.out.println(summer_fruits);\n\t}\n}\n<\/pre><\/div>\n\n\n\n
<\/p>\n\n\n\n[Pear]
<\/code><\/p>\n\n\n\nsummer_fruits<\/code> list and checked which values existed in only the summer_fruits<\/code> list. In this case, Pear<\/code> is the only fruit that exists only in the summer_fruits<\/code> list, and so our list returned one value: Pear.
<\/p>\n\n\n\nConclusion<\/h2>\n\n\n\n
<\/p>\n\n\n\n