array ( 0 => 'index.php', 1 => 'PHP Manual', ), 'head' => array ( 0 => 'UTF-8', 1 => 'de', ), 'this' => array ( 0 => 'class.splpriorityqueue.php', 1 => 'SplPriorityQueue', 2 => 'The SplPriorityQueue class', ), 'up' => array ( 0 => 'spl.datastructures.php', 1 => 'Datastructures', ), 'prev' => array ( 0 => 'splminheap.compare.php', 1 => 'SplMinHeap::compare', ), 'next' => array ( 0 => 'splpriorityqueue.compare.php', 1 => 'SplPriorityQueue::compare', ), 'alternatives' => array ( ), 'source' => array ( 'lang' => 'en', 'path' => 'reference/spl/splpriorityqueue.xml', ), 'history' => array ( ), 'extra_header_links' => array ( 'rel' => 'alternate', 'href' => '/manual/en/feeds/class.splpriorityqueue.atom', 'type' => 'application/atom+xml', ), ); $setup["toc"] = $TOC; $setup["toc_deprecated"] = $TOC_DEPRECATED; $setup["parents"] = $PARENTS; manual_setup($setup); contributors($setup); ?>

The SplPriorityQueue class

(PHP 5 >= 5.3.0, PHP 7, PHP 8)

Einführung

The SplPriorityQueue class provides the main functionalities of a prioritized queue, implemented using a max heap.

Hinweis: The order of elements with identical priority is undefined. It may differ from the order in which they have been inserted.

Klassenbeschreibung

class SplPriorityQueue implements Iterator, Countable {
/* Konstanten */
public const int EXTR_BOTH;
public const int EXTR_PRIORITY;
public const int EXTR_DATA;
/* Methoden */
public compare(mixed $priority1, mixed $priority2): int
public count(): int
public current(): mixed
public extract(): mixed
public getExtractFlags(): int
public insert(mixed $value, mixed $priority): true
public isCorrupted(): bool
public isEmpty(): bool
public key(): int
public next(): void
public recoverFromCorruption(): true
public rewind(): void
public setExtractFlags(int $flags): int
public top(): mixed
public valid(): bool
}

Inhaltsverzeichnis