/* * More info at: http://phpjs.org * * This is version: 2.47 * php.js is copyright 2009 Kevin van Zonneveld. * * Portions copyright Brett Zamir (http://brettz9.blogspot.com), Kevin van * Zonneveld (http://kevin.vanzonneveld.net), Onno Marsman, Michael White * (http://getsprink.com), Waldo Malqui Silva, Paulo Ricardo F. Santos, Jack, * Philip Peterson, Jonas Raoni Soares Silva (http://www.jsfromhell.com), Ates * Goral (http://magnetiq.com), Legaev Andrey, Martijn Wieringa, Nate, * Philippe Baumann, Enrique Gonzalez, Webtoolkit.info * (http://www.webtoolkit.info/), Ash Searle (http://hexmen.com/blog/), travc, * Jani Hartikainen, Carlos R. L. Rodrigues (http://www.jsfromhell.com), d3x, * Johnny Mast (http://www.phpvrouwen.nl), marrtins, Alex, Erkekjetter, Andrea * Giammarchi (http://webreflection.blogspot.com), GeekFG * (http://geekfg.blogspot.com), Mirek Slugen, Breaking Par Consulting Inc * (http://www.breakingpar.com/bkp/home.nsf/0/87256B280015193F87256CFB006C45F7), * Ole Vrijenhoek, Josh Fraser * (http://onlineaspect.com/2007/06/08/auto-detect-a-time-zone-with-javascript/), * Steven Levithan (http://blog.stevenlevithan.com), Public Domain * (http://www.json.org/json2.js), Marc Palau, mdsjack * (http://www.mdsjack.bo.it), David, Arpad Ray (mailto:arpad@php.net), * Pellentesque Malesuada, Thunder.m, Aman Gupta, Tyler Akins * (http://rumkin.com), Alfonso Jimenez (http://www.alfonsojimenez.com), Karol * Kowalski, AJ, Caio Ariede (http://caioariede.com), Sakimori, gorthaur, * Steve Hilder, john (http://www.jd-tech.net), David James, class_exists, * noname, Steve Clay, T. Wild, Hyam Singer * (http://www.impact-computing.com/), kenneth, Subhasis Deb, Pyerre, Felix * Geisendoerfer (http://www.debuggable.com/felix), djmix, Jon Hohle, Douglas * Crockford (http://javascript.crockford.com), mktime, sankai, Sanjoy Roy, * 0m3r, Marco, Thiago Mata (http://thiagomata.blog.com), madipta, Gilbert, * ger, Bryan Elliott, David Randall, Ozh, T0bsn, Tim Wiel, Peter-Paul Koch * (http://www.quirksmode.org/js/beat.html), Bayron Guevara, MeEtc * (http://yass.meetcweb.com), Brad Touesnard, XoraX (http://www.xorax.info), * echo is bad, J A R, duncan, Paul, Linuxworld, Marc Jansen, Der Simon * (http://innerdom.sourceforge.net/), Lincoln Ramsay, LH, Francesco, Slawomir * Kaniecki, marc andreu, Eric Nagel, Bobby Drake, rezna, Mick@el, Pierre-Luc * Paour, Martin Pool, Kirk Strobeck, Pul, Luke Godfrey, Christian Doebler, * YUI Library: * http://developer.yahoo.com/yui/docs/YAHOO.util.DateLocale.html, Blues at * http://hacks.bluesmoon.info/strftime/strftime.js, penutbutterjelly, Gabriel * Paderni, Blues (http://tech.bluesmoon.info/), Anton Ongson, Simon Willison * (http://simonwillison.net), Kristof Coomans (SCK-CEN Belgian Nucleair * Research Centre), Saulo Vallory, hitwork, Norman "zEh" Fuchs, sowberry, * Yves Sucaet, Nick Callen, ejsanders, johnrembo, dptr1988, Pedro Tainha * (http://www.pedrotainha.com), T.Wild, uestla, Valentina De Rosa, * strcasecmp, strcmp, metjay, DxGx, Alexander Ermolaev * (http://snippets.dzone.com/user/AlexanderErmolaev), ChaosNo1, Andreas, * Garagoth, Manish, Cord, Matt Bradley, Robin, FremyCompany, Tim de Koning, * taith, Victor, stensi, Arno, Nathan, nobbler, Mateusz "loonquawl" Zalega, * ReverseSyntax, Jalal Berrami, Francois, Scott Cariss, Tod Gentille, baris * ozdil, booeyOH, Cagri Ekin, Luke Smith (http://lucassmith.name), Ben Bryan, * Leslie Hoare, Andrej Pavlovic, Dino, mk.keck, Rival, Diogo Resende, Yannoo, * gabriel paderni, FGFEmperor, jakes, Atli Þór, Howard Yeend, Allan Jensen * (http://www.winternet.no), Benjamin Lupton * * Dual licensed under the MIT (MIT-LICENSE.txt) * and GPL (GPL-LICENSE.txt) licenses. * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be included * in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. * IN NO EVENT SHALL KEVIN VAN ZONNEVELD BE LIABLE FOR ANY CLAIM, DAMAGES * OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR * OTHER DEALINGS IN THE SOFTWARE. */ function abs( mixed_number ) { // Return the absolute value of the number // // version: 812.316 // discuss at: http://phpjs.org/functions/abs // + original by: Waldo Malqui Silva // + improved by: Karol Kowalski // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // * example 1: abs(4.2); // * returns 1: 4.2 // * example 2: abs(-4.2); // * returns 2: 4.2 // * example 3: abs(-5); // * returns 3: 5 // * example 4: abs('_argos'); // * returns 4: 0 return Math.abs(mixed_number) || 0; } function acos(arg) { // Return the arc cosine of the number in radians // // version: 810.114 // discuss at: http://phpjs.org/functions/acos // + original by: Onno Marsman // * example 1: acos(0.3); // * returns 1: 1.2661036727794992 return Math.acos(arg); } function acosh(arg) { // Returns the inverse hyperbolic cosine of the number, i.e. the value whose hyperbolic cosine is number // // version: 810.114 // discuss at: http://phpjs.org/functions/acosh // + original by: Onno Marsman // * example 1: acosh(8723321.4); // * returns 1: 16.674657798418625 return Math.log(arg + Math.sqrt(arg*arg-1)); } function addslashes( str ) { // Escapes single quote, double quotes and backslash characters in a string with backslashes // // version: 810.114 // discuss at: http://phpjs.org/functions/addslashes // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Ates Goral (http://magnetiq.com) // + improved by: marrtins // + improved by: Nate // + improved by: Onno Marsman // * example 1: addslashes("kevin's birthday"); // * returns 1: 'kevin\'s birthday' return (str+'').replace(/([\\"'])/g, "\\$1").replace(/\0/g, "\\0"); } function array_change_key_case( array ) { // Retuns an array with all string keys lowercased [or uppercased] // // version: 901.817 // discuss at: http://phpjs.org/functions/array_change_key_case // + original by: Ates Goral (http://magnetiq.com) // + improved by: marrtins // * example 1: array_change_key_case(42); // * returns 1: false // * example 2: array_change_key_case([ 3, 5 ]); // * returns 2: {0: 3, 1: 5} // * example 3: array_change_key_case({ FuBaR: 42 }); // * returns 3: {"fubar": 42} // * example 4: array_change_key_case({ FuBaR: 42 }, 'CASE_LOWER'); // * returns 4: {"fubar": 42} // * example 5: array_change_key_case({ FuBaR: 42 }, 'CASE_UPPER'); // * returns 5: {"FUBAR": 42} // * example 6: array_change_key_case({ FuBaR: 42 }, 2); // * returns 6: {"FUBAR": 42} var case_fn, tmp_ar = new Object, argc = arguments.length, argv = arguments, key; if (array instanceof Array) { return array; } if (array instanceof Object) { if( argc == 1 || argv[1] == 'CASE_LOWER' || argv[1] == 0 ){ case_fn = "toLowerCase"; } else{ case_fn = "toUpperCase"; } for (key in array) { tmp_ar[key[case_fn]()] = array[key]; } return tmp_ar; } return false; } function array_chunk( input, size ) { // Split array into chunks // // version: 810.114 // discuss at: http://phpjs.org/functions/array_chunk // + original by: Carlos R. L. Rodrigues (http://www.jsfromhell.com) // * example 1: array_chunk(['Kevin', 'van', 'Zonneveld'], 2); // * returns 1: {0 : {0: 'Kevin', 1: 'van'} , 1 : {0: 'Zonneveld'}} for(var x, i = 0, c = -1, l = input.length, n = []; i < l; i++){ (x = i % size) ? n[c][x] = input[i] : n[++c] = [input[i]]; } return n; } function array_combine( keys, values ) { // Creates an array by using the elements of the first parameter as keys and the elements of the second as the corresponding values // // version: 810.114 // discuss at: http://phpjs.org/functions/array_combine // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: array_combine([0,1,2], ['kevin','van','zonneveld']); // * returns 1: {0: 'kevin', 1: 'van', 2: 'zonneveld'} var new_array = {}, keycount=keys.length, i; // input sanitation if( !keys || !values || keys.constructor !== Array || values.constructor !== Array ){ return false; } // number of elements does not match if(keycount != values.length){ return false; } for ( i=0; i < keycount; i++ ){ new_array[keys[i]] = values[i]; } return new_array; } function array_count_values( array ) { // Return the value as key and the frequency of that value in input as value // // version: 812.316 // discuss at: http://phpjs.org/functions/array_count_values // + original by: Ates Goral (http://magnetiq.com) // + namespaced by: Michael White (http://getsprink.com) // + input by: sankai // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: array_count_values([ 3, 5, 3, "foo", "bar", "foo" ]); // * returns 1: {3:2, 5:1, "foo":2, "bar":1} // * example 2: array_count_values({ p1: 3, p2: 5, p3: 3, p4: "foo", p5: "bar", p6: "foo" }); // * returns 2: {3:2, 5:1, "foo":2, "bar":1} // * example 3: array_count_values([ true, 4.2, 42, "fubar" ]); // * returns 3: {42:1, "fubar":1} var tmp_arr = {}, key = '', t = ''; var __getType = function(obj) { // Objects are php associative arrays. var t = typeof obj; t = t.toLowerCase(); if (t == "object") { t = "array"; } return t; } var __countValue = function (value) { switch (typeof(value)) { case "number": if (Math.floor(value) != value) { return; } case "string": if (value in this) { ++this[value]; } else { this[value] = 1; } } }; t = __getType(array); if (t == 'array') { for ( key in array ) { __countValue.call(tmp_arr, array[key]); } } return tmp_arr; } function array_diff() { // Returns the entries of arr1 that have values which are not present in any of the others arguments. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_diff // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Sanjoy Roy // + revised by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: array_diff(['Kevin', 'van', 'Zonneveld'], ['van', 'Zonneveld']); // * returns 1: ['Kevin'] var arr1 = arguments[0], retArr = {}; var k1 = '', i = 1, k = '', arr = {}; arr1keys: for (k1 in arr1) { for (i = 1; i < arguments.length; i++) { arr = arguments[i]; for (k in arr) { if (arr[k] === arr1[k1]) { // If it reaches here, it was found in at least one array, so try next value continue arr1keys; } } retArr[k1] = arr1[k1]; } } return retArr; } function array_diff_assoc() { // Returns the entries of arr1 that have values which are not present in any of the others arguments but do additional checks whether the keys are equal // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_diff_assoc // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: 0m3r // + revised by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: array_diff_assoc({0: 'Kevin', 1: 'van', 2: 'Zonneveld'}, {0: 'Kevin', 4: 'van', 5: 'Zonneveld'}); // * returns 1: {1: 'van', 2: 'Zonneveld'} var arr1 = arguments[0], retArr = {}; var k1 = '', i = 1, k = '', arr = {}; arr1keys: for (k1 in arr1) { for (i = 1; i < arguments.length; i++) { arr = arguments[i]; for (k in arr) { if (arr[k] === arr1[k1] && k === k1) { // If it reaches here, it was found in at least one array, so try next value continue arr1keys; } } retArr[k1] = arr1[k1]; } } return retArr; } function array_diff_key() { // Returns the entries of arr1 that have keys which are not present in any of the others arguments. This function is like array_diff() but works on the keys instead of the values. The associativity is preserved. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_diff_key // + original by: Ates Goral (http://magnetiq.com) // + revised by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: array_diff_key({red: 1, green: 2, blue: 3, white: 4}, {red: 5}); // * returns 1: {"green":2, "blue":3, "white":4} // * example 2: array_diff_key({red: 1, green: 2, blue: 3, white: 4}, {red: 5}, {red: 5}); // * returns 2: {"green":2, "blue":3, "white":4} var arr1 = arguments[0], retArr = {}; var k1 = '', i = 1, k = '', arr = {}; arr1keys: for (k1 in arr1) { for (i = 1; i < arguments.length; i++) { arr = arguments[i]; for (k in arr) { if (k === k1) { // If it reaches here, it was found in at least one array, so try next value continue arr1keys; } } retArr[k1] = arr1[k1]; } } return retArr; } function array_diff_uassoc() { // Returns the entries of arr1 that have values which are not present in any of the others arguments but do additional checks whether the keys are equal. Elements are compared by user supplied function. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_diff_uassoc // + original by: Brett Zamir (http://brettz9.blogspot.com) // * 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_diff_uassoc($array1, $array2, function(key1, key2){ return (key1 == key2 ? 0 : (key1 > key2 ? 1 : -1)); }); // * returns 1: {b: 'brown', c: 'blue', 0: 'red'} var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1]; var arr = {}, i = 1, k1 = '', k = ''; cb = (typeof cb === 'string') ? window[cb] : (cb instanceof Array) ? window[cb[0]][cb[1]] : cb; arr1keys: for (k1 in arr1) { for (i=1; i < arguments.length-1; i++) { arr = arguments[i]; for (k in arr) { if (arr[k] === arr1[k1] && cb(k, k1) === 0) { // If it reaches here, it was found in at least one array, so try next value continue arr1keys; } } retArr[k1] = arr1[k1]; } } return retArr; } function array_diff_ukey() { // Returns the entries of arr1 that have keys which are not present in any of the others arguments. User supplied function is used for comparing the keys. This function is like array_udiff() but works on the keys instead of the values. The associativity is preserved. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_diff_ukey // + original by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: $array1 = {blue: 1, red: 2, green: 3, purple: 4} // * example 1: $array2 = {green: 5, blue: 6, yellow: 7, cyan: 8} // * example 1: array_diff_ukey($array1, $array2, function(key1, key2){ return (key1 == key2 ? 0 : (key1 > key2 ? 1 : -1)); }); // * returns 1: {red: 2, purple: 4} var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1]; var arr = {}, i = 1, k1 = '', k = ''; cb = (typeof cb === 'string') ? window[cb] : (cb instanceof Array) ? window[cb[0]][cb[1]] : cb; arr1keys: for (k1 in arr1) { for (i=1; i < arguments.length-1; i++) { arr = arguments[i]; for (k in arr) { if (cb(k, k1) === 0) { // If it reaches here, it was found in at least one array, so try next value continue arr1keys; } } retArr[k1] = arr1[k1]; } } return retArr; } function array_fill( start_index, num, mixed_val ) { // Create an array containing num elements starting with index start_key each initialized to val // // version: 812.316 // discuss at: http://phpjs.org/functions/array_fill // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Waldo Malqui Silva // * example 1: array_fill(5, 6, 'banana'); // * returns 1: { 5: 'banana', 6: 'banana', 7: 'banana', 8: 'banana', 9: 'banana', 10: 'banana' } var key, tmp_arr = {}; if ( !isNaN ( start_index ) && !isNaN ( num ) ) { for( key = 0; key < num; key++ ) { tmp_arr[(key+start_index)] = mixed_val; } } return tmp_arr; } function array_fill_keys (keys, value) { // Create an array using the elements of the first parameter as keys each initialized to val // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_fill_keys // + original by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: keys = {'a': 'foo', 2: 5, 3: 10, 4: 'bar'} // * example 1: array_fill_keys(keys, 'banana') // * returns 1: {"foo": "banana", 5: "banana", 10: "banana", "bar": "banana"} var retObj = {}, key = ''; for (key in keys) { retObj[keys[key]] = value; } return retObj; } function array_filter (arr, func) { // Filters elements from the array via the callback. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_filter // + original by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: Takes a function as an argument, not a function's name // * example 1: var odd = function (num) {return (num & 1);}; // * example 1: array_filter({"a": 1, "b": 2, "c": 3, "d": 4, "e": 5}, odd); // * returns 1: {"a": 1, "c": 3, "e": 5} // * example 2: var even = function (num) {return (!(num & 1));} // * example 2: array_filter([6, 7, 8, 9, 10, 11, 12], even); // * returns 2: {0: 6, 2: 8, 4: 10, 6: 12} var retObj = {}, k; for (k in arr) { if (func(arr[k])) { retObj[k] = arr[k]; } } return retObj; } function array_flip( trans ) { // Return array with key <-> value flipped // // version: 810.114 // discuss at: http://phpjs.org/functions/array_flip // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: array_flip( {a: 1, b: 1, c: 2} ); // * returns 1: {1: 'b', 2: 'c'} var key, tmp_ar = {}; for( key in trans ) { tmp_ar[trans[key]] = key; } return tmp_ar; } function array_intersect() { // Returns the entries of arr1 that have values which are present in all the other arguments // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_intersect // + original by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: These only output associative arrays (would need to be // % note 1: all numeric and counting from zero to be numeric) // * example 1: $array1 = {'a' : 'green', 0:'red', 1: 'blue'}; // * example 1: $array2 = {'b' : 'green', 0:'yellow', 1:'red'}; // * example 1: $array3 = ['green', 'red']; // * example 1: $result = array_intersect($array1, $array2, $array3); // * returns 1: {0: 'red', a: 'green'} var arr1 = arguments[0], retArr = {}; var k1 = '', arr = {}, i = 0, k = ''; arr1keys: for (k1 in arr1) { arrs: for (i=1; i < arguments.length; i++) { arr = arguments[i]; for (k in arr) { if (arr[k] === arr1[k1]) { if (i === arguments.length-1) { 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; } function array_intersect_assoc() { // Returns the entries of arr1 that have values which are present in all the other arguments. Keys are used to do more restrictive check // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_intersect_assoc // + original by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: These only output associative arrays (would need to be // % note 1: all numeric and counting from zero to be numeric) // * example 1: $array1 = {a: 'green', b: 'brown', c: 'blue', 0: 'red'} // * example 1: $array2 = {a: 'green', 0: 'yellow', 1: 'red'} // * example 1: array_intersect_assoc($array1, $array2) // * returns 1: {a: 'green'} var arr1 = arguments[0], retArr = {}; var k1 = '', arr = {}, i = 0, k = ''; arr1keys: for (k1 in arr1) { arrs: for (i=1; i < arguments.length; i++) { arr = arguments[i]; for (k in arr) { if (arr[k] === arr1[k1] && k === k1) { if (i === arguments.length-1) { 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; } function array_intersect_key() { // Returns the entries of arr1 that have keys which are present in all the other arguments. Kind of equivalent to array_diff(array_keys($arr1), array_keys($arr2)[,array_keys(...)]). Equivalent of array_intersect_assoc() but does not do compare of the data. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_intersect_key // + original by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: These only output associative arrays (would need to be // % note 1: all numeric and counting from zero to be numeric) // * example 1: $array1 = {a: 'green', b: 'brown', c: 'blue', 0: 'red'} // * example 1: $array2 = {a: 'green', 0: 'yellow', 1: 'red'} // * example 1: array_intersect_key($array1, $array2) // * returns 1: {0: 'red', a: 'green'} var arr1 = arguments[0], retArr = {}; var k1 = '', arr = {}, i = 0, k = ''; arr1keys: for (k1 in arr1) { arrs: for (i=1; i < arguments.length; i++) { arr = arguments[i]; for (k in arr) { if (k === k1) { if (i === arguments.length-1) { 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; } function array_intersect_uassoc () { // 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. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_intersect_uassoc // + original by: Brett Zamir (http://brettz9.blogspot.com) // * 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 arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1]; var k1 = '', i = 1, arr = {}, k = ''; cb = (typeof cb === 'string') ? window[cb] : (cb instanceof Array) ? window[cb[0]][cb[1]] : cb; arr1keys: for (k1 in arr1) { arrs: for (i = 1; i < arguments.length-1; i++) { arr = arguments[i]; for (k in arr) { if (arr[k] === arr1[k1] && cb(k, k1) === 0 ) { if (i === arguments.length-2) { 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; } function array_intersect_ukey () { // Returns the entries of arr1 that have keys which are present in all the other arguments. Kind of equivalent to array_diff(array_keys($arr1), array_keys($arr2)[,array_keys(...)]). The comparison of the keys is performed by a user supplied function. Equivalent of array_intersect_uassoc() but does not do compare of the data. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_intersect_ukey // + original by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: $array1 = {blue: 1, red: 2, green: 3, purple: 4} // * example 1: $array2 = {green: 5, blue: 6, yellow: 7, cyan: 8} // * example 1: array_intersect_ukey ($array1, $array2, function(key1, key2){ return (key1 == key2 ? 0 : (key1 > key2 ? 1 : -1)); }); // * returns 1: {blue: 1, green: 3} var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1]; var k1 = '', i = 1, arr = {}, k = ''; cb = (typeof cb === 'string') ? window[cb] : (cb instanceof Array) ? window[cb[0]][cb[1]] : cb; arr1keys: for (k1 in arr1) { arrs: for (i = 1; i < arguments.length-1; i++) { arr = arguments[i]; for (k in arr) { if (cb(k, k1) === 0 ) { if (i === arguments.length-2) { 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; } function array_key_exists ( key, search ) { // Checks if the given key or index exists in the array // // version: 810.114 // discuss at: http://phpjs.org/functions/array_key_exists // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Felix Geisendoerfer (http://www.debuggable.com/felix) // * example 1: array_key_exists('kevin', {'kevin': 'van Zonneveld'}); // * returns 1: true // input sanitation if( !search || (search.constructor !== Array && search.constructor !== Object) ){ return false; } return key in search; } function array_keys( input, search_value, argStrict ) { // Return just the keys from the input array, optionally only for the specified search_value // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_keys // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: array_keys( {firstname: 'Kevin', surname: 'van Zonneveld'} ); // * returns 1: {0: 'firstname', 1: 'surname'} var tmp_arr = {}, strict = !!argStrict, include = true, cnt = 0; var key = ''; for (key in input) { include = true; if (search_value != undefined) { if( strict && input[key] !== search_value ){ include = false; } else if( input[key] != search_value ){ include = false; } } if (include) { tmp_arr[cnt] = key; cnt++; } } return tmp_arr; } function array_map( callback ) { // Applies the callback to the elements in given arrays. // // version: 812.316 // discuss at: http://phpjs.org/functions/array_map // + original by: Andrea Giammarchi (http://webreflection.blogspot.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // % note 1: Takes a function as an argument, not a function's name // * example 1: array_map( function(a){return (a * a * a)}, [1, 2, 3, 4, 5] ); // * returns 1: [ 1, 8, 27, 64, 125 ] var argc = arguments.length, argv = arguments; var j = argv[1].length, i = 0, k = 1, m = 0; var tmp = [], tmp_ar = []; while (i < j) { while (k < argc){ tmp[m++] = argv[k++][i]; } m = 0; k = 1; if( callback ){ tmp_ar[i++] = callback.apply(null, tmp); } else{ tmp_ar[i++] = tmp; } tmp = []; } return tmp_ar; } function array_merge() { // Merges elements from passed arrays into one array // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_merge // + original by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Nate // - depends on: is_int // % note: Relies on is_int because !isNaN accepts floats // * example 1: arr1 = {"color": "red", 0: 2, 1: 4} // * example 1: arr2 = {0: "a", 1: "b", "color": "green", "shape": "trapezoid", 2: 4} // * example 1: array_merge(arr1, arr2) // * returns 1: {"color": "green", 0: 2, 1: 4, 2: "a", 3: "b", "shape": "trapezoid", 4: 4} // * example 2: arr1 = [] // * example 2: arr2 = {1: "data"} // * example 2: array_merge(arr1, arr2) // * returns 2: {1: "data"} var args = Array.prototype.slice.call(arguments); var retObj = {}, k, j = 0, i = 0; var retArr; for (i=0, retArr=true; i < args.length; i++) { if (!(args[i] instanceof Array)) { retArr=false; break; } } if (retArr) { return args; } var ct = 0; for (i=0, ct=0; i < args.length; i++) { if (args[i] instanceof Array) { for (j=0; j < args[i].length; j++) { retObj[ct++] = args[i][j]; } } else { for (k in args[i]) { if (is_int(k)) { retObj[ct++] = args[i][k]; } else { retObj[k] = args[i][k]; } } } } return retObj; } function array_merge_recursive (arr1, arr2){ // Recursively merges elements from passed arrays into one array // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_merge_recursive // + original by: Subhasis Deb // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: array_merge // * example 1: arr1 = {'color': {'favourite': 'read'}, 0: 5} // * example 1: arr2 = {0: 10, 'color': {'favorite': 'green', 0: 'blue'}} // * example 1: array_merge_recursive(arr1, arr2) // * returns 1: {'color': {'favorite': {0: 'red', 1: 'green'}, 0: 'blue'}, 1: 5, 1: 10} var idx = ''; if ((arr1 && (arr1 instanceof Array)) && (arr2 && (arr2 instanceof Array))) { for (idx in arr2) { arr1.push(arr2[idx]); } } else if ((arr1 && (arr1 instanceof Object)) && (arr2 && (arr2 instanceof Object))) { for (idx in arr2) { if (idx in arr1) { if (typeof arr1[idx] == 'object' && typeof arr2 == 'object') { arr1[idx] = array_merge(arr1[idx], arr2[idx]); } else { arr1[idx] = arr2[idx]; } } else { arr1[idx] = arr2[idx]; } } } return arr1; } function array_pad ( input, pad_size, pad_value ) { // Returns a copy of input array padded with pad_value to size pad_size // // version: 812.316 // discuss at: http://phpjs.org/functions/array_pad // + original by: Waldo Malqui Silva // * example 1: array_pad([ 7, 8, 9 ], 2, 'a'); // * returns 1: [ 7, 8, 9] // * example 2: array_pad([ 7, 8, 9 ], 5, 'a'); // * returns 2: [ 7, 8, 9, 'a', 'a'] // * example 3: array_pad([ 7, 8, 9 ], 5, 2); // * returns 3: [ 7, 8, 9, 2, 2] // * example 4: array_pad([ 7, 8, 9 ], -5, 'a'); // * returns 4: [ 'a', 'a', 7, 8, 9 ] var pad = [], newArray = [], newLength, i=0; if ( input instanceof Array && !isNaN ( pad_size ) ) { newLength = ( ( pad_size < 0 ) ? ( pad_size * -1 ) : pad_size ); if ( newLength > input.length ) { for ( i = 0; i < ( newLength - input.length ); i++ ) { newArray [ i ] = pad_value; } pad = ( ( pad_size < 0 ) ? newArray.concat ( input ) : input.concat ( newArray ) ); } else { pad = input; } } return pad; } function array_pop( array ) { // Pops an element off the end of the array // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_pop // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: array_pop([0,1,2]); // * returns 1: 2 // * example 2: data = {firstName: 'Kevin', surName: 'van Zonneveld'}; // * example 2: lastElem = array_pop(data); // * returns 2: 'van Zonneveld' // * results 2: data == {firstName: 'Kevin'} var key = '', cnt = 0; if (array.hasOwnProperty('length')) { // Indexed if( !array.length ){ // Done popping, are we? return null; } return array.pop(); } else { // Associative for (key in array) { cnt++; } if (cnt) { delete(array[key]); return array[key]; } else { return null; } } } function array_product ( input ) { // Returns the product of the array entries // // version: 812.316 // discuss at: http://phpjs.org/functions/array_product // + original by: Waldo Malqui Silva // * example 1: array_product([ 2, 4, 6, 8 ]); // * returns 1: 384 var Index = 0, Product = 1; if ( input instanceof Array ) { while ( Index < input.length ) { Product *= ( !isNaN ( input [ Index ] ) ? input [ Index ] : 0 ); Index++; } } else { Product = null; } return Product; } function array_push ( array ) { // Pushes elements onto the end of the array // // version: 810.114 // discuss at: http://phpjs.org/functions/array_push // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: array_push(['kevin','van'], 'zonneveld'); // * returns 1: 3 var i, argv = arguments, argc = argv.length; for (i=1; i < argc; i++){ array[array.length++] = argv[i]; } return array.length; } function array_rand ( input, num_req ) { // Return key/keys for random entry/entries in the array // // version: 812.316 // discuss at: http://phpjs.org/functions/array_rand // + original by: Waldo Malqui Silva // * example 1: array_rand( ['Kevin'], 1 ); // * returns 1: 0 var Indexes = []; var Ticks = num_req || 1; var checkDuplicate = function ( input, value ) { var Exist = false, Index = 0; while ( Index < input.length ) { if ( input [ Index ] === value ) { Exist = true; break; } Index++; } return Exist; }; if ( input instanceof Array && Ticks <= input.length ) { while ( true ) { var Rand = Math.floor ( ( Math.random ( ) * input.length ) ); if ( Indexes.length === Ticks ) { break; } if ( !checkDuplicate ( Indexes, Rand ) ) { Indexes.push ( Rand ); } } } else { Indexes = null; } return ( ( Ticks == 1 ) ? Indexes.join ( ) : Indexes ); } function array_reduce( a_input, callback ) { // Iteratively reduce the array to a single value via the callback. // // version: 903.2116 // discuss at: http://phpjs.org/functions/array_reduce // + original by: Alfonso Jimenez (http://www.alfonsojimenez.com) // % note 1: Takes a function as an argument, not a function's name // * example 1: array_reduce([1, 2, 3, 4, 5], function(v, w){v += w;return v;}); // * returns 1: 15 var lon = a_input.length; var res = 0, i = 0; var tmp = []; for(i = 0; i < lon; i+=2 ) { tmp[0] = a_input[i]; if(a_input[(i+1)]){ tmp[1] = a_input[(i+1)]; } else { tmp[1] = 0; } res+= callback.apply(null, tmp); tmp = []; } return res; } function array_reverse(array, preserve_keys) { // Return input as a new array with the order of the entries reversed // // version: 812.3017 // discuss at: http://phpjs.org/functions/array_reverse // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Karol Kowalski // * example 1: array_reverse( [ 'php', '4.0', ['green', 'red'] ], true); // * returns 1: { 2: ['green', 'red'], 1: 4, 0: 'php'} var arr_len = array.length, newkey = 0, tmp_arr = {}, key = ''; preserve_keys = !!preserve_keys; for (key in array) { newkey = arr_len - key - 1; tmp_arr[preserve_keys ? key : newkey] = array[key]; } return tmp_arr; } function array_search( needle, haystack, argStrict ) { // Searches the array for a given value and returns the corresponding key if successful // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_search // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: array_search('zonneveld', {firstname: 'kevin', middle: 'van', surname: 'zonneveld'}); // * returns 1: 'surname' var strict = !!argStrict; var key = ''; for(key in haystack){ if( (strict && haystack[key] === needle) || (!strict && haystack[key] == needle) ){ return key; } } return false; } function array_shift( array ) { // Pops an element off the beginning of the array // // version: 810.114 // discuss at: http://phpjs.org/functions/array_shift // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Martijn Wieringa // * example 1: array_shift(['Kevin', 'van', 'Zonneveld']); // * returns 1: 'Kevin' if (array.length > 0) { return array.shift(); } return null; } function array_slice(arr, offst, lgth, preserve_keys) { // Returns elements specified by offset and length // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_slice // + original by: Brett Zamir (http://brettz9.blogspot.com) // - depends on: is_int // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // % note: Relies on is_int because !isNaN accepts floats // * example 1: array_slice(["a", "b", "c", "d", "e"], 2, -1); // * returns 1: {0: 'c', 1: 'd'} // * example 2: array_slice(["a", "b", "c", "d", "e"], 2, -1, true); // * returns 2: {2: 'c', 3: 'd'} /* if ('callee' in arr && 'length' in arr) { arr = Array.prototype.slice.call(arr); } */ var key = ''; if (!(arr instanceof Array) || (preserve_keys && offst != 0)) { // Assoc. array as input or if required as output var lgt =0, newAssoc = {}; for (key in arr) { //if (key !== 'length') { lgt += 1; newAssoc[key] = arr[key]; //} } arr = newAssoc; offst = (offst < 0) ? lgt + offst : offst; lgth = lgth == undefined ? lgt : (lgth < 0) ? lgt + lgth - offst : lgth; var assoc = {}; var start = false, it=-1, arrlgth=0, no_pk_idx=0; for (key in arr) { ++it; if (arrlgth >= lgth) { break; } if (it == offst){ start = true; } if (!start) { continue; } ++arrlgth; if (is_int(key) && !preserve_keys) { assoc[no_pk_idx++] = arr[key]; } else { assoc[key] = arr[key]; } } //assoc.length = arrlgth; // Make as array-like object (though length will not be dynamic) return assoc; } if (lgth === undefined) { return arr.slice(offst); } else if (lgth >= 0) { return arr.slice(offst, offst + lgth); } else { return arr.slice(offst, lgth); } } function array_splice (arr, offst, lgth, replacement) { // Removes the elements designated by offset and length and replace them with supplied array // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_splice // + original by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: Order does get shifted in associative array input with numeric indices, // % note 1: since PHP behavior doesn't preserve keys, but I understand order is not reliable anyways // - depends on: is_int // * example 1: input = {4: "red", 'abc': "green", 2: "blue", 'dud': "yellow"}; // * example 1: array_splice(input, 2); // * returns 1: {0: "blue", 'dud': "yellow"} // * results 1: input == {'abc':"green", 0:"red"} // * example 2: input = ["red", "green", "blue", "yellow"]; // * example 2: array_splice(input, 3, 0, "purple"); // * returns 2: [] // * results 2: input == ["red", "green", "blue", "purple", "yellow"] // * example 3: input = ["red", "green", "blue", "yellow"] // * example 3: array_splice(input, -1, 1, ["black", "maroon"]); // * returns 3: ["yellow"] // * results 3: input == ["red", "green", "blue", "black", "maroon"] var checkToUpIndices = function (arr, ct, key) { // Deal with situation, e.g., if encounter index 4 and try to set it to 0, but 0 exists later in loop (need to // increment all subsequent (skipping current key, since we need its value below) until find unused) if (arr[ct] !== undefined) { var tmp = ct; ct += 1; if (ct === key) { ct += 1; } ct = checkToUpIndices(arr, ct, key); arr[ct] = arr[tmp]; delete arr[tmp]; } return ct; } if (replacement && !(typeof replacement === 'object')) { replacement = [replacement]; } if (lgth === undefined) { lgth = offst >= 0 ? arr.length - offst : -offst; } else if (lgth < 0) { lgth = (offst >= 0 ? arr.length - offst : -offst) + lgth; } if (!(arr instanceof Array)) { /*if (arr.length !== undefined) { // Deal with array-like objects as input delete arr.length; }*/ var lgt = 0, ct = -1, rmvd = [], rmvdObj = {}, repl_ct=-1, int_ct=-1; var returnArr = true, rmvd_ct = 0, rmvd_lgth = 0, key = ''; // rmvdObj.length = 0; for (key in arr) { // Can do arr.__count__ in some browsers lgt += 1; } offst = (offst >= 0) ? offst : lgt + offst; for (key in arr) { ct += 1; if (ct < offst) { if (is_int(key)) { int_ct += 1; if (parseInt(key, 10) === int_ct) { // Key is already numbered ok, so don't need to change key for value continue; } checkToUpIndices(arr, int_ct, key); // Deal with situation, e.g., // if encounter index 4 and try to set it to 0, but 0 exists later in loop arr[int_ct] = arr[key]; delete arr[key]; } continue; } if (returnArr && is_int(key)) { rmvd.push(arr[key]); rmvdObj[rmvd_ct++] = arr[key]; // PHP starts over here too } else { rmvdObj[key] = arr[key]; returnArr = false; } rmvd_lgth += 1; // rmvdObj.length += 1; if (replacement && replacement[++repl_ct]) { arr[key] = replacement[repl_ct] } else { delete arr[key]; } } // arr.length = lgt - rmvd_lgth + (replacement ? replacement.length : 0); // Make (back) into an array-like object return returnArr ? rmvd : rmvdObj; } if (replacement) { replacement.unshift(offst, lgth); return Array.prototype.splice.apply(arr, replacement); } return arr.splice(offst, lgth); } function array_sum( array ) { // Returns the sum of the array entries // // version: 901.617 // discuss at: http://phpjs.org/functions/array_sum // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Nate // + bugfixed by: Gilbert // * example 1: array_sum([4, 9, 182.6]); // * returns 1: 195.6 // * example 2: total = []; index = 0.1; for(y=0; y < 12; y++){total[y] = y + index;} // * example 2: array_sum(total); // * returns 2: 67.2 var key, sum = 0; // input sanitation if (typeof array !== 'object') { return null; } for (key in array) { //tester_print_r(typeof sum); sum += (array[key] * 1); } return sum; } function array_udiff() { // Returns the entries of arr1 that have values which are not present in any of the others arguments. Elements are compared by user supplied function. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_udiff // + original by: Brett Zamir (http://brettz9.blogspot.com) // * 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_udiff($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: {c: 'blue'} var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1]; var arr = '', i = 1, k1 = '', k = ''; cb = (typeof cb === 'string') ? window[cb] : (cb instanceof Array) ? window[cb[0]][cb[1]] : cb; arr1keys: for (k1 in arr1) { for (i=1; i < arguments.length-1; i++) { arr = arguments[i]; for (k in arr) { if (cb(arr[k], arr1[k1]) === 0) { // If it reaches here, it was found in at least one array, so try next value continue arr1keys; } } retArr[k1] = arr1[k1]; } } return retArr; } function array_udiff_assoc() { // Returns the entries of arr1 that have values which are not present in any of the others arguments but do additional checks whether the keys are equal. Entries are compared by user supplied function. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_udiff_assoc // + original by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: array_udiff_assoc({0: 'kevin', 1: 'van', 2: 'Zonneveld'}, {0: 'Kevin', 4: 'van', 5: 'Zonneveld'}, 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: {1: 'van', 2: 'Zonneveld'} var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1]; var arr = {}, i = 1, k1 = '', k = ''; cb = (typeof cb === 'string') ? window[cb] : (cb instanceof Array) ? window[cb[0]][cb[1]] : cb; arr1keys: for (k1 in arr1) { for (i=1; i < arguments.length-1; i++) { arr = arguments[i]; for (k in arr) { if (cb(arr[k], arr1[k1]) === 0 && k === k1) { // If it reaches here, it was found in at least one array, so try next value continue arr1keys; } } retArr[k1] = arr1[k1]; } } return retArr; } function array_udiff_uassoc () { // Returns the entries of arr1 that have values which are not present in any of the others arguments but do additional checks whether the keys are equal. Keys and elements are compared by user supplied functions. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_udiff_uassoc // + original by: Brett Zamir (http://brettz9.blogspot.com) // * 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_udiff_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;}, 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: {0: 'red', c: 'blue'} var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1], cb0 = arguments[arguments.length-2]; var k1 = '', i = 1, k = '', arr = {}; cb = (typeof cb === 'string') ? window[cb] : (cb instanceof Array) ? window[cb[0]][cb[1]] : cb; cb0 = (typeof cb0 === 'string') ? window[cb0] : (cb0 instanceof Array) ? window[cb0[0]][cb0[1]] : cb0; arr1keys: for (k1 in arr1) { for (i=1; i < arguments.length-2; i++) { arr = arguments[i]; for (k in arr) { if (cb0(arr[k], arr1[k1]) === 0 && cb(k, k1) === 0) { // If it reaches here, it was found in at least one array, so try next value continue arr1keys; } } retArr[k1] = arr1[k1]; } } return retArr; } function array_uintersect () { // Returns the entries of arr1 that have values which are present in all the other arguments. Data is compared by using an user-supplied callback. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_uintersect // + original by: Brett Zamir (http://brettz9.blogspot.com) // * 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_uintersect($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: {a: 'green', b: 'brown', 0: 'red'} var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1]; var k1 = '', i = 1, arr = {}, k = ''; cb = (typeof cb === 'string') ? window[cb] : (cb instanceof Array) ? window[cb[0]][cb[1]] : cb; arr1keys: for (k1 in arr1) { arrs: for (i = 1; i < arguments.length-1; i++) { arr = arguments[i]; for (k in arr) { if (cb(arr[k], arr1[k1]) === 0 ) { if (i === arguments.length-2) { 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; } function array_uintersect_assoc () { // Returns the entries of arr1 that have values which are present in all the other arguments. Keys are used to do more restrictive check. Data is compared by using an user-supplied callback. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_uintersect_assoc // + original by: Brett Zamir (http://brettz9.blogspot.com) // * 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_uintersect_assoc($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: {a: 'green', b: 'brown'} var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1]; var k1 = '', i = 1, arr = {}, k = ''; cb = (typeof cb === 'string') ? window[cb] : (cb instanceof Array) ? window[cb[0]][cb[1]] : cb; arr1keys: for (k1 in arr1) { arrs: for (i = 1; i < arguments.length-1; i++) { arr = arguments[i]; for (k in arr) { if (cb(arr[k], arr1[k1]) === 0 && k === k1) { if (i === arguments.length-2) { 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; } function array_uintersect_uassoc () { // Returns the entries of arr1 that have values which are present in all the other arguments. Keys are used to do more restrictive check. Both data and keys are compared by using user-supplied callbacks. // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_uintersect_uassoc // + original by: Brett Zamir (http://brettz9.blogspot.com) // * 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_uintersect_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;}, 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: {a: 'green', b: 'brown'} var arr1 = arguments[0], retArr = {}, cb = arguments[arguments.length-1], cb0 = arguments[arguments.length-2]; var k1 = '', i = 1, k = '', arr = {}; cb = (typeof cb === 'string') ? window[cb] : (cb instanceof Array) ? window[cb[0]][cb[1]] : cb; cb0 = (typeof cb0 === 'string') ? window[cb0] : (cb0 instanceof Array) ? window[cb0[0]][cb0[1]] : cb0; arr1keys: for (k1 in arr1) { arrs: for (i = 1; i < arguments.length-2; i++) { arr = arguments[i]; for (k in arr) { if (cb0(arr[k], arr1[k1]) === 0 && cb(k, k1) === 0) { if (i === arguments.length-3) { retArr[k1] = arr1[k1]; } continue arrs; // If the innermost loop always leads at least once to an equal value, continue the loop until done } } continue arr1keys; // If it reaches here, it wasn't found in at least one array, so try next value } } return retArr; } function array_unique( array ) { // Removes duplicate values from array // // version: 903.3016 // discuss at: http://phpjs.org/functions/array_unique // + original by: Carlos R. L. Rodrigues (http://www.jsfromhell.com) // + input by: duncan // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Nate // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: array_unique(['Kevin','Kevin','van','Zonneveld','Kevin']); // * returns 1: ['Kevin','van','Zonneveld'] // * example 2: array_unique({'a': 'green', 0: 'red', 'b': 'green', 1: 'blue', 2: 'red'}); // * returns 2: {'a': 'green', 0: 'red', 1: 'blue'} var key = '', tmp_arr1 = {}, tmp_arr2 = {}; var val = ''; tmp_arr1 = array; var __array_search = function (needle, haystack, argStrict) { var fkey = ''; var strict = !!argStrict; for (fkey in haystack) { if ((strict && haystack[fkey] === needle) || (!strict && haystack[fkey] == needle) ) { return fkey; } } return false; } for (key in tmp_arr1) { val = tmp_arr1[key]; if (false === __array_search(val, tmp_arr2)) { tmp_arr2[key] = val; } delete tmp_arr1[key]; } return tmp_arr2; } function array_unshift( array ) { // Pushes elements onto the beginning of the array // // version: 810.114 // discuss at: http://phpjs.org/functions/array_unshift // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Martijn Wieringa // * example 1: array_unshift(['van', 'Zonneveld'], 'Kevin'); // * returns 1: 3 var argc = arguments.length, argv = arguments, i; for (i = 1; i < argc; i++) { array.unshift(argv[i]); } return (array.length); } function array_values( input ) { // Return just the values from the input array // // version: 903.2116 // discuss at: http://phpjs.org/functions/array_values // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: array_values( {firstname: 'Kevin', surname: 'van Zonneveld'} ); // * returns 1: {0: 'Kevin', 1: 'van Zonneveld'} var tmp_arr = [], cnt = 0; var key = ''; for ( key in input ){ tmp_arr[cnt] = input[key]; cnt++; } return tmp_arr; } function array_walk (array, funcname, userdata) { // Apply a user function to every member of an array // // version: 812.316 // discuss at: http://phpjs.org/functions/array_walk // + original by: Johnny Mast (http://www.phpvrouwen.nl) // * example 1: array_walk ({'a':'b'}, 'void', 'userdata'); // * returns 1: true // * example 2: array_walk ('a', 'void', 'userdata'); // * returns 2: false var key; if (typeof array != 'object') { return false; } for (key in array) { if (typeof (userdata) != 'undefined') { eval (funcname + '( array [key] , key , userdata )' ); } else { eval (funcname + '( userdata ) '); } } return true; } function array_walk_recursive (array, funcname, userdata) { // Apply a user function recursively to every member of an array // // version: 812.316 // discuss at: http://phpjs.org/functions/array_walk_recursive // + original by: Johnny Mast (http://www.phpvrouwen.nl) // * example 1: array_walk_recursive ({'a': 'b', 'c': {'d': 'e'}}, 'void', 'userdata'); // * returns 1: true // * example 2: array_walk_recursive ('a', 'void', 'userdata'); // * returns 2: false var key; if (typeof array != 'object'){ return false; } for (key in array) { if (typeof array[key] == 'object') { return array_walk_recursive (array [key], funcname, userdata); } if (typeof (userdata) != 'undefined') { eval (funcname + '( array [key] , key , userdata )'); } else { eval (funcname + '( userdata ) '); } } return true; } function arsort(inputArr, sort_flags) { // Sort an array in reverse order and maintain index association // // version: 903.3016 // discuss at: http://phpjs.org/functions/arsort // + original by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: SORT_STRING (as well as natsort and natcasesort) might also be // % note 1: integrated into all of these functions by adapting the code at // % note 1: http://sourcefrog.net/projects/natsort/natcompare.js // % note 2: The examples are correct, this is a new way // % note 2: Credits to: http://javascript.internet.com/math-related/bubble-sort.html // * example 1: data = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'}; // * example 1: asort(data); // * results 1: data == {c: 'apple', b: 'banana', d: 'lemon', a: 'orange'} // * returns 1: true var valArr=[], keyArr=[], k, i, ret, sorter; switch (sort_flags) { case 'SORT_STRING': // compare items as strings sorter = function (a, b) { return strnatcmp(b, a); }; break; case 'SORT_LOCALE_STRING': // compare items as strings, based on the current locale (set with i18n_loc_set_default() as of PHP6) sorter = function (a, b) { return(b.localeCompare(a)); }; break; case 'SORT_NUMERIC': // compare items numerically sorter = function (a, b) { return(a - b); }; break; case 'SORT_REGULAR': // compare items normally (don't change types) default: sorter = function (a, b) { if (a > b) return 1; if (a < b) return -1; return 0; }; break; } var bubbleSort = function(keyArr, inputArr) { var i, j, tempValue, tempKeyVal; for (i = inputArr.length-2; i >= 0; i--) { for (j = 0; j <= i; j++) { ret = sorter(inputArr[j+1], inputArr[j]); if (ret > 0) { tempValue = inputArr[j]; inputArr[j] = inputArr[j+1]; inputArr[j+1] = tempValue; tempKeyVal = keyArr[j]; keyArr[j] = keyArr[j+1]; keyArr[j+1] = tempKeyVal; } } } }; // Get key and value arrays for (k in inputArr) { valArr.push(inputArr[k]); keyArr.push(k); delete inputArr[k] ; } try { // Sort our new temporary arrays bubbleSort(keyArr, valArr); } catch(e) { return false; } // Repopulate the old array for (i = 0; i < valArr.length; i++) { inputArr[keyArr[i]] = valArr[i]; } return true; } function asin(arg) { // Returns the arc sine of the number in radians // // version: 810.114 // discuss at: http://phpjs.org/functions/asin // + original by: Onno Marsman // * example 1: asin(0.3); // * returns 1: 0.3046926540153975 return Math.asin(arg); } function asinh(arg) { // Returns the inverse hyperbolic sine of the number, i.e. the value whose hyperbolic sine is number // // version: 810.114 // discuss at: http://phpjs.org/functions/asinh // + original by: Onno Marsman // * example 1: asinh(8723321.4); // * returns 1: 16.67465779841863 return Math.log(arg + Math.sqrt(arg*arg+1)); } function asort(inputArr, sort_flags) { // Sort an array and maintain index association // // version: 903.3016 // discuss at: http://phpjs.org/functions/asort // + original by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: SORT_STRING (as well as natsort and natcasesort) might also be // % note 1: integrated into all of these functions by adapting the code at // % note 1: http://sourcefrog.net/projects/natsort/natcompare.js // % note 2: The examples are correct, this is a new way // % note 2: Credits to: http://javascript.internet.com/math-related/bubble-sort.html // - depends on: strnatcmp // * example 1: data = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'}; // * example 1: asort(data); // * results 1: data == {c: 'apple', b: 'banana', d: 'lemon', a: 'orange'} // * returns 1: true var valArr=[], keyArr=[], k, i, ret, sorter; switch (sort_flags) { case 'SORT_STRING': // compare items as strings sorter = function (a, b) { return strnatcmp(a, b); }; break; case 'SORT_LOCALE_STRING': // compare items as strings, based on the current locale (set with i18n_loc_set_default() as of PHP6) sorter = function (a, b) { return(a.localeCompare(b)); }; break; case 'SORT_NUMERIC': // compare items numerically sorter = function (a, b) { return(a - b); }; break; case 'SORT_REGULAR': // compare items normally (don't change types) default: sorter = function (a, b) { if (a > b) return 1; if (a < b) return -1; return 0; }; break; } var bubbleSort = function(keyArr, inputArr) { var i, j, tempValue, tempKeyVal; for (i = inputArr.length-2; i >= 0; i--) { for (j = 0; j <= i; j++) { ret = sorter(inputArr[j+1], inputArr[j]); if (ret < 0) { tempValue = inputArr[j]; inputArr[j] = inputArr[j+1]; inputArr[j+1] = tempValue; tempKeyVal = keyArr[j]; keyArr[j] = keyArr[j+1]; keyArr[j+1] = tempKeyVal; } } } }; // Get key and value arrays for (k in inputArr) { valArr.push(inputArr[k]); keyArr.push(k); delete inputArr[k] ; } try { // Sort our new temporary arrays bubbleSort(keyArr, valArr); } catch(e) { return false; } // Repopulate the old array for (i = 0; i < valArr.length; i++) { inputArr[keyArr[i]] = valArr[i]; } return true; } function atan(arg) { // Returns the arc tangent of the number in radians // // version: 810.114 // discuss at: http://phpjs.org/functions/atan // + original by: Onno Marsman // * example 1: atan(8723321.4); // * returns 1: 1.5707962121596615 return Math.atan(arg); } function atanh(arg) { // Returns the inverse hyperbolic tangent of the number, i.e. the value whose hyperbolic tangent is number // // version: 810.114 // discuss at: http://phpjs.org/functions/atanh // + original by: Onno Marsman // * example 1: atanh(0.3); // * returns 1: 0.3095196042031118 return 0.5 * Math.log((1+arg)/(1-arg)); } function base64_decode( data ) { // Decodes string using MIME base64 algorithm // // version: 903.3016 // discuss at: http://phpjs.org/functions/base64_decode // + original by: Tyler Akins (http://rumkin.com) // + improved by: Thunder.m // + input by: Aman Gupta // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // + bugfixed by: Pellentesque Malesuada // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: utf8_decode // * example 1: base64_decode('S2V2aW4gdmFuIFpvbm5ldmVsZA=='); // * returns 1: 'Kevin van Zonneveld' // mozilla has this native // - but breaks in 2.0.0.12! //if (typeof window['btoa'] == 'function') { // return btoa(data); //} var b64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="; var o1, o2, o3, h1, h2, h3, h4, bits, i = 0, ac = 0, dec = "", tmp_arr = []; if (!data) { return data; } data += ''; do { // unpack four hexets into three octets using index points in b64 h1 = b64.indexOf(data.charAt(i++)); h2 = b64.indexOf(data.charAt(i++)); h3 = b64.indexOf(data.charAt(i++)); h4 = b64.indexOf(data.charAt(i++)); bits = h1<<18 | h2<<12 | h3<<6 | h4; o1 = bits>>16 & 0xff; o2 = bits>>8 & 0xff; o3 = bits & 0xff; if (h3 == 64) { tmp_arr[ac++] = String.fromCharCode(o1); } else if (h4 == 64) { tmp_arr[ac++] = String.fromCharCode(o1, o2); } else { tmp_arr[ac++] = String.fromCharCode(o1, o2, o3); } } while (i < data.length); dec = tmp_arr.join(''); dec = utf8_decode(dec); return dec; } function base64_encode( data ) { // Encodes string using MIME base64 algorithm // // version: 903.1614 // discuss at: http://phpjs.org/functions/base64_encode // + original by: Tyler Akins (http://rumkin.com) // + improved by: Bayron Guevara // + improved by: Thunder.m // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Pellentesque Malesuada // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: utf8_encode // * example 1: base64_encode('Kevin van Zonneveld'); // * returns 1: 'S2V2aW4gdmFuIFpvbm5ldmVsZA==' // mozilla has this native // - but breaks in 2.0.0.12! //if (typeof window['atob'] == 'function') { // return atob(data); //} var b64 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="; var o1, o2, o3, h1, h2, h3, h4, bits, i = 0, ac = 0, enc="", tmp_arr = []; if (!data) { return data; } data = utf8_encode(data+''); do { // pack three octets into four hexets o1 = data.charCodeAt(i++); o2 = data.charCodeAt(i++); o3 = data.charCodeAt(i++); bits = o1<<16 | o2<<8 | o3; h1 = bits>>18 & 0x3f; h2 = bits>>12 & 0x3f; h3 = bits>>6 & 0x3f; h4 = bits & 0x3f; // use hexets to index into b64, and append result to encoded string tmp_arr[ac++] = b64.charAt(h1) + b64.charAt(h2) + b64.charAt(h3) + b64.charAt(h4); } while (i < data.length); enc = tmp_arr.join(''); switch( data.length % 3 ){ case 1: enc = enc.slice(0, -2) + '=='; break; case 2: enc = enc.slice(0, -1) + '='; break; } return enc; } function base_convert(number, frombase, tobase) { // Converts a number in a string from any base <= 36 to any base <= 36 // // version: 810.1317 // discuss at: http://phpjs.org/functions/base_convert // + original by: Philippe Baumann // * example 1: base_convert('A37334', 16, 2); // * returns 1: '101000110111001100110100' return parseInt(number+'', frombase+0).toString(tobase+0); } function bin2hex(s){ // Converts the binary representation of data to hex // // version: 903.421 // discuss at: http://phpjs.org/functions/bin2hex // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // + bugfixed by: Linuxworld // * example 1: bin2hex('Kev'); // * returns 1: '4b6576' // * example 2: bin2hex(String.fromCharCode(0x00)); // * returns 2: '00' var i, f = 0, a = []; s += ''; f = s.length; for (i = 0; i chunklen) { result += body.substring(0, chunklen) + end; body = body.substring(chunklen); } return result + body + end; } function class_exists (cls) { // Checks if the class exists // // version: 903.3016 // discuss at: http://phpjs.org/functions/class_exists // + original by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: function class_a() {this.meth1 = function() {return true;}}; // * example 1: var instance_a = new class_a(); // * example 1: class_exists('class_a'); // * returns 1: true var i = ''; cls = window[cls]; // Note: will prevent inner classes if (typeof cls !== 'function') {return false;} for (i in cls.prototype) { return true; } for (i in cls) { // If static members exist, then consider a "class" if (i !== 'prototype') { return true; } } if (cls.toSource && cls.toSource().match(/this\./)) { // Hackish and non-standard but can probably detect if setting // a property (we don't want to test by instantiating as that // may have side-effects) return true; } return false; } function compact ( ) { // Creates a hash containing variables and their values // // version: 903.3016 // discuss at: http://phpjs.org/functions/compact // + original by: Waldo Malqui Silva // + tweaked by: Jack // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: var1 = 'Kevin'; var2 = 'van'; var3 = 'Zonneveld'; // * example 1: compact('var1', 'var2', 'var3'); // * returns 1: {'var1': 'Kevin', 'var2': 'van', 'var3': 'Zonneveld'} var Matrix = {}; var key_value; var process = function ( value ) { var i = 0, l = value.length, key_value = ''; for (i = 0; i < l; i++) { key_value = value [ i ]; if (key_value instanceof Array) { process ( key_value ); } else { if (typeof window[key_value] !== 'undefined') { Matrix[key_value] = window[key_value]; } } } return true; }; process(arguments); return Matrix; } function cos(arg) { // Returns the cosine of the number in radians // // version: 810.114 // discuss at: http://phpjs.org/functions/cos // + original by: Onno Marsman // * example 1: cos(8723321.4); // * returns 1: -0.18127180117607017 return Math.cos(arg); } function cosh(arg) { // Returns the hyperbolic cosine of the number, defined as (exp(number) + exp(-number))/2 // // version: 810.114 // discuss at: http://phpjs.org/functions/cosh // + original by: Onno Marsman // * example 1: cosh(-0.18127180117607017); // * returns 1: 1.0164747716114113 return (Math.exp(arg) + Math.exp(-arg))/2; } function count( mixed_var, mode ) { // Count the number of elements in a variable (usually an array) // // version: 812.316 // discuss at: http://phpjs.org/functions/count // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Waldo Malqui Silva // * example 1: count([[0,0],[0,-4]], 'COUNT_RECURSIVE'); // * returns 1: 6 // * example 2: count({'one' : [1,2,3,4,5]}, 'COUNT_RECURSIVE'); // * returns 2: 6 var key, cnt = 0; if( mode == 'COUNT_RECURSIVE' ) mode = 1; if( mode != 1 ) mode = 0; for (key in mixed_var){ cnt++; if( mode==1 && mixed_var[key] && (mixed_var[key].constructor === Array || mixed_var[key].constructor === Object) ){ cnt += count(mixed_var[key], 1); } } return cnt; } function count_chars( str, mode ) { // Returns info about what characters are used in input // // version: 903.3016 // discuss at: http://phpjs.org/functions/count_chars // + original by: Ates Goral (http://magnetiq.com) // + tweaked by: Jack // + bugfixed by: Onno Marsman // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: count_chars("Hello World!", 1); // * returns 1: "Hd e!lWor" var histogram = {}, tmp_arr = []; var key, i, code, strl = 0; var argc = arguments.length; var mode_even = 0; if (argc == 1) { mode = 0; } mode_even = (mode & 1) == 0; if (mode_even) { for (i = 1; i < 256; ++i) { histogram[i] = 0; } } str += ''; strl = str.length; for (i = 0; i < strl; ++i) { code = str.charCodeAt(i); if (code in histogram) { ++histogram[code]; } else { histogram[code] = 1; } } if (mode > 0) { for (key in histogram) { if (histogram[key] == 0 != mode_even) { delete histogram[key]; } } } if (mode < 3) { return histogram; } else { for (key in histogram) { tmp_arr.push(String.fromCharCode(key)); } return tmp_arr.join(""); } } function crc32 ( str ) { // Calculate the crc32 polynomial of a string // // version: 810.114 // discuss at: http://phpjs.org/functions/crc32 // + original by: Webtoolkit.info (http://www.webtoolkit.info/) // + improved by: T0bsn // - depends on: utf8_encode // * example 1: crc32('Kevin van Zonneveld'); // * returns 1: 1249991249 str = utf8_encode(str); var table = "00000000 77073096 EE0E612C 990951BA 076DC419 706AF48F E963A535 9E6495A3 0EDB8832 79DCB8A4 E0D5E91E 97D2D988 09B64C2B 7EB17CBD E7B82D07 90BF1D91 1DB71064 6AB020F2 F3B97148 84BE41DE 1ADAD47D 6DDDE4EB F4D4B551 83D385C7 136C9856 646BA8C0 FD62F97A 8A65C9EC 14015C4F 63066CD9 FA0F3D63 8D080DF5 3B6E20C8 4C69105E D56041E4 A2677172 3C03E4D1 4B04D447 D20D85FD A50AB56B 35B5A8FA 42B2986C DBBBC9D6 ACBCF940 32D86CE3 45DF5C75 DCD60DCF ABD13D59 26D930AC 51DE003A C8D75180 BFD06116 21B4F4B5 56B3C423 CFBA9599 B8BDA50F 2802B89E 5F058808 C60CD9B2 B10BE924 2F6F7C87 58684C11 C1611DAB B6662D3D 76DC4190 01DB7106 98D220BC EFD5102A 71B18589 06B6B51F 9FBFE4A5 E8B8D433 7807C9A2 0F00F934 9609A88E E10E9818 7F6A0DBB 086D3D2D 91646C97 E6635C01 6B6B51F4 1C6C6162 856530D8 F262004E 6C0695ED 1B01A57B 8208F4C1 F50FC457 65B0D9C6 12B7E950 8BBEB8EA FCB9887C 62DD1DDF 15DA2D49 8CD37CF3 FBD44C65 4DB26158 3AB551CE A3BC0074 D4BB30E2 4ADFA541 3DD895D7 A4D1C46D D3D6F4FB 4369E96A 346ED9FC AD678846 DA60B8D0 44042D73 33031DE5 AA0A4C5F DD0D7CC9 5005713C 270241AA BE0B1010 C90C2086 5768B525 206F85B3 B966D409 CE61E49F 5EDEF90E 29D9C998 B0D09822 C7D7A8B4 59B33D17 2EB40D81 B7BD5C3B C0BA6CAD EDB88320 9ABFB3B6 03B6E20C 74B1D29A EAD54739 9DD277AF 04DB2615 73DC1683 E3630B12 94643B84 0D6D6A3E 7A6A5AA8 E40ECF0B 9309FF9D 0A00AE27 7D079EB1 F00F9344 8708A3D2 1E01F268 6906C2FE F762575D 806567CB 196C3671 6E6B06E7 FED41B76 89D32BE0 10DA7A5A 67DD4ACC F9B9DF6F 8EBEEFF9 17B7BE43 60B08ED5 D6D6A3E8 A1D1937E 38D8C2C4 4FDFF252 D1BB67F1 A6BC5767 3FB506DD 48B2364B D80D2BDA AF0A1B4C 36034AF6 41047A60 DF60EFC3 A867DF55 316E8EEF 4669BE79 CB61B38C BC66831A 256FD2A0 5268E236 CC0C7795 BB0B4703 220216B9 5505262F C5BA3BBE B2BD0B28 2BB45A92 5CB36A04 C2D7FFA7 B5D0CF31 2CD99E8B 5BDEAE1D 9B64C2B0 EC63F226 756AA39C 026D930A 9C0906A9 EB0E363F 72076785 05005713 95BF4A82 E2B87A14 7BB12BAE 0CB61B38 92D28E9B E5D5BE0D 7CDCEFB7 0BDBDF21 86D3D2D4 F1D4E242 68DDB3F8 1FDA836E 81BE16CD F6B9265B 6FB077E1 18B74777 88085AE6 FF0F6A70 66063BCA 11010B5C 8F659EFF F862AE69 616BFFD3 166CCF45 A00AE278 D70DD2EE 4E048354 3903B3C2 A7672661 D06016F7 4969474D 3E6E77DB AED16A4A D9D65ADC 40DF0B66 37D83BF0 A9BCAE53 DEBB9EC5 47B2CF7F 30B5FFE9 BDBDF21C CABAC28A 53B39330 24B4A3A6 BAD03605 CDD70693 54DE5729 23D967BF B3667A2E C4614AB8 5D681B02 2A6F2B94 B40BBE37 C30C8EA1 5A05DF1B 2D02EF8D"; var crc = 0; var x = 0; var y = 0; crc = crc ^ (-1); for( var i = 0, iTop = str.length; i < iTop; i++ ) { y = ( crc ^ str.charCodeAt( i ) ) & 0xFF; x = "0x" + table.substr( y * 9, 8 ); crc = ( crc >>> 8 ) ^ x; } return crc ^ (-1); } function date ( format, timestamp ) { // Format a local date/time // // version: 903.3016 // discuss at: http://phpjs.org/functions/date // + original by: Carlos R. L. Rodrigues (http://www.jsfromhell.com) // + parts by: Peter-Paul Koch (http://www.quirksmode.org/js/beat.html) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: MeEtc (http://yass.meetcweb.com) // + improved by: Brad Touesnard // + improved by: Tim Wiel // + improved by: Bryan Elliott // + improved by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: David Randall // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: Uses global: php_js to store the default timezone // * example 1: date('H:m:s \\m \\i\\s \\m\\o\\n\\t\\h', 1062402400); // * returns 1: '09:09:40 m is month' // * example 2: date('F j, Y, g:i a', 1062462400); // * returns 2: 'September 2, 2003, 2:26 am' // * example 3: date('Y W o', 1062462400); // * returns 3: '2003 36 2003' // * example 4: x = date('Y m d', (new Date()).getTime()/1000); // 2009 01 09 // * example 4: (x+'').length == 10 // * returns 4: true var a, tal=[], jsdate=( (typeof(timestamp) == 'undefined') ? new Date() : // Not provided (typeof(timestamp) == 'number') ? new Date(timestamp*1000) : // UNIX timestamp new Date(timestamp) // Javascript Date() ); var pad = function(n, c){ if( (n = n + "").length < c ) { return new Array(++c - n.length).join("0") + n; } else { return n; } }; var ret = ''; var txt_weekdays = ["Sunday","Monday","Tuesday","Wednesday", "Thursday","Friday","Saturday"]; var txt_ordin = {1:"st",2:"nd",3:"rd",21:"st",22:"nd",23:"rd",31:"st"}; var txt_months = ["", "January", "February", "March", "April", "May", "June", "July", "August", "September", "October", "November", "December"]; var f = { // Day d: function(){ return pad(f.j(), 2); }, D: function(){ var t = f.l(); return t.substr(0,3); }, j: function(){ return jsdate.getDate(); }, l: function(){ return txt_weekdays[f.w()]; }, N: function(){ return f.w() + 1; }, S: function(){ return txt_ordin[f.j()] ? txt_ordin[f.j()] : 'th'; }, w: function(){ return jsdate.getDay(); }, z: function(){ return (jsdate - new Date(jsdate.getFullYear() + "/1/1")) / 864e5 >> 0; }, // Week W: function(){ var a = f.z(), b = 364 + f.L() - a; var nd2, nd = (new Date(jsdate.getFullYear() + "/1/1").getDay() || 7) - 1; if(b <= 2 && ((jsdate.getDay() || 7) - 1) <= 2 - b){ return 1; } else{ if(a <= 2 && nd >= 4 && a >= (6 - nd)){ nd2 = new Date(jsdate.getFullYear() - 1 + "/12/31"); return date("W", Math.round(nd2.getTime()/1000)); } else{ return (1 + (nd <= 3 ? ((a + nd) / 7) : (a - (7 - nd)) / 7) >> 0); } } }, // Month F: function(){ return txt_months[f.n()]; }, m: function(){ return pad(f.n(), 2); }, M: function(){ var t; t = f.F(); return t.substr(0,3); }, n: function(){ return jsdate.getMonth() + 1; }, t: function(){ var n; if( (n = jsdate.getMonth() + 1) == 2 ){ return 28 + f.L(); } else{ if( n & 1 && n < 8 || !(n & 1) && n > 7 ){ return 31; } else{ return 30; } } }, // Year L: function(){ var y = f.Y(); return (!(y & 3) && (y % 1e2 || !(y % 4e2))) ? 1 : 0; }, o: function(){ if (f.n() === 12 && f.W() === 1) { return jsdate.getFullYear()+1; } if (f.n() === 1 && f.W() >= 52) { return jsdate.getFullYear()-1; } return jsdate.getFullYear(); }, Y: function(){ return jsdate.getFullYear(); }, y: function(){ return (jsdate.getFullYear() + "").slice(2); }, // Time a: function(){ return jsdate.getHours() > 11 ? "pm" : "am"; }, A: function(){ return f.a().toUpperCase(); }, B: function(){ // peter paul koch: var off = (jsdate.getTimezoneOffset() + 60)*60; var theSeconds = (jsdate.getHours() * 3600) + (jsdate.getMinutes() * 60) + jsdate.getSeconds() + off; var beat = Math.floor(theSeconds/86.4); if (beat > 1000) beat -= 1000; if (beat < 0) beat += 1000; if ((String(beat)).length == 1) beat = "00"+beat; if ((String(beat)).length == 2) beat = "0"+beat; return beat; }, g: function(){ return jsdate.getHours() % 12 || 12; }, G: function(){ return jsdate.getHours(); }, h: function(){ return pad(f.g(), 2); }, H: function(){ return pad(jsdate.getHours(), 2); }, i: function(){ return pad(jsdate.getMinutes(), 2); }, s: function(){ return pad(jsdate.getSeconds(), 2); }, u: function(){ return pad(jsdate.getMilliseconds()*1000, 6); }, // Timezone e: function () { // var abbr='', i=0; // if (this.php_js && this.php_js.default_timezone) { // return this.php_js.default_timezone; // } // if (!tal.length) { // tal = timezone_abbreviations_list(); // } // for (abbr in tal) { // for (i=0; i < tal[abbr].length; i++) { // if (tal[abbr][i].offset === -jsdate.getTimezoneOffset()*60) { // return tal[abbr][i].timezone_id; // } // } // } return 'UTC'; }, I: function(){ var DST = (new Date(jsdate.getFullYear(),6,1,0,0,0)); DST = DST.getHours()-DST.getUTCHours(); var ref = jsdate.getHours()-jsdate.getUTCHours(); return ref != DST ? 1 : 0; }, O: function(){ var t = pad(Math.abs(jsdate.getTimezoneOffset()/60*100), 4); if (jsdate.getTimezoneOffset() > 0) t = "-" + t; else t = "+" + t; return t; }, P: function(){ var O = f.O(); return (O.substr(0, 3) + ":" + O.substr(3, 2)); }, T: function () { // var abbr='', i=0; // if (!tal.length) { // tal = timezone_abbreviations_list(); // } // if (this.php_js && this.php_js.default_timezone) { // for (abbr in tal) { // for (i=0; i < tal[abbr].length; i++) { // if (tal[abbr][i].timezone_id === this.php_js.default_timezone) { // return abbr.toUpperCase(); // } // } // } // } // for (abbr in tal) { // for (i=0; i < tal[abbr].length; i++) { // if (tal[abbr][i].offset === -jsdate.getTimezoneOffset()*60) { // return abbr.toUpperCase(); // } // } // } return 'UTC'; }, Z: function(){ var t = -jsdate.getTimezoneOffset()*60; return t; }, // Full Date/Time c: function(){ return f.Y() + "-" + f.m() + "-" + f.d() + "T" + f.h() + ":" + f.i() + ":" + f.s() + f.P(); }, r: function(){ return f.D()+', '+f.d()+' '+f.M()+' '+f.Y()+' '+f.H()+':'+f.i()+':'+f.s()+' '+f.O(); }, U: function(){ return Math.round(jsdate.getTime()/1000); } }; return format.replace(/[\\]?([a-zA-Z])/g, function(t, s){ if( t!=s ){ // escaped ret = s; } else if( f[s] ){ // a date function exists ret = f[s](); } else{ // nothing special ret = s; } return ret; }); } function decbin(number) { // Returns a string containing a binary representation of the number // // version: 812.316 // discuss at: http://phpjs.org/functions/decbin // + original by: Enrique Gonzalez // + bugfixed by: Onno Marsman // * example 1: decbin(12); // * returns 1: '1100' // * example 2: decbin(26); // * returns 2: '11010' // * example 3: decbin('26'); // * returns 3: '11010' return parseInt(number).toString(2); } function dechex(number) { // Returns a string containing a hexadecimal representation of the given number // // version: 810.1317 // discuss at: http://phpjs.org/functions/dechex // + original by: Philippe Baumann // + bugfixed by: Onno Marsman // * example 1: dechex(10); // * returns 1: 'a' // * example 2: dechex(47); // * returns 2: '2f' return parseInt(number).toString(16); } function decoct(number) { // Returns a string containing an octal representation of the given number // // version: 810.1317 // discuss at: http://phpjs.org/functions/decoct // + original by: Enrique Gonzalez // + bugfixed by: Onno Marsman // * example 1: decoct(15); // * returns 1: '17' // * example 2: decoct(264); // * returns 2: '410' return parseInt(number).toString(8); } function deg2rad(angle) { // Converts the number in degrees to the radian equivalent // // version: 810.114 // discuss at: http://phpjs.org/functions/deg2rad // + original by: Enrique Gonzalez // * example 1: deg2rad(45); // * returns 1: 0.7853981633974483 return (angle/180)*Math.PI; } function doubleval( mixed_var ) { // !No description available for doubleval. @php.js developers: Please update the function summary text file. // // version: 903.3016 // discuss at: http://phpjs.org/functions/doubleval // + original by: Brett Zamir (http://brettz9.blogspot.com) // - depends on: floatval // % note 1: 1.0 is simplified to 1 before it can be accessed by the function, this makes // % note 1: it different from the PHP implementation. We can't fix this unfortunately. // * example 1: doubleval(186); // * returns 1: 186.00 return floatval(mixed_var); } function echo ( ) { // !No description available for echo. @php.js developers: Please update the function summary text file. // // version: 903.3016 // discuss at: http://phpjs.org/functions/echo // + original by: Philip Peterson // + improved by: echo is bad // + improved by: Nate // + revised by: Der Simon (http://innerdom.sourceforge.net/) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: The function still has issues with outputting certain kinds of XML, such as // % note 1: attributes defined with apostrophes, or creating namespaced XML, etc. // % note 1: We might solve this by building on http://code.google.com/p/jssaxparser // % note 1: and using that, but it would be even larger; if browsers start to support // % note 1: DOM Level 3 Load and Save (parsing/serializing), we wouldn't need any // % note 1: such long code (even most of the code below). // % note 2: InnerHTML() is better because it works (and it's fast), // % note 2: but using innerHTML on the BODY is very dangerous because // % note 2: you will break all references to HTMLElements that were done before // * example 1: echo('Hello', 'World'); // * returns 1: undefined var arg = '', argc = arguments.length, argv = arguments, i = 0; var stringToDOM = function (q){ var d = document; var r = function(a){ return a.replace(/\r/g,' ').replace(/\n/g,' '); }; var s = function(a){ return a.replace(/&/g,'&').replace(/>/g,'>').replace(/</g,'<').replace(/ /g,' ').replace(/"/g,'"'); }; var t = function(a){ return a.replace(/ /g,''); }; var u = function(a){ var b,c,e,f,g,h,i; b=d.createDocumentFragment(); c=a.indexOf(' '); if (c === -1) { b.appendChild(d.createElement(a.toLowerCase())); } else { i = t(a.substring(0,c)).toLowerCase(); a = a.substr(c+1); b.appendChild(d.createElement(i)); while(a.length){ e=a.indexOf('='); if(e>=0){ f=t(a.substring(0,e)).toLowerCase(); g=a.indexOf('"'); a=a.substr(g+1); g=a.indexOf('"'); h=s(a.substring(0,g)); a=a.substr(g+2); b.lastChild.setAttribute(f,h); }else{ break } } } return b; } var v = function(a,b,c){ var e,f; e=b; c=c.toLowerCase(); f=e.indexOf(''); a=a.concat(e.substring(0,f)); e=e.substr(f); while(a.indexOf('<'+c)!=-1){ a=a.substr(a.indexOf('<'+c)); a=a.substr(a.indexOf('>')+1); e=e.substr(e.indexOf('>')+1); f=e.indexOf(''); a=a.concat(e.substring(0,f)); e=e.substr(f); } return b.length-e.length; }; var w = function(a){ var b,c,e,f,g,h,i,j,k,l,m,n,o,p,q; b=d.createDocumentFragment(); while(a&&a.length){ c=a.indexOf('<'); if(c===-1){ a=s(a); b.appendChild(d.createTextNode(a)); a=null; } else if(c){ q=s(a.substring(0,c)); b.appendChild(d.createTextNode(q)); a=a.substr(c); } else{ e=a.indexOf(''); g=a.substring(4,f); g=s(g); b.appendChild(d.createComment(g)); a=a.substr(f+3); } else{ h=a.indexOf('>'); if(a.substring(h-1,h)==='/'){ i=a.indexOf('/>'); j=a.substring(1,i); b.appendChild(u(j)); a=a.substr(i+2); } else{ k=a.indexOf('>'); l=a.substring(1,k); m=d.createDocumentFragment(); m.appendChild(u(l)); a=a.substr(k+1); n=a.substring(0,a.indexOf('')+1); m.lastChild.appendChild(w(n)); b.appendChild(m); } } } } return b; }; return w(q); } for (i = 0; i < argc; i++ ) { arg = argv[i]; if (document.createDocumentFragment && document.createTextNode && document.appendChild) { if (document.body) { document.body.appendChild(stringToDOM(arg)); } else { document.documentElement.appendChild(stringToDOM(arg)); } } else if (document.write) { document.write(arg); } else { print(arg); } } } function end ( arr ) { // Advances array argument's internal pointer to the last element and return it // // version: 903.3016 // discuss at: http://phpjs.org/functions/end // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Legaev Andrey // + revised by: J A R // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + restored by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + revised by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: Uses global: php_js to store the array pointer // * example 1: end({0: 'Kevin', 1: 'van', 2: 'Zonneveld'}); // * returns 1: 'Zonneveld' // * example 2: end(['Kevin', 'van', 'Zonneveld']); // * returns 2: 'Zonneveld' if (!this.php_js) this.php_js = {}; if (!this.php_js.pointers) this.php_js.pointers = []; var pointers = this.php_js.pointers; if (pointers.indexOf(arr) === -1) { pointers.push(arr, 0); } var arrpos = pointers.indexOf(arr); if (!(arr instanceof Array)) { var ct = 0; for (var k in arr) { ct++; var val = arr[k]; } if (ct === 0) { return false; // Empty } pointers[arrpos+1] = ct - 1; return val; } if (arr.length === 0) { return false; } pointers[arrpos+1] = arr.length - 1; return arr[pointers[arrpos+1]]; } function exp(arg) { // Returns e raised to the power of the number // // version: 810.114 // discuss at: http://phpjs.org/functions/exp // + original by: Onno Marsman // * example 1: exp(0.3); // * returns 1: 1.3498588075760032 return Math.exp(arg); } function explode( delimiter, string, limit ) { // Splits a string on string separator and return array of components. If limit is positive only limit number of components is returned. If limit is negative all components except the last abs(limit) are returned. // // version: 810.114 // discuss at: http://phpjs.org/functions/explode // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: kenneth // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: d3x // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: explode(' ', 'Kevin van Zonneveld'); // * returns 1: {0: 'Kevin', 1: 'van', 2: 'Zonneveld'} // * example 2: explode('=', 'a=bc=d', 2); // * returns 2: ['a', 'bc=d'] var emptyArray = { 0: '' }; // third argument is not required if ( arguments.length < 2 || typeof arguments[0] == 'undefined' || typeof arguments[1] == 'undefined' ) { return null; } if ( delimiter === '' || delimiter === false || delimiter === null ) { return false; } if ( typeof delimiter == 'function' || typeof delimiter == 'object' || typeof string == 'function' || typeof string == 'object' ) { return emptyArray; } if ( delimiter === true ) { delimiter = '1'; } if (!limit) { return string.toString().split(delimiter.toString()); } else { // support for limit argument var splitted = string.toString().split(delimiter.toString()); var partA = splitted.splice(0, limit - 1); var partB = splitted.join(delimiter.toString()); partA.push(partB); return partA; } } function floatval(mixed_var) { // + original by: Michael White (http://getsprink.com) // % note 1: The native parseFloat() method of JavaScript returns NaN when it encounters a string before an int or float value. // * example 1: floatval('150.03_page-section'); // * returns 1: 150.03 // * example 2: floatval('page: 3'); // * returns 2: 0 // * example 2: floatval('-50 + 8'); // * returns 2: -50 return (parseFloat(mixed_var) || 0); } function floor(value) { // Returns the next lowest integer value from the number // // version: 810.114 // discuss at: http://phpjs.org/functions/floor // + original by: Onno Marsman // * example 1: floor(8723321.4); // * returns 1: 8723321 return Math.floor(value); } function fmod(x, y) { // Returns the remainder of dividing x by y as a float // // version: 903.3016 // discuss at: http://phpjs.org/functions/fmod // + original by: Onno Marsman // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: fmod(5.7, 1.3); // * returns 1: 0.5 var tmp, tmp2, p = 0, pY = 0, l = 0.0, l2 = 0.0; tmp = x.toExponential().match(/^.\.?(.*)e(.+)$/); p = parseInt(tmp[2])-(tmp[1]+'').length; tmp = y.toExponential().match(/^.\.?(.*)e(.+)$/); pY = parseInt(tmp[2])-(tmp[1]+'').length; if (pY > p) { p = pY; } tmp2 = (x%y); if (p < -100 || p > 20) { // toFixed will give an out of bound error so we fix it like this: l = Math.round(Math.log(tmp2)/Math.log(10)); l2 = Math.pow(10, l); return (tmp2 / l2).toFixed(l-p)*l2; } else { return parseFloat(tmp2.toFixed(-p)); } } function get_class(obj) { // Retrieves the class name // // version: 810.114 // discuss at: http://phpjs.org/functions/get_class // + original by: Ates Goral (http://magnetiq.com) // + improved by: David James // * example 1: get_class(new (function MyClass() {})); // * returns 1: "MyClass" // * example 2: get_class({}); // * returns 2: "Object" // * example 3: get_class([]); // * returns 3: false // * example 4: get_class(42); // * returns 4: false // * example 5: get_class(window); // * returns 5: false // * example 6: get_class(function MyFunction() {}); // * returns 6: false if (obj instanceof Object && !(obj instanceof Array) && !(obj instanceof Function) && obj.constructor && obj != window) { var arr = obj.constructor.toString().match(/function\s*(\w+)/); if (arr && arr.length == 2) { return arr[1]; } } return false; } function get_defined_vars() { // Returns an associative array of names and values of all currently defined variable names (variables in the current scope) // // version: 903.3016 // discuss at: http://phpjs.org/functions/get_defined_vars // + original by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: Test case 1: If get_defined_vars can find itself in the defined vars, it worked :) // * example 1: function test_in_array(array, p_val) {for(var i = 0, l = array.length; i < l; i++) {if(array[i] == p_val) return true;} return false;} // * example 1: funcs = get_defined_vars(); // * example 1: found = test_in_array(funcs, 'get_defined_vars'); // * results 1: found == true var i = '', arr = [], already = {}; for (i in window) { try { if (typeof window[i] === 'function') { if (!already[i]) { already[i] = 1; arr.push(i); } } else if (typeof window[i] === 'object') { for (var j in window[i]) { if (typeof window[j] === 'function' && window[j] && !already[j]) { already[j] = 1; arr.push(j); } } } } catch (e) { } } return arr; } function get_headers(url, format) { // fetches all the headers sent by the server in response to a HTTP request // // version: 812.1017 // discuss at: http://phpjs.org/functions/get_headers // + original by: Paulo Ricardo F. Santos // % note 1: This function uses XmlHttpRequest and cannot retrieve resource from different domain. // % note 1: Synchronous so may lock up browser, mainly here for study purposes. // * example 1: get_headers('http://kevin.vanzonneveld.net/pj_test_supportfile_1.htm'); // * returns 1: '123' var req = window.ActiveXObject ? new ActiveXObject("Microsoft.XMLHTTP") : new XMLHttpRequest(); if (!req) throw new Error('XMLHttpRequest not supported'); var tmp, headers, pair, i; req.open('HEAD', url, false); req.send(null); if (req.readyState < 3) { return false; } tmp = req.getAllResponseHeaders();alert(tmp); tmp = tmp.split('\n'); tmp = array_filter(tmp, function (value) { return value.substring(1) != ''; }); headers = [req.status + ' ' + req.statusText]; for (i in tmp) { if (format) { pair = tmp[i].split(':'); headers[pair.splice(0, 1)] = pair.join(':').substring(1); } else { headers[headers.length] = tmp[i]; } } return headers; } function get_html_translation_table(table, quote_style) { // Returns the internal translation table used by htmlspecialchars and htmlentities // // version: 903.1614 // discuss at: http://phpjs.org/functions/get_html_translation_table // + original by: Philip Peterson // + revised by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: noname // + bugfixed by: Alex // + bugfixed by: Marco // + bugfixed by: madipta // % note: It has been decided that we're not going to add global // % note: dependencies to php.js. Meaning the constants are not // % note: real constants, but strings instead. integers are also supported if someone // % note: chooses to create the constants themselves. // % note: Table from http://www.the-art-of-web.com/html/character-codes/ // * example 1: get_html_translation_table('HTML_SPECIALCHARS'); // * returns 1: {'"': '"', '&': '&', '<': '<', '>': '>'} var entities = {}, histogram = {}, decimal = 0, symbol = ''; var constMappingTable = {}, constMappingQuoteStyle = {}; var useTable = {}, useQuoteStyle = {}; useTable = (table ? table.toUpperCase() : 'HTML_SPECIALCHARS'); useQuoteStyle = (quote_style ? quote_style.toUpperCase() : 'ENT_COMPAT'); // Translate arguments constMappingTable[0] = 'HTML_SPECIALCHARS'; constMappingTable[1] = 'HTML_ENTITIES'; constMappingQuoteStyle[0] = 'ENT_NOQUOTES'; constMappingQuoteStyle[2] = 'ENT_COMPAT'; constMappingQuoteStyle[3] = 'ENT_QUOTES'; // Map numbers to strings for compatibilty with PHP constants if (!isNaN(useTable)) { useTable = constMappingTable[useTable]; } if (!isNaN(useQuoteStyle)) { useQuoteStyle = constMappingQuoteStyle[useQuoteStyle]; } if (useTable == 'HTML_SPECIALCHARS') { // ascii decimals for better compatibility entities['38'] = '&'; if (useQuoteStyle != 'ENT_NOQUOTES') { entities['34'] = '"'; } if (useQuoteStyle == 'ENT_QUOTES') { entities['39'] = '''; } entities['60'] = '<'; entities['62'] = '>'; } else if (useTable == 'HTML_ENTITIES') { // ascii decimals for better compatibility entities['38'] = '&'; if (useQuoteStyle != 'ENT_NOQUOTES') { entities['34'] = '"'; } if (useQuoteStyle == 'ENT_QUOTES') { entities['39'] = '''; } entities['60'] = '<'; entities['62'] = '>'; entities['160'] = ' '; entities['161'] = '¡'; entities['162'] = '¢'; entities['163'] = '£'; entities['164'] = '¤'; entities['165'] = '¥'; entities['166'] = '¦'; entities['167'] = '§'; entities['168'] = '¨'; entities['169'] = '©'; entities['170'] = 'ª'; entities['171'] = '«'; entities['172'] = '¬'; entities['173'] = '­'; entities['174'] = '®'; entities['175'] = '¯'; entities['176'] = '°'; entities['177'] = '±'; entities['178'] = '²'; entities['179'] = '³'; entities['180'] = '´'; entities['181'] = 'µ'; entities['182'] = '¶'; entities['183'] = '·'; entities['184'] = '¸'; entities['185'] = '¹'; entities['186'] = 'º'; entities['187'] = '»'; entities['188'] = '¼'; entities['189'] = '½'; entities['190'] = '¾'; entities['191'] = '¿'; entities['192'] = 'À'; entities['193'] = 'Á'; entities['194'] = 'Â'; entities['195'] = 'Ã'; entities['196'] = 'Ä'; entities['197'] = 'Å'; entities['198'] = 'Æ'; entities['199'] = 'Ç'; entities['200'] = 'È'; entities['201'] = 'É'; entities['202'] = 'Ê'; entities['203'] = 'Ë'; entities['204'] = 'Ì'; entities['205'] = 'Í'; entities['206'] = 'Î'; entities['207'] = 'Ï'; entities['208'] = 'Ð'; entities['209'] = 'Ñ'; entities['210'] = 'Ò'; entities['211'] = 'Ó'; entities['212'] = 'Ô'; entities['213'] = 'Õ'; entities['214'] = 'Ö'; entities['215'] = '×'; entities['216'] = 'Ø'; entities['217'] = 'Ù'; entities['218'] = 'Ú'; entities['219'] = 'Û'; entities['220'] = 'Ü'; entities['221'] = 'Ý'; entities['222'] = 'Þ'; entities['223'] = 'ß'; entities['224'] = 'à'; entities['225'] = 'á'; entities['226'] = 'â'; entities['227'] = 'ã'; entities['228'] = 'ä'; entities['229'] = 'å'; entities['230'] = 'æ'; entities['231'] = 'ç'; entities['232'] = 'è'; entities['233'] = 'é'; entities['234'] = 'ê'; entities['235'] = 'ë'; entities['236'] = 'ì'; entities['237'] = 'í'; entities['238'] = 'î'; entities['239'] = 'ï'; entities['240'] = 'ð'; entities['241'] = 'ñ'; entities['242'] = 'ò'; entities['243'] = 'ó'; entities['244'] = 'ô'; entities['245'] = 'õ'; entities['246'] = 'ö'; entities['247'] = '÷'; entities['248'] = 'ø'; entities['249'] = 'ù'; entities['250'] = 'ú'; entities['251'] = 'û'; entities['252'] = 'ü'; entities['253'] = 'ý'; entities['254'] = 'þ'; entities['255'] = 'ÿ'; } else { throw Error("Table: "+useTable+' not supported'); return false; } // ascii decimals to real symbols for (decimal in entities) { symbol = String.fromCharCode(decimal); histogram[symbol] = entities[decimal]; } return histogram; } function getdate(timestamp) { // Get date/time information // // version: 812.316 // discuss at: http://phpjs.org/functions/getdate // + original by: Paulo Ricardo F. Santos // * example 1: getdate(1055901520); // * returns 1: {'seconds': 40, 'minutes': 58, 'hours': 21, 'mday': 17, 'wday': 2, 'mon': 6, 'year': 2003, 'yday': 167, 'weekday': 'Tuesday', 'month': 'June', '0': 1055901520} var _w = ['Sunday', 'Monday', 'Tuesday', 'Wednesday', 'Thursday', 'Friday', 'Saturday']; var _m = ['January', 'February', 'March', 'April', 'May', 'June', 'July', 'August', 'September', 'October', 'November', 'December']; var d = (typeof timestamp == 'number') ? new Date(timestamp * 1000) : new Date(); var w = d.getDay(); var m = d.getMonth(); var y = d.getFullYear(); var r = {}; r['seconds'] = d.getSeconds(); r['minutes'] = d.getMinutes(); r['hours'] = d.getHours(); r['mday'] = d.getDate(); r['wday'] = w; r['mon'] = m + 1; r['year'] = y; r['yday'] = Math.floor((d - (new Date(y, 0, 1))) / 86400000); r['weekday'] = _w[w]; r['month'] = _m[m]; r['0'] = parseInt(d.getTime() / 1000); return r; } function getrandmax() { // Returns the maximum value a random number can have // // version: 810.1317 // discuss at: http://phpjs.org/functions/getrandmax // + original by: Onno Marsman // * example 1: getrandmax(); // * returns 1: 2147483647 return 2147483647; } function hexdec(hex_string) { // Returns the decimal equivalent of the hexadecimal number // // version: 810.300 // discuss at: http://phpjs.org/functions/hexdec // + original by: Philippe Baumann // * example 1: hexdec('that'); // * returns 1: 10 // * example 2: hexdec('a0'); // * returns 2: 160 hex_string = (hex_string+'').replace(/[^a-f0-9]/gi, ''); return parseInt(hex_string, 16); } function html_entity_decode( string, quote_style ) { // Convert all HTML entities to their applicable characters // // version: 901.714 // discuss at: http://phpjs.org/functions/html_entity_decode // + original by: john (http://www.jd-tech.net) // + input by: ger // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + revised by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // + improved by: marc andreu // + revised by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: get_html_translation_table // * example 1: html_entity_decode('Kevin & van Zonneveld'); // * returns 1: 'Kevin & van Zonneveld' // * example 2: html_entity_decode('&lt;'); // * returns 2: '<' var histogram = {}, symbol = '', tmp_str = '', entity = ''; tmp_str = string.toString(); if (false === (histogram = get_html_translation_table('HTML_ENTITIES', quote_style))) { return false; } // & must be the last character when decoding! delete(histogram['&']); histogram['&'] = '&'; for (symbol in histogram) { entity = histogram[symbol]; tmp_str = tmp_str.split(entity).join(symbol); } return tmp_str; } function htmlentities (string, quote_style) { // Convert all applicable characters to HTML entities // // version: 903.2219 // discuss at: http://phpjs.org/functions/htmlentities // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + revised by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: nobbler // + tweaked by: Jack // + bugfixed by: Onno Marsman // + revised by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: get_html_translation_table // * example 1: htmlentities('Kevin & van Zonneveld'); // * returns 1: 'Kevin & van Zonneveld' // * example 2: htmlentities("foo'bar","ENT_QUOTES"); // * returns 2: 'foo'bar' var histogram = {}, symbol = '', tmp_str = '', entity = ''; tmp_str = string.toString(); if (false === (histogram = get_html_translation_table('HTML_ENTITIES', quote_style))) { return false; } for (symbol in histogram) { entity = histogram[symbol]; tmp_str = tmp_str.split(symbol).join(entity); } return tmp_str; } function htmlspecialchars (string, quote_style) { // Convert special characters to HTML entities // // version: 812.3017 // discuss at: http://phpjs.org/functions/htmlspecialchars // + original by: Mirek Slugen // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Nathan // + bugfixed by: Arno // + revised by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: get_html_translation_table // * example 1: htmlspecialchars("Test", 'ENT_QUOTES'); // * returns 1: '<a href='test'>Test</a>' var histogram = {}, symbol = '', tmp_str = '', entity = ''; tmp_str = string.toString(); if (false === (histogram = get_html_translation_table('HTML_SPECIALCHARS', quote_style))) { return false; } for (symbol in histogram) { entity = histogram[symbol]; tmp_str = tmp_str.split(symbol).join(entity); } return tmp_str; } function htmlspecialchars_decode(string, quote_style) { // Convert special HTML entities back to characters // // version: 901.714 // discuss at: http://phpjs.org/functions/htmlspecialchars_decode // + original by: Mirek Slugen // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Mateusz "loonquawl" Zalega // + input by: ReverseSyntax // + input by: Slawomir Kaniecki // + input by: Scott Cariss // + input by: Francois // + bugfixed by: Onno Marsman // + revised by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: get_html_translation_table // * example 1: htmlspecialchars_decode("

this -> "

", 'ENT_NOQUOTES'); // * returns 1: '

this -> "

' var histogram = {}, symbol = '', tmp_str = '', entity = ''; tmp_str = string.toString(); if (false === (histogram = get_html_translation_table('HTML_SPECIALCHARS', quote_style))) { return false; } // & must be the last character when decoding! delete(histogram['&']); histogram['&'] = '&'; for (symbol in histogram) { entity = histogram[symbol]; tmp_str = tmp_str.split(entity).join(symbol); } return tmp_str; } function http_build_query( formdata, numeric_prefix, arg_separator ) { // Generates a form-encoded query string from an associative array or object. // // version: 904.317 // discuss at: http://phpjs.org/functions/http_build_query // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Legaev Andrey // + improved by: Michael White (http://getsprink.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: urlencode // * example 1: http_build_query({foo: 'bar', php: 'hypertext processor', baz: 'boom', cow: 'milk'}, '', '&'); // * returns 1: 'foo=bar&php=hypertext+processor&baz=boom&cow=milk' // * example 2: http_build_query({'php': 'hypertext processor', 0: 'foo', 1: 'bar', 2: 'baz', 3: 'boom', 'cow': 'milk'}, 'myvar_'); // * returns 2: 'php=hypertext+processor&myvar_0=foo&myvar_1=bar&myvar_2=baz&myvar_3=boom&cow=milk' // Recursive version by stag019, but currently breaks second example // // var key, tmp = []; // // var _http_build_query_helper = function (key, val, arg_separator) { // var k, tmp = []; // if (val === true) { // val = "1"; // } else if (val === false) { // val = "0"; // } // if (typeof(val) == "array" || typeof(val) == "object") { // for (k in val) { // if(val[k] !== null) { // tmp.push(_http_build_query_helper(key + "[" + k + "]", val[k], arg_separator)); // } // } // return tmp.join(arg_separator); // } else if(typeof(val) != "function") { // return urlencode(key) + "=" + urlencode(val); // } // }; // // if (!arg_separator) { // arg_separator = "&"; // } // for (key in formdata) { // if (numeric_prefix && !isNaN(key)) { // key = String(numeric_prefix) + key; // } // tmp.push(_http_build_query_helper(key, formdata[key], arg_separator)); // } // // return tmp.join(arg_separator); var key, use_val, use_key, i = 0, j=0, tmp_arr = []; if (!arg_separator) { arg_separator = '&'; } for (key in formdata) { use_val = urlencode(formdata[key].toString()); use_key = urlencode(key); if (numeric_prefix && !isNaN(key)) { use_key = numeric_prefix + j; j++; } tmp_arr[i++] = use_key + '=' + use_val; } return tmp_arr.join(arg_separator); } function hypot(x, y) { // Returns sqrt(num1*num1 + num2*num2) // // version: 810.1317 // discuss at: http://phpjs.org/functions/hypot // + original by: Onno Marsman // * example 1: hypot(3, 4); // * returns 1: 5 // * example 2: hypot([], 'a'); // * returns 2: 0 return Math.sqrt(x*x + y*y) || 0; } function implode( glue, pieces ) { // Joins array elements placing glue string between items and return one string // // version: 812.316 // discuss at: http://phpjs.org/functions/implode // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Waldo Malqui Silva // * example 1: implode(' ', ['Kevin', 'van', 'Zonneveld']); // * returns 1: 'Kevin van Zonneveld' return ( ( pieces instanceof Array ) ? pieces.join ( glue ) : pieces ); } function in_array(needle, haystack, argStrict) { // Checks if the given value exists in the array // // version: 903.1614 // discuss at: http://phpjs.org/functions/in_array // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: in_array('van', ['Kevin', 'van', 'Zonneveld']); // * returns 1: true var found = false, key, strict = !!argStrict; for (key in haystack) { if ((strict && haystack[key] === needle) || (!strict && haystack[key] == needle)) { found = true; break; } } return found; } function intval( mixed_var, base ) { // Get the integer value of a variable using the optional base for the conversion // // version: 812.3015 // discuss at: http://phpjs.org/functions/intval // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: stensi // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: intval('Kevin van Zonneveld'); // * returns 1: 0 // * example 2: intval(4.2); // * returns 2: 4 // * example 3: intval(42, 8); // * returns 3: 42 // * example 4: intval('09'); // * returns 4: 9 var tmp; var type = typeof( mixed_var ); if(type == 'boolean'){ if (mixed_var == true) { return 1; } else { return 0; } } else if(type == 'string'){ tmp = parseInt(mixed_var * 1); if(isNaN(tmp) || !isFinite(tmp)){ return 0; } else{ return tmp.toString(base || 10); } } else if(type == 'number' && isFinite(mixed_var) ){ return Math.floor(mixed_var); } else{ return 0; } } function ip2long ( ip_address ) { // Converts a string containing an (IPv4) Internet Protocol dotted address into a proper address // // version: 901.714 // discuss at: http://phpjs.org/functions/ip2long // + original by: Waldo Malqui Silva // + improved by: Victor // * example 1: ip2long( '192.0.34.166' ); // * returns 1: 3221234342 var output = false; var parts = []; if (ip_address.match(/^\d{1,3}\.\d{1,3}\.\d{1,3}\.\d{1,3}$/)) { parts = ip_address.split('.'); output = ( parts[0] * 16777216 + ( parts[1] * 65536 ) + ( parts[2] * 256 ) + ( parts[3] * 1 ) ); } return output; } function is_bool(mixed_var) { // Returns true if variable is a boolean // // version: 810.1317 // discuss at: http://phpjs.org/functions/is_bool // + original by: Onno Marsman // * example 1: is_bool(false); // * returns 1: true // * example 2: is_bool(0); // * returns 2: false return (typeof mixed_var == 'boolean'); } function is_double( mixed_var ) { // !No description available for is_double. @php.js developers: Please update the function summary text file. // // version: 812.1017 // discuss at: http://phpjs.org/functions/is_double // + original by: Paulo Ricardo F. Santos // - depends on: is_float // % note 1: 1.0 is simplified to 1 before it can be accessed by the function, this makes // % note 1: it different from the PHP implementation. We can't fix this unfortunately. // * example 1: is_double(186.31); // * returns 1: true return is_float(mixed_var); } function is_finite(val) { // Returns whether argument is finite // // version: 810.1317 // discuss at: http://phpjs.org/functions/is_finite // + original by: Onno Marsman // * example 1: is_finite(Infinity); // * returns 1: false // * example 2: is_finite(-Infinity); // * returns 2: false // * example 3: is_finite(0); // * returns 3: true var warningType = ''; if (val===Infinity || val===-Infinity) { return false; } //Some warnings for maximum PHP compatibility if (typeof val=='object') { warningType = (val instanceof Array ? 'array' : 'object'); } else if (typeof val=='string' && !val.match(/^[\+\-]?\d/)) { //simulate PHP's behaviour: '-9a' doesn't give a warning, but 'a9' does. warningType = 'string'; } if (warningType) { throw new Error('Warning: is_finite() expects parameter 1 to be double, '+warningType+' given'); } return true; } function is_float( mixed_var ) { // Returns true if variable is float point // // version: 812.1017 // discuss at: http://phpjs.org/functions/is_float // + original by: Paulo Ricardo F. Santos // % note 1: 1.0 is simplified to 1 before it can be accessed by the function, this makes // % note 1: it different from the PHP implementation. We can't fix this unfortunately. // * example 1: is_float(186.31); // * returns 1: true return parseFloat(mixed_var * 1) != parseInt(mixed_var * 1); } function is_infinite(val) { // Returns whether argument is infinite // // version: 810.1317 // discuss at: http://phpjs.org/functions/is_infinite // + original by: Onno Marsman // * example 1: is_infinite(Infinity); // * returns 1: true // * example 2: is_infinite(-Infinity); // * returns 2: true // * example 3: is_infinite(0); // * returns 3: false var warningType = ''; if (val===Infinity || val===-Infinity) { return true; } //Some warnings for maximum PHP compatibility if (typeof val=='object') { warningType = (val instanceof Array ? 'array' : 'object'); } else if (typeof val=='string' && !val.match(/^[\+\-]?\d/)) { //simulate PHP's behaviour: '-9a' doesn't give a warning, but 'a9' does. warningType = 'string'; } if (warningType) { throw new Error('Warning: is_infinite() expects parameter 1 to be double, '+warningType+' given'); } return false; } function is_int( mixed_var ) { // !No description available for is_int. @php.js developers: Please update the function summary text file. // // version: 901.2514 // discuss at: http://phpjs.org/functions/is_int // + original by: Alex // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + revised by: Matt Bradley // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // % note 1: 1.0 is simplified to 1 before it can be accessed by the function, this makes // % note 1: it different from the PHP implementation. We can't fix this unfortunately. // * example 1: is_int(23) // * returns 1: true // * example 2: is_int('23') // * returns 2: false // * example 3: is_int(23.5) // * returns 3: false // * example 4: is_int(true) // * returns 4: false if (typeof mixed_var !== 'number') { return false; } if (parseFloat(mixed_var) != parseInt(mixed_var)) { return false; } return true; } function is_integer( mixed_var ) { // !No description available for is_integer. @php.js developers: Please update the function summary text file. // // version: 812.1017 // discuss at: http://phpjs.org/functions/is_integer // + original by: Paulo Ricardo F. Santos // - depends on: is_int // % note 1: 1.0 is simplified to 1 before it can be accessed by the function, this makes // % note 1: it different from the PHP implementation. We can't fix this unfortunately. // * example 1: is_integer(186.31); // * returns 1: false // * example 2: is_integer(12); // * returns 2: true return is_int(mixed_var); } function is_long( mixed_var ) { // Returns true if variable is a long (integer) // // version: 812.1017 // discuss at: http://phpjs.org/functions/is_long // + original by: Paulo Ricardo F. Santos // - depends on: is_float // % note 1: 1.0 is simplified to 1 before it can be accessed by the function, this makes // % note 1: it different from the PHP implementation. We can't fix this unfortunately. // * example 1: is_long(186.31); // * returns 1: true return is_float(mixed_var); } function is_nan(val) { // Returns whether argument is not a number // // version: 810.1317 // discuss at: http://phpjs.org/functions/is_nan // + original by: Onno Marsman // + input by: Robin // * example 1: is_nan(NaN); // * returns 1: true // * example 2: is_nan(0); // * returns 2: false var warningType = ''; if (typeof val=='number' && isNaN(val)) { return true; } //Some errors for maximum PHP compatibility if (typeof val=='object') { warningType = (val instanceof Array ? 'array' : 'object'); } else if (typeof val=='string' && !val.match(/^[\+\-]?\d/)) { //simulate PHP's behaviour: '-9a' doesn't give a warning, but 'a9' does. warningType = 'string'; } if (warningType) { throw new Error('Warning: is_nan() expects parameter 1 to be double, '+warningType+' given'); } return false; } function is_null( mixed_var ){ // Returns true if variable is null // // version: 810.114 // discuss at: http://phpjs.org/functions/is_null // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: is_null('23'); // * returns 1: false // * example 2: is_null(null); // * returns 2: true return ( mixed_var === null ); } function is_numeric( mixed_var ) { // Returns true if value is a number or a numeric string // // version: 904.317 // discuss at: http://phpjs.org/functions/is_numeric // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: David // + improved by: taith // + bugfixed by: Tim de Koning // * example 1: is_numeric(186.31); // * returns 1: true // * example 2: is_numeric('Kevin van Zonneveld'); // * returns 2: false // * example 3: is_numeric('+186.31e2'); // * returns 3: true // * example 4: is_numeric(''); // * returns 4: false if (mixed_var === '') { return false; } return !isNaN(mixed_var * 1); } function is_real( mixed_var ) { // !No description available for is_real. @php.js developers: Please update the function summary text file. // // version: 903.3016 // discuss at: http://phpjs.org/functions/is_real // + original by: Brett Zamir (http://brettz9.blogspot.com) // - depends on: is_float // % note 1: 1.0 is simplified to 1 before it can be accessed by the function, this makes // % note 1: it different from the PHP implementation. We can't fix this unfortunately. // * example 1: is_double(186.31); // * returns 1: true return is_float(mixed_var); } function is_scalar( mixed_var ) { // Returns true if value is a scalar // // version: 812.1017 // discuss at: http://phpjs.org/functions/is_scalar // + original by: Paulo Ricardo F. Santos // * example 1: is_scalar(186.31); // * returns 1: true // * example 2: is_scalar({0: 'Kevin van Zonneveld'}); // * returns 2: false return /boolean|number|string/.test(typeof mixed_var); } function is_string( mixed_var ){ // Returns true if variable is a Unicode or binary string // // version: 810.114 // discuss at: http://phpjs.org/functions/is_string // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: is_string('23'); // * returns 1: true // * example 2: is_string(23.5); // * returns 2: false return (typeof( mixed_var ) == 'string'); } function join( glue, pieces ) { // An alias for implode // // version: 810.114 // discuss at: http://phpjs.org/functions/join // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: implode // * example 1: join(' ', ['Kevin', 'van', 'Zonneveld']); // * returns 1: 'Kevin van Zonneveld' return implode( glue, pieces ); } function json_decode(str_json) { // Decodes the JSON representation into a PHP value // // version: 901.2515 // discuss at: http://phpjs.org/functions/json_decode // + original by: Public Domain (http://www.json.org/json2.js) // + reimplemented by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: json_decode('[\n "e",\n {\n "pluribus": "unum"\n}\n]'); // * returns 1: ['e', {pluribus: 'unum'}] /* http://www.JSON.org/json2.js 2008-11-19 Public Domain. NO WARRANTY EXPRESSED OR IMPLIED. USE AT YOUR OWN RISK. See http://www.JSON.org/js.html */ var cx = /[\u0000\u00ad\u0600-\u0604\u070f\u17b4\u17b5\u200c-\u200f\u2028-\u202f\u2060-\u206f\ufeff\ufff0-\uffff]/g; var j; var text = str_json; var walk = function(holder, key) { // The walk method is used to recursively walk the resulting structure so // that modifications can be made. var k, v, value = holder[key]; if (value && typeof value === 'object') { for (k in value) { if (Object.hasOwnProperty.call(value, k)) { v = walk(value, k); if (v !== undefined) { value[k] = v; } else { delete value[k]; } } } } return reviver.call(holder, key, value); } // Parsing happens in four stages. In the first stage, we replace certain // Unicode characters with escape sequences. JavaScript handles many characters // incorrectly, either silently deleting them, or treating them as line endings. cx.lastIndex = 0; if (cx.test(text)) { text = text.replace(cx, function (a) { return '\\u' + ('0000' + a.charCodeAt(0).toString(16)).slice(-4); }); } // In the second stage, we run the text against regular expressions that look // for non-JSON patterns. We are especially concerned with '()' and 'new' // because they can cause invocation, and '=' because it can cause mutation. // But just to be safe, we want to reject all unexpected forms. // We split the second stage into 4 regexp operations in order to work around // crippling inefficiencies in IE's and Safari's regexp engines. First we // replace the JSON backslash pairs with '@' (a non-JSON character). Second, we // replace all simple value tokens with ']' characters. Third, we delete all // open brackets that follow a colon or comma or that begin the text. Finally, // we look to see that the remaining characters are only whitespace or ']' or // ',' or ':' or '{' or '}'. If that is so, then the text is safe for eval. if (/^[\],:{}\s]*$/. test(text.replace(/\\(?:["\\\/bfnrt]|u[0-9a-fA-F]{4})/g, '@'). replace(/"[^"\\\n\r]*"|true|false|null|-?\d+(?:\.\d*)?(?:[eE][+\-]?\d+)?/g, ']'). replace(/(?:^|:|,)(?:\s*\[)+/g, ''))) { // In the third stage we use the eval function to compile the text into a // JavaScript structure. The '{' operator is subject to a syntactic ambiguity // in JavaScript: it can begin a block or an object literal. We wrap the text // in parens to eliminate the ambiguity. j = eval('(' + text + ')'); // In the optional fourth stage, we recursively walk the new structure, passing // each name/value pair to a reviver function for possible transformation. return typeof reviver === 'function' ? walk({ '': j }, '') : j; } // If the text is not JSON parseable, then a SyntaxError is thrown. throw new SyntaxError('json_decode'); } function json_encode(mixed_val) { // Returns the JSON representation of a value // // version: 901.2515 // discuss at: http://phpjs.org/functions/json_encode // + original by: Public Domain (http://www.json.org/json2.js) // + reimplemented by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: json_encode(['e', {pluribus: 'unum'}]); // * returns 1: '[\n "e",\n {\n "pluribus": "unum"\n}\n]' /* http://www.JSON.org/json2.js 2008-11-19 Public Domain. NO WARRANTY EXPRESSED OR IMPLIED. USE AT YOUR OWN RISK. See http://www.JSON.org/js.html */ var indent; var value = mixed_val; var i; var quote = function (string) { var escapable = /[\\\"\x00-\x1f\x7f-\x9f\u00ad\u0600-\u0604\u070f\u17b4\u17b5\u200c-\u200f\u2028-\u202f\u2060-\u206f\ufeff\ufff0-\uffff]/g; var meta = { // table of character substitutions '\b': '\\b', '\t': '\\t', '\n': '\\n', '\f': '\\f', '\r': '\\r', '"' : '\\"', '\\': '\\\\' }; escapable.lastIndex = 0; return escapable.test(string) ? '"' + string.replace(escapable, function (a) { var c = meta[a]; return typeof c === 'string' ? c : '\\u' + ('0000' + a.charCodeAt(0).toString(16)).slice(-4); }) + '"' : '"' + string + '"'; } var str = function(key, holder) { var gap = ''; var indent = ' '; var i = 0; // The loop counter. var k = ''; // The member key. var v = ''; // The member value. var length = 0; var mind = gap; var partial = []; var value = holder[key]; // If the value has a toJSON method, call it to obtain a replacement value. if (value && typeof value === 'object' && typeof value.toJSON === 'function') { value = value.toJSON(key); } // What happens next depends on the value's type. switch (typeof value) { case 'string': return quote(value); case 'number': // JSON numbers must be finite. Encode non-finite numbers as null. return isFinite(value) ? String(value) : 'null'; case 'boolean': case 'null': // If the value is a boolean or null, convert it to a string. Note: // typeof null does not produce 'null'. The case is included here in // the remote chance that this gets fixed someday. return String(value); case 'object': // If the type is 'object', we might be dealing with an object or an array or // null. // Due to a specification blunder in ECMAScript, typeof null is 'object', // so watch out for that case. if (!value) { return 'null'; } // Make an array to hold the partial results of stringifying this object value. gap += indent; partial = []; // Is the value an array? if (Object.prototype.toString.apply(value) === '[object Array]') { // The value is an array. Stringify every element. Use null as a placeholder // for non-JSON values. length = value.length; for (i = 0; i < length; i += 1) { partial[i] = str(i, value) || 'null'; } // Join all of the elements together, separated with commas, and wrap them in // brackets. v = partial.length === 0 ? '[]' : gap ? '[\n' + gap + partial.join(',\n' + gap) + '\n' + mind + ']' : '[' + partial.join(',') + ']'; gap = mind; return v; } // Iterate through all of the keys in the object. for (k in value) { if (Object.hasOwnProperty.call(value, k)) { v = str(k, value); if (v) { partial.push(quote(k) + (gap ? ': ' : ':') + v); } } } // Join all of the member texts together, separated with commas, // and wrap them in braces. v = partial.length === 0 ? '{}' : gap ? '{\n' + gap + partial.join(',\n' + gap) + '\n' + mind + '}' : '{' + partial.join(',') + '}'; gap = mind; return v; } }; // Make a fake root object containing our value under the key of ''. // Return the result of stringifying the value. return str('', { '': value }); } function krsort(array, sort_flags) { // Sort an array by key value in reverse order // // version: 903.3016 // discuss at: http://phpjs.org/functions/krsort // + original by: GeekFG (http://geekfg.blogspot.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // % note: The examples are correct, this is a new way // * example 1: data = {2: 'van', 3: 'Zonneveld', 1: 'Kevin'}; // * example 1: krsort(data); // * results 1: data == {3: 'Kevin', 2: 'van', 1: 'Zonneveld'} // * returns 1: true var tmp_arr={}, keys=[], sorter, i, key; switch (sort_flags) { case 'SORT_STRING': // compare items as strings sorter = function (a, b) { return strnatcmp(b, a); }; break; case 'SORT_LOCALE_STRING': // compare items as strings, based on the current locale (set with i18n_loc_set_default() as of PHP6) sorter = function (a, b) { return(b.localeCompare(a)); }; break; case 'SORT_NUMERIC': // compare items numerically sorter = function (a, b) { return(b - a); }; break; case 'SORT_REGULAR': // compare items normally (don't change types) default: sorter = function (a, b) { if (a < b) return 1; if (a > b) return -1; return 0; }; break; } // Make a list of key names for (key in array) { keys.push(key); } keys.sort(sorter); // Rebuild array with sorted key names for (i = 0; i < keys.length; i++) { key = keys[i]; tmp_arr[key] = array[key]; delete array[key]; } for (i in tmp_arr) { array[i] = tmp_arr[i] } return true; } function ksort(array, sort_flags) { // Sort an array by key // // version: 903.3016 // discuss at: http://phpjs.org/functions/ksort // + original by: GeekFG (http://geekfg.blogspot.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // % note: The examples are correct, this is a new way // * example 1: data = {2: 'van', 3: 'Zonneveld', 1: 'Kevin'}; // * example 1: ksort(data); // * results 1: data == {1: 'Kevin', 2: 'van', 3: 'Zonneveld'} // * returns 1: true var tmp_arr={}, keys=[], sorter, i, key; switch (sort_flags) { case 'SORT_STRING': // compare items as strings sorter = function (a, b) { return strnatcmp(a, b); }; break; case 'SORT_LOCALE_STRING': // compare items as strings, based on the current locale (set with i18n_loc_set_default() as of PHP6) sorter = function (a, b) { return(a.localeCompare(b)); }; break; case 'SORT_NUMERIC': // compare items numerically sorter = function (a, b) { return(a - b); }; break; case 'SORT_REGULAR': // compare items normally (don't change types) default: sorter = function (a, b) { if (a > b) return 1; if (a < b) return -1; return 0; }; break; } // Make a list of key names for (key in array) { keys.push(key); } keys.sort(sorter); // Rebuild array with sorted key names for (i = 0; i < keys.length; i++) { key = keys[i]; tmp_arr[key] = array[key]; delete array[key]; } for (i in tmp_arr) { array[i] = tmp_arr[i] } return true; } function lcfirst( str ) { // !No description available for lcfirst. @php.js developers: Please update the function summary text file. // // version: 903.3016 // discuss at: http://phpjs.org/functions/lcfirst // + original by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: lcfirst('Kevin Van Zonneveld'); // * returns 1: 'kevin Van Zonneveld' str += ''; var f = str.charAt(0).toLowerCase(); return f + str.substr(1); } function lcg_value() { // !No description available for lcg_value. @php.js developers: Please update the function summary text file. // // version: 810.1317 // discuss at: http://phpjs.org/functions/lcg_value // + original by: Onno Marsman return Math.random(); } function levenshtein (a, b){ // Calculate Levenshtein distance between two strings // // version: 903.3016 // discuss at: http://phpjs.org/functions/levenshtein // + original by: Carlos R. L. Rodrigues (http://www.jsfromhell.com) // + bugfixed by: Onno Marsman // + revised by: Andrea Giammarchi (http://webreflection.blogspot.com) // + reimplemented by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: levenshtein('Kevin van Zonneveld', 'Kevin van Sommeveld'); // * returns 1: 3 var min=Math.min, len1=0, len2=0, I=0, i=0, d=[], c='', j=0, J=0; // BEGIN STATIC var split = false; try{ split=!('0')[0]; } catch(i){ split=true; // Earlier IE may not support access by string index } // END STATIC if (a == b) { return 0; } if (!a.length || !b.length) { return b.length || a.length; } if (split){ a = a.split('');b = b.split(''); } len1 = a.length + 1; len2 = b.length + 1; d = [[0]]; while (++i < len2) { d[0][i] = i; } i = 0; while (++i < len1) { J = j = 0; c = a[I]; d[i] = [i]; while (++j < len2) { d[i][j] = min(d[I][j] + 1, d[i][J] + 1, d[I][J] + (c != b[J])); ++J; } ++I; } return d[len1 - 1][len2 - 1]; } function log(arg, base) { // Returns the natural logarithm of the number, or the base log if base is specified // // version: 810.114 // discuss at: http://phpjs.org/functions/log // + original by: Onno Marsman // * example 1: log(8723321.4, 7); // * returns 1: 8.212871815082147 if (base === undefined) { return Math.log(arg); } else { return Math.log(arg)/Math.log(base); } } function log10(arg) { // Returns the base-10 logarithm of the number // // version: 812.316 // discuss at: http://phpjs.org/functions/log10 // + original by: Philip Peterson // + improved by: Onno Marsman // + improved by: Tod Gentille // * example 1: log10(10); // * returns 1: 1 // * example 2: log10(1); // * returns 2: 0 return Math.log(arg)/Math.LN10; } function long2ip ( proper_address ) { // Converts an (IPv4) Internet network address into a string in Internet standard dotted format // // version: 812.316 // discuss at: http://phpjs.org/functions/long2ip // + original by: Waldo Malqui Silva // * example 1: long2ip( 3221234342 ); // * returns 1: '192.0.34.166' var output = false; if ( !isNaN ( proper_address ) && ( proper_address >= 0 || proper_address <= 4294967295 ) ) { output = Math.floor (proper_address / Math.pow ( 256, 3 ) ) + '.' + Math.floor ( ( proper_address % Math.pow ( 256, 3 ) ) / Math.pow ( 256, 2 ) ) + '.' + Math.floor ( ( ( proper_address % Math.pow ( 256, 3 ) ) % Math.pow ( 256, 2 ) ) / Math.pow ( 256, 1 ) ) + '.' + Math.floor ( ( ( ( proper_address % Math.pow ( 256, 3 ) ) % Math.pow ( 256, 2 ) ) % Math.pow ( 256, 1 ) ) / Math.pow ( 256, 0 ) ); } return output; } function ltrim ( str, charlist ) { // Strips whitespace from the beginning of a string // // version: 810.1317 // discuss at: http://phpjs.org/functions/ltrim // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Erkekjetter // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // * example 1: ltrim(' Kevin van Zonneveld '); // * returns 1: 'Kevin van Zonneveld ' charlist = !charlist ? ' \s\xA0' : (charlist+'').replace(/([\[\]\(\)\.\?\/\*\{\}\+\$\^\:])/g, '\$1'); var re = new RegExp('^[' + charlist + ']+', 'g'); return (str+'').replace(re, ''); } function max() { // Return the highest value in an array or a series of arguments // // version: 810.114 // discuss at: http://phpjs.org/functions/max // + original by: Onno Marsman // + revised by: Onno Marsman // + tweaked by: Jack // % note: Long code cause we're aiming for maximum PHP compatibility // * example 1: max(1, 3, 5, 6, 7); // * returns 1: 7 // * example 2: max([2, 4, 5]); // * returns 2: 5 // * example 3: max(0, 'hello'); // * returns 3: 0 // * example 4: max('hello', 0); // * returns 4: 'hello' // * example 5: max(-1, 'hello'); // * returns 5: 'hello' // * example 6: max([2, 4, 8], [2, 5, 7]); // * returns 6: [2, 5, 7] var ar, retVal, i = 0, n = 0; var argv = arguments, argc = argv.length; var _obj2Array = function(obj) { if (obj instanceof Array) { return obj; } else { var ar = []; for (var i in obj) { ar.push(obj[i]); } return ar; } } //function _obj2Array var _compare = function(current, next) { var i = 0, n = 0, tmp = 0; var nl = 0, cl = 0; if (current === next) { return 0; } else if (typeof current == 'object') { if (typeof next == 'object') { current = _obj2Array(current); next = _obj2Array(next); cl = current.length; nl = next.length; if (nl > cl) { return 1; } else if (nl < cl) { return -1; } else { for (i = 0, n = cl; i0 ? 1 : -1); } } else { if (next==current) { return 0; } else { return (next>current ? 1 : -1); } } } //function _compare if (argc == 0) { throw new Error('At least one value should be passed to max()'); } else if (argc == 1) { if (typeof argv[0]=='object') { ar = _obj2Array(argv[0]); } else { throw new Error('Wrong parameter count for max()'); } if (ar.length == 0) { throw new Error('Array must contain at least one element for max()'); } } else { ar = argv; } retVal = ar[0]; for (i=1, n=ar.length; i>>(32-iShiftBits)); }; var AddUnsigned = function(lX,lY) { var lX4,lY4,lX8,lY8,lResult; lX8 = (lX & 0x80000000); lY8 = (lY & 0x80000000); lX4 = (lX & 0x40000000); lY4 = (lY & 0x40000000); lResult = (lX & 0x3FFFFFFF)+(lY & 0x3FFFFFFF); if (lX4 & lY4) { return (lResult ^ 0x80000000 ^ lX8 ^ lY8); } if (lX4 | lY4) { if (lResult & 0x40000000) { return (lResult ^ 0xC0000000 ^ lX8 ^ lY8); } else { return (lResult ^ 0x40000000 ^ lX8 ^ lY8); } } else { return (lResult ^ lX8 ^ lY8); } }; var F = function(x,y,z) { return (x & y) | ((~x) & z); }; var G = function(x,y,z) { return (x & z) | (y & (~z)); }; var H = function(x,y,z) { return (x ^ y ^ z); }; var I = function(x,y,z) { return (y ^ (x | (~z))); }; var FF = function(a,b,c,d,x,s,ac) { a = AddUnsigned(a, AddUnsigned(AddUnsigned(F(b, c, d), x), ac)); return AddUnsigned(RotateLeft(a, s), b); }; var GG = function(a,b,c,d,x,s,ac) { a = AddUnsigned(a, AddUnsigned(AddUnsigned(G(b, c, d), x), ac)); return AddUnsigned(RotateLeft(a, s), b); }; var HH = function(a,b,c,d,x,s,ac) { a = AddUnsigned(a, AddUnsigned(AddUnsigned(H(b, c, d), x), ac)); return AddUnsigned(RotateLeft(a, s), b); }; var II = function(a,b,c,d,x,s,ac) { a = AddUnsigned(a, AddUnsigned(AddUnsigned(I(b, c, d), x), ac)); return AddUnsigned(RotateLeft(a, s), b); }; var ConvertToWordArray = function(str) { var lWordCount; var lMessageLength = str.length; var lNumberOfWords_temp1=lMessageLength + 8; var lNumberOfWords_temp2=(lNumberOfWords_temp1-(lNumberOfWords_temp1 % 64))/64; var lNumberOfWords = (lNumberOfWords_temp2+1)*16; var lWordArray=Array(lNumberOfWords-1); var lBytePosition = 0; var lByteCount = 0; while ( lByteCount < lMessageLength ) { lWordCount = (lByteCount-(lByteCount % 4))/4; lBytePosition = (lByteCount % 4)*8; lWordArray[lWordCount] = (lWordArray[lWordCount] | (str.charCodeAt(lByteCount)<>>29; return lWordArray; }; var WordToHex = function(lValue) { var WordToHexValue="",WordToHexValue_temp="",lByte,lCount; for (lCount = 0;lCount<=3;lCount++) { lByte = (lValue>>>(lCount*8)) & 255; WordToHexValue_temp = "0" + lByte.toString(16); WordToHexValue = WordToHexValue + WordToHexValue_temp.substr(WordToHexValue_temp.length-2,2); } return WordToHexValue; }; var x=Array(); var k,AA,BB,CC,DD,a,b,c,d; var S11=7, S12=12, S13=17, S14=22; var S21=5, S22=9 , S23=14, S24=20; var S31=4, S32=11, S33=16, S34=23; var S41=6, S42=10, S43=15, S44=21; str = utf8_encode(str); x = ConvertToWordArray(str); a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476; xl = x.length; for (k=0;k 1000000000 && timeStamp < 2000000000 var now = new Date().getTime() / 1000; var s = parseInt(now); return (get_as_float) ? now : (Math.round((now - s) * 1000) / 1000) + ' ' + s; } function min() { // Return the lowest value in an array or a series of arguments // // version: 810.114 // discuss at: http://phpjs.org/functions/min // + original by: Onno Marsman // + revised by: Onno Marsman // + tweaked by: Jack // % note: Long code cause we're aiming for maximum PHP compatibility // * example 1: min(1, 3, 5, 6, 7); // * returns 1: 1 // * example 2: min([2, 4, 5]); // * returns 2: 2 // * example 3: min(0, 'hello'); // * returns 3: 0 // * example 4: min('hello', 0); // * returns 4: 'hello' // * example 5: min(-1, 'hello'); // * returns 5: -1 // * example 6: min([2, 4, 8], [2, 5, 7]); // * returns 6: [2, 4, 8] var ar, retVal, i = 0, n = 0; var argv = arguments, argc = argv.length; var _obj2Array = function(obj) { if (obj instanceof Array) { return obj; } else { var ar = []; for (var i in obj) { ar.push(obj[i]); } return ar; } } //function _obj2Array var _compare = function(current, next) { var i = 0, n = 0, tmp = 0; var nl = 0, cl = 0; if (current === next) { return 0; } else if (typeof current == 'object') { if (typeof next == 'object') { current = _obj2Array(current); next = _obj2Array(next); cl = current.length; nl = next.length; if (nl > cl) { return 1; } else if (nl < cl) { return -1; } else { for (i = 0, n = cl; i0 ? 1 : -1); } } else { if (next==current) { return 0; } else { return (next>current ? 1 : -1); } } } //function _compare if (argc == 0) { throw new Error('At least one value should be passed to min()'); } else if (argc == 1) { if (typeof argv[0]=='object') { ar = _obj2Array(argv[0]); } else { throw new Error('Wrong parameter count for min()'); } if (ar.length == 0) { throw new Error('Array must contain at least one element for min()'); } } else { ar = argv; } retVal = ar[0]; for (i=1, n=ar.length; i= 0 && tt <= 69) { tt += 2000; } else if (tt >= 70 && tt <= 100) { tt += 1900; } return d.setFullYear(tt+ma); } // 7th argument (for DST) is deprecated }; for( i = 0; i < argc; i++ ){ no = parseInt(argv[i]*1); if (isNaN(no)) { return false; } else { // arg is number, let's manipulate date object if(!dateManip[i](no)){ // failed return false; } } } for (i = argc; i < 6; i++) { switch(i) { case 0: no = dn.getHours(); break; case 1: no = dn.getMinutes(); break; case 2: no = dn.getSeconds(); break; case 3: no = dn.getMonth()+1; break; case 4: no = dn.getDate(); break; case 5: no = dn.getFullYear(); break; } dateManip[i](no); } return Math.floor(d.getTime()/1000); } function mt_getrandmax() { // Returns the maximum value a random number from Mersenne Twister can have // // version: 810.1317 // discuss at: http://phpjs.org/functions/mt_getrandmax // + original by: Onno Marsman // * example 1: mt_getrandmax(); // * returns 1: 2147483647 return 2147483647; } function mt_rand( min, max ) { // Returns a random number from Mersenne Twister // // version: 810.1317 // discuss at: http://phpjs.org/functions/mt_rand // + original by: Onno Marsman // * example 1: mt_rand(1, 1); // * returns 1: 1 var argc = arguments.length; if (argc == 0) { min = 0; max = 2147483647; } else if (argc == 1) { throw new Error('Warning: mt_rand() expects exactly 2 parameters, 1 given'); } return Math.floor(Math.random() * (max - min + 1)) + min; } function natcasesort(inputArr) { // Sort an array using case-insensitive natural sort // // version: 903.3016 // discuss at: http://phpjs.org/functions/natcasesort // + original by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // - depends on: strnatcasecmp // * example 1: $array1 = {0:'IMG0.png', 1:'img12.png', 2:'img10.png', 3:'img2.png', 4:'img1.png', 5:'IMG3.png'}; // * example 1: natcasesort($array1); // * returns 1: {0: 'IMG0.png', 4: 'img1.png', 3: 'img2.png', 5: 'IMG3.png', 2: 'img10.png', 1: 'img12.png'} var valArr=[], keyArr=[], k, i, ret; var bubbleSort = function(keyArr, inputArr) { var i, j, tempValue, tempKeyVal; for (i = inputArr.length-2; i >= 0; i--) { for (j = 0; j <= i; j++) { ret = strnatcasecmp(inputArr[j+1], inputArr[j]); if (ret < 0) { tempValue = inputArr[j]; inputArr[j] = inputArr[j+1]; inputArr[j+1] = tempValue; tempKeyVal = keyArr[j]; keyArr[j] = keyArr[j+1]; keyArr[j+1] = tempKeyVal; } } } }; // Get key and value arrays for (k in inputArr) { valArr.push(inputArr[k]); keyArr.push(k); delete inputArr[k] ; } try { // Sort our new temporary arrays bubbleSort(keyArr, valArr); } catch(e) { return false; } // Repopulate the old array for (i = 0; i < valArr.length; i++) { inputArr[keyArr[i]] = valArr[i]; } return true; } function natsort(inputArr) { // Sort an array using natural sort // // version: 903.3016 // discuss at: http://phpjs.org/functions/natsort // + original by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // - depends on: strnatcmp // * example 1: $array1 = {a:"img12.png", b:"img10.png", c:"img2.png", d:"img1.png"}; // * example 1: natcasesort($array1); // * returns 1: {d: 'img1.png', c: 'img2.png', b: 'img10.png', a: 'img12.png'} var valArr=[], keyArr=[], k, i, ret; var bubbleSort = function(keyArr, inputArr) { var i, j, tempValue, tempKeyVal; for (i = inputArr.length-2; i >= 0; i--) { for (j = 0; j <= i; j++) { ret = strnatcmp(inputArr[j+1], inputArr[j]); if (ret < 0) { tempValue = inputArr[j]; inputArr[j] = inputArr[j+1]; inputArr[j+1] = tempValue; tempKeyVal = keyArr[j]; keyArr[j] = keyArr[j+1]; keyArr[j+1] = tempKeyVal; } } } }; // Get key and value arrays for (k in inputArr) { valArr.push(inputArr[k]); keyArr.push(k); delete inputArr[k] ; } try { // Sort our new temporary arrays bubbleSort(keyArr, valArr); } catch(e) { return false; } // Repopulate the old array for (i = 0; i < valArr.length; i++) { inputArr[keyArr[i]] = valArr[i]; } return true; } function nl2br (str, is_xhtml) { // Converts newlines to HTML line breaks // // version: 903.3016 // discuss at: http://phpjs.org/functions/nl2br // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Philip Peterson // + improved by: Onno Marsman // + improved by: Atli Þór // + bugfixed by: Onno Marsman // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: nl2br('Kevin\nvan\nZonneveld'); // * returns 1: 'Kevin
\nvan
\nZonneveld' // * example 2: nl2br("\nOne\nTwo\n\nThree\n", false); // * returns 2: '
\nOne
\nTwo
\n
\nThree
\n' // * example 3: nl2br("\nOne\nTwo\n\nThree\n", true); // * returns 3: '
\nOne
\nTwo
\n
\nThree
\n' var breakTag = ''; breakTag = '
'; if (typeof is_xhtml != 'undefined' && !is_xhtml) { breakTag = '
'; } return (str + '').replace(/([^>]?)\n/g, '$1'+ breakTag +'\n'); } function number_format( number, decimals, dec_point, thousands_sep ) { // Formats a number with grouped thousands // // version: 902.1517 // discuss at: http://phpjs.org/functions/number_format // + original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfix by: Michael White (http://getsprink.com) // + bugfix by: Benjamin Lupton // + bugfix by: Allan Jensen (http://www.winternet.no) // + revised by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // + bugfix by: Howard Yeend // + revised by: Luke Smith (http://lucassmith.name) // + bugfix by: Diogo Resende // + bugfix by: Rival // % note 1: For 1000.55 result with precision 1 in FF/Opera is 1,000.5, but in IE is 1,000.6 // * example 1: number_format(1234.56); // * returns 1: '1,235' // * example 2: number_format(1234.56, 2, ',', ' '); // * returns 2: '1 234,56' // * example 3: number_format(1234.5678, 2, '.', ''); // * returns 3: '1234.57' // * example 4: number_format(67, 2, ',', '.'); // * returns 4: '67,00' // * example 5: number_format(1000); // * returns 5: '1,000' // * example 6: number_format(67.311, 2); // * returns 6: '67.31' var n = number, prec = decimals; n = !isFinite(+n) ? 0 : +n; prec = !isFinite(+prec) ? 0 : Math.abs(prec); var sep = (typeof thousands_sep == "undefined") ? ',' : thousands_sep; var dec = (typeof dec_point == "undefined") ? '.' : dec_point; var s = (prec > 0) ? n.toFixed(prec) : Math.round(n).toFixed(prec); //fix for IE parseFloat(0.55).toFixed(0) = 0; var abs = Math.abs(n).toFixed(prec); var _, i; if (abs >= 1000) { _ = abs.split(/\D/); i = _[0].length % 3 || 3; _[0] = s.slice(0,i + (n < 0)) + _[0].slice(i).replace(/(\d{3})/g, sep+'$1'); s = _.join(dec); } else { s = s.replace('.', dec); } return s; } function octdec (oct_string) { // Returns the decimal equivalent of an octal string // // version: 810.1317 // discuss at: http://phpjs.org/functions/octdec // + original by: Philippe Baumann // * example 1: octdec('77'); // * returns 1: 63 oct_string = (oct_string+'').replace(/[^0-7]/gi, ''); return parseInt(oct_string, 8); } function ord( string ) { // Returns the codepoint value of a character // // version: 810.1317 // discuss at: http://phpjs.org/functions/ord // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // * example 1: ord('K'); // * returns 1: 75 return (string+'').charCodeAt(0); } function parse_str(str, array){ // Parses GET/POST/COOKIE data and sets global variables // // version: 903.421 // discuss at: http://phpjs.org/functions/parse_str // + original by: Cagri Ekin // + improved by: Michael White (http://getsprink.com) // + tweaked by: Jack // + bugfixed by: Onno Marsman // % note 1: Currently does not put variables in local scope. // % note 1: So use of second argument is required. // * example 1: var arr = {}; // * example 1: parse_str('first=foo&second=bar', arr); // * results 1: arr == { first: 'foo', second: 'bar' } // * example 2: var arr = {}; // * example 2: parse_str('str_a=Jack+and+Jill+didn%27t+see+the+well.', arr); // * results 2: arr == { str_a: "Jack and Jill didn't see the well." } var glue1 = '='; var glue2 = '&'; var array2 = (str+'').split(glue2); var array2l = 0, tmp = '', x = 0; array2l = array2.length; for (x = 0; x|:"); // * returns 3: '\\\.\+\*\?\[\^\]\$\(\)\{\}\=\!\<\>\|\:' return (str+'').replace(/([\\\.\+\*\?\[\^\]\$\(\)\{\}\=\!\<\>\|\:])/g, "\\$1"); } function print_r( array, return_val ) { // Prints out or returns information about the specified variable // // version: 904.610 // discuss at: http://phpjs.org/functions/print_r // + original by: Michael White (http://getsprink.com) // + improved by: Ben Bryan // + input by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: echo // * example 1: print_r(1, true); // * returns 1: 1 var output = "", pad_char = " ", pad_val = 4; var formatArray = function (obj, cur_depth, pad_val, pad_char) { if (cur_depth > 0) { cur_depth++; } var base_pad = repeat_char(pad_val*cur_depth, pad_char); var thick_pad = repeat_char(pad_val*(cur_depth+1), pad_char); var str = ""; if (typeof obj === 'object' && obj !== null && obj.constructor && obj.constructor.name !== 'PHPJS_Resource') { str += "Array\n" + base_pad + "(\n"; for (var key in obj) { if (obj[key] instanceof Array) { str += thick_pad + "["+key+"] => "+formatArray(obj[key], cur_depth+1, pad_val, pad_char); } else { str += thick_pad + "["+key+"] => " + obj[key] + "\n"; } } str += base_pad + ")\n"; } else if(obj == null || obj == undefined) { str = ''; } else { // for our "resource" class str = obj.toString(); } return str; }; var repeat_char = function (len, pad_char) { var str = ""; for(var i=0; i < len; i++) { str += pad_char; } return str; }; output = formatArray(array, 0, pad_val, pad_char); if (return_val !== true) { if (document.body) { echo(output); } else { try { XULDocument; // We're in XUL, so appending as plain text won't work echo('
'+output+'
'); } catch(e) { echo(output); // Outputting as plain text may work in some plain XML } } return true; } else { return output; } } function property_exists (cls, prop) { // Checks if the object or class has a property // // version: 903.3016 // discuss at: http://phpjs.org/functions/property_exists // + original by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: function class_a() {this.prop1 = 'one'}; // * example 1: var instance_a = new class_a(); // * example 1: property_exists(instance_a, 'prop1'); // * returns 1: true // * example 2: function class_a() {this.prop1 = 'one'}; // * example 2: var instance_a = new class_a(); // * example 2: property_exists(instance_a, 'prop2'); // * returns 2: false cls = (typeof cls === 'string') ? window[cls] : cls; if (typeof cls === 'function' && cls.toSource && cls.toSource().match(new RegExp('this\\.'+prop+'\\s')) ) { // Hackish and non-standard but can probably detect if setting // the property (we don't want to test by instantiating as that // may have side-effects) return true; } return (cls[prop] !== undefined && typeof cls[prop] !== 'function') || (cls.prototype !== undefined && cls.prototype[prop] !== undefined && typeof cls.prototype[prop] !== 'function') || (cls.constructor && cls.constructor[prop] !== undefined && typeof cls.constructor[prop] !== 'function'); } function quotemeta(str) { // Quotes meta characters // // version: 812.316 // discuss at: http://phpjs.org/functions/quotemeta // + original by: Paulo Ricardo F. Santos // * example 1: quotemeta(". + * ? ^ ( $ )"); // * returns 1: '\. \+ \* \? \^ \( \$ \)' return (str+'').replace(/([\.\\\+\*\?\[\^\]\$\(\)])/g, '\\$1'); } function rad2deg(angle) { // Converts the radian number to the equivalent number in degrees // // version: 810.117 // discuss at: http://phpjs.org/functions/rad2deg // + original by: Enrique Gonzalez // * example 1: rad2deg(3.141592653589793); // * returns 1: 180 return (angle/Math.PI) * 180; } function rand( min, max ) { // Returns a random number // // version: 810.1317 // discuss at: http://phpjs.org/functions/rand // + original by: Leslie Hoare // + bugfixed by: Onno Marsman // * example 1: rand(1, 1); // * returns 1: 1 var argc = arguments.length; if (argc == 0) { min = 0; max = 2147483647; } else if (argc == 1) { throw new Error('Warning: rand() expects exactly 2 parameters, 1 given'); } return Math.floor(Math.random() * (max - min + 1)) + min; } function range ( low, high, step ) { // Create an array containing the range of integers or characters from low to high (inclusive) // // version: 812.316 // discuss at: http://phpjs.org/functions/range // + original by: Waldo Malqui Silva // * example 1: range ( 0, 12 ); // * returns 1: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12] // * example 2: range( 0, 100, 10 ); // * returns 2: [0, 10, 20, 30, 40, 50, 60, 70, 80, 90, 100] // * example 3: range( 'a', 'i' ); // * returns 3: ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i'] // * example 4: range( 'c', 'a' ); // * returns 4: ['c', 'b', 'a'] var matrix = []; var inival, endval, plus; var walker = step || 1; var chars = false; if ( !isNaN ( low ) && !isNaN ( high ) ) { inival = low; endval = high; } else if ( isNaN ( low ) && isNaN ( high ) ) { chars = true; inival = low.charCodeAt ( 0 ); endval = high.charCodeAt ( 0 ); } else { inival = ( isNaN ( low ) ? 0 : low ); endval = ( isNaN ( high ) ? 0 : high ); } plus = ( ( inival > endval ) ? false : true ); if ( plus ) { while ( inival <= endval ) { matrix.push ( ( ( chars ) ? String.fromCharCode ( inival ) : inival ) ); inival += walker; } } else { while ( inival >= endval ) { matrix.push ( ( ( chars ) ? String.fromCharCode ( inival ) : inival ) ); inival -= walker; } } return matrix; } function rawurldecode( str ) { // Decodes URL-encodes string // // version: 904.317 // discuss at: http://phpjs.org/functions/rawurldecode // + original by: Brett Zamir (http://brettz9.blogspot.com) // + input by: travc // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: rawurldecode('Kevin+van+Zonneveld%21'); // * returns 1: 'Kevin+van+Zonneveld!' // * example 2: rawurldecode('http%3A%2F%2Fkevin.vanzonneveld.net%2F'); // * returns 2: 'http://kevin.vanzonneveld.net/' // * example 3: rawurldecode('http%3A%2F%2Fwww.google.nl%2Fsearch%3Fq%3Dphp.js%26ie%3Dutf-8%26oe%3Dutf-8%26aq%3Dt%26rls%3Dcom.ubuntu%3Aen-US%3Aunofficial%26client%3Dfirefox-a'); // * returns 3: 'http://www.google.nl/search?q=php.js&ie=utf-8&oe=utf-8&aq=t&rls=com.ubuntu:en-US:unofficial&client=firefox-a' // * example 4: rawurldecode('-22%97bc%2Fbc'); // * returns 4: '-22—bc/bc' var histogram = {}; var ret = str.toString(); var replacer = function(search, replace, str) { var tmp_arr = []; tmp_arr = str.split(search); return tmp_arr.join(replace); }; // The histogram is identical to the one in urlencode. histogram["'"] = '%27'; histogram['('] = '%28'; histogram[')'] = '%29'; histogram['*'] = '%2A'; histogram['~'] = '%7E'; histogram['!'] = '%21'; s for (replace in histogram) { search = histogram[replace]; // Switch order when decoding ret = replacer(search, replace, ret) // Custom replace. No regexing } // End with decodeURIComponent, which most resembles PHP's encoding functions ret = ret.replace(/%([a-fA-F][0-9a-fA-F])/g, function (all, hex) {return String.fromCharCode('0x'+hex);}); // These Latin-B have the same values in Unicode, so we can convert them like this ret = decodeURIComponent(ret); return ret; } function rawurlencode( str ) { // URL-encodes string // // version: 904.317 // discuss at: http://phpjs.org/functions/rawurlencode // + original by: Brett Zamir (http://brettz9.blogspot.com) // + input by: travc // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: rawurlencode('Kevin van Zonneveld!'); // * returns 1: 'Kevin van Zonneveld%21' // * example 2: rawurlencode('http://kevin.vanzonneveld.net/'); // * returns 2: 'http%3A%2F%2Fkevin.vanzonneveld.net%2F' // * example 3: rawurlencode('http://www.google.nl/search?q=php.js&ie=utf-8&oe=utf-8&aq=t&rls=com.ubuntu:en-US:unofficial&client=firefox-a'); // * returns 3: 'http%3A%2F%2Fwww.google.nl%2Fsearch%3Fq%3Dphp.js%26ie%3Dutf-8%26oe%3Dutf-8%26aq%3Dt%26rls%3Dcom.ubuntu%3Aen-US%3Aunofficial%26client%3Dfirefox-a' var histogram = {}, tmp_arr = []; var ret = str.toString(); var replacer = function(search, replace, str) { var tmp_arr = []; tmp_arr = str.split(search); return tmp_arr.join(replace); }; // The histogram is identical to the one in urldecode. histogram["'"] = '%27'; histogram['('] = '%28'; histogram[')'] = '%29'; histogram['*'] = '%2A'; histogram['~'] = '%7E'; histogram['!'] = '%21'; histogram['\u20AC'] = '%80'; histogram['\u0081'] = '%81'; histogram['\u201A'] = '%82'; histogram['\u0192'] = '%83'; histogram['\u201E'] = '%84'; histogram['\u2026'] = '%85'; histogram['\u2020'] = '%86'; histogram['\u2021'] = '%87'; histogram['\u02C6'] = '%88'; histogram['\u2030'] = '%89'; histogram['\u0160'] = '%8A'; histogram['\u2039'] = '%8B'; histogram['\u0152'] = '%8C'; histogram['\u008D'] = '%8D'; histogram['\u017D'] = '%8E'; histogram['\u008F'] = '%8F'; histogram['\u0090'] = '%90'; histogram['\u2018'] = '%91'; histogram['\u2019'] = '%92'; histogram['\u201C'] = '%93'; histogram['\u201D'] = '%94'; histogram['\u2022'] = '%95'; histogram['\u2013'] = '%96'; histogram['\u2014'] = '%97'; histogram['\u02DC'] = '%98'; histogram['\u2122'] = '%99'; histogram['\u0161'] = '%9A'; histogram['\u203A'] = '%9B'; histogram['\u0153'] = '%9C'; histogram['\u009D'] = '%9D'; histogram['\u017E'] = '%9E'; histogram['\u0178'] = '%9F'; // Begin with encodeURIComponent, which most resembles PHP's encoding functions ret = encodeURIComponent(ret); // Restore spaces, converted by encodeURIComponent which is not rawurlencode compatible ret = replacer('%20', ' ', ret); // Custom replace. No regexing for (search in histogram) { replace = histogram[search]; ret = replacer(search, replace, ret) // Custom replace. No regexing } // Uppercase for full PHP compatibility return ret.replace(/(\%([a-z0-9]{2}))/g, function(full, m1, m2) { return "%"+m2.toUpperCase(); }); return ret; } function reset ( arr ) { // Set array argument's internal pointer to the first element and return it // // version: 903.3016 // discuss at: http://phpjs.org/functions/reset // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Legaev Andrey // + revised by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: Uses global: php_js to store the array pointer // * example 1: reset({0: 'Kevin', 1: 'van', 2: 'Zonneveld'}); // * returns 1: 'Kevin' if (!this.php_js) this.php_js = {}; if (!this.php_js.pointers) this.php_js.pointers = []; var pointers = this.php_js.pointers; if (pointers.indexOf(arr) === -1) { pointers.push(arr, 0); } var arrpos = pointers.indexOf(arr); if (!(arr instanceof Array)) { for (var k in arr) { if (pointers.indexOf(arr) === -1) { pointers.push(arr, 0); } else { pointers[arrpos+1] = 0; } return arr[k]; } return false; // Empty } if (arr.length === 0) { return false; } pointers[arrpos+1] = 0; return arr[pointers[arrpos+1]]; } function round ( val, precision ) { // Returns the number rounded to specified precision // // version: 810.114 // discuss at: http://phpjs.org/functions/round // + original by: Philip Peterson // + revised by: Onno Marsman // * example 1: round(1241757, -3); // * returns 1: 1242000 // * example 2: round(3.6); // * returns 2: 4 return parseFloat(parseFloat(val).toFixed(precision)); } function rsort (inputArr, sort_flags) { // Sort an array in reverse order // // version: 903.3016 // discuss at: http://phpjs.org/functions/rsort // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + revised by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: SORT_STRING (as well as natsort and natcasesort) might also be // % note 1: integrated into all of these functions by adapting the code at // % note 1: http://sourcefrog.net/projects/natsort/natcompare.js // * example 1: rsort(['Kevin', 'van', 'Zonneveld']); // * returns 1: true // * example 2: fruits = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'}; // * example 2: rsort(fruits); // * returns 2: true // * results 2: fruits == {0: 'orange', 1: 'lemon', 2: 'banana', 3: 'apple'} var valArr = [], keyArr=[]; var k = '', i = 0, sorter = false; for (k in inputArr) { // Get key and value arrays valArr.push(inputArr[k]); delete inputArr[k] ; } switch (sort_flags) { case 'SORT_STRING': // compare items as strings sorter = function (a, b) { return strnatcmp(b, a); }; break; case 'SORT_LOCALE_STRING': // compare items as strings, based on the current locale (set with i18n_loc_set_default() as of PHP6) sorter = function (a, b) { return(b.localeCompare(a)); }; break; case 'SORT_NUMERIC': // compare items numerically sorter = function (a, b) { return(b - a); }; break; case 'SORT_REGULAR': // compare items normally (don't change types) default: sorter = function (a, b) { if (a < b) return 1; if (a > b) return -1; return 0; }; break; } valArr.sort(sorter); for (i = 0; i < valArr.length; i++) { // Repopulate the old array inputArr[i] = valArr[i]; } return true; } function rtrim ( str, charlist ) { // Removes trailing whitespace // // version: 810.1317 // discuss at: http://phpjs.org/functions/rtrim // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Erkekjetter // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // * example 1: rtrim(' Kevin van Zonneveld '); // * returns 1: ' Kevin van Zonneveld' charlist = !charlist ? ' \s\xA0' : (charlist+'').replace(/([\[\]\(\)\.\?\/\*\{\}\+\$\^\:])/g, '\$1'); var re = new RegExp('[' + charlist + ']+$', 'g'); return (str+'').replace(re, ''); } function serialize( mixed_value ) { // Returns a string representation of variable (which can later be unserialized) // // version: 812.3015 // discuss at: http://phpjs.org/functions/serialize // + original by: Arpad Ray (mailto:arpad@php.net) // + improved by: Dino // + bugfixed by: Andrej Pavlovic // + bugfixed by: Garagoth // % note: We feel the main purpose of this function should be to ease the transport of data between php & js // % note: Aiming for PHP-compatibility, we have to translate objects to arrays // * example 1: serialize(['Kevin', 'van', 'Zonneveld']); // * returns 1: 'a:3:{i:0;s:5:"Kevin";i:1;s:3:"van";i:2;s:9:"Zonneveld";}' // * example 2: serialize({firstName: 'Kevin', midName: 'van', surName: 'Zonneveld'}); // * returns 2: 'a:3:{s:9:"firstName";s:5:"Kevin";s:7:"midName";s:3:"van";s:7:"surName";s:9:"Zonneveld";}' var _getType = function( inp ) { var type = typeof inp, match; var key; if (type == 'object' && !inp) { return 'null'; } if (type == "object") { if (!inp.constructor) { return 'object'; } var cons = inp.constructor.toString(); if (match = cons.match(/(\w+)\(/)) { cons = match[1].toLowerCase(); } var types = ["boolean", "number", "string", "array"]; for (key in types) { if (cons == types[key]) { type = types[key]; break; } } } return type; }; var type = _getType(mixed_value); var val, ktype = ''; switch (type) { case "function": val = ""; break; case "undefined": val = "N"; break; case "boolean": val = "b:" + (mixed_value ? "1" : "0"); break; case "number": val = (Math.round(mixed_value) == mixed_value ? "i" : "d") + ":" + mixed_value; break; case "string": val = "s:" + mixed_value.length + ":\"" + mixed_value + "\""; break; case "array": case "object": val = "a"; /* if (type == "object") { var objname = mixed_value.constructor.toString().match(/(\w+)\(\)/); if (objname == undefined) { return; } objname[1] = serialize(objname[1]); val = "O" + objname[1].substring(1, objname[1].length - 1); } */ var count = 0; var vals = ""; var okey; var key; for (key in mixed_value) { ktype = _getType(mixed_value[key]); if (ktype == "function") { continue; } okey = (key.match(/^[0-9]+$/) ? parseInt(key) : key); vals += serialize(okey) + serialize(mixed_value[key]); count++; } val += ":" + count + ":{" + vals + "}"; break; } if (type != "object" && type != "array") val += ";"; return val; } function setcookie(name, value, expires, path, domain, secure) { // Send a cookie // // version: 901.810 // discuss at: http://phpjs.org/functions/setcookie // + original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // + bugfixed by: Andreas // + bugfixed by: Onno Marsman // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: setrawcookie // * example 1: setcookie('author_name', 'Kevin van Zonneveld'); // * returns 1: true return setrawcookie(name, encodeURIComponent(value), expires, path, domain, secure) } function setrawcookie(name, value, expires, path, domain, secure) { // Send a cookie with no url encoding of the value // // version: 903.3016 // discuss at: http://phpjs.org/functions/setrawcookie // + original by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: setcookie('author_name', 'Kevin van Zonneveld'); // * returns 1: true if (expires instanceof Date) { expires = expires.toGMTString(); } else if(typeof(expires) == 'number') { expires = (new Date(+(new Date) + expires * 1e3)).toGMTString(); } var r = [name + "=" + value], s, i; for(i in s = {expires: expires, path: path, domain: domain}){ s[i] && r.push(i + "=" + s[i]); } return secure && r.push("secure"), document.cookie = r.join(";"), true; } function settype (vr, type) { // http://kevin.vanzonneveld.net // + original by: Waldo Malqui Silva // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + revised by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: Credits to Crockford also // % note 2: only works on global variables, and "vr" must be passed in as a string // * example 1: foo = '5bar'; // * example 1: settype(foo, 'integer'); // * results 1: foo == 5 // * returns 1: true // * example 2: foo = true; // * example 2: settype(foo, 'string'); // * results 2: foo == '1' // * returns 2: true var is_array = function (arr) { return typeof arr === 'object' && typeof arr.length === 'number' && !(arr.propertyIsEnumerable('length')) && typeof arr.splice === 'function'; }; var v, mtch, i, obj; v = this[vr] ? this[vr] : vr; try { switch(type) { case 'boolean': if (is_array(v) && v.length === 0) {this[vr]=false;} else if (v === '0') {this[vr]=false;} else if (typeof v === 'object' && !is_array(v)) { var lgth = false; for (i in v) { lgth = true; } this[vr]=lgth; } else {this[vr] = !!v;} break; case 'integer': if (typeof v === 'number') {this[vr]=parseInt(v, 10);} else if (typeof v === 'string') { mtch = v.match(/^([+-]?)(\d+)/); if (!mtch) {this[vr]=0;} else {this[vr]=parseInt(v, 10);} } else if (v === true) {this[vr]=1;} else if (v === false || v === null) {this[vr]=0;} else if (is_array(v) && v.length === 0) {this[vr]=0;} else if (typeof v === 'object') {this[vr]=1;} break; case 'float': if (typeof v === 'string') { mtch = v.match(/^([+-]?)(\d+(\.\d+)?|\.\d+)([eE][+-]?\d+)?/); if (!mtch) {this[vr]=0;} else {this[vr]=parseFloat(v, 10);} } else if (v === true) {this[vr]=1;} else if (v === false || v === null) {this[vr]=0;} else if (is_array(v) && v.length === 0) {this[vr]=0;} else if (typeof v === 'object') {this[vr]=1;} break; case 'string': if (v === null || v === false) {this[vr]='';} else if (is_array(v)) {this[vr]='Array';} else if (typeof v === 'object') {this[vr]='Object';} else if (v === true) {this[vr]='1';} else {this[vr] += '';} // numbers (and functions?) break; case 'array': if (v === null) {this[vr] = [];} else if (typeof v !== 'object') {this[vr] = [v];} break; case 'object': if (v === null) {this[vr]={};} else if (is_array(v)) { for (i = 0, obj={}; i < v.length; i++) { obj[i] = v; } this[vr] = obj; } else if (typeof v !== 'object') {this[vr]={scalar:v};} break; case 'null': delete this[vr]; break; } return true; } catch (e) { return false; } } function sha1 ( str ) { // Calculate the sha1 hash of a string // // version: 903.3016 // discuss at: http://phpjs.org/functions/sha1 // + original by: Webtoolkit.info (http://www.webtoolkit.info/) // + namespaced by: Michael White (http://getsprink.com) // + input by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: utf8_encode // * example 1: sha1('Kevin van Zonneveld'); // * returns 1: '54916d2e62f65b3afa6e192e6a601cdbe5cb5897' var rotate_left = function(n,s) { var t4 = ( n<>>(32-s)); return t4; }; var lsb_hex = function(val) { var str=""; var i; var vh; var vl; for( i=0; i<=6; i+=2 ) { vh = (val>>>(i*4+4))&0x0f; vl = (val>>>(i*4))&0x0f; str += vh.toString(16) + vl.toString(16); } return str; }; var cvt_hex = function(val) { var str=""; var i; var v; for( i=7; i>=0; i-- ) { v = (val>>>(i*4))&0x0f; str += v.toString(16); } return str; }; var blockstart; var i, j; var W = new Array(80); var H0 = 0x67452301; var H1 = 0xEFCDAB89; var H2 = 0x98BADCFE; var H3 = 0x10325476; var H4 = 0xC3D2E1F0; var A, B, C, D, E; var temp; str = utf8_encode(str); var str_len = str.length; var word_array = []; for( i=0; i>>29 ); word_array.push( (str_len<<3)&0x0ffffffff ); for ( blockstart=0; blockstart b) return 1; if (a < b) return -1; return 0; }; break; } valArr.sort(sorter); for (i = 0; i < valArr.length; i++) { // Repopulate the old array inputArr[i] = valArr[i]; } return true; } function soundex(str) { // Calculate the soundex key of a string // // version: 903.3016 // discuss at: http://phpjs.org/functions/soundex // + original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // + tweaked by: Jack // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: soundex('Kevin'); // * returns 1: 'K150' // * example 2: soundex('Ellery'); // * returns 2: 'E460' // * example 3: soundex('Euler'); // * returns 3: 'E460' var s = ''; var i, j, l, p = isNaN(p) ? 4 : p > 10 ? 10 : p < 4 ? 4 : p; var m = { BFPV: 1, CGJKQSXZ: 2, DT: 3, L: 4, MN: 5, R: 6 }; var r = (s = (str+'').toUpperCase().replace(/[^A-Z]/g, "").split("")).splice(0, 1); var sl = 0; sl = s.length; for (i = -1, l = sl; ++i < l;) { for (j in m) { if (j.indexOf(s[i]) + 1 && r[r.length-1] != m[j] && r.push(m[j])) { break; } } } return r.length > p && (r.length = p), r.join("") + (new Array(p - r.length + 1)).join("0"); } function split( delimiter, string ) { // Split string into array by regular expression // // version: 810.114 // discuss at: http://phpjs.org/functions/split // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // - depends on: explode // * example 1: split(' ', 'Kevin van Zonneveld'); // * returns 1: {0: 'Kevin', 1: 'van', 2: 'Zonneveld'} return explode( delimiter, string ); } function sprintf( ) { // Return a formatted string // // version: 903.3016 // discuss at: http://phpjs.org/functions/sprintf // + original by: Ash Searle (http://hexmen.com/blog/) // + namespaced by: Michael White (http://getsprink.com) // + tweaked by: Jack // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Paulo Ricardo F. Santos // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: sprintf("%01.2f", 123.1); // * returns 1: 123.10 // * example 2: sprintf("[%10s]", 'monkey'); // * returns 2: '[ monkey]' // * example 3: sprintf("[%'#10s]", 'monkey'); // * returns 3: '[####monkey]' var regex = /%%|%(\d+\$)?([-+\'#0 ]*)(\*\d+\$|\*|\d+)?(\.(\*\d+\$|\*|\d+))?([scboxXuidfegEG])/g; var a = arguments, i = 0, format = a[i++]; // pad() var pad = function(str, len, chr, leftJustify) { if (!chr) chr = ' '; var padding = (str.length >= len) ? '' : Array(1 + len - str.length >>> 0).join(chr); return leftJustify ? str + padding : padding + str; }; // justify() var justify = function(value, prefix, leftJustify, minWidth, zeroPad, customPadChar) { var diff = minWidth - value.length; if (diff > 0) { if (leftJustify || !zeroPad) { value = pad(value, minWidth, customPadChar, leftJustify); } else { value = value.slice(0, prefix.length) + pad('', diff, '0', true) + value.slice(prefix.length); } } return value; }; // formatBaseX() var formatBaseX = function(value, base, prefix, leftJustify, minWidth, precision, zeroPad) { // Note: casts negative numbers to positive ones var number = value >>> 0; prefix = prefix && number && {'2': '0b', '8': '0', '16': '0x'}[base] || ''; value = prefix + pad(number.toString(base), precision || 0, '0', false); return justify(value, prefix, leftJustify, minWidth, zeroPad); }; // formatString() var formatString = function(value, leftJustify, minWidth, precision, zeroPad, customPadChar) { if (precision != null) { value = value.slice(0, precision); } return justify(value, '', leftJustify, minWidth, zeroPad, customPadChar); }; // doFormat() var doFormat = function(substring, valueIndex, flags, minWidth, _, precision, type) { var number; var prefix; var method; var textTransform; var value; if (substring == '%%') return '%'; // parse flags var leftJustify = false, positivePrefix = '', zeroPad = false, prefixBaseX = false, customPadChar = ' '; var flagsl = flags.length; for (var j = 0; flags && j < flagsl; j++) switch (flags.charAt(j)) { case ' ': positivePrefix = ' '; break; case '+': positivePrefix = '+'; break; case '-': leftJustify = true; break; case "'": customPadChar = flags.charAt(j+1); break; case '0': zeroPad = true; break; case '#': prefixBaseX = true; break; } // parameters may be null, undefined, empty-string or real valued // we want to ignore null, undefined and empty-string values if (!minWidth) { minWidth = 0; } else if (minWidth == '*') { minWidth = +a[i++]; } else if (minWidth.charAt(0) == '*') { minWidth = +a[minWidth.slice(1, -1)]; } else { minWidth = +minWidth; } // Note: undocumented perl feature: if (minWidth < 0) { minWidth = -minWidth; leftJustify = true; } if (!isFinite(minWidth)) { throw new Error('sprintf: (minimum-)width must be finite'); } if (!precision) { precision = 'fFeE'.indexOf(type) > -1 ? 6 : (type == 'd') ? 0 : void(0); } else if (precision == '*') { precision = +a[i++]; } else if (precision.charAt(0) == '*') { precision = +a[precision.slice(1, -1)]; } else { precision = +precision; } // grab value using valueIndex if required? value = valueIndex ? a[valueIndex.slice(0, -1)] : a[i++]; switch (type) { case 's': return formatString(String(value), leftJustify, minWidth, precision, zeroPad, customPadChar); case 'c': return formatString(String.fromCharCode(+value), leftJustify, minWidth, precision, zeroPad); case 'b': return formatBaseX(value, 2, prefixBaseX, leftJustify, minWidth, precision, zeroPad); case 'o': return formatBaseX(value, 8, prefixBaseX, leftJustify, minWidth, precision, zeroPad); case 'x': return formatBaseX(value, 16, prefixBaseX, leftJustify, minWidth, precision, zeroPad); case 'X': return formatBaseX(value, 16, prefixBaseX, leftJustify, minWidth, precision, zeroPad).toUpperCase(); case 'u': return formatBaseX(value, 10, prefixBaseX, leftJustify, minWidth, precision, zeroPad); case 'i': case 'd': { number = parseInt(+value); prefix = number < 0 ? '-' : positivePrefix; value = prefix + pad(String(Math.abs(number)), precision, '0', false); return justify(value, prefix, leftJustify, minWidth, zeroPad); } case 'e': case 'E': case 'f': case 'F': case 'g': case 'G': { number = +value; prefix = number < 0 ? '-' : positivePrefix; method = ['toExponential', 'toFixed', 'toPrecision']['efg'.indexOf(type.toLowerCase())]; textTransform = ['toString', 'toUpperCase']['eEfFgG'.indexOf(type) % 2]; value = prefix + Math.abs(number)[method](precision); return justify(value, prefix, leftJustify, minWidth, zeroPad)[textTransform](); } default: return substring; } }; return format.replace(regex, doFormat); } function sqrt(arg) { // Returns the square root of the number // // version: 810.114 // discuss at: http://phpjs.org/functions/sqrt // + original by: Onno Marsman // * example 1: sqrt(8723321.4); // * returns 1: 2953.5269424875746 return Math.sqrt(arg); } function str_ireplace ( search, replace, subject ) { // Replaces all occurrences of search in haystack with replace / case-insensitive // // version: 903.3016 // discuss at: http://phpjs.org/functions/str_ireplace // + original by: Martijn Wieringa // + input by: penutbutterjelly // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + tweaked by: Jack // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: str_ireplace('l', 'l', 'HeLLo'); // * returns 1: 'Hello' var i, k = ''; var searchl = 0; var reg; search += ''; searchl = search.length; if (!(replace instanceof Array)) { replace = new Array(replace); if (search instanceof Array) { // If search is an array and replace is a string, // then this replacement string is used for every value of search while (searchl > replace.length) { replace[replace.length] = replace[0]; } } } if (!(search instanceof Array)) { search = new Array(search); } while (search.length>replace.length) { // If replace has fewer values than search, // then an empty string is used for the rest of replacement values replace[replace.length] = ''; } if (subject instanceof Array) { // If subject is an array, then the search and replace is performed // with every entry of subject , and the return value is an array as well. for (k in subject) { subject[k] = str_ireplace(search, replace, subject[k]); } return subject; } searchl = search.length; for (i = 0; i < searchl; i++) { reg = new RegExp(search[i], 'gi'); subject = subject.replace(reg, replace[i]); } return subject; } function str_pad( input, pad_length, pad_string, pad_type ) { // Returns input string padded on the left or right to specified length with pad_string // // version: 810.1317 // discuss at: http://phpjs.org/functions/str_pad // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + namespaced by: Michael White (http://getsprink.com) // * example 1: str_pad('Kevin van Zonneveld', 30, '-=', 'STR_PAD_LEFT'); // * returns 1: '-=-=-=-=-=-Kevin van Zonneveld' // * example 2: str_pad('Kevin van Zonneveld', 30, '-', 'STR_PAD_BOTH'); // * returns 2: '------Kevin van Zonneveld-----' var half = '', pad_to_go; var str_pad_repeater = function(s, len) { var collect = '', i; while(collect.length < len) collect += s; collect = collect.substr(0,len); return collect; }; input += ''; if (pad_type != 'STR_PAD_LEFT' && pad_type != 'STR_PAD_RIGHT' && pad_type != 'STR_PAD_BOTH') { pad_type = 'STR_PAD_RIGHT'; } if ((pad_to_go = pad_length - input.length) > 0) { if (pad_type == 'STR_PAD_LEFT') { input = str_pad_repeater(pad_string, pad_to_go) + input; } else if (pad_type == 'STR_PAD_RIGHT') { input = input + str_pad_repeater(pad_string, pad_to_go); } else if (pad_type == 'STR_PAD_BOTH') { half = str_pad_repeater(pad_string, Math.ceil(pad_to_go/2)); input = half + input + half; input = input.substr(0, pad_length); } } return input; } function str_repeat ( input, multiplier ) { // Returns the input string repeat mult times // // version: 810.114 // discuss at: http://phpjs.org/functions/str_repeat // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // * example 1: str_repeat('-=', 10); // * returns 1: '-=-=-=-=-=-=-=-=-=-=' return new Array(multiplier+1).join(input); } function str_replace(search, replace, subject) { // Replaces all occurrences of search in haystack with replace // // version: 903.3016 // discuss at: http://phpjs.org/functions/str_replace // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Gabriel Paderni // + improved by: Philip Peterson // + improved by: Simon Willison (http://simonwillison.net) // + revised by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // + bugfixed by: Anton Ongson // + input by: Onno Marsman // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + tweaked by: Onno Marsman // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: str_replace(' ', '.', 'Kevin van Zonneveld'); // * returns 1: 'Kevin.van.Zonneveld' // * example 2: str_replace(['{name}', 'l'], ['hello', 'm'], '{name}, lars'); // * returns 2: 'hemmo, mars' var s = subject; var ra = r instanceof Array, sa = s instanceof Array; var f = [].concat(search); var r = [].concat(replace); var i = (s = [].concat(s)).length; var j = 0; while (j = 0, i--) { if (s[i]) { while (s[i] = (s[i]+'').split(f[j]).join(ra ? r[j] || "" : r[0]), ++j in f){}; } } return sa ? s : s[0]; } function str_rot13( str ) { // Perform the rot13 transform on a string // // version: 810.1317 // discuss at: http://phpjs.org/functions/str_rot13 // + original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // + improved by: Ates Goral (http://magnetiq.com) // + bugfixed by: Onno Marsman // * example 1: str_rot13('Kevin van Zonneveld'); // * returns 1: 'Xriva ina Mbaariryq' // * example 2: str_rot13('Xriva ina Mbaariryq'); // * returns 2: 'Kevin van Zonneveld' return (str+'').replace(/[A-Za-z]/g, function (c) { return String.fromCharCode((((c = c.charCodeAt(0)) & 223) - 52) % 26 + (c & 32) + 65); }); } function str_shuffle (str) { // Shuffles string. One permutation of all possible is created // // version: 903.3016 // discuss at: http://phpjs.org/functions/str_shuffle // + original by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: shuffled = str_shuffle("abcdef"); // * results 1: shuffled.length == 6 if (str == undefined) { throw 'Wrong parameter count for str_shuffle()'; } var getRandomInt = function (max) { return Math.floor(Math.random() * (max + 1)); }; var newStr = '', rand = 0; while (str.length) { rand = getRandomInt(str.length-1); newStr += str[rand]; str = str.substring(0, rand)+str.substr(rand+1); } return newStr; } function str_split ( f_string, f_split_length){ // Convert a string to an array. If split_length is specified, break the string down into chunks each split_length characters long. // // version: 903.3016 // discuss at: http://phpjs.org/functions/str_split // + original by: Martijn Wieringa // + improved by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Onno Marsman // * example 1: str_split('Hello Friend', 3); // * returns 1: ['Hel', 'lo ', 'Fri', 'end'] f_string += ''; if (f_split_length == undefined) { f_split_length = 1; } if(f_split_length > 0){ var result = []; while(f_string.length > f_split_length) { result[result.length] = f_string.substring(0, f_split_length); f_string = f_string.substring(f_split_length); } result[result.length] = f_string; return result; } return false; } function strcasecmp (f_string1, f_string2){ // Binary safe case-insensitive string comparison // // version: 810.1317 // discuss at: http://phpjs.org/functions/strcasecmp // + original by: Martijn Wieringa // + bugfixed by: Onno Marsman // * example 1: strcasecmp('Hello', 'hello'); // * returns 1: 0 var string1 = (f_string1+'').toLowerCase(); var string2 = (f_string2+'').toLowerCase(); if(string1 > string2) { return 1; } else if(string1 == string2) { return 0; } return -1; } function strchr ( haystack, needle, bool ) { // An alias for strstr // // version: 810.114 // discuss at: http://phpjs.org/functions/strchr // + original by: Philip Peterson // - depends on: strstr // * example 1: strchr('Kevin van Zonneveld', 'van'); // * returns 1: 'van Zonneveld' // * example 2: strchr('Kevin van Zonneveld', 'van', true); // * returns 2: 'Kevin ' return strstr( haystack, needle, bool ); } function strcmp ( str1, str2 ) { // Binary safe string comparison // // version: 812.316 // discuss at: http://phpjs.org/functions/strcmp // + original by: Waldo Malqui Silva // + input by: Steve Hilder // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + revised by: gorthaur // * example 1: strcmp( 'waldo', 'owald' ); // * returns 1: 1 // * example 2: strcmp( 'owald', 'waldo' ); // * returns 2: -1 return ( ( str1 == str2 ) ? 0 : ( ( str1 > str2 ) ? 1 : -1 ) ); } function strcspn (str, mask, start, length) { // Finds length of initial segment consisting entirely of characters not found in mask. If start or/and length is provide works like strcspn(substr($s,$start,$len),$bad_chars) // // version: 903.3016 // discuss at: http://phpjs.org/functions/strcspn // + original by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: strcspn('abcdefg123', '1234567890'); // * returns 1: 7 // * example 2: strcspn('123abc', '1234567890'); // * returns 2: 3 start = start ? start : 0; var count = (length && ((start + length) < str.length)) ? start + length : str.length; strct: for (var i=start, lgth=0; i < count; i++) { for (var j=0; j < mask.length; j++) { if (str[i].indexOf(mask[j]) !== -1) { continue strct; } } ++lgth; } return lgth; } function strip_tags(str, allowed_tags) { // Strips HTML and PHP tags from a string // // version: 903.3016 // discuss at: http://phpjs.org/functions/strip_tags // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Luke Godfrey // + input by: Pul // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // + input by: Alex // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Marc Palau // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Eric Nagel // + input by: Bobby Drake // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: strip_tags('

Kevin


van Zonneveld', ''); // * returns 1: 'Kevin van Zonneveld' // * example 2: strip_tags('

Kevin van Zonneveld

', '

'); // * returns 2: '

Kevin van Zonneveld

' // * example 3: strip_tags("Kevin van Zonneveld", ""); // * returns 3: 'Kevin van Zonneveld' // * example 4: strip_tags('1 < 5 5 > 1'); // * returns 4: '1 < 5 5 > 1' var key = '', allowed = false; var matches = []; var allowed_array = []; var allowed_tag = ''; var i = 0; var k = ''; var html = ''; var replacer = function(search, replace, str) { return str.split(search).join(replace); }; // Build allowes tags associative array if (allowed_tags) { allowed_array = allowed_tags.match(/([a-zA-Z]+)/gi); } str += ''; // Match tags matches = str.match(/(<\/?[\S][^>]*>)/gi); // Go through all HTML tags for (key in matches) { if (isNaN(key)) { // IE7 Hack continue; } // Save HTML tag html = matches[key].toString(); // Is tag not in allowed list? Remove from str! allowed = false; // Go through all allowed tags for (k in allowed_array) { // Init allowed_tag = allowed_array[k]; i = -1; if (i != 0) { i = html.toLowerCase().indexOf('<'+allowed_tag+'>');} if (i != 0) { i = html.toLowerCase().indexOf('<'+allowed_tag+' ');} if (i != 0) { i = html.toLowerCase().indexOf(' next || next > 0xDFFF) { throw 'High surrogate without following low surrogate'; } return str[i]+str[i+1]; } else if (0xDC00 <= code && code <= 0xDFFF) { // Low surrogate if (i === 0) { throw 'Low surrogate without preceding high surrogate'; } prev = str.charCodeAt(i-1); if (0xD800 > prev || prev > 0xDBFF) { //(could change last hex to 0xDB7F to treat high private surrogates as single characters) throw 'Low surrogate without preceding high surrogate'; } return false; // We can pass over low surrogates now as the second component in a pair which we have already processed } return str[i]; }; for (i=0, lgth=0; i < str.length; i++) { if ((chr = getWholeChar(str, i)) === false) { continue; } // Adapt this line at the top of any loop, passing in the whole string and the current iteration and returning a variable to represent the individual character; purpose is to treat the first part of a surrogate pair as the whole character and then ignore the second part lgth++; } return lgth; } function strnatcasecmp(str1, str2) { // Returns the result of case-insensitive string comparison using 'natural' algorithm // // version: 903.3016 // discuss at: http://phpjs.org/functions/strnatcasecmp // + original by: Martin Pool // + reimplemented by: Pierre-Luc Paour // + reimplemented by: Kristof Coomans (SCK-CEN (Belgian Nucleair Research Centre)) // + reimplemented by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: strnatcasecmp(10, 1); // * returns 1: 1 // * example 1: strnatcasecmp('1', '10'); // * returns 1: -1 a = (str1+'').toLowerCase(); b = (str2+'').toLowerCase(); var isWhitespaceChar = function(a) { return a.charCodeAt(0) <= 32; } var isDigitChar = function (a) { var charCode = a.charCodeAt(0); return ( charCode >= 48 && charCode <= 57 ); } var compareRight = function(a,b) { var bias = 0; var ia = 0; var ib = 0; var ca; var cb; // The longest run of digits wins. That aside, the greatest // value wins, but we can't know that it will until we've scanned // both numbers to know that they have the same magnitude, so we // remember it in BIAS. for (;; ia++, ib++) { ca = a.charAt(ia); cb = b.charAt(ib); if (!isDigitChar(ca) && !isDigitChar(cb)) { return bias; } else if (!isDigitChar(ca)) { return -1; } else if (!isDigitChar(cb)) { return +1; } else if (ca < cb) { if (bias == 0) { bias = -1; } } else if (ca > cb) { if (bias == 0) bias = +1; } else if (ca == 0 && cb == 0) { return bias; } } } var ia = 0, ib = 0; var nza = 0, nzb = 0; var ca, cb; var result; while (true) { // only count the number of zeroes leading the last number compared nza = nzb = 0; ca = a.charAt(ia); cb = b.charAt(ib); // skip over leading spaces or zeros while ( isWhitespaceChar( ca ) || ca =='0' ) { if (ca == '0') { nza++; } else { // only count consecutive zeroes nza = 0; } ca = a.charAt(++ia); } while ( isWhitespaceChar( cb ) || cb == '0') { if (cb == '0') { nzb++; } else { // only count consecutive zeroes nzb = 0; } cb = b.charAt(++ib); } // process run of digits if (isDigitChar(ca) && isDigitChar(cb)) { if ((result = compareRight(a.substring(ia), b.substring(ib))) != 0) { return result; } } if (ca == 0 && cb == 0) { // The strings compare the same. Perhaps the caller // will want to call strcmp to break the tie. return nza - nzb; } if (ca < cb) { return -1; } else if (ca > cb) { return +1; } ++ia; ++ib; } } function strnatcmp ( f_string1, f_string2, f_version ) { // Returns the result of string comparison using 'natural' algorithm // // version: 903.2116 // discuss at: http://phpjs.org/functions/strnatcmp // + original by: Martijn Wieringa // + namespaced by: Michael White (http://getsprink.com) // + tweaked by: Jack // + bugfixed by: Onno Marsman // - depends on: strcmp // % note: Added f_version argument against code guidelines, because it's so neat // * example 1: strnatcmp('Price 12.9', 'Price 12.15'); // * returns 1: 1 // * example 2: strnatcmp('Price 12.09', 'Price 12.15'); // * returns 2: -1 // * example 3: strnatcmp('Price 12.90', 'Price 12.15'); // * returns 3: 1 // * example 4: strnatcmp('Version 12.9', 'Version 12.15', true); // * returns 4: -6 // * example 5: strnatcmp('Version 12.15', 'Version 12.9', true); // * returns 5: 6 if (f_version == undefined) { f_version = false; } var __strnatcmp_split = function( f_string ) { var result = []; var buffer = ''; var chr = ''; var i = 0, f_stringl = 0; var text = true; f_stringl = f_string.length; for (i = 0; i < f_stringl; i++) { chr = f_string.substring(i, i + 1); if (chr.match(/[0-9]/)) { if (text) { if(buffer.length > 0){ result[result.length] = buffer; buffer = ''; } text = false; } buffer += chr; } else if ((text == false) && (chr == '.') && (i < (f_string.length - 1)) && (f_string.substring(i + 1, i + 2).match(/[0-9]/))) { result[result.length] = buffer; buffer = ''; } else { if (text == false) { if (buffer.length > 0) { result[result.length] = parseInt(buffer); buffer = ''; } text = true; } buffer += chr; } } if (buffer.length > 0) { if (text) { result[result.length] = buffer; } else { result[result.length] = parseInt(buffer); } } return result; }; var array1 = __strnatcmp_split(f_string1+''); var array2 = __strnatcmp_split(f_string2+''); var len = array1.length; var text = true; var result = -1; var r = 0; if (len > array2.length) { len = array2.length; result = 1; } for (i = 0; i < len; i++) { if (isNaN(array1[i])) { if (isNaN(array2[i])) { text = true; if ((r = strcmp(array1[i], array2[i])) != 0) { return r; } } else if (text){ return 1; } else { return -1; } } else if (isNaN(array2[i])) { if(text) { return -1; } else{ return 1; } } else { if(text || f_version){ if ((r = (array1[i] - array2[i])) != 0) { return r; } } else { if ((r = strcmp(array1[i].toString(), array2[i].toString())) != 0) { return r; } } text = false; } } return result; } function strncasecmp (argStr1, argStr2, len) { // Binary safe string comparison // // version: 903.1614 // discuss at: http://phpjs.org/functions/strncasecmp // + original by: Saulo Vallory // + input by: Nate // + bugfixed by: Onno Marsman // % note: Returns < 0 if str1 is less than str2 ; > 0 if str1 is greater than str2 , and 0 if they are equal. // * example 1: strncasecmp('Price 12.9', 'Price 12.15', 2); // * returns 1: 0 // * example 2: strncasecmp('Price 12.09', 'Price 12.15', 10); // * returns 2: -1 // * example 3: strncasecmp('Price 12.90', 'Price 12.15', 30); // * returns 3: 8 // * example 4: strncasecmp('Version 12.9', 'Version 12.15', 20); // * returns 4: 8 // * example 5: strncasecmp('Version 12.15', 'Version 12.9', 20); // * returns 5: -8 var diff, i = 0; var str1 = (argStr1+'').toLowerCase().substr(0,len); var str2 = (argStr2+'').toLowerCase().substr(0,len); if(str1.length !== str2.length) { if(str1.length < str2.length) { len = str1.length; if(str2.substr(0, str1.length) == str1) { return str1.length - str2.length; // return the difference of chars } } else { len = str2.length; // str1 is longer than str2 if(str1.substr(0, str2.length) == str2) { return str1.length - str2.length; // return the difference of chars } } } else { // Avoids trying to get a char that does not exist len = str1.length; } for(diff = 0, i=0; i < len; i++) { diff = str1.charCodeAt(i) - str2.charCodeAt(i); if(diff !== 0) { return diff; } } return 0; } function strncmp ( str1, str2, lgth ) { // Binary safe string comparison // // version: 903.3016 // discuss at: http://phpjs.org/functions/strncmp // + original by: Waldo Malqui Silva // + input by: Steve Hilder // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + revised by: gorthaur // + reimplemented by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: strncmp('aaa', 'aab', 2); // * returns 1: 0 // * example 2: strncmp('aaa', 'aab', 3 ); // * returns 2: -1 var s1 = (str1+'').substr(0, lgth); var s2 = (str2+'').substr(0, lgth); return ( ( s1 == s2 ) ? 0 : ( ( s1 > s2 ) ? 1 : -1 ) ); } function strpbrk( haystack, char_list ) { // Search a string for any of a set of characters // // version: 903.1614 // discuss at: http://phpjs.org/functions/strpbrk // + original by: Alfonso Jimenez (http://www.alfonsojimenez.com) // + bugfixed by: Onno Marsman // * example 1: strpbrk('This is a Simple text.', 'is'); // * returns 1: 'is is a Simple text.' haystack += ''; char_list += ''; var lon = haystack.length; var lon_search = char_list.length; var ret = false; var stack = ''; var i = 0, j = 0; if (lon >= lon_search) { if (lon == lon_search) { if (haystack == char_list){ ret = haystack; } } else { j = 0; i = 0; while (i < lon_search && j < lon && !ret) { if (char_list[i] == haystack[j]) { i++; if (i == lon_search) { ret = true; } } j++; } if (ret) { for(i = (j-lon_search); i < lon; i++){ stack += haystack[i]; } } if (stack != '') { ret = stack; } } } return ret; } function strpos( haystack, needle, offset){ // Finds position of first occurrence of a string within another // // version: 810.1317 // discuss at: http://phpjs.org/functions/strpos // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Onno Marsman // * example 1: strpos('Kevin van Zonneveld', 'e', 5); // * returns 1: 14 var i = (haystack+'').indexOf( needle, offset ); return i===-1 ? false : i; } function strrchr (haystack, needle) { // Finds the last occurrence of a character in a string within another // // version: 903.3016 // discuss at: http://phpjs.org/functions/strrchr // + original by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: strrchr("Line 1\nLine 2\nLine 3", 10).substr(1) // * returns 1: 'Line 3' var pos = 0; if (typeof needle !== 'string') { needle = String.fromCharCode(parseInt(needle, 10)); } needle = needle[0]; pos = haystack.lastIndexOf(needle); if (pos === -1) { return false; } return haystack.substr(pos); } function strrev( string ){ // Reverse a string // // version: 810.1317 // discuss at: http://phpjs.org/functions/strrev // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // * example 1: strrev('Kevin van Zonneveld'); // * returns 1: 'dlevennoZ nav niveK' var ret = '', i = 0; string += ''; for ( i = string.length-1; i >= 0; i-- ){ ret += string.charAt(i); } return ret; } function strripos( haystack, needle, offset){ // Finds position of last occurrence of a string within another string // // version: 810.1317 // discuss at: http://phpjs.org/functions/strripos // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // * example 1: strripos('Kevin van Zonneveld', 'E'); // * returns 1: 16 var i = (haystack+'').toLowerCase().lastIndexOf( (needle+'').toLowerCase(), offset ); // returns -1 return i >= 0 ? i : false; } function strrpos( haystack, needle, offset){ // Finds position of last occurrence of a string within another string // // version: 810.1317 // discuss at: http://phpjs.org/functions/strrpos // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // * example 1: strrpos('Kevin van Zonneveld', 'e'); // * returns 1: 16 var i = (haystack+'').lastIndexOf( needle, offset ); // returns -1 return i >= 0 ? i : false; } function strspn(str1, str2, start, lgth){ // Finds length of initial segment consisting entirely of characters found in mask. If start or/and length is provided works like strspn(substr($s,$start,$len),$good_chars) // // version: 903.3016 // discuss at: http://phpjs.org/functions/strspn // + original by: Valentina De Rosa // + improved by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: strspn('42 is the answer, what is the question ...', '1234567890'); // * returns 1: 2 // * example 2: strspn('foo', 'o', 1, 2); // * returns 2: 2 var found; var stri; var strj; var j = 0; var i = 0; start = start ? (start < 0 ? (str1.length+start) : start) : 0; lgth = lgth ? ((lgth < 0) ? (str1.length+lgth-start) : lgth) : str1.length-start; str1 = str1.substr(start, lgth); for(i = 0; i < str1.length; i++){ found = 0; stri = str1.substring(i,i+1); for (j = 0; j <= str2.length; j++) { strj = str2.substring(j,j+1); if (stri == strj) { found = 1; break; } } if (found != 1) { return i; } } return i; } function strstr( haystack, needle, bool ) { // Finds first occurrence of a string within another // // version: 810.1317 // discuss at: http://phpjs.org/functions/strstr // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // * example 1: strstr('Kevin van Zonneveld', 'van'); // * returns 1: 'van Zonneveld' // * example 2: strstr('Kevin van Zonneveld', 'van', true); // * returns 2: 'Kevin ' var pos = 0; haystack += ''; pos = haystack.indexOf( needle ); if( pos == -1 ){ return false; } else{ if( bool ){ return haystack.substr( 0, pos ); } else{ return haystack.slice( pos ); } } } function strtok (str, tokens) { // Tokenize a string // // version: 903.3016 // discuss at: http://phpjs.org/functions/strtok // + original by: Brett Zamir (http://brettz9.blogspot.com) // % note 1: Use tab and newline as tokenizing characters as well // * example 1: $string = "\t\t\t\nThis is\tan example\nstring\n"; // * example 1: $tok = strtok($string, " \n\t"); // * example 1: $b = ''; // * example 1: while($tok !== false) {$b += "Word="+$tok+"\n"; $tok = strtok(" \n\t");} // * example 1: $b // * returns 1: "Word=This\nWord=is\nWord=an\nWord=example\nWord=string\n" if (tokens === undefined) { tokens = str; str = strtok.leftOver; } if (str.length === 0) { return false; } if (tokens.indexOf(str[0]) !== -1) { return strtok(str.substr(1), tokens); } for (var i=0; i < str.length; i++) { if (tokens.indexOf(str[i]) !== -1) { break; } } strtok.leftOver = str.substr(i+1); return str.substring(0, i); } function strtolower( str ) { // Makes a string lowercase // // version: 810.114 // discuss at: http://phpjs.org/functions/strtolower // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Onno Marsman // * example 1: strtolower('Kevin van Zonneveld'); // * returns 1: 'kevin van zonneveld' return (str+'').toLowerCase(); } function strtotime(str, now) { // Convert string representation of date and time to a timestamp // // version: 902.2516 // discuss at: http://phpjs.org/functions/strtotime // + original by: Caio Ariede (http://caioariede.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: David // + improved by: Caio Ariede (http://caioariede.com) // % note 1: Examples all have a fixed timestamp to prevent tests to fail because of variable time(zones) // * example 1: strtotime('+1 day', 1129633200); // * returns 1: 1129719600 // * example 2: strtotime('+1 week 2 days 4 hours 2 seconds', 1129633200); // * returns 2: 1130425202 // * example 3: strtotime('last month', 1129633200); // * returns 3: 1127041200 // * example 4: strtotime('2009-05-04 08:30:00'); // * returns 4: 1241418600 var i, match, s, strTmp = '', parse = ''; strTmp = str; strTmp = strTmp.replace(/\s{2,}|^\s|\s$/g, ' '); // unecessary spaces strTmp = strTmp.replace(/[\t\r\n]/g, ''); // unecessary chars if (strTmp == 'now') { return (new Date()).getTime(); } else if (!isNaN(parse = Date.parse(strTmp))) { return parse/1000; } else if (now) { now = new Date(now); } else { now = new Date(); } strTmp = strTmp.toLowerCase(); var process = function (m) { var ago = (m[2] && m[2] == 'ago'); var num = (num = m[0] == 'last' ? -1 : 1) * (ago ? -1 : 1); switch (m[0]) { case 'last': case 'next': switch (m[1].substring(0, 3)) { case 'yea': now.setFullYear(now.getFullYear() + num); break; case 'mon': now.setMonth(now.getMonth() + num); break; case 'wee': now.setDate(now.getDate() + (num * 7)); break; case 'day': now.setDate(now.getDate() + num); break; case 'hou': now.setHours(now.getHours() + num); break; case 'min': now.setMinutes(now.getMinutes() + num); break; case 'sec': now.setSeconds(now.getSeconds() + num); break; default: var day; if (typeof (day = __is_day[m[1].substring(0, 3)]) != 'undefined') { var diff = day - now.getDay(); if (diff == 0) { diff = 7 * num; } else if (diff > 0) { if (m[0] == 'last') diff -= 7; } else { if (m[0] == 'next') diff += 7; } now.setDate(now.getDate() + diff); } } break; default: if (/\d+/.test(m[0])) { num *= parseInt(m[0]); switch (m[1].substring(0, 3)) { case 'yea': now.setFullYear(now.getFullYear() + num); break; case 'mon': now.setMonth(now.getMonth() + num); break; case 'wee': now.setDate(now.getDate() + (num * 7)); break; case 'day': now.setDate(now.getDate() + num); break; case 'hou': now.setHours(now.getHours() + num); break; case 'min': now.setMinutes(now.getMinutes() + num); break; case 'sec': now.setSeconds(now.getSeconds() + num); break; } } else { return false; } break; } return true; } var __is = { day: { 'sun': 0, 'mon': 1, 'tue': 2, 'wed': 3, 'thu': 4, 'fri': 5, 'sat': 6 }, mon: { 'jan': 0, 'feb': 1, 'mar': 2, 'apr': 3, 'may': 4, 'jun': 5, 'jul': 6, 'aug': 7, 'sep': 8, 'oct': 9, 'nov': 10, 'dec': 11 } } match = strTmp.match(/^(\d{2,4}-\d{2}-\d{2})(\s\d{1,2}:\d{1,2}(:\d{1,2})?)?$/); if (match != null) { if (!match[2]) { match[2] = '00:00:00'; } else if (!match[3]) { match[2] += ':00'; } s = match[1].split(/-/g); for (i in __is.mon) { if (__is.mon[i] == s[1] - 1) { s[1] = i; } } return strtotime(s[2] + ' ' + s[1] + ' ' + s[0] + ' ' + match[2]); } var regex = '([+-]?\\d+\\s' + '(years?|months?|weeks?|days?|hours?|min|minutes?|sec|seconds?' + '|sun\.?|sunday|mon\.?|monday|tue\.?|tuesday|wed\.?|wednesday' + '|thu\.?|thursday|fri\.?|friday|sat\.?|saturday)' + '|(last|next)\\s' + '(years?|months?|weeks?|days?|hours?|min|minutes?|sec|seconds?' + '|sun\.?|sunday|mon\.?|monday|tue\.?|tuesday|wed\.?|wednesday' + '|thu\.?|thursday|fri\.?|friday|sat\.?|saturday))' + '(\\sago)?'; match = strTmp.match(new RegExp(regex, 'g')); if (match == null) { return false; } for (i in match) { if (!process(match[i].split(' '))) { return false; } } return (now); } function strtoupper( str ) { // Makes a string uppercase // // version: 810.114 // discuss at: http://phpjs.org/functions/strtoupper // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Onno Marsman // * example 1: strtoupper('Kevin van Zonneveld'); // * returns 1: 'KEVIN VAN ZONNEVELD' return (str+'').toUpperCase(); } function strtr (str, from, to) { // Translates characters in str using given translation tables // // version: 903.3016 // discuss at: http://phpjs.org/functions/strtr // + original by: Brett Zamir (http://brettz9.blogspot.com) // + input by: uestla // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: $trans = {"hello" : "hi", "hi" : "hello"}; // * example 1: strtr("hi all, I said hello", $trans) // * returns 1: 'hello all, I said hi' // * example 2: strtr('äaabaåccasdeöoo', 'äåö','aao'); // * returns 2: 'aaabaaccasdeooo' // * example 3: strtr('ääääääää', 'ä','a'); // * returns 3: 'aaaaaaaa' var fr = '', i = 0, lgth = 0; if (typeof from === 'object') { for (fr in from) { str = str.replace(fr, from[fr]); } return str; } lgth = to.length; if (from.length < to.length) { lgth = from.length; } for (i = 0; i < lgth; i++) { str = str.replace(from[i], to[i], 'g'); } return str; } function substr( f_string, f_start, f_length ) { // Returns part of a string // // version: 810.1317 // discuss at: http://phpjs.org/functions/substr // + original by: Martijn Wieringa // + bugfixed by: T.Wild // + tweaked by: Onno Marsman // * example 1: substr('abcdef', 0, -1); // * returns 1: 'abcde' // * example 2: substr(2, 0, -6); // * returns 2: '' f_string += ''; if(f_start < 0) { f_start += f_string.length; } if(f_length == undefined) { f_length = f_string.length; } else if(f_length < 0){ f_length += f_string.length; } else { f_length += f_start; } if(f_length < f_start) { f_length = f_start; } return f_string.substring(f_start, f_length); } function substr_count( haystack, needle, offset, length ) { // Returns the number of times a substring occurs in the string // // version: 810.1317 // discuss at: http://phpjs.org/functions/substr_count // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // * example 1: substr_count('Kevin van Zonneveld', 'e'); // * returns 1: 3 // * example 2: substr_count('Kevin van Zonneveld', 'K', 1); // * returns 2: 0 // * example 3: substr_count('Kevin van Zonneveld', 'Z', 0, 10); // * returns 3: false var pos = 0, cnt = 0; haystack += ''; needle += ''; if(isNaN(offset)) offset = 0; if(isNaN(length)) length = 0; offset--; while( (offset = haystack.indexOf(needle, offset+1)) != -1 ){ if(length > 0 && (offset+needle.length) > length){ return false; } else{ cnt++; } } return cnt; } function tan(arg) { // Returns the tangent of the number in radians // // version: 810.114 // discuss at: http://phpjs.org/functions/tan // + original by: Onno Marsman // * example 1: tan(8723321.4); // * returns 1: 5.4251848798444815 return Math.tan(arg); } function tanh(arg) { // Returns the hyperbolic tangent of the number, defined as sinh(number)/cosh(number) // // version: 810.114 // discuss at: http://phpjs.org/functions/tanh // + original by: Onno Marsman // * example 1: tanh(5.4251848798444815); // * returns 1: 0.9999612058841574 return (Math.exp(arg) - Math.exp(-arg)) / (Math.exp(arg) + Math.exp(-arg)); } function time() { // Return current UNIX timestamp // // version: 810.114 // discuss at: http://phpjs.org/functions/time // + original by: GeekFG (http://geekfg.blogspot.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: metjay // * example 1: timeStamp = time(); // * results 1: timeStamp > 1000000000 && timeStamp < 2000000000 return Math.round(new Date().getTime()/1000); } function trim (str, charlist) { // Strips whitespace from the beginning and end of a string // // version: 812.316 // discuss at: http://phpjs.org/functions/trim // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: mdsjack (http://www.mdsjack.bo.it) // + improved by: Alexander Ermolaev (http://snippets.dzone.com/user/AlexanderErmolaev) // + input by: Erkekjetter // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: DxGx // + improved by: Steven Levithan (http://blog.stevenlevithan.com) // + tweaked by: Jack // + bugfixed by: Onno Marsman // * example 1: trim(' Kevin van Zonneveld '); // * returns 1: 'Kevin van Zonneveld' // * example 2: trim('Hello World', 'Hdle'); // * returns 2: 'o Wor' // * example 3: trim(16, 1); // * returns 3: 6 var whitespace, l = 0, i = 0; str += ''; if (!charlist) { // default list whitespace = " \n\r\t\f\x0b\xa0\u2000\u2001\u2002\u2003\u2004\u2005\u2006\u2007\u2008\u2009\u200a\u200b\u2028\u2029\u3000"; } else { // preg_quote custom list charlist += ''; whitespace = charlist.replace(/([\[\]\(\)\.\?\/\*\{\}\+\$\^\:])/g, '\$1'); } l = str.length; for (i = 0; i < l; i++) { if (whitespace.indexOf(str.charAt(i)) === -1) { str = str.substring(i); break; } } l = str.length; for (i = l - 1; i >= 0; i--) { if (whitespace.indexOf(str.charAt(i)) === -1) { str = str.substring(0, i + 1); break; } } return whitespace.indexOf(str.charAt(0)) === -1 ? str : ''; } function uasort (inputArr, sorter) { // Sort an array with a user-defined comparison function and maintain index association // // version: 903.3016 // discuss at: http://phpjs.org/functions/uasort // + original by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: fruits = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'}; // * example 1: uasort(fruits, function (a, b) { if (a > b) {return 1;}if (a < b) {return -1;} return 0;}); // * results 1: fruits == {c: 'apple', b: 'banana', d: 'lemon', a: 'orange'} if (typeof sorter === 'string') { sorter = this[sorter]; } else if (sorter instanceof Array) { sorter = this[sorter[0]][sorter[1]]; } var valArr = [], keyArr=[], tempKeyVal, tempValue, ret; var k = '', i = 0; var sorterNew = function (keyArr, valArr) { for (var i=valArr.length-2; i >=0; i--) { for (var j=0; j <= i; j++) { ret = sorter(valArr[j+1], valArr[j]); if (ret < 0) { tempValue = valArr[j]; valArr[j] = valArr[j+1]; valArr[j+1] = tempValue; tempKeyVal = keyArr[j]; keyArr[j] = keyArr[j+1]; keyArr[j+1] = tempKeyVal; } } } } for (k in inputArr) { // Get key and value arrays valArr.push(inputArr[k]); keyArr.push(k); delete inputArr[k] ; } try { sorterNew(keyArr, valArr); // Sort our new temporary arrays } catch(e) { return false; } for (i = 0; i < valArr.length; i++) { // Repopulate the old array inputArr[keyArr[i]] = valArr[i]; } return true; } function ucfirst( str ) { // Makes a string's first character uppercase // // version: 903.3016 // discuss at: http://phpjs.org/functions/ucfirst // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + bugfixed by: Onno Marsman // + improved by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: ucfirst('kevin van zonneveld'); // * returns 1: 'Kevin van zonneveld' str += ''; var f = str.charAt(0).toUpperCase(); return f + str.substr(1); } function ucwords( str ) { // Uppercase the first character of every word in a string // // version: 812.316 // discuss at: http://phpjs.org/functions/ucwords // + original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // + improved by: Waldo Malqui Silva // + bugfixed by: Onno Marsman // * example 1: ucwords('kevin van zonneveld'); // * returns 1: 'Kevin Van Zonneveld' // * example 2: ucwords('HELLO WORLD'); // * returns 2: 'HELLO WORLD' return (str+'').replace(/^(.)|\s(.)/g, function ( $1 ) { return $1.toUpperCase ( ); } ); } function uksort(array, sorter) { // Sort an array by keys using a user-defined comparison function // // version: 903.3016 // discuss at: http://phpjs.org/functions/uksort // + original by: Brett Zamir (http://brettz9.blogspot.com) // % note: The examples are correct, this is a new way // * example 1: data = {d: 'lemon', a: 'orange', b: 'banana', c: 'apple'}; // * example 1: uksort(data, function(key1, key2){ return (key1 == key2 ? 0 : (key1 > key2 ? 1 : -1)); }); // * results 1: data == {a: 'orange', b: 'banana', c: 'apple', d: 'lemon'} // * returns 1: true if (typeof sorter === 'string') { sorter = window[sorter]; } var tmp_arr = {}, keys = [], i = 0, key = ''; // Make a list of key names for (key in array) { keys.push(key); } // Sort key names try { if (sorter) { keys.sort(sorter); } else { keys.sort(); } } catch (e) { return false; } // Rebuild array with sorted key names for (i = 0; i < keys.length; i++) { key = keys[i]; tmp_arr[key] = array[key]; delete array[key]; } for (i in tmp_arr) { array[i] = tmp_arr[i] } return true; } function unserialize(data){ // Takes a string representation of variable and recreates it // // version: 903.3016 // discuss at: http://phpjs.org/functions/unserialize // + original by: Arpad Ray (mailto:arpad@php.net) // + improved by: Pedro Tainha (http://www.pedrotainha.com) // + bugfixed by: dptr1988 // + revised by: d3x // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: Brett Zamir (http://brettz9.blogspot.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // % note: We feel the main purpose of this function should be to ease the transport of data between php & js // % note: Aiming for PHP-compatibility, we have to translate objects to arrays // * example 1: unserialize('a:3:{i:0;s:5:"Kevin";i:1;s:3:"van";i:2;s:9:"Zonneveld";}'); // * returns 1: ['Kevin', 'van', 'Zonneveld'] // * example 2: unserialize('a:3:{s:9:"firstName";s:5:"Kevin";s:7:"midName";s:3:"van";s:7:"surName";s:9:"Zonneveld";}'); // * returns 2: {firstName: 'Kevin', midName: 'van', surName: 'Zonneveld'} var error = function (type, msg, filename, line){throw new window[type](msg, filename, line);}; var read_until = function (data, offset, stopchr){ var buf = []; var chr = data.slice(offset, offset + 1); var i = 2; while (chr != stopchr) { if ((i+offset) > data.length) { error('Error', 'Invalid'); } buf.push(chr); chr = data.slice(offset + (i - 1),offset + i); i += 1; } return [buf.length, buf.join('')]; }; var read_chrs = function (data, offset, length){ var buf; buf = []; for(var i = 0;i < length;i++){ var chr = data.slice(offset + (i - 1),offset + i); buf.push(chr); } return [buf.length, buf.join('')]; }; var _unserialize = function (data, offset){ var readdata; var readData; var chrs = 0; var ccount; var stringlength; var keyandchrs; var keys; if(!offset) offset = 0; var dtype = (data.slice(offset, offset + 1)).toLowerCase(); var dataoffset = offset + 2; var typeconvert = new Function('x', 'return x'); switch(dtype){ case "i": typeconvert = new Function('x', 'return parseInt(x)'); readData = read_until(data, dataoffset, ';'); chrs = readData[0]; readdata = readData[1]; dataoffset += chrs + 1; break; case "b": typeconvert = new Function('x', 'return (parseInt(x) == 1)'); readData = read_until(data, dataoffset, ';'); chrs = readData[0]; readdata = readData[1]; dataoffset += chrs + 1; break; case "d": typeconvert = new Function('x', 'return parseFloat(x)'); readData = read_until(data, dataoffset, ';'); chrs = readData[0]; readdata = readData[1]; dataoffset += chrs + 1; break; case "n": readdata = null; break; case "s": ccount = read_until(data, dataoffset, ':'); chrs = ccount[0]; stringlength = ccount[1]; dataoffset += chrs + 2; readData = read_chrs(data, dataoffset+1, parseInt(stringlength)); chrs = readData[0]; readdata = readData[1]; dataoffset += chrs + 2; if(chrs != parseInt(stringlength) && chrs != readdata.length){ error('SyntaxError', 'String length mismatch'); } break; case "a": readdata = {}; keyandchrs = read_until(data, dataoffset, ':'); chrs = keyandchrs[0]; keys = keyandchrs[1]; dataoffset += chrs + 2; for(var i = 0;i < parseInt(keys);i++){ var kprops = _unserialize(data, dataoffset); var kchrs = kprops[1]; var key = kprops[2]; dataoffset += kchrs; var vprops = _unserialize(data, dataoffset); var vchrs = vprops[1]; var value = vprops[2]; dataoffset += vchrs; readdata[key] = value; } dataoffset += 1; break; default: error('SyntaxError', 'Unknown / Unhandled data type(s): ' + dtype); break; } return [dtype, dataoffset - offset, typeconvert(readdata)]; }; return _unserialize(data, 0)[2]; } function urldecode( str ) { // Decodes URL-encoded string // // version: 904.317 // discuss at: http://phpjs.org/functions/urldecode // + original by: Philip Peterson // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: AJ // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // + input by: travc // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // % note 1: info on what encoding functions to use from: http://xkr.us/articles/javascript/encode-compare/ // * example 1: urldecode('Kevin+van+Zonneveld%21'); // * returns 1: 'Kevin van Zonneveld!' // * example 2: urldecode('http%3A%2F%2Fkevin.vanzonneveld.net%2F'); // * returns 2: 'http://kevin.vanzonneveld.net/' // * example 3: urldecode('http%3A%2F%2Fwww.google.nl%2Fsearch%3Fq%3Dphp.js%26ie%3Dutf-8%26oe%3Dutf-8%26aq%3Dt%26rls%3Dcom.ubuntu%3Aen-US%3Aunofficial%26client%3Dfirefox-a'); // * returns 3: 'http://www.google.nl/search?q=php.js&ie=utf-8&oe=utf-8&aq=t&rls=com.ubuntu:en-US:unofficial&client=firefox-a' var histogram = {}; var ret = str.toString(); var replacer = function(search, replace, str) { var tmp_arr = []; tmp_arr = str.split(search); return tmp_arr.join(replace); }; // The histogram is identical to the one in urlencode. histogram["'"] = '%27'; histogram['('] = '%28'; histogram[')'] = '%29'; histogram['*'] = '%2A'; histogram['~'] = '%7E'; histogram['!'] = '%21'; histogram['%20'] = '+'; histogram['\u20AC'] = '%80'; histogram['\u0081'] = '%81'; histogram['\u201A'] = '%82'; histogram['\u0192'] = '%83'; histogram['\u201E'] = '%84'; histogram['\u2026'] = '%85'; histogram['\u2020'] = '%86'; histogram['\u2021'] = '%87'; histogram['\u02C6'] = '%88'; histogram['\u2030'] = '%89'; histogram['\u0160'] = '%8A'; histogram['\u2039'] = '%8B'; histogram['\u0152'] = '%8C'; histogram['\u008D'] = '%8D'; histogram['\u017D'] = '%8E'; histogram['\u008F'] = '%8F'; histogram['\u0090'] = '%90'; histogram['\u2018'] = '%91'; histogram['\u2019'] = '%92'; histogram['\u201C'] = '%93'; histogram['\u201D'] = '%94'; histogram['\u2022'] = '%95'; histogram['\u2013'] = '%96'; histogram['\u2014'] = '%97'; histogram['\u02DC'] = '%98'; histogram['\u2122'] = '%99'; histogram['\u0161'] = '%9A'; histogram['\u203A'] = '%9B'; histogram['\u0153'] = '%9C'; histogram['\u009D'] = '%9D'; histogram['\u017E'] = '%9E'; histogram['\u0178'] = '%9F'; for (replace in histogram) { search = histogram[replace]; // Switch order when decoding ret = replacer(search, replace, ret) // Custom replace. No regexing } // End with decodeURIComponent, which most resembles PHP's encoding functions ret = decodeURIComponent(ret); return ret; } function urlencode( str ) { // URL-encodes string // // version: 904.317 // discuss at: http://phpjs.org/functions/urlencode // + original by: Philip Peterson // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: AJ // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + input by: travc // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // % note 1: info on what encoding functions to use from: http://xkr.us/articles/javascript/encode-compare/ // * example 1: urlencode('Kevin van Zonneveld!'); // * returns 1: 'Kevin+van+Zonneveld%21' // * example 2: urlencode('http://kevin.vanzonneveld.net/'); // * returns 2: 'http%3A%2F%2Fkevin.vanzonneveld.net%2F' // * example 3: urlencode('http://www.google.nl/search?q=php.js&ie=utf-8&oe=utf-8&aq=t&rls=com.ubuntu:en-US:unofficial&client=firefox-a'); // * returns 3: 'http%3A%2F%2Fwww.google.nl%2Fsearch%3Fq%3Dphp.js%26ie%3Dutf-8%26oe%3Dutf-8%26aq%3Dt%26rls%3Dcom.ubuntu%3Aen-US%3Aunofficial%26client%3Dfirefox-a' var histogram = {}, tmp_arr = []; var ret = (str+'').toString(); var replacer = function(search, replace, str) { var tmp_arr = []; tmp_arr = str.split(search); return tmp_arr.join(replace); }; // The histogram is identical to the one in urldecode. histogram["'"] = '%27'; histogram['('] = '%28'; histogram[')'] = '%29'; histogram['*'] = '%2A'; histogram['~'] = '%7E'; histogram['!'] = '%21'; histogram['%20'] = '+'; histogram['\u20AC'] = '%80'; histogram['\u0081'] = '%81'; histogram['\u201A'] = '%82'; histogram['\u0192'] = '%83'; histogram['\u201E'] = '%84'; histogram['\u2026'] = '%85'; histogram['\u2020'] = '%86'; histogram['\u2021'] = '%87'; histogram['\u02C6'] = '%88'; histogram['\u2030'] = '%89'; histogram['\u0160'] = '%8A'; histogram['\u2039'] = '%8B'; histogram['\u0152'] = '%8C'; histogram['\u008D'] = '%8D'; histogram['\u017D'] = '%8E'; histogram['\u008F'] = '%8F'; histogram['\u0090'] = '%90'; histogram['\u2018'] = '%91'; histogram['\u2019'] = '%92'; histogram['\u201C'] = '%93'; histogram['\u201D'] = '%94'; histogram['\u2022'] = '%95'; histogram['\u2013'] = '%96'; histogram['\u2014'] = '%97'; histogram['\u02DC'] = '%98'; histogram['\u2122'] = '%99'; histogram['\u0161'] = '%9A'; histogram['\u203A'] = '%9B'; histogram['\u0153'] = '%9C'; histogram['\u009D'] = '%9D'; histogram['\u017E'] = '%9E'; histogram['\u0178'] = '%9F'; // Begin with encodeURIComponent, which most resembles PHP's encoding functions ret = encodeURIComponent(ret); for (search in histogram) { replace = histogram[search]; ret = replacer(search, replace, ret) // Custom replace. No regexing } // Uppercase for full PHP compatibility return ret.replace(/(\%([a-z0-9]{2}))/g, function(full, m1, m2) { return "%"+m2.toUpperCase(); }); return ret; } function usort (inputArr, sorter) { // Sort an array by values using a user-defined comparison function // // version: 903.3016 // discuss at: http://phpjs.org/functions/usort // + original by: Brett Zamir (http://brettz9.blogspot.com) // * example 1: stuff = {d: '3', a: '1', b: '11', c: '4'}; // * example 1: usort(stuff, function (a, b) {return(a-b);}); // * results 1: stuff = {0: '1', 1: '3', 2: '4', 3: '11'}; var valArr = [], keyArr=[]; var k = '', i = 0; if (typeof sorter === 'string') { sorter = this[sorter]; } else if (sorter instanceof Array) { sorter = this[sorter[0]][sorter[1]]; } for (k in inputArr) { // Get key and value arrays valArr.push(inputArr[k]); delete inputArr[k] ; } try { valArr.sort(sorter); } catch (e) { return false; } for (i = 0; i < valArr.length; i++) { // Repopulate the old array inputArr[i] = valArr[i]; } return true; } function utf8_decode ( str_data ) { // Converts a UTF-8 encoded string to ISO-8859-1 // // version: 903.3016 // discuss at: http://phpjs.org/functions/utf8_decode // + original by: Webtoolkit.info (http://www.webtoolkit.info/) // + input by: Aman Gupta // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Norman "zEh" Fuchs // + bugfixed by: hitwork // + bugfixed by: Onno Marsman // + input by: Brett Zamir (http://brettz9.blogspot.com) // + bugfixed by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // * example 1: utf8_decode('Kevin van Zonneveld'); // * returns 1: 'Kevin van Zonneveld' var tmp_arr = [], i = 0, ac = 0, c1 = 0, c2 = 0, c3 = 0; str_data += ''; while ( i < str_data.length ) { c1 = str_data.charCodeAt(i); if (c1 < 128) { tmp_arr[ac++] = String.fromCharCode(c1); i++; } else if ((c1 > 191) && (c1 < 224)) { c2 = str_data.charCodeAt(i+1); tmp_arr[ac++] = String.fromCharCode(((c1 & 31) << 6) | (c2 & 63)); i += 2; } else { c2 = str_data.charCodeAt(i+1); c3 = str_data.charCodeAt(i+2); tmp_arr[ac++] = String.fromCharCode(((c1 & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63)); i += 3; } } return tmp_arr.join(''); } function utf8_encode ( string ) { // Encodes an ISO-8859-1 string to UTF-8 // // version: 812.316 // discuss at: http://phpjs.org/functions/utf8_encode // + original by: Webtoolkit.info (http://www.webtoolkit.info/) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: sowberry // + tweaked by: Jack // + bugfixed by: Onno Marsman // + improved by: Yves Sucaet // + bugfixed by: Onno Marsman // * example 1: utf8_encode('Kevin van Zonneveld'); // * returns 1: 'Kevin van Zonneveld' string = (string+'').replace(/\r\n/g, "\n").replace(/\r/g, "\n"); var utftext = ""; var start, end; var stringl = 0; start = end = 0; stringl = string.length; for (var n = 0; n < stringl; n++) { var c1 = string.charCodeAt(n); var enc = null; if (c1 < 128) { end++; } else if((c1 > 127) && (c1 < 2048)) { enc = String.fromCharCode((c1 >> 6) | 192) + String.fromCharCode((c1 & 63) | 128); } else { enc = String.fromCharCode((c1 >> 12) | 224) + String.fromCharCode(((c1 >> 6) & 63) | 128) + String.fromCharCode((c1 & 63) | 128); } if (enc != null) { if (end > start) { utftext += string.substring(start, end); } utftext += enc; start = end = n+1; } } if (end > start) { utftext += string.substring(start, string.length); } return utftext; } function var_export(mixed_expression, bool_return) { // Outputs or returns a string representation of a variable // // version: 904.610 // discuss at: http://phpjs.org/functions/var_export // + original by: Philip Peterson // + improved by: johnrembo // + improved by: Brett Zamir (http://brettz9.blogspot.com) // - depends on: echo // * example 1: var_export(null); // * returns 1: null // * example 2: var_export({0: 'Kevin', 1: 'van', 2: 'Zonneveld'}, true); // * returns 2: "array (\n 0 => 'Kevin',\n 1 => 'van',\n 2 => 'Zonneveld'\n)" // * example 3: data = 'Kevin'; // * example 3: var_export(data, true); // * returns 3: "'Kevin'" var retstr = ""; var iret = ""; var cnt = 0; var x = []; var key = '', i = 0; var __getType = function( inp ) { var match, type = typeof inp; if (type == 'object' && inp.constructor && inp.constructor.name === 'PHPJS_Resource') { return 'resource'; } if (type == 'object' && !inp) { return 'null'; // Should this be just null? } if (type == "object") { if (!inp.constructor) { return 'object'; } var cons = inp.constructor.toString(); if (match = cons.match(/(\w+)\(/)) { cons = match[1].toLowerCase(); } var types = ["boolean", "number", "string", "array"]; for (key in types) { if (cons == types[key]) { type = types[key]; break; } } } return type; }; var type = __getType(mixed_expression); if( type === null) { retstr = "NULL"; } else if(type == 'array' || type == 'object') { for(i in mixed_expression) { x[cnt++] = var_export(i,true)+" => "+var_export(mixed_expression[i], true); } iret = x.join(',\n '); retstr = "array (\n "+iret+"\n)"; } else if (type === 'resource') { retstr = 'NULL'; // Resources treated as null for var_export } else { retstr = (!isNaN( mixed_expression )) ? mixed_expression : "'" + mixed_expression.replace('/(["\'\])/g', "\\$1").replace('/\0/g', "\\0") + "'"; } if(bool_return != true) { echo(retstr); return null; } else { return retstr; } } function vsprintf(format, args) { // Return a formatted string // // version: 901.817 // discuss at: http://phpjs.org/functions/vsprintf // + original by: ejsanders // - depends on: sprintf // * example 1: vsprintf('%04d-%02d-%02d', [1988, 8, 1]); // * returns 1: '1988-08-01' return sprintf.apply(this, [format].concat(args)); } function wordwrap( str, int_width, str_break, cut ) { // Wraps buffer to selected number of characters using string break char // // version: 810.1317 // discuss at: http://phpjs.org/functions/wordwrap // + original by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // + improved by: Nick Callen // + revised by: Jonas Raoni Soares Silva (http://www.jsfromhell.com) // + improved by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Sakimori // * example 1: wordwrap('Kevin van Zonneveld', 6, '|', true); // * returns 1: 'Kevin |van |Zonnev|eld' // * example 2: wordwrap('The quick brown fox jumped over the lazy dog.', 20, '
\n'); // * returns 2: 'The quick brown fox
\njumped over the lazy
\n dog.' // * example 3: wordwrap('Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat.'); // * returns 3: 'Lorem ipsum dolor sit amet, consectetur adipisicing elit, sed do eiusmod \ntempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim \nveniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea \ncommodo consequat.' // PHP Defaults var m = ((arguments.length >= 2) ? arguments[1] : 75 ); var b = ((arguments.length >= 3) ? arguments[2] : "\n" ); var c = ((arguments.length >= 4) ? arguments[3] : false); var i, j, l, s, r; str += ''; if (m < 1) { return str; } for (i = -1, l = (r = str.split("\n")).length; ++i < l; r[i] += s) { for(s = r[i], r[i] = ""; s.length > m; r[i] += s.slice(0, j) + ((s = s.slice(j)).length ? b : "")){ j = c == 2 || (j = s.slice(0, m + 1).match(/\S*(\s)?$/))[1] ? m : j.input.length - j[0].length || c == 1 && m || j.input.length + (j = s.slice(m).match(/^\S*/)).input.length; } } return r.join("\n"); }