Class PriorityQueue<T>

constructor

• new PriorityQueue(comp?: Comparator<T>): PriorityQueue
• new PriorityQueue(obj: PriorityQueue<T>): PriorityQueue
• new PriorityQueue(first: Readonly<IForwardIterator<T>>, last: Readonly<IForwardIterator<T>>, comp?: Comparator<T>): PriorityQueue

• Default Constructor.

  Parameters

  • Optional comp: Comparator<T>

    A binary function predicates x element would be placed before y. When returns true, then x precedes y. Note that, because equality is predicated by !comp(x, y) && !comp(y, x), the function must not cover the equality like <= or >=. It must exclude the equality like < or >. Default is less.

  Returns PriorityQueue

• Copy Constructor.

  Parameters

  • obj: PriorityQueue<T>

    Object to copy.

  Returns PriorityQueue

• Range Constructor.

  Parameters

  • first: Readonly<IForwardIterator<T>>

    Input iterator of the first position.

  • last: Readonly<IForwardIterator<T>>

    Input iterator of the last position.

  • Optional comp: Comparator<T>

    A binary function predicates x element would be placed before y. When returns true, then x precedes y. Note that, because equality is predicated by !comp(x, y) && !comp(y, x), the function must not cover the equality like <= or >=. It must exclude the equality like < or >. Default is less.

  Returns PriorityQueue