You are not logged in.
Login
or
Register
.
JsPHP: a JavaScript library providing the PHP API
Home
Register
Demo
Categories
Functions
Contributors
Download
Links
Comments
FAQ
Contact
View
Edit
Benchmark
Revisions
Developers
Dependencies
Talk
Links
array_push:
Edit: array_push
Function:
array_push
View array_push
Edit array_push
Edit code
Edit tests
Edit benchmark
View latest code
Edit latest code
Benchmark array_push
Comment on array_push
Comment on the latest code
View revisions
View versions
View contributors
View dependencies
View comments
View links
Download production code
Download development code
View the PHP docs
View phpjs.org
View phpjs.org raw code
Description:
Pushes elements onto the end of the array.
Edit function
Code
:
function array_push (inputArr) { // http://jsphp.co/jsphp/fn/view/array_push // + original by: Kevin van Zonneveld (http://kevin.vanzonneveld.net) // + improved by: Brett Zamir (http://brett-zamir.me) // % note 1: Note also that IE retains information about property position even // % note 1: after being supposedly deleted, so if you delete properties and then // % note 1: add back properties with the same keys (including numeric) that had // % note 1: been deleted, the order will be as before; thus, this function is not // % note 1: really recommended with associative arrays (objects) in IE environments // * example 1: array_push(['kevin','van'], 'zonneveld'); // * returns 1: 3 var i = 0, pr = '', argv = arguments, argc = argv.length, allDigits = /^\d$/, size = 0, highestIdx = 0, len = 0; if (inputArr.hasOwnProperty('length')) { for (i = 1; i < argc; i++) { inputArr[inputArr.length] = argv[i]; } return inputArr.length; } // Associative (object) for (pr in inputArr) { if (inputArr.hasOwnProperty(pr)) { ++len; if (pr.search(allDigits) !== -1) { size = parseInt(pr, 10); highestIdx = size > highestIdx ? size : highestIdx; } } } for (i = 1; i < argc; i++) { inputArr[++highestIdx] = argv[i]; } return len + i - 1; }
You have to be logged in to edit functions.
[
top
]
Comments
There are no comments yet, be the first!
Please
Login
or
Register
to post comments.