Iterator i1=h1.iterator();
while(i1.hasNext()){
int p=(int)(i1.next());
}
Please explain this code in python programming language term, here h1 is linkedhashset Thanks in advance
-
Check this answer Equivalent for LinkedHashSet for PythonAndres Sacco– Andres Sacco2021-01-07 17:11:52 +00:00Commented Jan 7, 2021 at 17:11
-
@AndresSacco can you explain this above code bcz i am new to javalivikmap99– livikmap992021-01-07 17:13:54 +00:00Commented Jan 7, 2021 at 17:13
-
This looks like homework. Voting to close as it shows no attempt from author to solve it.Karol Dowbecki– Karol Dowbecki2021-01-07 17:18:19 +00:00Commented Jan 7, 2021 at 17:18
-
2@KarolDowbecki I think you are not getting him. He already mentioned that he is new to java and want the explanation of the above code in python . So how he will show you that he attempt to understand the above code or not ? also the LinkedHashSet is difficult part for a beginner so there is nothing wrong in asking this question.Akash nitter– Akash nitter2021-01-07 17:22:14 +00:00Commented Jan 7, 2021 at 17:22
Add a comment
|
1 Answer
You have different ways to iterate a "LinkedHashSet", for example using: "forEach" or "iterate".
An iterator is an object that can be used to iterate all the elements in a collection. The Iterator has two important methods (hasNext, next).
I put an explanation about each line of your code
Iterator i1 = h1.iterator(); //obtain an iterator of the collection
while(i1.hasNext()) { // Continue iterating because has a next element
int p=(int)(i1.next()); //return the next element and parse it to "int"
}
Also with an Iterator you can add or remove elements.
Additional resources:
