Options
All
  • Public
  • Public/Protected
  • All
Menu

Interface Deque<K>

Type parameters

  • K

Hierarchy

Implemented by

Index

Methods

__@iterator

  • __@iterator(): Iterator<K>

add

  • add(k: K): boolean
  • Parameters

    • k: K

    Returns boolean

    true if this collection changed as a result of the call

addFirst

  • addFirst(k: K): boolean
  • Parameters

    • k: K

    Returns boolean

    true if this collection changed as a result of the call

addLast

  • addLast(k: K): boolean
  • Parameters

    • k: K

    Returns boolean

    true if this collection changed as a result of the call

clear

  • clear(): any

contains

  • contains(t: K): boolean

element

  • element(): K
  • Returns K

    the element at the head of the queue or null if empty

forEach

getFirst

  • getFirst(): K
  • Returns K

    the element at the head of the queue or undefined if empty

getLast

  • getLast(): K
  • Returns K

    the element at the tail of the queue or undefined if empty

immutableCollection

isEmpty

  • isEmpty(): boolean

iterator

offer

  • offer(k: K): boolean
  • Parameters

    • k: K

    Returns boolean

    true if this collection changed as a result of the call

offerFirst

  • offerFirst(k: K): boolean
  • Parameters

    • k: K

    Returns boolean

    true if this collection changed as a result of the call

offerLast

  • offerLast(k: K): boolean
  • Parameters

    • k: K

    Returns boolean

    true if this collection changed as a result of the call

peek

  • peek(): K
  • Returns K

    the element at the head of the queue or null if empty

peekFirst

  • peekFirst(): K
  • Returns K

    the element at the head of the queue or null if empty

peekLast

  • peekLast(): K
  • Returns K

    the element at the head of the queue or null if empty

poll

  • poll(): K
  • Returns K

    the element at the head of the queue or null if empty

pollFirst

  • pollFirst(): K
  • Returns K

    the element at the head of the queue or null if empty

pollLast

  • pollLast(): K
  • Returns K

    the element at the head of the queue or null if empty

remove

  • remove(t: K): boolean

removeFirst

  • removeFirst(): K
  • Returns K

    the element at the head of the queue or undefined if empty

removeLast

  • removeLast(): K
  • Returns K

    the element at the end of the queue or undefined if empty

removeQueue

  • removeQueue(): K

size

  • size(): number

Generated using TypeDoc