PriorityList

Complexity: O(1)

Adds value to the list with specified priority Complexity: O(log n)

If a value wasn't previously added to the list, simply adds it with a given priority. Otherwise, in case if priority is less or equal to the priority of existent element(s), does nothing. Otherwise, removes all existing elements from the list and adds value with a given priority. Complexity: O(n + k * log(n)) where k is a number of elements equal to value

All collection elements Complexity: O(n)

All elements with their priorities ordered by the time of adding (elements added earlier go first) Complexity: O(n log(n))

Collection iterator Amortized next()/hasNext() complexity: O(1)

Removes all values that are equal to value Complexity: O(n + k * log(n)) where k is a number of elements to remove