₦airaland Forum

//JS Memoization
//memo is a one dimensional array for storing pre-defined numbers.......
//the function returns a value if it already exists in the array.......
//.......else generate and store a value for future use, then return the generated value
var memoizer = function (memo, fundamental) {
 var shell = function (n) {
  var result = memo[n];
  if (typeof result !== 'number') {
    result = fundamental(shell, n);
    memo[n] = result;
  }
  return result;
 };
 return shell;
};
//fundamental function can be a Factorial, Fibonacci series generator, fetching data over a network or any processor intensive task

//PHP Multi-Dimension Array Restructuring --- handles 2D to nD arrays as memory permits
//Designed to rearrange $_FILES superglobal from associative to numeric array when multiple files are uploaded at once
function get_fixed_files() {
    $function = function($files, $fixed_files = [], $path = []) use (&$function) {
        foreach ($files as $key => $value) {
            $temp = $path;
            $temp[] = $key;
          
            if (is_array($value)) {
                $fixed_files = $function($value, $fixed_files, $temp);
            } else {
                $next = array_splice($temp, 1, 1);
                $temp = array_merge($temp, $next);
                    
                $new = &$fixed_files;
                    
                foreach ($temp as $key) {
                    $new = &$new[$key];
                }
                    
                $new = $value;
            }
        }
            
        return $fixed_files;
    };
        
    return $function($_FILES);
}

var arr = [

{charLen:['boobs','of', 'viv..'],randObj: ['push', 'your', 'limit'], views: 5},

{charLen: ['nmeri', 'chukwu', 'legend of all tym'], randObj: ['op is a fat donke'], longer: ['shell dynamism', 'thiswontbeomitted', {amy:'deep search  will not respond'}], views:17}

],

newData = path = [];

for(var a = 0; a <arr.length;a++) {

		var init = memoizer(arr[a], (mental,index) => {

			var ctxView = mental('views'),

            myShell =arr;

			for (var d =0;d <path.length;d++) myShell = myShell[path[d]];

		// your fundamental can do anything. here, I'm returning the element whose length matches the shell's view
			return myShell.filter(c => c.length == ctxView)[0]; // need access to contextual views
		}),

		keys = Object.keys(arr[a]);


		for(var b = 0; b < keys.length;b++) {


		path = [a, keys[b]]; // populate  this as as required. i imagine the data set will have random dimensions in each node but this is enough algorithming for one day. hint: you'll need another recursive function to grab all nested structures

		newData.push(init(keys[b]));

       }
}

console.log(newData)

romme2u:
I have over-studied in recent weeks as I’ve read more than I write (code); mostly package management and version control tools as I prepare for large-scale code collaboration and deployment of complex projects (actually I am preparing to port a Drupal 7 module to Drupal 8 for a start).

There is a technique that has been flying over my head for over a year (probably because I didn’t take it serious at first). I came across it in Douglas Crockford’s “JavaScript the Good Parts” while studying advanced function technique late last year. Here is a sample:

//JS Memoization
var memoizer = function (memo, fundamental) {
var shell = function (n) {
var result = memo[n];
if (typeof result !== 'number') {
result = fundamental(shell, n);
memo[n] = result;
}
return result;
};
return shell;
};


Here is it counterpart in PHP (Source – User Comment on PHP online manual):

//PHP Multi-Dimension Array Restructuring
function get_fixed_files() {
$function = function($files, $fixed_files = [], $path = []) use (&$function) {
foreach ($files as $key => $value) {
$temp = $path;
$temp[] = $key;

if (is_array($value)) {
$fixed_files = $function($value, $fixed_files, $temp);
} else {
$next = array_splice($temp, 1, 1);
$temp = array_merge($temp, $next);

$new = &$fixed_files;

foreach ($temp as $key) {
$new = &$new[$key];
}

$new = $value;
}
}

return $fixed_files;
};

return $function($_FILES);
}

Both piece of code uses same technique (Recursive Anonymous Function Expression) to solve two different problems. My issue is not recursive functions as I understand the concept perfectly. But since recursive function usually suffers from stack overflow (in some languages) and can be rewritten as iterative, I have never used it as iteration presents a more readable code.

It seems the PHP code uses the Tower of Hanoi concept to rearrange the data structure. It is just a guess, I’m not really sure.

Can anyone help me breakdown the code as the thing nearly crash my head.

seun, kodewrita, codehouse, kobojunkie talk2hb1

romme2u:
I have over-studied in recent weeks as I’ve read more than I write (code); mostly package management and version control tools as I prepare for large-scale code collaboration and deployment of complex projects (actually I am preparing to port a Drupal 7 module to Drupal 8 for a start).

There is a technique that has been flying over my head for over a year (probably because I didn’t take it serious at first). I came across it in Douglas Crockford’s “JavaScript the Good Parts” while studying advanced function technique late last year. Here is a sample:

//JS Memoization
var memoizer = function (memo, fundamental) {
var shell = function (n) {
var result = memo[n];
if (typeof result !== 'number') {
result = fundamental(shell, n);
memo[n] = result;
}
return result;
};
return shell;
};


Here is it counterpart in PHP (Source – User Comment on PHP online manual):

//PHP Multi-Dimension Array Restructuring
function get_fixed_files() {
$function = function($files, $fixed_files = [], $path = []) use (&$function) {
foreach ($files as $key => $value) {
$temp = $path;
$temp[] = $key;

if (is_array($value)) {
$fixed_files = $function($value, $fixed_files, $temp);
} else {
$next = array_splice($temp, 1, 1);
$temp = array_merge($temp, $next);

$new = &$fixed_files;

foreach ($temp as $key) {
$new = &$new[$key];
}

$new = $value;
}
}

return $fixed_files;
};

return $function($_FILES);
}

Both piece of code uses same technique (Recursive Anonymous Function Expression) to solve two different problems. My issue is not recursive functions as I understand the concept perfectly. But since recursive function usually suffers from stack overflow (in some languages) and can be rewritten as iterative, I have never used it as iteration presents a more readable code.

It seems the PHP code uses the Tower of Hanoi concept to rearrange the data structure. It is just a guess, I’m not really sure.

Can anyone help me breakdown the code as the thing nearly crash my head.

seun, kodewrita, codehouse, kobojunkie talk2hb1

CodeHouse:
Firstly, don't over study again and don't crash your head.

Secondly, bring your question to Afri coders, not that we don't have great minds here but codes are better interpreted with no smileys

Lastly, check me @ www.sayitafrica.com