Interface ScheduledEntries<K,V>

All Superinterfaces:
Iterable<Map.Entry<K,V>>

public interface ScheduledEntries<K,V> extends Iterable<Map.Entry<K,V>>
A collection of scheduled entries with a predictable iteration order.
Author:
Paul Ferraro
  • Method Details

    • isSorted

      boolean isSorted()
      Indicates whether the entries are sorted, or if iteration order recapitulates insertion order.
      Returns:
      true, if these entries are sorted, false otherwise.
    • add

      void add(K key, V value)
      Adds an entry using the specified key and value.
      Parameters:
      key - an entry key
      value - an entry value
    • remove

      void remove(K key)
      Removes the entry with the specified key.
      Parameters:
      key - an entry key
    • contains

      boolean contains(K key)
      Indicates whether specified key exists among the scheduled entries.
      Parameters:
      key - an entry key
      Returns:
      true, if the key is a scheduled entry, false otherwise
    • peek

      default Map.Entry<K,V> peek()
      Returns, but does not remove, the first entry.
    • stream

      Stream<Map.Entry<K,V>> stream()
      Returns a stream of scheduled entries.
      Returns:
      a stream of scheduled entries.
    • iterator

      default Iterator<Map.Entry<K,V>> iterator()
      Specified by:
      iterator in interface Iterable<K>
    • linked

      static <K, V> ScheduledEntries<K,V> linked()
    • sorted

      static <K extends Comparable<? super K>, V extends Comparable<? super V>> ScheduledEntries<K,V> sorted()
    • sorted

      static <K, V> ScheduledEntries<K,V> sorted(Comparator<Map.Entry<K,V>> comparator)