Package ghidra.generic.util.datastruct

Interface ValueSortedMap.LesserList<E>

Type Parameters:
E - the type of element
All Superinterfaces:
Iterable<E>
All Known Subinterfaces:
SortedList<E>, ValueSortedMap.ValueSortedMapEntryList<K,V>, ValueSortedMap.ValueSortedMapKeyList<K>
All Known Implementing Classes:
RestrictedValueSortedMap.RestrictedSortedList, RestrictedValueSortedMap.RestrictedValueSortedMapEntryList, RestrictedValueSortedMap.RestrictedValueSortedMapKeyList, TreeValueSortedMap.ValueSortedTreeMapEntrySet, TreeValueSortedMap.ValueSortedTreeMapKeySet, TreeValueSortedMap.ValueSortedTreeMapValues
Enclosing interface:
ValueSortedMap<K,V>
public static interface ValueSortedMap.LesserList<E> extends Iterable<E>
An interface with a subset of methods from List.

We've opted to implement this instead of List so that newer JDKs do not impose new requirements on our implementations.

  • Method Details

    • isEmpty

      boolean isEmpty()

    • size

      int size()

    • get

      E get(int i)
      Get the element at the given index
      Parameters:
      i - the index
      Returns:
      the element

    • toList

      List<E> toList()
      Copy this to a new list
      Returns:
      the list

    • listIterator

      ListIterator<E> listIterator(int index)

    • indexOf

      int indexOf(Object o)
      Get the index of a given element

      Returns the index of the element, or -1 if not found

      Parameters:
      o - the object
      Returns:
      the index or -1

    • contains

      boolean contains(Object o)

    • poll

      E poll()
      Get and remove the first element
      Returns:
      the first element, or null if empty

    • remove

      boolean remove(Object o)

    • removeAll

      default boolean removeAll(Collection<?> col)