SPL数据结构之队列SplQueue,先进先出,First In First Out(FIFO)。
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25
| <?php $obj = new SplQueue();
$obj->enqueue('a'); $obj->enqueue('b'); $obj->enqueue('c'); print_r($obj); echo 'Bottom:' . $obj->bottom() . "\r\n"; echo 'Top:' . $obj->top() . "\r\n";
$obj->offsetSet(0, 'A'); print_r($obj);
$obj->rewind(); echo 'Current:' . $obj->current() . "\r\n";
while ($obj->valid()) { echo $obj->key() . '=>' . $obj->current() . "\r\n"; $obj->next(); }
echo 'dequeue obj:' . $obj->dequeue() . "\r\n"; print_r($obj);
|