Queue

public struct Queue<T>: SequenceType

Data structure that represents queue.

Complexity of enqueue, dequeue is O(1) when number of operations is averaged over N operations.

Complexity of peek is O(1).

  • Type of generator.

    Declaration

    Swift

    public typealias Generator = AnyGenerator<T>

  • Creates new queue.

    Declaration

    Swift

    public init(capacity: Int)

    Parameters

    capacity

    Capacity of newly created queue.

  • Declaration

    Swift

    public var isEmpty: Bool

    Return Value

    Is queue empty.

  • Declaration

    Swift

    public var count: Int

    Return Value

    Number of elements inside queue.

  • Declaration

    Swift

    public func peek() -> T

    Return Value

    Element in front of a list of elements to dequeue.

  • Enqueues element.

    Declaration

    Swift

    public mutating func enqueue(element: T)

    Parameters

    element

    Element to enqueue.

  • Dequeues element or throws an exception in case queue is empty.

    Declaration

    Swift

    public mutating func dequeue() -> T?

    Return Value

    Dequeued element.

  • Declaration

    Swift

    public func generate() -> Generator

    Return Value

    Generator of contained elements.