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

You will eventually implement your own iterator for your own lists. Your iterator will implement the standard Iterator <\/em><\/a>interface<\/a>. Let's discuss each method and its expected behavior. Some of the expected behavior of your iterator will differ slightly from the standard implementation, so read these descriptions carefully.<\/p>\n\n

hasNext<\/strong><\/h3>\n

boolean hasNext()<\/p>\n

Returns true if the iteration has more elements. (In other words, returns true if next() would return an element rather than throwing an exception.)<\/p>\n

Throws:
ConcurrentModificationException<\/a> - if the list has been modified outside of this iterator<\/p>\n

This method will need to check if there are elements remaining in the list. It should return true if there are and return false if no more elements are left. It should throw a ConcurrentModificationException<\/em> if the list is modified if the list has been modified in any way by anything other than this iterator.<\/p>\n\n

next<\/strong><\/h3>\n

E next()<\/p>\n

Returns the next element in the iteration.<\/p>\n

Throws:<\/p>\n

NoSuchElementException<\/a>- if the iteration has no more elements
ConcurrentModificationException<\/a> - if the list has been modified outside of this iterator<\/p>\n

This method will return the next element in the list or throw an exception if there aren't any elements left (i.e. if hasNext() returns false). It should throw a ConcurrentModificationException<\/em> if the list is modified if the list has been modified in any way by anything other than this iterator.<\/p>\n\n

remove<\/strong><\/h3>\n

void remove()

Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next()<\/a>.<\/p>\n


Throws:
IllegalStateException<\/a> - if the next method has not yet been called, or the remove method has already been called after the last call to the next method
ConcurrentModificationException<\/a> - if the list has been modified outside of this iterator<\/p>\n


This method should return the element that was most recently returned by a call to next.<\/em> It does not remove the next element in the list; it does not allow you to find an element to remove. Whatever was returned by next<\/em> is what gets removed. That's why it doesn't need to return anything. The user must call next<\/em> before they can call remove<\/em>. The user can call remove<\/em> exactly once per call to next<\/em>. In other words, the user is not allowed to call remove<\/em> twice in a row.<\/p>\n

It should throw a ConcurrentModificationException<\/em> if the list is modified if the list has been modified in any way by anything other than this iterator. Note that remove<\/em> is the only iterator method that modifies the list. It is perfectly fine to have multiple iterators moving through the same list, as long as they only call hasNext()<\/em> and\/or next()<\/em>. Those methods do not modify the list. If one iterator calls remove<\/em>, however, that invalidates all other iterators.<\/p>\n\n<\/div>","rendered":"

\n

You will eventually implement your own iterator for your own lists. Your iterator will implement the standard Iterator <\/em><\/a>interface<\/a>. Let’s discuss each method and its expected behavior. Some of the expected behavior of your iterator will differ slightly from the standard implementation, so read these descriptions carefully.<\/p>\n

hasNext<\/strong><\/h3>\n

boolean hasNext()<\/p>\n

Returns true if the iteration has more elements. (In other words, returns true if next() would return an element rather than throwing an exception.)<\/p>\n

Throws:
ConcurrentModificationException<\/a> – if the list has been modified outside of this iterator<\/p>\n

This method will need to check if there are elements remaining in the list. It should return true if there are and return false if no more elements are left. It should throw a ConcurrentModificationException<\/em> if the list is modified if the list has been modified in any way by anything other than this iterator.<\/p>\n

next<\/strong><\/h3>\n

E next()<\/p>\n

Returns the next element in the iteration.<\/p>\n

Throws:<\/p>\n

NoSuchElementException<\/a>– if the iteration has no more elements
ConcurrentModificationException<\/a> – if the list has been modified outside of this iterator<\/p>\n

This method will return the next element in the list or throw an exception if there aren’t any elements left (i.e. if hasNext() returns false). It should throw a ConcurrentModificationException<\/em> if the list is modified if the list has been modified in any way by anything other than this iterator.<\/p>\n

remove<\/strong><\/h3>\n

void remove()

Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next()<\/a>.<\/p>\n


Throws:
IllegalStateException<\/a> – if the next method has not yet been called, or the remove method has already been called after the last call to the next method
ConcurrentModificationException<\/a> – if the list has been modified outside of this iterator<\/p>\n


This method should return the element that was most recently returned by a call to next.<\/em> It does not remove the next element in the list; it does not allow you to find an element to remove. Whatever was returned by next<\/em> is what gets removed. That’s why it doesn’t need to return anything. The user must call next<\/em> before they can call remove<\/em>. The user can call remove<\/em> exactly once per call to next<\/em>. In other words, the user is not allowed to call remove<\/em> twice in a row.<\/p>\n

It should throw a ConcurrentModificationException<\/em> if the list is modified if the list has been modified in any way by anything other than this iterator. Note that remove<\/em> is the only iterator method that modifies the list. It is perfectly fine to have multiple iterators moving through the same list, as long as they only call hasNext()<\/em> and\/or next()<\/em>. Those methods do not modify the list. If one iterator calls remove<\/em>, however, that invalidates all other iterators.<\/p>\n<\/div>\n","protected":false},"author":1,"menu_order":3,"template":"","meta":{"pb_show_title":"","pb_short_title":"","pb_subtitle":"","pb_authors":[],"pb_section_license":""},"chapter-type":[49],"contributor":[],"license":[],"class_list":["post-212","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\/212","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\/212\/revisions"}],"predecessor-version":[{"id":213,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapters\/212\/revisions\/213"}],"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\/212\/metadata\/"}],"wp:attachment":[{"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/media?parent=212"}],"wp:term":[{"taxonomy":"chapter-type","embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/pressbooks\/v2\/chapter-type?post=212"},{"taxonomy":"contributor","embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/contributor?post=212"},{"taxonomy":"license","embeddable":true,"href":"https:\/\/libraryresources.nse.org.ng\/computersciencetwo\/wp-json\/wp\/v2\/license?post=212"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}