To better handle the problem of sparse array completion mentioned a couple years ago...
What you really need in this scenario is an empty array containing all the desired keys, and a sparse array containing the keys and values you want overridden. This PHP5 function does that. (The PEAR package PHP_Compat should be able to fill in the gap -- array_combine() -- for a 4.3 install, if necessary.)
<?php
function array_complete(
$keys="", // array of keys you need filled, in order
$sparse="" // sparse array to override blanks
)
{
if(!is_array($sparse))
$sparse=array();
if(!is_array($keys))
return $sparse;
return array_merge(
array_combine( // create an associative array
$keys, // your list of keys
array_fill( // blank value for each key
0,count(
$keys
),""
)
),$sparse // merge with your incomplete array
);
}
?>
This merges in your sparse array (inserting any additional keys in that array after the ones you've specified), placing its values in the key order you specify, leaving all the other values blank.
Test call: var_dump(array_complete(array("test1", "test2", "test3", "test4", "test5"), array("test3" => "test3", "test1" => "test1", "garbage" => "garbage")));
Result: array(6) {
["test1"]=>
string(5) "test1"
["test2"]=>
string(0) ""
["test3"]=>
string(5) "test3"
["test4"]=>
string(0) ""
["test5"]=>
string(0) ""
["garbage"]=>
string(7) "garbage"
}
array_fill
(PHP 4 >= 4.2.0, PHP 5)
array_fill — Completează un tablou cu valori
Descrierea
Completează un tablou cu num înregistrări cu valoarea parametrului value , cheile începând de la valoarea parametrului start_index .
Parametri
- start_index
-
Primul indice al tabloului întors
- num
-
Numărul elementelor pentru a fi inserate
- value
-
Valoarea utilizată pentru a completa tabloul
Valorile întroarse
Întoarce tabloul completat
Erori/Excepţii
Aruncă o E_WARNING dacă num este mai mic decât unu.
Exemple
Example #1 Exemplu array_fill()
<?php
$a = array_fill(5, 6, 'banana');
$b = array_fill(-2, 2, 'pear');
print_r($a);
print_r($b);
?>
Exemplul de mai sus va afişa:
Array
(
[5] => banana
[6] => banana
[7] => banana
[8] => banana
[9] => banana
[10] => banana
)
Array
(
[-2] => pear
[0] => pear
)
Note
Accesaţi de asemenea secţiunea manualului referitoare la Tablouri pentru o explicaţie detaliată a cheilor negative.
Vedeţi de asemenea
- array_fill_keys() - Fill an array with values, specifying keys
- str_repeat() - Repeat a string
- range() - Create an array containing a range of elements
array_fill
caliban at darklock dot com
23-May-2005 02:42
23-May-2005 02:42
csst0266 at cs dot uoi dot gr
11-Aug-2004 05:32
11-Aug-2004 05:32
This is what I recently did to quickly create a two dimensional array (10x10), initialized to 0:
<?php
$a = array_fill(0, 10, array_fill(0, 10, 0));
?>
This should work for as many dimensions as you want, each time passing to array_fill() (as the 3rd argument) another array_fill() function.
jausion at hotmail-dot-com
29-Mar-2003 07:50
29-Mar-2003 07:50
For PHP < 4.2.0 users:
Add this to your script:
if (!function_exists('array_fill')) {
require_once('array_fill.func.php');
}
and the array_fill.func.php file:
<?php
// For PHP version < 4.2.0 missing the array_fill function,
// I provide here an alternative. -Philippe
function array_fill($iStart, $iLen, $vValue) {
$aResult = array();
for ($iCount = $iStart; $iCount < $iLen + $iStart; $iCount++) {
$aResult[$iCount] = $vValue;
}
return $aResult;
}
?>
25-Aug-2002 08:59
array_fill() cannot be used to setup only missing keys in an array. This may be necessary for example before using implode() on a sparse filled array.
The solution is to use this function:
<?php
function array_setkeys(&$array, $fill = NULL) {
$indexmax = -1;
for (end($array); $key = key($array); prev($array)) {
if ($key > $indexmax)
$indexmax = $key;
}
for ($i = 0; $i <= $indexmax; $i++) {
if (!isset($array[$i]))
$array[$i] = $fill;
}
ksort($array);
}
?>
This is usefull in some situations where you don't know which key index was filled and you want to preserve the association between a positioned field in an imploded array and the key index when exploding it.
