PHP設計模式漫談之迭代器模式(5)_PHP教程

來源:互聯網
上載者:User
注意,迭代器是比對象集更好的抽象,因為我們可以讓InfiniteIterators,NoRewindIterators等,不用與普通數組陣列與一致,因此,Iterator缺少count()函數等功能。
在PHP官方手冊中可以找到完整的SPL迭代器列表。得益於對PHP的強力支援,使用迭代器模式的大部分工作都包括在標準實現中,下面的程式碼範例就利用了標準Iterator和RecursiveIterators的功能。

___FCKpd___0___FCKpd___1

// lets play with RecursiveIterator implementations $it = new RecursiveArrayIterator(array( A, B, array( C, D ), array( array( E, F ), array( G, H, I ) ) )); // $it is a RecursiveIterator but also an Iterator, // so it loops normally over the four elements // of the array. echo "Foreach over a RecursiveIterator: "; foreach ($it as $value) { echo $value; // but RecursiveIterators specify additional // methods to explore children nodes $children = $it->hasChildren() ? {Yes} : {No}; echo $children, ; } echo ""; // we can bridge it to a different contract via // a RecursiveIteratorIterator, whose cryptic name // should be read as an Iterator that spans over // a RecursiveIterator. echo "Foreach over a RecursiveIteratorIterator: "; foreach (new RecursiveIteratorIterator($it) as $value) { echo $value; } echo ""; 原文名:Practical Php Patterns: Iterator 作者:Giorgio

content;
private $_index = 0;

public function __construct(array $content)
{
$this->_content = $content;
}

public function rewind()
{
$this->_index = 0;
}

public function valid()
{
return isset($this->_content[$this->_index]);
}

public function current()
{
return $this->_content[$this->_index];
}

public function key()
{
return $this->_index;
}

public function next()
{
$this->_index++;
}
}

$arrayarray = array(A, B, C, D);
echo "Collection: ";
foreach (new Collection($array) as $key => $value) {
echo "$key => $value. ";
}
echo "";
___FCKpd___1___FCKpd___2原文名:Practical Php Patterns: Iterator 作者:Giorgio

content;

public function __construct(array $content)
{
$this->_content = $content;
}

public function contains($number)
{
return in_array($number, $this->_content);
}

/**
* Only this method is necessary to implement IteratorAggregate.
* @return Iterator
*/
public function getIterator()
{
return new ArrayIterator($this->_content);
}
}

echo "NumbersSet: ";
foreach (new NumbersSet($array) as $key => $value) {
echo "$key => $value. ";
}
echo "";
___FCKpd___2原文名:Practical Php Patterns: Iterator 作者:Giorgio

content;
private $_index = 0;

public function __construct(array $content)
{
$this->_content = $content;
}

public function rewind()
{
$this->_index = 0;
}

public function valid()
{
return isset($this->_content[$this->_index]);
}

public function current()
{
return $this->_content[$this->_index];
}

public function key()
{
return $this->_index;
}

public function next()
{
$this->_index++;
}
}

$arrayarray = array(A, B, C, D);
echo "Collection: ";
foreach (new Collection($array) as $key => $value) {
echo "$key => $value. ";
}
echo "";
___FCKpd___1___FCKpd___2

http://www.bkjia.com/PHPjc/478773.htmlwww.bkjia.comtruehttp://www.bkjia.com/PHPjc/478773.htmlTechArticle注意,迭代器是比對象集更好的抽象,因為我們可以讓InfiniteIterators,NoRewindIterators等,不用與普通數組陣列與一致,因此,Iterator缺少cou...

  • 聯繫我們

    該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

    如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

    A Free Trial That Lets You Build Big!

    Start building with 50+ products and up to 12 months usage for Elastic Compute Service

    • Sales Support

      1 on 1 presale consultation

    • After-Sales Support

      24/7 Technical Support 6 Free Tickets per Quarter Faster Response

    • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.