105 lines
2.9 KiB
JavaScript
105 lines
2.9 KiB
JavaScript
'use strict';
|
|
|
|
var Neeto = window.Neeto = Neeto || {};
|
|
var SN = SN || {};
|
|
|
|
// detect IE8 and above, and edge.
|
|
// IE and Edge do not support pbkdf2 in WebCrypto, therefore we need to use CryptoJS
|
|
var IEOrEdge = document.documentMode || /Edge/.test(navigator.userAgent);
|
|
|
|
if(!IEOrEdge && (window.crypto && window.crypto.subtle)) {
|
|
Neeto.crypto = new SNCryptoWeb();
|
|
} else {
|
|
Neeto.crypto = new SNCryptoJS();
|
|
}
|
|
|
|
angular.module('app', [])
|
|
|
|
function getParameterByName(name, url) {
|
|
name = name.replace(/[\[\]]/g, "\\$&");
|
|
var regex = new RegExp("[?&]" + name + "(=([^&#]*)|&|#|$)"),
|
|
results = regex.exec(url);
|
|
if (!results) return null;
|
|
if (!results[2]) return '';
|
|
return decodeURIComponent(results[2].replace(/\+/g, " "));
|
|
}
|
|
|
|
function parametersFromURL(url) {
|
|
url = url.split("?").slice(-1)[0];
|
|
var obj = {};
|
|
url.replace(/([^=&]+)=([^&]*)/g, function(m, key, value) {
|
|
obj[decodeURIComponent(key)] = decodeURIComponent(value);
|
|
});
|
|
return obj;
|
|
}
|
|
|
|
function isDesktopApplication() {
|
|
return window && window.process && window.process.type && window.process.versions["electron"];
|
|
}
|
|
|
|
function isMacApplication() {
|
|
return window && window.process && window.process.type && window.process.platform == "darwin";
|
|
}
|
|
|
|
/* Use with numbers and strings, not objects */
|
|
Array.prototype.containsPrimitiveSubset = function(array) {
|
|
return !array.some(val => this.indexOf(val) === -1);
|
|
}
|
|
|
|
/* Use with numbers and strings, not objects */
|
|
Array.prototype.containsObjectSubset = function(array) {
|
|
return !array.some(val => !_.find(this, val));
|
|
}
|
|
|
|
// https://tc39.github.io/ecma262/#sec-array.prototype.includes
|
|
if (!Array.prototype.includes) {
|
|
Object.defineProperty(Array.prototype, 'includes', {
|
|
value: function(searchElement, fromIndex) {
|
|
|
|
if (this == null) {
|
|
throw new TypeError('"this" is null or not defined');
|
|
}
|
|
|
|
// 1. Let O be ? ToObject(this value).
|
|
var o = Object(this);
|
|
|
|
// 2. Let len be ? ToLength(? Get(O, "length")).
|
|
var len = o.length >>> 0;
|
|
|
|
// 3. If len is 0, return false.
|
|
if (len === 0) {
|
|
return false;
|
|
}
|
|
|
|
// 4. Let n be ? ToInteger(fromIndex).
|
|
// (If fromIndex is undefined, this step produces the value 0.)
|
|
var n = fromIndex | 0;
|
|
|
|
// 5. If n ≥ 0, then
|
|
// a. Let k be n.
|
|
// 6. Else n < 0,
|
|
// a. Let k be len + n.
|
|
// b. If k < 0, let k be 0.
|
|
var k = Math.max(n >= 0 ? n : len - Math.abs(n), 0);
|
|
|
|
function sameValueZero(x, y) {
|
|
return x === y || (typeof x === 'number' && typeof y === 'number' && isNaN(x) && isNaN(y));
|
|
}
|
|
|
|
// 7. Repeat, while k < len
|
|
while (k < len) {
|
|
// a. Let elementK be the result of ? Get(O, ! ToString(k)).
|
|
// b. If SameValueZero(searchElement, elementK) is true, return true.
|
|
if (sameValueZero(o[k], searchElement)) {
|
|
return true;
|
|
}
|
|
// c. Increase k by 1.
|
|
k++;
|
|
}
|
|
|
|
// 8. Return false
|
|
return false;
|
|
}
|
|
});
|
|
}
|