PHP Find File In Directory, Scan Subdirectories. Find Array Value In Matrix.

»»» shrink text ««« ««« enlarge text »»»

OBJECTIVE: implement in Php functions to find files in a directory or items (values) in an array no matter how branched the array is or how many subdirectories the chosen root directory has and how irregularly arranged. Find after full file name or full array value, or after substrings, or using regular expressions.  
 
About five functions belonging to this family can be found on Php: Scan A Directory Or An Array Of Arrays (Matrix, Numerical Or Associative).  
Find a file name scanning a branched directory, stop when found.  

function findFile($node, $value, $limit=0, $separator="\\"){
//validate:
if(!is_dir($node) || !isset($value) || $value===""){return null;}; $newSeparator=($separator=="\\")?"/":$separator;
$node=str_replace($separator,$newSeparator,$node); $node=str_replace("//",$newSeparator,$node);
$node=(strrpos($node, $newSeparator)==strlen($node)-1)?
substr($node, 0, strlen($node)-1):$node;
//initialize:
$slashes=substr_count($node, $newSeparator); $limit=(!$limit)?-1:$limit+$slashes;
$stack=array( array($node, $slashes) );
//RUN:
	while(sizeof($stack) && $stack[0][1]!=$limit){
	$current=array_shift($stack);
	$items=opendir($current[0]); 
		while( ($it=readdir($items))!==false ){
			if( strrpos($it,".") === (strlen($it)-1) ){continue;};
		$path=$current[0].$newSeparator.$it;
			if(is_dir($path)){
			$directories[]=$path; $stack[]=array( $path, substr_count($path, $newSeparator) );}
			else if($it === $value){return $path;};
		};
	}
return false;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
INPUTS: first the string address of the directory and subdirectories within which the file has to be located.  
Then the string file name to locate inclusive of extension if present.  
Then an optional number representing the nested folders depth, zero meaning scan all subfolders.  
A last argument is optional and represents the directory separator implemented on your operative system, defaults to the Windows backward slash.  
 
RETURNS: null in case of wrong inputs, boolean false if no file is found or the string path to the found file, inclusive of the file name.  
 
CAVEATS: case sensitive.  
Same as above but case insensitive:  

function findFilei($node, $value, $limit=0, $separator="\\"){
//validate:
if(!is_dir($node) || !isset($value) || $value===""){return null;}; $newSeparator=($separator=="\\")?"/":$separator;
$node=str_replace($separator,$newSeparator,$node); $node=str_replace("//",$newSeparator,$node);
$node=(strrpos($node, $newSeparator)==strlen($node)-1)?
substr($node, 0, strlen($node)-1):$node;
//initialize:
$slashes=substr_count($node, $newSeparator); $limit=(!$limit)?-1:$limit+$slashes;
$stack=array( array($node, $slashes) ); $value=strtolower($value);
//RUN:
	while(sizeof($stack) && $stack[0][1]!=$limit){
	$current=array_shift($stack);
	$items=opendir($current[0]);
		while( ($it=readdir($items))!==false ){
			if( strrpos($it,".") === (strlen($it)-1) ){continue;};
		$path=$current[0].$newSeparator.$it;
			if(is_dir($path)){
			$directories[]=$path; $stack[]=array( $path, substr_count($path, $newSeparator) );}
			else if(strtolower($it) === $value){return $path;};
		};
	}
return false;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
Find a file name scanning a branched directory, report all found instances.  

function findFiles($node, $value, $limit=0, $separator="\\"){
//validate:
if(!is_dir($node) || !isset($value) || $value===""){return null;}; $newSeparator=($separator=="\\")?"/":$separator;
$node=str_replace($separator,$newSeparator,$node); $node=str_replace("//",$newSeparator,$node);
$node=(strrpos($node, $newSeparator)==strlen($node)-1)?
substr($node, 0, strlen($node)-1):$node;
//initialize:
$slashes=substr_count($node, $newSeparator); $limit=(!$limit)?-1:$limit+$slashes;
$output=array(); $stack=array( array($node, $slashes) );
//RUN:
	while(sizeof($stack) && $stack[0][1]!=$limit){
	$current=array_shift($stack);
	$items=opendir($current[0]);
		while( ($it=readdir($items))!==false ){
			if( strrpos($it,".") === (strlen($it)-1) ){continue;};
		$path=$current[0].$newSeparator.$it;
			if(is_dir($path)){
			$directories[]=$path; $stack[]=array( $path, substr_count($path, $newSeparator) );}
			else if($it === $value){$output[]=$path;};
		};
	}
return $output;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
INPUTS: first the string address of the directory and subdirectories within which the file has to be located.  
Then the string file name to locate inclusive of extension if present.  
Then an optional number representing the nested folders depth, zero meaning scan all subfolders.  
A last argument is optional and represents the directory separator implemented on your operative system, defaults to the Windows backward slash.  
 
RETURNS: null in case of wrong inputs, an empty array if no file is found or an array whose each item is a string path to the found file(s), inclusive of the file name(s).  
 
CAVEATS: case sensitive.  
Same as above but case insensitive:  

function findFilesi($node, $value, $limit=0, $separator="\\"){
//validate:
if(!is_dir($node) || !isset($value) || $value===""){return null;}; $newSeparator=($separator=="\\")?"/":$separator;
$node=str_replace($separator,$newSeparator,$node); $node=str_replace("//",$newSeparator,$node);
$node=(strrpos($node, $newSeparator)==strlen($node)-1)?
substr($node, 0, strlen($node)-1):$node;
//initialize:
$slashes=substr_count($node, $newSeparator); $limit=(!$limit)?-1:$limit+$slashes;
$output=array(); $stack=array( array($node, $slashes) ); $value=strtolower($value);
//RUN:
	while(sizeof($stack) && $stack[0][1]!=$limit){
	$current=array_shift($stack);
	$items=opendir($current[0]);
		while( ($it=readdir($items))!==false ){
			if( strrpos($it,".") === (strlen($it)-1) ){continue;};
		$path=$current[0].$newSeparator.$it;
			if(is_dir($path)){
			$directories[]=$path; $stack[]=array( $path, substr_count($path, $newSeparator) );}
			else if(strtolower($it) === $value){$output[]=$path;};
		};
	}
return $output;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
Find a file name given a substring of the name (partial name, that is - such as also just the extension) scanning a branched directory, report all found instances.  

function findFiless($node, $value, $limit=0, $separator="\\"){
//validate:
if(!is_dir($node) || !isset($value) || $value===""){return null;}; $newSeparator=($separator=="\\")?"/":$separator;
$node=str_replace($separator,$newSeparator,$node); $node=str_replace("//",$newSeparator,$node);
$node=(strrpos($node, $newSeparator)==strlen($node)-1)?
substr($node, 0, strlen($node)-1):$node;
//initialize:
$slashes=substr_count($node, $newSeparator); $limit=(!$limit)?-1:$limit+$slashes;
$output=array(); $stack=array( array($node, $slashes) ); $value=strtolower($value);
//RUN:
	while(sizeof($stack) && $stack[0][1]!=$limit){
	$current=array_shift($stack);
	$items=opendir($current[0]);
		while( ($it=readdir($items))!==false ){
			if( strrpos($it,".") === (strlen($it)-1) ){continue;};
		$path=$current[0].$newSeparator.$it;
			if(is_dir($path)){
			$directories[]=$path; $stack[]=array( $path, substr_count($path, $newSeparator) );}
			else if(strpos(strtolower($it), $value)  !== false){$output[]=$path;};
		};
	}
return $output;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
INPUTS: first the string address of the directory and subdirectories within which the file has to be located.  
Then the string file name to locate inclusive of extension if present.  
Then an optional number representing the nested folders depth, zero meaning scan all subfolders.  
A last argument is optional and represents the directory separator implemented on your operative system, defaults to the Windows backward slash.  
 
RETURNS: null in case of wrong inputs, an empty array if no file is found or an array whose each item is a string path to the found file(s), inclusive of the file name(s).  
 
CAVEATS: case sensitive.  
Find a file name given a regular expression (so it may allow also partial name, that is - such as also just the extension) scanning a branched directory, report all found instances.  

function findFilesr($node, $regexp, $limit=0, $separator="\\"){
//validate:
if(!is_dir($node) || !is_string($regexp)){return null;}; $newSeparator=($separator=="\\")?"/":$separator;
$node=str_replace($separator,$newSeparator,$node); $node=str_replace("//",$newSeparator,$node);
$node=(strrpos($node, $newSeparator)==strlen($node)-1)?
substr($node, 0, strlen($node)-1):$node;
//initialize:
$slashes=substr_count($node, $newSeparator); $limit=(!$limit)?-1:$limit+$slashes;
$output=array(); $stack=array( array($node, $slashes) );
//RUN:
	while(sizeof($stack) && $stack[0][1]!=$limit){
	$current=array_shift($stack);
	$items=opendir($current[0]);
		while( ($it=readdir($items))!==false ){
			if( strrpos($it,".") === (strlen($it)-1) ){continue;};
		$path=$current[0].$newSeparator.$it;
			if(is_dir($path)){
			$directories[]=$path; $stack[]=array( $path, substr_count($path, $newSeparator) );}
			else if(preg_match($regexp,$it)){$output[]=$path;};
		};
	}
return $output;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
INPUTS: first the string address of the directory and subdirectories within which the file has to be located.  
Then a regular expression in between quotes, inclusive of the leading and trailing forward slashes; after the trailing ending slash you can add a i flag to make it case insensitive if you prefer so.  
Then an optional number representing the nested folders depth, zero meaning scan all subfolders.  
A last argument is optional and represents the directory separator implemented on your operative system, defaults to the Windows backward slash.  
 
RETURNS: null in case of wrong inputs, an empty array if no file is found or an array whose each item is a string path to the found file(s), inclusive of the file name(s).  
Find a file name given a regular expression (so it may allow also partial name, that is - such as also just the extension) scanning a branched directory, stop when found.  

function findFiler($node, $regexp, $limit=0, $separator="\\"){
//validate:
if(!is_dir($node) || !is_string($regexp)){return null;}; $newSeparator=($separator=="\\")?"/":$separator;
$node=str_replace($separator,$newSeparator,$node); $node=str_replace("//",$newSeparator,$node);
$node=(strrpos($node, $newSeparator)==strlen($node)-1)?
substr($node, 0, strlen($node)-1):$node;
//initialize:
$slashes=substr_count($node, $newSeparator); $limit=(!$limit)?-1:$limit+$slashes;
$stack=array( array($node, $slashes) );
//RUN:
	while(sizeof($stack) && $stack[0][1]!=$limit){
	$current=array_shift($stack);
	$items=opendir($current[0]);
		while( ($it=readdir($items))!==false ){
			if( strrpos($it,".") === (strlen($it)-1) ){continue;};
		$path=$current[0].$newSeparator.$it;
			if(is_dir($path)){
			$directories[]=$path; $stack[]=array( $path, substr_count($path, $newSeparator) );}
			else if(preg_match($regexp,$it)){return $path;};
		};
	}
return false;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
INPUTS: first the string address of the directory and subdirectories within which the file has to be located.  
Then a regular expression in between quotes, inclusive of the leading and trailing forward slashes; after the trailing ending slash you can add a i flag to make it case insensitive if you prefer so.  
Then an optional number representing the nested folders depth, zero meaning scan all subfolders.  
A last argument is optional and represents the directory separator implemented on your operative system, defaults to the Windows backward slash.  
 
RETURNS: null in case of wrong inputs, boolean false if no file is found or the string path to the found file, inclusive of the file name.  
Remember Php: Scan A Directory Or An Array Of Arrays (Matrix, Numerical Or Associative).  
 
Next function:  
Find a file name scanning a branched numerically indexed array, stop when found.  

function find($node, $value){
if(!$node || !is_array($node) || (!isset($value) && $value!==null)){return null;};
$stack=array( array($node, sizeof($node), array()) );
	while(sizeof($stack)){
	$currentStackIndex=sizeof($stack)-1;
		if(is_array( $stack[$currentStackIndex][0] ) && $stack[$currentStackIndex][1]){
		$nextObjectIndex=( sizeof($stack[$currentStackIndex][0]) - $stack[$currentStackIndex][1] );
		--$stack[$currentStackIndex][1];
			array_push($stack,
				array($stack[$currentStackIndex][0][$nextObjectIndex], sizeof($stack[$currentStackIndex][0][$nextObjectIndex]), array_merge($stack[$currentStackIndex][2], array($nextObjectIndex)))
			);
		continue;};
			if( $stack[$currentStackIndex][0] === $value ){
				return array($stack[$currentStackIndex][0], $stack[$currentStackIndex][2]);
			};
		array_pop($stack);
	}
	return false;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
INPUTS: first the string address of the directory and subdirectories within which the file has to be located.  
Then the string value to locate inclusive of extension if present.  
 
RETURNS: null in case of wrong inputs, boolean false if no such value is found or an array of two items. The first is the item found at the end of each branch, and the second item is an array again, whose each entry is a number: that is the map of all the traversed indexes to get at the reported item.  
 
CAVEATS: case sensitive.  
Find a file name scanning a branched numerically indexed array, report all found items.  

function findAll($node, $value){
if(!$node || !is_array($node) || (!isset($value) && $value!==null)){return null;};
$output=array(); $stack=array( array($node, sizeof($node), array()) );
	while(sizeof($stack)){
	$currentStackIndex=sizeof($stack)-1;
		if(is_array( $stack[$currentStackIndex][0] ) && $stack[$currentStackIndex][1]){
		$nextObjectIndex=( sizeof($stack[$currentStackIndex][0]) - $stack[$currentStackIndex][1] );
		--$stack[$currentStackIndex][1];
			array_push($stack,
				array($stack[$currentStackIndex][0][$nextObjectIndex], sizeof($stack[$currentStackIndex][0][$nextObjectIndex]), array_merge($stack[$currentStackIndex][2], array($nextObjectIndex)))
			);
		continue;};
			if( $stack[$currentStackIndex][0] === $value ){
				$output[]=array($stack[$currentStackIndex][0], $stack[$currentStackIndex][2]);
			};
		array_pop($stack);
	}
	return $output;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
INPUTS: first the string address of the directory and subdirectories within which the file has to be located.  
Then the string value to locate inclusive of extension if present.  
 
RETURNS: null in case of wrong inputs, an empty array if no such value is found or an array of two items. The first is the item found at the end of each branch, and the second item is an array again, whose each entry is a number: that is the map of all the traversed indexes to get at the reported item.  
 
CAVEATS: case sensitive.  
Find a file name scanning a branched associative array, stop when found.  

function associativeFind($node, $value){
if(!$node || !is_array($node) || (!isset($value) && $value!==null)){return null;};
$stack=array( array($node, 0, 0, array(), array(), array()) );
	while(sizeof($stack)){
	$currentStackIndex=sizeof($stack)-1;
		if( !$stack[$currentStackIndex][2] && is_array($stack[$currentStackIndex][0]) ){
		$stack[$currentStackIndex][3]=array_keys($stack[$currentStackIndex][0]);
		$stack[$currentStackIndex][1]=sizeof($stack[$currentStackIndex][3]);/*decreasing length*/
		$stack[$currentStackIndex][2]=sizeof($stack[$currentStackIndex][3]);/*fixed length*/
		};
		if(is_array( $stack[$currentStackIndex][0] ) && $stack[$currentStackIndex][1]){
		$nextObjectIndex=( $stack[$currentStackIndex][2] - $stack[$currentStackIndex][1] );
		$nextObjectAssociativeIndex=$stack[$currentStackIndex][3][$nextObjectIndex];
		--$stack[$currentStackIndex][1];
			array_push($stack,
				array($stack[$currentStackIndex][0][$nextObjectAssociativeIndex], 0, 0, array(), array_merge($stack[$currentStackIndex][4], array($nextObjectAssociativeIndex)), array_merge($stack[$currentStackIndex][5], array($nextObjectIndex))
				)
			);
		continue;};
			if( $stack[$currentStackIndex][0] === $value ){
				return array($stack[$currentStackIndex][0], $stack[$currentStackIndex][4], $stack[$currentStackIndex][5]);
			};
		array_pop($stack);
	}
	return false;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
INPUTS: first the string address of the directory and subdirectories within which the file has to be located.  
Then the string value to locate inclusive of extension if present.  
 
RETURNS: null in case of wrong inputs, boolean false if no such value is found or an array of two items. The first is the item found at the end of each branch, and the second item is an array again, whose each entry is a number: that is the map of all the traversed indexes to get at the reported item.  
 
CAVEATS: case sensitive.  
Find a file name scanning a branched associative array, report all found items.  

function associativeFindAll($node, $value){
if(!$node || !is_array($node) || (!isset($value) && $value!==null)){return null;};
$output=array();
$stack=array( array($node, 0, 0, array(), array(), array()) );
	while(sizeof($stack)){
	$currentStackIndex=sizeof($stack)-1;
		if( !$stack[$currentStackIndex][2] && is_array($stack[$currentStackIndex][0]) ){
		$stack[$currentStackIndex][3]=array_keys($stack[$currentStackIndex][0]);
		$stack[$currentStackIndex][1]=sizeof($stack[$currentStackIndex][3]);/*decreasing length*/
		$stack[$currentStackIndex][2]=sizeof($stack[$currentStackIndex][3]);/*fixed length*/
		};
		if(is_array( $stack[$currentStackIndex][0] ) && $stack[$currentStackIndex][1]){
		$nextObjectIndex=( $stack[$currentStackIndex][2] - $stack[$currentStackIndex][1] );
		$nextObjectAssociativeIndex=$stack[$currentStackIndex][3][$nextObjectIndex];
		--$stack[$currentStackIndex][1];
			array_push($stack,
				array($stack[$currentStackIndex][0][$nextObjectAssociativeIndex], 0, 0, array(), array_merge($stack[$currentStackIndex][4], array($nextObjectAssociativeIndex)), array_merge($stack[$currentStackIndex][5], array($nextObjectIndex))
				)
			);
		continue;};
			if( $stack[$currentStackIndex][0] === $value ){
				$output[]=array($stack[$currentStackIndex][0], $stack[$currentStackIndex][4], $stack[$currentStackIndex][5]);
			};
		array_pop($stack);
	}
	return $output;
/* keep this comment to reuse freely:
http://www.fullposter.com/?1 */}

Remove colors  
INPUTS: first the string address of the directory and subdirectories within which the file has to be located.  
Then the string value to locate inclusive of extension if present.  
 
RETURNS: null in case of wrong inputs, an empty array if no such value is found or an array of two items. The first is the item found at the end of each branch, and the second item is an array again, whose each entry is a number: that is the map of all the traversed indexes to get at the reported item.  
 
CAVEATS: case sensitive.

Visitors: 15,898
Overall visits to all the topics: 5,066,706
Daily average (Calculated from the website subscription day): 2,078.22 Optional sorting commands:
Normal order: click here
Order by amount of visits: click here
Order by category: Programming Php
Current order: normal Other categories available for this author (Limited data report: 100):
Advice: Martial Arts and Self Defense(4), Books(236), Boxing(2), Critical Reviews and Essays(4), Dictionaries(1), Emergency Care(4), Epistles Letters and Advice(5), Fantasy Epics and Fables(1), History and Documents(5), Humor and Jokes(2), Methematics(2), Music and Lyrics(6), News Digests and Press Reviews(1), Novels Poetry and Stories(3), Philosophy Reviews(7), Poetry(1), Programming(4), Programming Ajax(2), Programming Javascript(82), Programming Php(52), Psychology(1), Quotes(1), Religion Esoterica and Spirituality(13), Scientifical Reviews(4), Self Improvement(1), Sport Activities and Apparels(1), Tarots(1) Showing topics: 11, 20
Available total: 450 View only a list of the snippets by this author: click here.
Other topics available for this author: click on any title below to view the complete item: