mirror of
https://github.com/DanielnetoDotCom/YouPHPTube
synced 2025-10-05 19:42:38 +02:00
Libs updates and new version with option to pin videos on channel
This commit is contained in:
parent
e1f2188de0
commit
1beab3b1c0
8565 changed files with 149805 additions and 165674 deletions
80
node_modules/inputmask/lib/polyfills/Array.includes.js
generated
vendored
80
node_modules/inputmask/lib/polyfills/Array.includes.js
generated
vendored
|
@ -1,48 +1,46 @@
|
|||
// https://tc39.github.io/ecma262/#sec-array.prototype.includes
|
||||
if (!Array.prototype.includes) {
|
||||
Object.defineProperty(Array.prototype, "includes", {
|
||||
value: function(searchElement, fromIndex) {
|
||||
// eslint-disable-next-line no-extend-native
|
||||
Object.defineProperty(Array.prototype, "includes", {
|
||||
value: function (searchElement, fromIndex) {
|
||||
// 1. Let O be ? ToObject(this value).
|
||||
if (this == null) {
|
||||
throw new TypeError('"this" is null or not defined');
|
||||
}
|
||||
|
||||
// 1. Let O be ? ToObject(this value).
|
||||
if (this == null) {
|
||||
throw new TypeError("\"this\" is null or not defined");
|
||||
}
|
||||
const o = Object(this),
|
||||
// 2. Let len be ? ToLength(? Get(O, "length")).
|
||||
len = o.length >>> 0;
|
||||
|
||||
var o = Object(this);
|
||||
// 3. If len is 0, return false.
|
||||
if (len === 0) {
|
||||
return false;
|
||||
}
|
||||
|
||||
// 2. Let len be ? ToLength(? Get(O, "length")).
|
||||
var len = o.length >>> 0;
|
||||
// 4. Let n be ? ToInteger(fromIndex).
|
||||
// (If fromIndex is undefined, this step produces the value 0.)
|
||||
let 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.
|
||||
k = Math.max(n >= 0 ? n : len - Math.abs(n), 0);
|
||||
|
||||
// 3. If len is 0, return false.
|
||||
if (len === 0) {
|
||||
return false;
|
||||
}
|
||||
// 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.
|
||||
// c. Increase k by 1.
|
||||
// NOTE: === provides the correct "SameValueZero" comparison needed here.
|
||||
if (o[k] === searchElement) {
|
||||
return true;
|
||||
}
|
||||
k++;
|
||||
}
|
||||
|
||||
// 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);
|
||||
|
||||
// 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.
|
||||
// c. Increase k by 1.
|
||||
// NOTE: === provides the correct "SameValueZero" comparison needed here.
|
||||
if (o[k] === searchElement) {
|
||||
return true;
|
||||
}
|
||||
k++;
|
||||
}
|
||||
|
||||
// 8. Return false
|
||||
return false;
|
||||
}
|
||||
});
|
||||
}
|
||||
// 8. Return false
|
||||
return false;
|
||||
}
|
||||
});
|
||||
}
|
||||
|
|
27
node_modules/inputmask/lib/polyfills/Object.entries.js
generated
vendored
27
node_modules/inputmask/lib/polyfills/Object.entries.js
generated
vendored
|
@ -1,10 +1,21 @@
|
|||
const reduce = Function.bind.call(Function.call, Array.prototype.reduce);
|
||||
const isEnumerable = Function.bind.call(Function.call, Object.prototype.propertyIsEnumerable);
|
||||
const concat = Function.bind.call(Function.call, Array.prototype.concat);
|
||||
const keys = Object.keys;
|
||||
const reduce = Function.bind.call(Function.call, Array.prototype.reduce),
|
||||
isEnumerable = Function.bind.call(
|
||||
Function.call,
|
||||
Object.prototype.propertyIsEnumerable
|
||||
),
|
||||
concat = Function.bind.call(Function.call, Array.prototype.concat),
|
||||
keys = Object.keys;
|
||||
|
||||
if (!Object.entries) {
|
||||
Object.entries = function entries(O) {
|
||||
return reduce(keys(O), (e, k) => concat(e, typeof k === 'string' && isEnumerable(O, k) ? [[k, O[k]]] : []), []);
|
||||
};
|
||||
}
|
||||
Object.entries = function entries(O) {
|
||||
return reduce(
|
||||
keys(O),
|
||||
(e, k) =>
|
||||
concat(
|
||||
e,
|
||||
typeof k === "string" && isEnumerable(O, k) ? [[k, O[k]]] : []
|
||||
),
|
||||
[]
|
||||
);
|
||||
};
|
||||
}
|
||||
|
|
15
node_modules/inputmask/lib/polyfills/Object.getPrototypeOf.js
generated
vendored
15
node_modules/inputmask/lib/polyfills/Object.getPrototypeOf.js
generated
vendored
|
@ -1,7 +1,10 @@
|
|||
if (typeof Object.getPrototypeOf !== "function") {
|
||||
Object.getPrototypeOf = typeof "test".__proto__ === "object" ? function (object) {
|
||||
return object.__proto__;
|
||||
} : function (object) {
|
||||
return object.constructor.prototype;
|
||||
};
|
||||
}
|
||||
Object.getPrototypeOf =
|
||||
typeof "test".__proto__ === "object"
|
||||
? function (object) {
|
||||
return object.__proto__;
|
||||
}
|
||||
: function (object) {
|
||||
return object.constructor.prototype;
|
||||
};
|
||||
}
|
||||
|
|
23
node_modules/inputmask/lib/polyfills/String.includes.js
generated
vendored
23
node_modules/inputmask/lib/polyfills/String.includes.js
generated
vendored
|
@ -1,13 +1,14 @@
|
|||
if (!String.prototype.includes) {
|
||||
String.prototype.includes = function(search, start) {
|
||||
if (typeof start !== 'number') {
|
||||
start = 0;
|
||||
}
|
||||
// eslint-disable-next-line no-extend-native
|
||||
String.prototype.includes = function (search, start) {
|
||||
if (typeof start !== "number") {
|
||||
start = 0;
|
||||
}
|
||||
|
||||
if (start + search.length > this.length) {
|
||||
return false;
|
||||
} else {
|
||||
return this.indexOf(search, start) !== -1;
|
||||
}
|
||||
};
|
||||
}
|
||||
if (start + search.length > this.length) {
|
||||
return false;
|
||||
} else {
|
||||
return this.indexOf(search, start) !== -1;
|
||||
}
|
||||
};
|
||||
}
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue