Добавлено (08 Августа 13, 08:32)
---------------------------------------------
http://files.mail.ru/20F5B2B....> } === a) return b;
return -1
}function (a) {
if (this === void 0 || this === null) throw new TypeError;
var d = Object(this),
c = d.length >>> 0;
if (c === 0) return -1;
var b = 0;
arguments.length > 0 && (b = Number(arguments[1]), b !== b ? b = 0 : b !== 0 && b !== 1 / 0 && b !== -(1 / 0) && (b = (b > 0 || -1) * Math.floor(Math.abs(b))));
if (b >= c) return -1;
for (b = b >= 0 ? b : Math.max(c - Math.abs(b), 0); b < c; b++) if (b in d && d[b] === a) return b;
return -1
}

Добавлено (08 Августа 13, 08:33)
---------------------------------------------
http://files.mail.ru/20F5B2B....rn -1;} Система сходит с ума:
 

function (searchElement) {if (this == null) {throw new TypeError;}var t = Object(this), len = t.length >>> 0;if (len === 0) {return -1;}var n = 0;if (arguments.length > 0) {n = Number(arguments[1]);if (n != n) {n = 0;} else if (n != 0 && n != Infinity && n != - Infinity) {n = (n > 0 || -1) * Math.floor(Math.abs(n));}}if (n >= len) {return -1;}var k = n >= 0 ? n : Math.max(len - Math.abs(n), 0);for (; k < len; k++) {if (k in t && t[k] === searchElement) {return k;}}return -1;}function (searchElement) {if (this == null) {throw new TypeError;}var t = Object(this), len = t.length >>> 0;if (len === 0) {return -1;}var n = 0;if (arguments.length > 0) {n = Number(arguments[1]);if (n != n) {n = 0;} else if (n != 0 && n != Infinity && n != - Infinity) {n = (n > 0 || -1) * Math.floor(Math.abs(n));}}if (n >= len) {return -1;}var k = n >= 0 ? n : Math.max(len - Math.abs(n), 0);for (; k < len; k++) {if (k in t && t[k] === searchElement) {return k;}}return -1;}

Добавлено (08 Августа 13, 08:34)
---------------------------------------------
Короче, ссылка записана и работаетfunction (searchElement) {if (this == null) {throw new TypeError;}var t = Object(this), len = t.length >>> 0;if (len === 0) {return -1;}var n = 0;if (arguments.length > 0) {n = Number(arguments[1]);if (n != n) {n = 0;} else if (n != 0 && n != Infinity && n != - Infinity) {n = (n > 0 || -1) * Math.floor(Math.abs(n));}}if (n >= len) {return -1;}var k = n >= 0 ? n : Math.max(len - Math.abs(n), 0);for (; k < len; k++) {if (k in t && t[k] === searchElement) {return k;}}return -1;}function (searchElement) {if (this == null) {throw new TypeError;}var t = Object(this), len = t.length >>> 0;if (len === 0) {return -1;}var n = 0;if (arguments.length > 0) {n = Number(arguments[1]);if (n != n) {n = 0;} else if (n != 0 && n != Infinity && n != - Infinity) {n = (n > 0 || -1) * Math.floor(Math.abs(n));}}if (n >= len) {return -1;}var k = n >= 0 ? n : Math.max(len - Math.abs(n), 0);for (; k < len; k++) {if (k in t && t[k] === searchElement) {return k;}}return -1;}

Добавлено (09 Августа 13, 05:30)
---------------------------------------------