本文整理匯總了PHP中Zend\Stdlib\PriorityQueue::top方法的典型用法代碼示例。如果您正苦於以下問題：PHP PriorityQueue::top方法的具體用法？PHP PriorityQueue::top怎麽用？PHP PriorityQueue::top使用的例子？那麽, 這裏精選的方法代碼示例或許可以為您提供幫助。您也可以進一步了解該方法所在類Zend\Stdlib\PriorityQueue的用法示例。
在下文中一共展示了PriorityQueue::top方法的2個代碼示例，這些例子默認根據受歡迎程度排序。您可以為喜歡或者感覺有用的代碼點讚，您的評價將有助於係統推薦出更棒的PHP代碼示例。
示例1: testCloningAlsoClonesQueue
public function testCloningAlsoClonesQueue()
{
$foo = new \stdClass();
$foo->name = 'bar';
$queue = new PriorityQueue();
$queue->insert($foo, 1);
$queue->insert($foo, 2);
$queueClone = clone $queue;
while (!$queue->isEmpty()) {
$this->assertSame($foo, $queue->top());
$queue->remove($queue->top());
}
$this->assertTrue($queue->isEmpty());
$this->assertFalse($queueClone->isEmpty());
$this->assertEquals(2, $queueClone->count());
while (!$queueClone->isEmpty()) {
$this->assertSame($foo, $queueClone->top());
$queueClone->remove($queueClone->top());
}
$this->assertTrue($queueClone->isEmpty());
}示例2: read
/**
* If the chain is non-empty then the storage with the top priority is guaranteed to be
* filled. Return its value.
*
* @see StorageInterface::read()
*/
public function read()
{
return $this->storageChain->top()->read();
}