compiler/edu.cornell.cs.apl.viaduct.util/UniqueQueue

UniqueQueue

A queue implementation that keeps only one copy of each element.

Trying to insert an element that is already in the queue will ignore the new copy, keeping the old. Additionally, the element will keep its original position in the queue, and is not moved to the end of the queue.

Constructors

UniqueQueue

fun <E> UniqueQueue(collection: Collection<E>)

UniqueQueue

fun UniqueQueue()

Functions

add

open override fun add(element: E): Boolean

addAll

open override fun addAll(elements: Collection<E>): Boolean

clear

open override fun clear()

contains

open operator override fun contains(element: E): Boolean

containsAll

open override fun containsAll(elements: Collection<E>): Boolean

element

open override fun element(): E

forEach

open fun forEach(p0: Consumer<in E>)

isEmpty

open override fun isEmpty(): Boolean

iterator

open operator override fun iterator(): MutableIterator<E>

offer

open override fun offer(e: E): Boolean

parallelStream

open fun parallelStream(): Stream<E>

peek

open override fun peek(): E?

poll

open override fun poll(): E?

remove

open override fun remove(): E

open override fun remove(element: E): Boolean

removeAll

open override fun removeAll(elements: Collection<E>): Boolean

removeIf

open fun removeIf(p0: Predicate<in E>): Boolean

retainAll

open override fun retainAll(elements: Collection<E>): Boolean

spliterator

open override fun spliterator(): Spliterator<E>

stream

open fun stream(): Stream<E>

toArray

open fun toArray(): Array<Any>

open fun <T : Any> toArray(p0: Array<T>): Array<T>

~~open~~ ~~fun~~ <T : Any> ~~toArray~~(p0: IntFunction<Array<T>>): Array<T>

toString

open override fun toString(): String

Properties

size

open override val size: Int