Java Essentials - Sets in java

Now let us discuss sets in Java

So set is nothing but one mathematical abstraction and in this particular collection duplicate data

are not allowed. So let us go for more discussion on these sets

So the sets in Java collection. A set is a collection that cannot contain duplicate elements and it models the mathematical

set abstraction. The set interface contains only methods inherited from the collection and it adds the restriction that duplicate elements will remain

prohibited. So that's why it is actually nothing but a mathematical set abstraction

So to have the better clarity on this topic, let us go for one practical demonstration

and in the demonstration using Java sample code will be discussing more on this set

In this demonstration, we shall discuss the set interface and its respective objects and

how to deal with them here we have defined two integer arrays list one and list two

and these are the set of data it is having you can find that some duplicate data

are also present we have defined one set interface object that is set one you

can find that this set is this interface I is written here is under the package

that is the Java dot util a collection that contains no duplicate elements and more formally set contents no pair of elements e1 and e2 such that u1 equals e2 and at most one null element as implied by its name this

interface models the mathematical set abstraction so here you can find that we have defined

two set class set interface objects as set 1 and set 2 is a new будто has set the

constructed has been called here so now we are having already we're having to

integer arrays and now we are populating this set one and set two adding

this items picking up from this integer areas at first from the list one to set

one and then from list two to set two so here we have used the for each loop so

for item item item colon list one so each and every item will be picked up one at

a time each each and every integer data will be picked up one at a time

then that will get added with the set one and you can find that this set one is

actually the object under the interface set and here the set will hold the integer

that is a wrapper class objects so system dot out of print a length the first set

will be printed and the second set will be printed you can find that we're

having this first set has got printed so it has got printed in this way one two

and then it is having five then six then twelve you see the

duplicate data data have got removed there is no duplicate data here and they have got shorted automatically so now we are having this the second one that is a 12 4 3 2 4 15

you can find that it has become 2 3 4 12 and 15 here now we shall go for the set

operations the union of two sets we have defined one set interface object that is

the union is equal to new has set which will be containing the typecasting has been done

as integer upper class object and then set 1 so using the set 1 members this union

will get populated and now this union is having all the items from set 1 and then union

dot add all set 2 so add items of the set 2 with the set 1 set 1 items which are residing

in this union that is a interface set object so now if I go on printing the current

value of union then I'm getting this one you can find that all the data items are unique all the data items are distinct so there

is no repetition or data items and the items have been printed in the shorted

form so now we shall go for the intersection now we shall go for the intersection so

we have defined the one here one set interface object that is the intersection

which will hold this integer upper class objects as its items and intersection

dot written all just remember this method that method is written all and that is useful to do the intersection of two sets and here add all that was used to do the union of two sets here so written all set two so now

this intersection current content has got printed you can find that it has got

printed as 2 and 12 because 2 and 12 are the common elements between this set 1

and set 2 now we shall go for the difference so now the method will be a

remove all that means at first the difference has got instantiated with the items from set one and then diff dot

remove all set two so remove common elements from the two sets and in this way

we're going to get the updated content and the reduced content of diff okay so

now you see this is my set one and this my set two here we have printed them

earlier so now if you go for set 1 minus set 2 I'm remaining with this one 5 and

six because in between these two sets only two is common so two is common and then

this one five six 12 is also common here so that's why one five six is the only the outcome of the

difference set one minus set two in this way in this demonstration you have discussed a lot on this set

interface and how to deal with its methods and how to define the respective objects how to

initialize them and you have different we have discussed that one into detail

details with some sample coding. Thanks for watching this video