应用通报的数组递归交换第一个数组的元素
array_replace_recursive
$base = array('citrus' => array( "orange") , 'berries' => array("blackberry", "raspberry"), ); $replacements = array('citrus' => array('pineapple'), 'berries' => array('blueberry')); $basket = array_replace_recursive($base, $replacements);
带索引反省较量争论数组的交加,用回调函数比拟索引 array_intersect_uassoc
$array1 = array("a" => "green", "b" => "brown", "c" => "blue", "red"); $array2 = array("a" => "GREEN", "B" => "brown", "yellow", "red"); print_r(array_intersect_uassoc($array1, $array2, "strcasecmp"));
递归地兼并一个或多个数组 array_merge_recursive
$ar1 = array("color" => array("favorite" => "red"), 5);\ $ar2 = array(10, "color" => array("favorite" => "green", "blue"));\ $result = array_merge_recursive($ar1, $ar2);
应用通报的数组递归交换第一个数组的元素 array_replace_recursive
$base = array('citrus' => array( "orange") , 'berries' => array("blackberry", "raspberry"), ); $replacements = array('citrus' => array('pineapple'), 'berries' => array('blueberry')); $basket = array_replace_recursive($base, $replacements); print_r($basket);\
将一个线性数组转换为一个树,或许多维数组
function array_stack (&$a, $p = '@parent', $c = '@children') { $l = $t = array(); foreach ($a AS $key => $val): if (!$val[$p]) $t[$key] =& $l[$key]; else $l[$val[$p]][$c][$key] =& $l[$key]; $l[$key] = (array)$l[$key] + $val; endforeach; return $a = array('tree' => $t, 'leaf' => $l); } $node = array(); $node[1] = array('@parent' => 0, 'title' => 'I am node 1.'); $node[2] = array('@parent' => 1, 'title' => 'I am node 2.'); $node[3] = array('@parent' => 2, 'title' => 'I am node 3.'); $node[4] = array('@parent' => 1, 'title' => 'I am node 4.'); $node[5] = array('@parent' => 4, 'title' => 'I am node 5.'); print_r(array_stack($node));
以上就是分享几个无意思的数组办法的具体内容,更多请存眷资源魔其它相干文章!
标签: php开发教程 php开发资料 php开发自学 数组
版权声明:除非特别标注,否则均为本站原创文章,转载时请以链接形式注明文章出处。
抱歉,评论功能暂时关闭!