You can use this to quickly find all the files (recursively) in a certain directory. This beats maintaining a stack yourself.
<?php
$directory = "/tmp/";
$fileSPLObjects = new RecursiveIteratorIterator(
new RecursiveDirectoryIterator($directory),
RecursiveIteratorIterator::CHILD_FIRST
);
try {
foreach( $fileSPLObjects as $fullFileName => $fileSPLObject ) {
print $fullFileName . " " . $fileSPLObject->getFilename() . "\n";
}
}
catch (UnexpectedValueException $e) {
printf("Directory [%s] contained a directory we can not recurse into", $directory);
}
?>
Note: if there is a directory contained within the directory you are searching in that you have no access to read an UnexpectedValueException will be thrown (leaving you with an empty list).
Note: objects returned are SPLFileObjects
RecursiveIteratorIterator::beginChildren
RecursiveFilterIterator::hasChildren
[edit] Last updated: Fri, 17 May 2013
RecursiveFilterIterator::hasChildren
[edit] Last updated: Fri, 17 May 2013
Класс RecursiveIteratorIterator
(PHP 5)
Введение
Может быть использован для перебора рекурсивных итераторов.
Обзор классов
/* Константы */
/* Методы */
public __construct
( Traversable
$iterator
[, int $mode = RecursiveIteratorIterator::LEAVES_ONLY
[, int $flags = 0
]] )/* Наследуемые методы */
}Предопределенные константы
-
RecursiveIteratorIterator::LEAVES_ONLY -
RecursiveIteratorIterator::SELF_FIRST -
RecursiveIteratorIterator::CHILD_FIRST -
RecursiveIteratorIterator::CATCH_GET_CHILD
Содержание
- RecursiveIteratorIterator::beginChildren — Переход к первому дочернему элементу
- RecursiveIteratorIterator::beginIteration — Начало навигации
- RecursiveIteratorIterator::callGetChildren — Получение дочерних элементов
- RecursiveIteratorIterator::callHasChildren — Проверка, есть ли у элемента дочерние
- RecursiveIteratorIterator::__construct — Конструктор класса RecursiveIteratorIterator
- RecursiveIteratorIterator::current — Получает значение текущего элемента
- RecursiveIteratorIterator::endChildren — End children
- RecursiveIteratorIterator::endIteration — Окончание навигации
- RecursiveIteratorIterator::getDepth — Определяет текущую глубину рекурсии
- RecursiveIteratorIterator::getInnerIterator — Получение ссылки на внутренний итератор
- RecursiveIteratorIterator::getMaxDepth — Получение максимальной глубины рекурсии
- RecursiveIteratorIterator::getSubIterator — Получение активного вложенного итератора
- RecursiveIteratorIterator::key — Получение ключа текущего элемента
- RecursiveIteratorIterator::next — Перемещение итератора к следующему элементу
- RecursiveIteratorIterator::nextElement — Следующий элемент
- RecursiveIteratorIterator::rewind — Перемещает итератор на первый элемент самого верхнего уровня вложенности внутреннего итератора
- RecursiveIteratorIterator::setMaxDepth — Установка максимальной глубины вложенности
- RecursiveIteratorIterator::valid — Проверка допустимости текущей позиции
RecursiveIteratorIterator::beginChildren
RecursiveFilterIterator::hasChildren
[edit] Last updated: Fri, 17 May 2013
RecursiveFilterIterator::hasChildren
[edit] Last updated: Fri, 17 May 2013
add a note
User Contributed Notes
RecursiveIteratorIterator - [5 notes]
Michiel Brandenburg ¶
3 years ago
crashrox at gmail dot com ¶
4 years ago
Recursive multidimensional array flatten using SPL
<?php
function array_flatten_recursive($array) {
if($array) {
$flat = array();
foreach(new RecursiveIteratorIterator(new RecursiveArrayIterator($array), RecursiveIteratorIterator::SELF_FIRST) as $key=>$value) {
if(!is_array($value)) {
$flat[] = $value;
}
}
return $flat;
} else {
return false;
}
}
$array = array(
'A' => array('B' => array( 1, 2, 3, 4, 5)),
'C' => array( 6,7,8,9)
);
print_r(array_flatten_recursive($array));
?>
-- Returns:
Array (
[0] => 1
[1] => 2
[2] => 3
[3] => 4
[4] => 5
[5] => 6
[6] => 7
[7] => 8
[8] => 9
)
Adil Baig @ AIdezigns ¶
1 year ago
A very important thing to note about \RecursiveIteratorIterator is that it returns a flattened array when used with the iterator_to_array function. Ex:
<?php
$arr = array('Zero', 'name'=>'Adil', 'address' => array( 'city'=>'Dubai', 'tel' => array('int' => 971, 'tel'=>12345487)), '' => 'nothing');
$iterator = new \RecursiveIteratorIterator(new \RecursiveArrayIterator($arr));
var_dump(iterator_to_array($iterator,true));
?>
This code will return :
array(6) {
[0]=>
string(4) "Zero"
["name"]=>
string(4) "Adil"
["city"]=>
string(5) "Dubai"
["int"]=>
int(91)
["tel"]=>
int(12345487)
[""]=>
string(7) "nothing"
}
To get the non-flattened proper array use the getArrayCopy() method, like so :
$iterator->getArrayCopy()
This will return
array(4) {
[0]=>
string(4) "Zero"
["name"]=>
string(4) "Adil"
["address"]=>
array(2) {
["city"]=>
string(5) "Dubai"
["tel"]=>
array(2) {
["int"]=>
int(91)
["tel"]=>
int(12345487)
}
}
[""]=>
string(7) "nothing"
}
Tom ¶
2 years ago
This class operates on a tree of elements, which is build by nesting recursive iterators into one another.
Thus you might say it is an iterator over iterators. While traversing those, the class pushes the iterators on a stack while traversing down to a leaf and removes them from the stack while going back up.
aidan at php dot net ¶
3 years ago
This example demonstrates using the getDepth() method with a RecursiveArrayIterator.
<?php
$tree = array();
$tree[1][2][3] = 'lemon';
$tree[1][4] = 'melon';
$tree[2][3] = 'orange';
$tree[2][5] = 'grape';
$tree[3] = 'pineapple';
print_r($tree);
$arrayiter = new RecursiveArrayIterator($tree);
$iteriter = new RecursiveIteratorIterator($arrayiter);
foreach ($iteriter as $key => $value) {
$d = $iteriter->getDepth();
echo "depth=$d k=$key v=$value\n";
}
?>
The output of this would be:
Array
(
[1] => Array
(
[2] => Array
(
[3] => lemon
)
[4] => melon
)
[2] => Array
(
[3] => orange
[5] => grape
)
[3] => pineapple
)
depth=2 k=3 v=lemon
depth=1 k=4 v=melon
depth=1 k=3 v=orange
depth=1 k=5 v=grape
depth=0 k=3 v=pineapple