Package ghidra.generic.util.datastruct

Class RestrictedValueSortedMap.RestrictedEntryListIterator

  • All Implemented Interfaces:
    java.util.Iterator<java.util.Map.Entry<K,​V>>, java.util.ListIterator<java.util.Map.Entry<K,​V>>
    Enclosing class:
    RestrictedValueSortedMap<K,​V>
    public class RestrictedValueSortedMap.RestrictedEntryListIterator
extends java.lang.Object
implements java.util.ListIterator<java.util.Map.Entry<K,​V>>
    A list iterator suitable for List.listIterator(), etc., on the entries of a RestrictedValueSortedMap

    • Field Summary

      Fields 
      Modifier and Type Field Description
      protected java.util.ListIterator<java.util.Map.Entry<K,​V>> wit  

    • Method Summary

      All Methods Instance Methods Concrete Methods 
      Modifier and Type Method Description
      void add​(java.util.Map.Entry<K,​V> e)  
      boolean hasNext()  
      boolean hasPrevious()  
      java.util.Map.Entry<K,​V> next()  
      int nextIndex()  
      java.util.Map.Entry<K,​V> previous()  
      int previousIndex()  
      void remove()  
      void set​(java.util.Map.Entry<K,​V> e)  

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

      • Methods inherited from interface java.util.Iterator

        forEachRemaining

    • Field Detail

      • wit

        protected final java.util.ListIterator<java.util.Map.Entry<K,​V>> wit

    • Constructor Detail

      • RestrictedEntryListIterator

        public RestrictedEntryListIterator()
        Construct an iterator

      • RestrictedEntryListIterator

        public RestrictedEntryListIterator​(int start)
        Construct an iterator starting at a given index of the sub list.
        Parameters:
        start - initial iterator position

    • Method Detail

      • hasNext

        public boolean hasNext()
        Specified by:
        hasNext in interface java.util.Iterator<java.util.Map.Entry<K,​V>>
        Specified by:
        hasNext in interface java.util.ListIterator<java.util.Map.Entry<K,​V>>

      • next

        public java.util.Map.Entry<K,​V> next()
        Specified by:
        next in interface java.util.Iterator<java.util.Map.Entry<K,​V>>
        Specified by:
        next in interface java.util.ListIterator<java.util.Map.Entry<K,​V>>

      • hasPrevious

        public boolean hasPrevious()
        Specified by:
        hasPrevious in interface java.util.ListIterator<java.util.Map.Entry<K,​V>>

      • previous

        public java.util.Map.Entry<K,​V> previous()
        Specified by:
        previous in interface java.util.ListIterator<java.util.Map.Entry<K,​V>>

      • nextIndex

        public int nextIndex()
        Specified by:
        nextIndex in interface java.util.ListIterator<java.util.Map.Entry<K,​V>>

      • previousIndex

        public int previousIndex()
        Specified by:
        previousIndex in interface java.util.ListIterator<java.util.Map.Entry<K,​V>>

      • remove

        public void remove()
        Specified by:
        remove in interface java.util.Iterator<java.util.Map.Entry<K,​V>>
        Specified by:
        remove in interface java.util.ListIterator<java.util.Map.Entry<K,​V>>

      • set

        public void set​(java.util.Map.Entry<K,​V> e)
        Specified by:
        set in interface java.util.ListIterator<java.util.Map.Entry<K,​V>>

      • add

        public void add​(java.util.Map.Entry<K,​V> e)
        Specified by:
        add in interface java.util.ListIterator<java.util.Map.Entry<K,​V>>