{"id":210,"date":"2024-07-30T06:52:39","date_gmt":"2024-07-30T06:52:39","guid":{"rendered":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/chapter\/iterator-examples-2\/"},"modified":"2026-03-16T14:30:44","modified_gmt":"2026-03-16T14:30:44","slug":"iterator-examples-2","status":"publish","type":"chapter","link":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/chapter\/iterator-examples-2\/","title":{"raw":"Iterator Examples","rendered":"Iterator Examples"},"content":{"raw":"
\n

Iterating over a Collection with an Iterator<\/h3>\n

For the examples that follow, we will use a list of Player <\/em>objects, where a Player <\/em>has a name <\/em>and a score<\/em>.<\/p>\n\n

ArrayList<Player> players = new<\/strong> ArrayList<Player>();\nplayers.add(new<\/strong> Player(\"Pam\", 24));\nplayers.add(new<\/strong> Player(\"Len\", 19));\nplayers.add(new<\/strong> Player(\"Malia\", 37));\nplayers.add(new<\/strong> Player(\"Bob\", 13));\nplayers.add(new<\/strong> Player(\"Rea\", 46));\n\n\n<\/pre>\n
To use an iterator to traverse this list:<\/p>\n\n<\/div>\n
Iterator<Player> iter = players.iterator();\nwhile(iter.hasNext()) {\n   Player player = iter.next();\n    System.out.println(player);\n}\n<\/pre>\n \n
\n
Note that the Iterator <\/em>interface is generic, so we must specify what type of objects we are iterating over. The result of the code above is of course, no different from either of the approaches below:<\/p>\n\n
\n\n\n\n\n\n
\n
for-each Loop<\/strong><\/p>\n<\/td>\n
\n
<\/p>\n<\/td>\n
\n
Indexed Loop<\/strong><\/p>\n<\/td>\n<\/tr>\n
\n
for<\/strong>(Player player : players) {<\/code><\/p>\n
\u00a0\u00a0 System.out<\/em><\/strong>.println(player);<\/code><\/p>\n
}<\/code><\/p>\n
<\/p>\n<\/td>\n
\n
<\/p>\n<\/td>\n
\n
for<\/strong>(int<\/strong> i = 0; i < players.size(); i++) {<\/code><\/p>\n
\u00a0\u00a0 System.out<\/em><\/strong>.println(players.get(i));<\/code><\/p>\n
}<\/code><\/p>\n
<\/p>\n<\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n
Most people would not use an iterator to iterator over a collection, they would use the for-each <\/em>or indexed loop. A good use for an iterator is to remove certain elements as we iterate over it, which we consider in the next section. Interestingly, the for-each <\/em>loop compiles down to an iterator.<\/p>\n
The Iterator <\/em>interface is an excellent example of object-oriented design, which uses information hiding. An iterator hides the actual storage mechanism of the data. Thus, the user of an iterator does not need to know how the data is stored, it just knows that it can access the next<\/em> item. For example, with the indexed loop, if you are using an ArrayList<\/em>, you must use the get <\/em>method, with other types of collections, there may be some other method to access an item, or no method at all. With an iterator, you don\u2019t need to know these.<\/p>\n\n
Filtering a Collection with an Iterator \u2013 Removing Elements<\/h3>\n
Filtering <\/em>a collection refers to the idea of finding all the elements in a collection that meet certain criteria. The way we consider it here, is we will remove all elements that meet the criteria from the collection. An Iterator <\/em>is the preferred way to filter a collection by removing elements.<\/p>\n
In the players <\/em>list considered above, suppose we want to remove all players whose score is less than 20. In this case, we can use the Iterator<\/em>\u2019s remove <\/em>method:<\/p>\n\n<\/div>\n
Iterator<Player> iter = players.iterator();\nwhile(iter.hasNext() ) {\n   Player player = iter.next();\n   if(player.getScore() < 20) {\n      \titer.remove();\n   }\n}\n<\/pre>\n \n
\n
A common mistake is to use a for-each <\/em>loop and then using the collection\u2019s remove <\/em>method. However, such code will fail if the remove <\/em>method is executed, throwing a ConcurrentModificationException.<\/em> You cannot modify a collection (add to or remove from) while iterating over it with a for-each <\/em>loop. Another common mistake is to use an indexed loop, somewhat naively. An example is found in an Appendix. Other approaches to filtering that work are: an indexed loop with a subtle modification of the index inside the loop (bad practice), a while <\/em>loop, or using an indexed loop traversing the list in reverse order.<\/p>\n\n
Filtering a Collection with an Iterator \u2013 Removing & Returning Elements<\/h3>\n
Suppose you want to remove certain elements from a collection and also return the removed elements in a new collection. Considering the example from above, suppose we want to (a) remove all players whose score is less than 20 from the players <\/em>list and (b) put those removed players in another list named lowScorePlayers. <\/em>Note that every time the next <\/em>method is called, the next element in the collection is retrieved. Thus, if you call next <\/em>twice inside the loop, you will receive the next two elements, respectively. Thus, if you need the next element more than once in the loop, you must store it in a variable. The correct version is shown in the table below on the left. There, we make one call to next <\/em>inside the loop, capturing the item in the player <\/em>variable. Then, player <\/em>is used twice. Both examples define this list to store the players that are to be stored in a separate list:<\/p>\n
ArrayList<Player> lowScorePlayers = new<\/strong> ArrayList<Player>();<\/p>\n\n
\n\n\n\n\n\n
\n
Correct<\/strong><\/p>\n<\/td>\n
\n
Incorrect<\/strong><\/p>\n<\/td>\n<\/tr>\n
\n
Iterator<Player> iter = players.iterator();<\/code><\/p>\n
while<\/strong>( iter.hasNext() ) {<\/code><\/p>\n
\u00a0\u00a0\u00a0 Player player = iter.next();<\/code><\/p>\n
\u00a0\u00a0\u00a0 if<\/strong>(player.getScore() < 20) {<\/code><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 iter.remove();<\/code><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 lowScorePlayers.add(player);<\/code><\/p>\n
\u00a0\u00a0\u00a0 }<\/code><\/p>\n
}<\/code><\/p>\n
\/\/ Result<\/code><\/p>\n
\/\/ players: [Pam-24, Malia-37, Rea-46]<\/code><\/p>\n
\/\/lowScorePlayers: [Len-19, Bob-13]<\/code><\/p>\n<\/td>\n
\n
Iterator<Player> iter = players.iterator();<\/code><\/p>\n
while<\/strong>(iter.hasNext()) {<\/code><\/p>\n
\u00a0\u00a0\u00a0 if<\/strong>(iter.next().<\/span>getScore() < 20) {<\/code><\/p>\n
iter.remove();<\/code><\/p>\n
lowScorePlayers.add(iter.next())<\/span>;<\/code><\/p>\n
\u00a0\u00a0\u00a0 }<\/code><\/p>\n
}<\/code><\/p>\n
\/\/ Result<\/code><\/p>\n
\/\/ players: [Pam-24, Malia-37, Rea-46]<\/code><\/p>\n
\/\/ lowScorePlayers: [Malia-37, Rea-46]<\/code><\/p>\n<\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n
For the incorrect version, consider the original list of players:<\/p>\n
[Pam-24, Len-19, Malia-37, Bob-13, Rea-46]<\/p>\n
When the player, \u201cLen-19\u201d is found, it is removed, but then the subsequent call to iter.next() <\/em>advances to the next player, \u201cMalia-13\u201d, which is added to lowScorePlayers. <\/em>Then, the loop repeats, where the first next <\/em>retrieves: \u201cBob-13, which is removed and the subsequent call to iter.next() <\/em>adds \u201cRea-46\u201d to lowScorePlayers<\/em>. So, we can see that (a) we are putting the wrong players in the list, (b) some players do not have their score checked \u2013 we are effectively skipping them, (c) if there has been a player with score less than 20 in the last space, then there is the possibility that the code would throw an exception as the coded tried to add the next element to lowScorePlayers, <\/em>(d) the loop, in this case only executed 3 times. This is a common mistake. Thus, if you need the current element in the loop more than once, you should store it in a variable with a single call to iter.next<\/em> as shown in the correct version above.<\/p>\n\n<\/div>","rendered":"
\n
Iterating over a Collection with an Iterator<\/h3>\n
For the examples that follow, we will use a list of Player <\/em>objects, where a Player <\/em>has a name <\/em>and a score<\/em>.<\/p>\n
ArrayList<Player> players = new<\/strong> ArrayList<Player>();\nplayers.add(new<\/strong> Player(\"Pam\", 24));\nplayers.add(new<\/strong> Player(\"Len\", 19));\nplayers.add(new<\/strong> Player(\"Malia\", 37));\nplayers.add(new<\/strong> Player(\"Bob\", 13));\nplayers.add(new<\/strong> Player(\"Rea\", 46));\n\n\n<\/pre>\n
To use an iterator to traverse this list:<\/p>\n<\/div>\n
Iterator<Player> iter = players.iterator();\nwhile(iter.hasNext()) {\n   Player player = iter.next();\n    System.out.println(player);\n}\n<\/pre>\n
 <\/p>\n
\n
Note that the Iterator <\/em>interface is generic, so we must specify what type of objects we are iterating over. The result of the code above is of course, no different from either of the approaches below:<\/p>\n
\n\n\n\n\n\n
\n
for-each Loop<\/strong><\/p>\n<\/td>\n
\n
\n<\/td>\n
\n
Indexed Loop<\/strong><\/p>\n<\/td>\n<\/tr>\n
\n
for<\/strong>(Player player : players) {<\/code><\/p>\n
\u00a0\u00a0 System.out<\/em><\/strong>.println(player);<\/code><\/p>\n
}<\/code><\/p>\n
\n<\/td>\n
\n
\n<\/td>\n
\n
for<\/strong>(int<\/strong> i = 0; i < players.size(); i++) {<\/code><\/p>\n
\u00a0\u00a0 System.out<\/em><\/strong>.println(players.get(i));<\/code><\/p>\n
}<\/code><\/p>\n
\n<\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n
Most people would not use an iterator to iterator over a collection, they would use the for-each <\/em>or indexed loop. A good use for an iterator is to remove certain elements as we iterate over it, which we consider in the next section. Interestingly, the for-each <\/em>loop compiles down to an iterator.<\/p>\n
The Iterator <\/em>interface is an excellent example of object-oriented design, which uses information hiding. An iterator hides the actual storage mechanism of the data. Thus, the user of an iterator does not need to know how the data is stored, it just knows that it can access the next<\/em> item. For example, with the indexed loop, if you are using an ArrayList<\/em>, you must use the get <\/em>method, with other types of collections, there may be some other method to access an item, or no method at all. With an iterator, you don\u2019t need to know these.<\/p>\n
Filtering a Collection with an Iterator \u2013 Removing Elements<\/h3>\n
Filtering <\/em>a collection refers to the idea of finding all the elements in a collection that meet certain criteria. The way we consider it here, is we will remove all elements that meet the criteria from the collection. An Iterator <\/em>is the preferred way to filter a collection by removing elements.<\/p>\n
In the players <\/em>list considered above, suppose we want to remove all players whose score is less than 20. In this case, we can use the Iterator<\/em>\u2019s remove <\/em>method:<\/p>\n<\/div>\n
Iterator<Player> iter = players.iterator();\nwhile(iter.hasNext() ) {\n   Player player = iter.next();\n   if(player.getScore() < 20) {\n      \titer.remove();\n   }\n}\n<\/pre>\n
 <\/p>\n
\n
A common mistake is to use a for-each <\/em>loop and then using the collection\u2019s remove <\/em>method. However, such code will fail if the remove <\/em>method is executed, throwing a ConcurrentModificationException.<\/em> You cannot modify a collection (add to or remove from) while iterating over it with a for-each <\/em>loop. Another common mistake is to use an indexed loop, somewhat naively. An example is found in an Appendix. Other approaches to filtering that work are: an indexed loop with a subtle modification of the index inside the loop (bad practice), a while <\/em>loop, or using an indexed loop traversing the list in reverse order.<\/p>\n
Filtering a Collection with an Iterator \u2013 Removing & Returning Elements<\/h3>\n
Suppose you want to remove certain elements from a collection and also return the removed elements in a new collection. Considering the example from above, suppose we want to (a) remove all players whose score is less than 20 from the players <\/em>list and (b) put those removed players in another list named lowScorePlayers. <\/em>Note that every time the next <\/em>method is called, the next element in the collection is retrieved. Thus, if you call next <\/em>twice inside the loop, you will receive the next two elements, respectively. Thus, if you need the next element more than once in the loop, you must store it in a variable. The correct version is shown in the table below on the left. There, we make one call to next <\/em>inside the loop, capturing the item in the player <\/em>variable. Then, player <\/em>is used twice. Both examples define this list to store the players that are to be stored in a separate list:<\/p>\n
ArrayList<Player> lowScorePlayers = new<\/strong> ArrayList<Player>();<\/p>\n
\n\n\n\n\n\n
\n
Correct<\/strong><\/p>\n<\/td>\n
\n
Incorrect<\/strong><\/p>\n<\/td>\n<\/tr>\n
\n
Iterator<Player> iter = players.iterator();<\/code><\/p>\n
while<\/strong>( iter.hasNext() ) {<\/code><\/p>\n
\u00a0\u00a0\u00a0 Player player = iter.next();<\/code><\/p>\n
\u00a0\u00a0\u00a0 if<\/strong>(player.getScore() < 20) {<\/code><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 iter.remove();<\/code><\/p>\n
\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0\u00a0 lowScorePlayers.add(player);<\/code><\/p>\n
\u00a0\u00a0\u00a0 }<\/code><\/p>\n
}<\/code><\/p>\n
\/\/ Result<\/code><\/p>\n
\/\/ players: [Pam-24, Malia-37, Rea-46]<\/code><\/p>\n
\/\/lowScorePlayers: [Len-19, Bob-13]<\/code><\/p>\n<\/td>\n
\n
Iterator<Player> iter = players.iterator();<\/code><\/p>\n
while<\/strong>(iter.hasNext()) {<\/code><\/p>\n
\u00a0\u00a0\u00a0 if<\/strong>(iter.next().<\/span>getScore() < 20) {<\/code><\/p>\n
iter.remove();<\/code><\/p>\n
lowScorePlayers.add(iter.next())<\/span>;<\/code><\/p>\n
\u00a0\u00a0\u00a0 }<\/code><\/p>\n
}<\/code><\/p>\n
\/\/ Result<\/code><\/p>\n
\/\/ players: [Pam-24, Malia-37, Rea-46]<\/code><\/p>\n
\/\/ lowScorePlayers: [Malia-37, Rea-46]<\/code><\/p>\n<\/td>\n<\/tr>\n
<\/td>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n<\/div>\n
For the incorrect version, consider the original list of players:<\/p>\n
[Pam-24, Len-19, Malia-37, Bob-13, Rea-46]<\/p>\n
When the player, \u201cLen-19\u201d is found, it is removed, but then the subsequent call to iter.next() <\/em>advances to the next player, \u201cMalia-13\u201d, which is added to lowScorePlayers. <\/em>Then, the loop repeats, where the first next <\/em>retrieves: \u201cBob-13, which is removed and the subsequent call to iter.next() <\/em>adds \u201cRea-46\u201d to lowScorePlayers<\/em>. So, we can see that (a) we are putting the wrong players in the list, (b) some players do not have their score checked \u2013 we are effectively skipping them, (c) if there has been a player with score less than 20 in the last space, then there is the possibility that the code would throw an exception as the coded tried to add the next element to lowScorePlayers, <\/em>(d) the loop, in this case only executed 3 times. This is a common mistake. Thus, if you need the current element in the loop more than once, you should store it in a variable with a single call to iter.next<\/em> as shown in the correct version above.<\/p>\n<\/div>\n","protected":false},"author":1,"menu_order":2,"template":"","meta":{"pb_show_title":"","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[49],"contributor":[],"license":[],"class_list":["post-210","chapter","type-chapter","status-publish","hentry","chapter-type-numberless"],"part":207,"_links":{"self":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters\/210","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters"}],"about":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/types\/chapter"}],"author":[{"embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/users\/1"}],"version-history":[{"count":1,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters\/210\/revisions"}],"predecessor-version":[{"id":211,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters\/210\/revisions\/211"}],"part":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/parts\/207"}],"metadata":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters\/210\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/media?parent=210"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapter-type?post=210"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/contributor?post=210"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/license?post=210"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}