Edit array_intersect_uassoc code | JsPHP: a JavaScript library providing the PHP API

Edit: array_intersect_uassoc

Function:

Description:

Returns the entries of arr1 that have values which are present in all the other arguments. Keys are used to do more restrictive check and they are compared by using an user-supplied callback.

Edit function

Code:	function array_intersect_uassoc (arr1) { // http://jsphp.co/jsphp/fn/view/array_intersect_uassoc // + original by: Brett Zamir (http://brett-zamir.me) // * example 1: $array1 = {a: 'green', b: 'brown', c: 'blue', 0: 'red'} // * example 1: $array2 = {a: 'GREEN', B: 'brown', 0: 'yellow', 1: 'red'} // * example 1: array_intersect_uassoc($array1, $array2, function (f_string1, f_string2){var string1 = (f_string1+'').toLowerCase(); var string2 = (f_string2+'').toLowerCase(); if (string1 > string2) return 1; if (string1 == string2) return 0; return -1;}); // * returns 1: {b: 'brown'} var retArr = {}, arglm1 = arguments.length - 1, arglm2 = arglm1 - 1, cb = arguments[arglm1], k1 = '', i = 1, arr = {}, k = ''; cb = (typeof cb === 'string') ? this.window[cb] : (Object.prototype.toString.call(cb) === '[object Array]') ? this.window[cb[0]][cb[1]] : cb; arr1keys: for (k1 in arr1) { arrs: for (i = 1; i < arglm1; i++) { arr = arguments[i]; for (k in arr) { if (arr[k] === arr1[k1] && cb(k, k1) === 0) { if (i === arglm2) { retArr[k1] = arr1[k1]; } // If the innermost loop always leads at least once to an equal value, continue the loop until done continue arrs; } } // If it reaches here, it wasn't found in at least one array, so try next value continue arr1keys; } } return retArr; }
	You have to be logged in to edit functions.

[top]

Comments

<< < > >> Page 1 of 1: 1 Size: -10, +10, 10, 20, 50, 100, Default

Subject	From	Date

RE Reply View comment : array_intersect_uassoc version 18	John Elliot	2012-04-19 04:02
Planning to transcribe the unit test code into an actual test. Still needs lots more work.

<< < > >> Page 1 of 1: 1 Size: -10, +10, 10, 20, 50, 100, Default

Please Login or Register to post comments.