Here you can find the source of searchById(id)
Array.prototype.searchById = function(id){ for(var i=0; i<this.length; i++){ if(this[i].id === id){ return this[i]; }//from w w w .ja va 2 s .c om } };
Array.prototype.search = function(n) { var start = 0; var end = this.length - 1; var result = {count: 0, index: -1, length: this.length}; while (start <= end) { mid = (start + end) / 2 >> 0; if (this[start] === n) { result.index = start; return result; ...
Array.prototype.search = function(search_func){ for (var i= 0; i<this.length; i++){ if (search_func(this[i]) == 0) return this[i] return null;
Array.prototype.search = function(v){ for (i=0;i<this.length;i++) { if (this[i]===v) return i;
Array.prototype.search = function(value){ var startIndex = 0, stopIndex = this.length - 1, middle = Math.floor((stopIndex + startIndex)/2); var count = 0; while(this[middle] != value && startIndex < stopIndex){ if (value < this[middle]){ stopIndex = middle - 1; }else if (value > this[middle]){ ...
Array.prototype.search = function(value){ var startIndex = 0, stopIndex = this.length - 1, middle = Math.floor((stopIndex + startIndex)/2); var count = 0; while(this[middle] != value && startIndex < stopIndex){ count+=1; if (value < this[middle]){ stopIndex = middle - 1; ...
"use strict"; Array.prototype.searchIndex = function(n){ var result = [], i, l= this.length; for( i= 0; i< l; i++){ if(this[i] == n){ result.push(i); if(result.length == 0){ result.push(-1); return result; }; var arr = [1,2,5,5,5,5,5,6,9]; console.log(arr.searchIndex(5)); console.log(arr.searchIndex(0));
'use strict'; Array.prototype.searchObject = function (filterParams) { return this.filter(function (v) { return recursiveMatchFunc(v, filterParams); }); }; Array.prototype.randomSelect = function () { return this[Math.floor(Math.random() * this.length)]; }; ...