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

The SplHeap class

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

简介

The SplHeap class provides the main functionalities of a Heap.

类摘要

abstract class SplHeap implements Iterator, Countable {

/* 方法 */

protected compare(mixed $value1, mixed $value2): int

public count(): int

public current(): mixed

public extract(): mixed

public insert(mixed $value): true

public isCorrupted(): bool

public isEmpty(): bool

public key(): int

public next(): void

public recoverFromCorruption(): true

public rewind(): void

public top(): mixed

public valid(): bool

}

目录

SplHeap::compare — Compare elements in order to place them correctly in the heap while sifting up
SplHeap::count — Counts the number of elements in the heap
SplHeap::current — Return current node pointed by the iterator
SplHeap::extract — Extracts a node from top of the heap and sift up
SplHeap::insert — Inserts an element in the heap by sifting it up
SplHeap::isCorrupted — Tells if the heap is in a corrupted state
SplHeap::isEmpty — Checks whether the heap is empty
SplHeap::key — Return current node index
SplHeap::next — Move to the next node
SplHeap::recoverFromCorruption — Recover from the corrupted state and allow further actions on the heap
SplHeap::rewind — Rewind iterator back to the start (no-op)
SplHeap::top — Peeks at the node from the top of the heap
SplHeap::valid — Check whether the heap contains more nodes