Huge News!Announcing our $40M Series B led by Abstract Ventures.Learn More →
Socket
Sign inDemoInstall
Socket
Sign inDemoInstall

filepond-polyfill

Package Overview
Dependencies
Maintainers
1
Versions
6
Alerts
File Explorer

Advanced tools

License
Socket logo

Install Socket

Detect and block malicious and high-risk dependencies

Install

filepond-polyfill - npm Package Compare versions

Comparing version 1.0.2 to 1.0.3

18

dist/filepond-polyfill.esm.js

@@ -1,6 +0,9 @@

/*
* FilePondPolyfill 1.0.2
* Licensed under MIT, https://opensource.org/licenses/MIT
* Please visit https://pqina.nl/filepond for details.
/*!
* FilePondPluginImageValidateSize 1.0.3
* Licensed under MIT, https://opensource.org/licenses/MIT/
* Please visit https://pqina.nl/filepond/ for details.
*/
/* eslint-disable */
// https://tc39.github.io/ecma262/#sec-array.prototype.find

@@ -247,4 +250,2 @@ if (!Array.prototype.find) {

Array.prototype.some = function(fun /*, thisArg*/) {
'use strict';
if (this == null) {

@@ -274,4 +275,2 @@ throw new TypeError('Array.prototype.some called on null or undefined');

Array.prototype.every = function(callbackfn, thisArg) {
'use strict';
var T, k;

@@ -340,5 +339,2 @@

value: function assign(target, varArgs) {
// .length of function is 2
'use strict';
if (target == null) {

@@ -345,0 +341,0 @@ // TypeError if undefined or null

13

dist/filepond-polyfill.esm.min.js

@@ -1,6 +0,9 @@

/*
* FilePondPolyfill 1.0.2
* Licensed under MIT, https://opensource.org/licenses/MIT
* Please visit https://pqina.nl/filepond for details.
/*!
* FilePondPluginImageValidateSize 1.0.3
* Licensed under MIT, https://opensource.org/licenses/MIT/
* Please visit https://pqina.nl/filepond/ for details.
*/
Array.prototype.find||Object.defineProperty(Array.prototype,"find",{value:function(r){if(null==this)throw new TypeError('"this" is null or not defined');var t=Object(this),e=t.length>>>0;if("function"!=typeof r)throw new TypeError("predicate must be a function");for(var n=arguments[1],o=0;o<e;){var i=t[o];if(r.call(n,i,o,t))return i;o++}}}),Array.prototype.findIndex||Object.defineProperty(Array.prototype,"findIndex",{value:function(r){if(null==this)throw new TypeError('"this" is null or not defined');var t=Object(this),e=t.length>>>0;if("function"!=typeof r)throw new TypeError("predicate must be a function");for(var n=arguments[1],o=0;o<e;){var i=t[o];if(r.call(n,i,o,t))return o;o++}return-1}}),Array.from||(Array.from=function(){var r=Object.prototype.toString,t=function(t){return"function"==typeof t||"[object Function]"===r.call(t)},e=Math.pow(2,53)-1,n=function(r){var t=function(r){var t=Number(r);return isNaN(t)?0:0!==t&&isFinite(t)?(t>0?1:-1)*Math.floor(Math.abs(t)):t}(r);return Math.min(Math.max(t,0),e)};return function(r){var e=Object(r);if(null==r)throw new TypeError("Array.from requires an array-like object - not null or undefined");var o,i=arguments.length>1?arguments[1]:void 0;if(void 0!==i){if(!t(i))throw new TypeError("Array.from: when provided, the second argument must be a function");arguments.length>2&&(o=arguments[2])}for(var u,a=n(e.length),f=t(this)?Object(new this(a)):new Array(a),l=0;l<a;)u=e[l],f[l]=i?void 0===o?i(u,l):i.call(o,u,l):u,l+=1;return f.length=a,f}}()),Array.prototype.includes||Object.defineProperty(Array.prototype,"includes",{value:function(r,t){function e(r,t){return r===t||"number"==typeof r&&"number"==typeof t&&isNaN(r)&&isNaN(t)}if(null==this)throw new TypeError('"this" is null or not defined');var n=Object(this),o=n.length>>>0;if(0===o)return!1;for(var i=0|t,u=Math.max(i>=0?i:o-Math.abs(i),0);u<o;){if(e(n[u],r))return!0;u++}return!1}}),Array.prototype.some||(Array.prototype.some=function(r){"use strict";if(null==this)throw new TypeError("Array.prototype.some called on null or undefined");if("function"!=typeof r)throw new TypeError;for(var t=Object(this),e=t.length>>>0,n=arguments.length>=2?arguments[1]:void 0,o=0;o<e;o++)if(o in t&&r.call(n,t[o],o,t))return!0;return!1}),Array.prototype.every||(Array.prototype.every=function(r,t){"use strict";var e,n;if(null==this)throw new TypeError("this is null or not defined");var o=Object(this),i=o.length>>>0;if("function"!=typeof r)throw new TypeError;for(arguments.length>1&&(e=t),n=0;n<i;){var u;if(n in o){u=o[n];if(!r.call(e,u,n,o))return!1}n++}return!0}),"function"!=typeof Object.assign&&Object.defineProperty(Object,"assign",{value:function(r,t){"use strict";if(null==r)throw new TypeError("Cannot convert undefined or null to object");for(var e=Object(r),n=1;n<arguments.length;n++){var o=arguments[n];if(null!=o)for(var i in o)Object.prototype.hasOwnProperty.call(o,i)&&(e[i]=o[i])}return e},writable:!0,configurable:!0}),function(){function r(r,t){t=t||{bubbles:!1,cancelable:!1,detail:void 0};var e=document.createEvent("CustomEvent");return e.initCustomEvent(r,t.bubbles,t.cancelable,t.detail),e}if("function"==typeof window.CustomEvent)return!1;r.prototype=window.Event.prototype,window.CustomEvent=r}();
/* eslint-disable */
var r,t,e,n;Array.prototype.find||Object.defineProperty(Array.prototype,"find",{value:function(r){if(null==this)throw new TypeError('"this" is null or not defined');var t=Object(this),e=t.length>>>0;if("function"!=typeof r)throw new TypeError("predicate must be a function");for(var n=arguments[1],o=0;o<e;){var i=t[o];if(r.call(n,i,o,t))return i;o++}}}),Array.prototype.findIndex||Object.defineProperty(Array.prototype,"findIndex",{value:function(r){if(null==this)throw new TypeError('"this" is null or not defined');var t=Object(this),e=t.length>>>0;if("function"!=typeof r)throw new TypeError("predicate must be a function");for(var n=arguments[1],o=0;o<e;){var i=t[o];if(r.call(n,i,o,t))return o;o++}return-1}}),Array.from||(Array.from=(r=Object.prototype.toString,t=function(t){return"function"==typeof t||"[object Function]"===r.call(t)},e=Math.pow(2,53)-1,n=function(r){var t=function(r){var t=Number(r);return isNaN(t)?0:0!==t&&isFinite(t)?(t>0?1:-1)*Math.floor(Math.abs(t)):t}(r);return Math.min(Math.max(t,0),e)},function(r){var e=Object(r);if(null==r)throw new TypeError("Array.from requires an array-like object - not null or undefined");var o,i=arguments.length>1?arguments[1]:void 0;if(void 0!==i){if(!t(i))throw new TypeError("Array.from: when provided, the second argument must be a function");arguments.length>2&&(o=arguments[2])}for(var a,f=n(e.length),u=t(this)?Object(new this(f)):new Array(f),l=0;l<f;)a=e[l],u[l]=i?void 0===o?i(a,l):i.call(o,a,l):a,l+=1;return u.length=f,u})),Array.prototype.includes||Object.defineProperty(Array.prototype,"includes",{value:function(r,t){if(null==this)throw new TypeError('"this" is null or not defined');var e=Object(this),n=e.length>>>0;if(0===n)return!1;var o,i,a=0|t,f=Math.max(a>=0?a:n-Math.abs(a),0);for(;f<n;){if((o=e[f])===(i=r)||"number"==typeof o&&"number"==typeof i&&isNaN(o)&&isNaN(i))return!0;f++}return!1}}),Array.prototype.some||(Array.prototype.some=function(r){if(null==this)throw new TypeError("Array.prototype.some called on null or undefined");if("function"!=typeof r)throw new TypeError;for(var t=Object(this),e=t.length>>>0,n=arguments.length>=2?arguments[1]:void 0,o=0;o<e;o++)if(o in t&&r.call(n,t[o],o,t))return!0;return!1}),Array.prototype.every||(Array.prototype.every=function(r,t){var e,n;if(null==this)throw new TypeError("this is null or not defined");var o=Object(this),i=o.length>>>0;if("function"!=typeof r)throw new TypeError;for(arguments.length>1&&(e=t),n=0;n<i;){var a;if(n in o)if(a=o[n],!r.call(e,a,n,o))return!1;n++}return!0}),"function"!=typeof Object.assign&&Object.defineProperty(Object,"assign",{value:function(r,t){if(null==r)throw new TypeError("Cannot convert undefined or null to object");for(var e=Object(r),n=1;n<arguments.length;n++){var o=arguments[n];if(null!=o)for(var i in o)Object.prototype.hasOwnProperty.call(o,i)&&(e[i]=o[i])}return e},writable:!0,configurable:!0}),function(){if("function"==typeof window.CustomEvent)return!1;function r(r,t){t=t||{bubbles:!1,cancelable:!1,detail:void 0};var e=document.createEvent("CustomEvent");return e.initCustomEvent(r,t.bubbles,t.cancelable,t.detail),e}r.prototype=window.Event.prototype,window.CustomEvent=r}();

191

dist/filepond-polyfill.js

@@ -1,11 +0,12 @@

/*
* FilePondPolyfill 1.0.2
* Licensed under MIT, https://opensource.org/licenses/MIT
* Please visit https://pqina.nl/filepond for details.
/*!
* FilePondPluginImageValidateSize 1.0.3
* Licensed under MIT, https://opensource.org/licenses/MIT/
* Please visit https://pqina.nl/filepond/ for details.
*/
(function(global, factory) {
typeof exports === 'object' && typeof module !== 'undefined'
? factory()
: typeof define === 'function' && define.amd ? define(factory) : factory();
})(this, function() {
/* eslint-disable */
(function(factory) {
typeof define === 'function' && define.amd ? define(factory) : factory();
})(function() {
'use strict';

@@ -22,19 +23,14 @@

var o = Object(this);
var o = Object(this); // 2. Let len be ? ToLength(? Get(O, "length")).
// 2. Let len be ? ToLength(? Get(O, "length")).
var len = o.length >>> 0;
var len = o.length >>> 0; // 3. If IsCallable(predicate) is false, throw a TypeError exception.
// 3. If IsCallable(predicate) is false, throw a TypeError exception.
if (typeof predicate !== 'function') {
throw new TypeError('predicate must be a function');
}
} // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.
// 4. If thisArg was supplied, let T be thisArg; else let T be undefined.
var thisArg = arguments[1];
var thisArg = arguments[1]; // 5. Let k be 0.
// 5. Let k be 0.
var k = 0;
var k = 0; // 6. Repeat, while k < len
// 6. Repeat, while k < len
while (k < len) {

@@ -46,10 +42,10 @@ // a. Let Pk be ! ToString(k).

var kValue = o[k];
if (predicate.call(thisArg, kValue, k, o)) {
return kValue;
}
// e. Increase k by 1.
} // e. Increase k by 1.
k++;
}
} // 7. Return undefined.
// 7. Return undefined.
return undefined;

@@ -69,19 +65,14 @@ }

var o = Object(this);
var o = Object(this); // 2. Let len be ? ToLength(? Get(O, "length")).
// 2. Let len be ? ToLength(? Get(O, "length")).
var len = o.length >>> 0;
var len = o.length >>> 0; // 3. If IsCallable(predicate) is false, throw a TypeError exception.
// 3. If IsCallable(predicate) is false, throw a TypeError exception.
if (typeof predicate !== 'function') {
throw new TypeError('predicate must be a function');
}
} // 4. If thisArg was supplied, let T be thisArg; else let T be undefined.
// 4. If thisArg was supplied, let T be thisArg; else let T be undefined.
var thisArg = arguments[1];
var thisArg = arguments[1]; // 5. Let k be 0.
// 5. Let k be 0.
var k = 0;
var k = 0; // 6. Repeat, while k < len
// 6. Repeat, while k < len
while (k < len) {

@@ -93,10 +84,10 @@ // a. Let Pk be ! ToString(k).

var kValue = o[k];
if (predicate.call(thisArg, kValue, k, o)) {
return k;
}
// e. Increase k by 1.
} // e. Increase k by 1.
k++;
}
} // 7. Return -1.
// 7. Return -1.
return -1;

@@ -111,2 +102,3 @@ }

var toStr = Object.prototype.toString;
var isCallable = function isCallable(fn) {

@@ -117,27 +109,33 @@ return (

};
var toInteger = function toInteger(value) {
var number = Number(value);
if (isNaN(number)) {
return 0;
}
if (number === 0 || !isFinite(number)) {
return number;
}
return (number > 0 ? 1 : -1) * Math.floor(Math.abs(number));
};
var maxSafeInteger = Math.pow(2, 53) - 1;
var toLength = function toLength(value) {
var len = toInteger(value);
return Math.min(Math.max(len, 0), maxSafeInteger);
};
}; // The length property of the from method is 1.
// The length property of the from method is 1.
return function from(arrayLike /*, mapFn, thisArg */) {
return function from(
arrayLike
/*, mapFn, thisArg */
) {
// 1. Let C be the this value.
var C = this;
var C = this; // 2. Let items be ToObject(arrayLike).
// 2. Let items be ToObject(arrayLike).
var items = Object(arrayLike);
var items = Object(arrayLike); // 3. ReturnIfAbrupt(items).
// 3. ReturnIfAbrupt(items).
if (arrayLike == null) {

@@ -147,7 +145,7 @@ throw new TypeError(

);
}
} // 4. If mapfn is undefined, then let mapping be false.
// 4. If mapfn is undefined, then let mapping be false.
var mapFn = arguments.length > 1 ? arguments[1] : void undefined;
var T;
if (typeof mapFn !== 'undefined') {

@@ -160,26 +158,24 @@ // 5. else

);
}
} // 5. b. If thisArg was supplied, let T be thisArg; else let T be undefined.
// 5. b. If thisArg was supplied, let T be thisArg; else let T be undefined.
if (arguments.length > 2) {
T = arguments[2];
}
}
// 10. Let lenValue be Get(items, "length").
} // 10. Let lenValue be Get(items, "length").
// 11. Let len be ToLength(lenValue).
var len = toLength(items.length);
// 13. If IsConstructor(C) is true, then
var len = toLength(items.length); // 13. If IsConstructor(C) is true, then
// 13. a. Let A be the result of calling the [[Construct]] internal method
// of C with an argument list containing the single item len.
// 14. a. Else, Let A be ArrayCreate(len).
var A = isCallable(C) ? Object(new C(len)) : new Array(len);
// 16. Let k be 0.
var k = 0;
// 17. Repeat, while k < len… (also steps a - h)
var A = isCallable(C) ? Object(new C(len)) : new Array(len); // 16. Let k be 0.
var k = 0; // 17. Repeat, while k < len… (also steps a - h)
var kValue;
while (k < len) {
kValue = items[k];
if (mapFn) {

@@ -193,7 +189,8 @@ A[k] =

}
k += 1;
}
// 18. Let putStatus be Put(A, "length", len, true).
A.length = len;
// 20. Return A.
} // 18. Let putStatus be Put(A, "length", len, true).
A.length = len; // 20. Return A.
return A;

@@ -213,17 +210,12 @@ };

var o = Object(this);
var o = Object(this); // 2. Let len be ? ToLength(? Get(O, "length")).
// 2. Let len be ? ToLength(? Get(O, "length")).
var len = o.length >>> 0;
var len = o.length >>> 0; // 3. If len is 0, return false.
// 3. If len is 0, return false.
if (len === 0) {
return false;
}
// 4. Let n be ? ToInteger(fromIndex).
} // 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
var n = fromIndex | 0; // 5. If n ≥ 0, then
// a. Let k be n.

@@ -233,2 +225,3 @@ // 6. Else n < 0,

// b. If k < 0, let k be 0.
var k = Math.max(n >= 0 ? n : len - Math.abs(n), 0);

@@ -244,5 +237,4 @@

);
}
} // 7. Repeat, while k < len
// 7. Repeat, while k < len
while (k < len) {

@@ -255,6 +247,6 @@ // a. Let elementK be the result of ? Get(O, ! ToString(k)).

}
k++;
}
} // 8. Return false
// 8. Return false
return false;

@@ -268,5 +260,6 @@ }

if (!Array.prototype.some) {
Array.prototype.some = function(fun /*, thisArg*/) {
'use strict';
Array.prototype.some = function(
fun
/*, thisArg*/
) {
if (this == null) {

@@ -282,4 +275,4 @@ throw new TypeError('Array.prototype.some called on null or undefined');

var len = t.length >>> 0;
var thisArg = arguments.length >= 2 ? arguments[1] : void 0;
var thisArg = arguments.length >= 2 ? arguments[1] : void 0;
for (var i = 0; i < len; i++) {

@@ -297,4 +290,2 @@ if (i in t && fun.call(thisArg, t[i], i, t)) {

Array.prototype.every = function(callbackfn, thisArg) {
'use strict';
var T, k;

@@ -304,31 +295,23 @@

throw new TypeError('this is null or not defined');
}
// 1. Let O be the result of calling ToObject passing the this
} // 1. Let O be the result of calling ToObject passing the this
// value as the argument.
var O = Object(this);
// 2. Let lenValue be the result of calling the Get internal method
var O = Object(this); // 2. Let lenValue be the result of calling the Get internal method
// of O with the argument "length".
// 3. Let len be ToUint32(lenValue).
var len = O.length >>> 0;
// 4. If IsCallable(callbackfn) is false, throw a TypeError exception.
var len = O.length >>> 0; // 4. If IsCallable(callbackfn) is false, throw a TypeError exception.
if (typeof callbackfn !== 'function') {
throw new TypeError();
}
} // 5. If thisArg was supplied, let T be thisArg; else let T be undefined.
// 5. If thisArg was supplied, let T be thisArg; else let T be undefined.
if (arguments.length > 1) {
T = thisArg;
}
} // 6. Let k be 0.
// 6. Let k be 0.
k = 0;
k = 0; // 7. Repeat, while k < len
// 7. Repeat, while k < len
while (k < len) {
var kValue;
// a. Let Pk be ToString(k).
var kValue; // a. Let Pk be ToString(k).
// This is implicit for LHS operands of the in operator

@@ -339,13 +322,12 @@ // b. Let kPresent be the result of calling the HasProperty internal

// c. If kPresent is true, then
if (k in O) {
// i. Let kValue be the result of calling the Get internal method
// of O with argument Pk.
kValue = O[k];
// ii. Let testResult be the result of calling the Call internal method
kValue = O[k]; // ii. Let testResult be the result of calling the Call internal method
// of callbackfn with T as the this value and argument list
// containing kValue, k, and O.
var testResult = callbackfn.call(T, kValue, k, O);
// iii. If ToBoolean(testResult) is false, return false.
var testResult = callbackfn.call(T, kValue, k, O); // iii. If ToBoolean(testResult) is false, return false.
if (!testResult) {

@@ -355,4 +337,6 @@ return false;

}
k++;
}
return true;

@@ -366,5 +350,2 @@ };

value: function assign(target, varArgs) {
// .length of function is 2
'use strict';
if (target == null) {

@@ -390,2 +371,3 @@ // TypeError if undefined or null

}
return to;

@@ -419,5 +401,4 @@ },

CustomEvent.prototype = window.Event.prototype;
window.CustomEvent = CustomEvent;
})();
});

13

dist/filepond-polyfill.min.js

@@ -1,6 +0,9 @@

/*
* FilePondPolyfill 1.0.2
* Licensed under MIT, https://opensource.org/licenses/MIT
* Please visit https://pqina.nl/filepond for details.
/*!
* FilePondPluginImageValidateSize 1.0.3
* Licensed under MIT, https://opensource.org/licenses/MIT/
* Please visit https://pqina.nl/filepond/ for details.
*/
!function(r,e){"object"==typeof exports&&"undefined"!=typeof module?e():"function"==typeof define&&define.amd?define(e):e()}(this,function(){"use strict";Array.prototype.find||Object.defineProperty(Array.prototype,"find",{value:function(r){if(null==this)throw new TypeError('"this" is null or not defined');var e=Object(this),t=e.length>>>0;if("function"!=typeof r)throw new TypeError("predicate must be a function");for(var n=arguments[1],o=0;o<t;){var i=e[o];if(r.call(n,i,o,e))return i;o++}}}),Array.prototype.findIndex||Object.defineProperty(Array.prototype,"findIndex",{value:function(r){if(null==this)throw new TypeError('"this" is null or not defined');var e=Object(this),t=e.length>>>0;if("function"!=typeof r)throw new TypeError("predicate must be a function");for(var n=arguments[1],o=0;o<t;){var i=e[o];if(r.call(n,i,o,e))return o;o++}return-1}}),Array.from||(Array.from=function(){var r=Object.prototype.toString,e=function(e){return"function"==typeof e||"[object Function]"===r.call(e)},t=function(r){var e=Number(r);return isNaN(e)?0:0!==e&&isFinite(e)?(e>0?1:-1)*Math.floor(Math.abs(e)):e},n=Math.pow(2,53)-1,o=function(r){var e=t(r);return Math.min(Math.max(e,0),n)};return function(r){var t=this,n=Object(r);if(null==r)throw new TypeError("Array.from requires an array-like object - not null or undefined");var i,f=arguments.length>1?arguments[1]:void 0;if("undefined"!=typeof f){if(!e(f))throw new TypeError("Array.from: when provided, the second argument must be a function");arguments.length>2&&(i=arguments[2])}for(var u,a=o(n.length),l=e(t)?Object(new t(a)):new Array(a),c=0;c<a;)u=n[c],f?l[c]="undefined"==typeof i?f(u,c):f.call(i,u,c):l[c]=u,c+=1;return l.length=a,l}}()),Array.prototype.includes||Object.defineProperty(Array.prototype,"includes",{value:function(r,e){function t(r,e){return r===e||"number"==typeof r&&"number"==typeof e&&isNaN(r)&&isNaN(e)}if(null==this)throw new TypeError('"this" is null or not defined');var n=Object(this),o=n.length>>>0;if(0===o)return!1;for(var i=0|e,f=Math.max(i>=0?i:o-Math.abs(i),0);f<o;){if(t(n[f],r))return!0;f++}return!1}}),Array.prototype.some||(Array.prototype.some=function(r){if(null==this)throw new TypeError("Array.prototype.some called on null or undefined");if("function"!=typeof r)throw new TypeError;for(var e=Object(this),t=e.length>>>0,n=arguments.length>=2?arguments[1]:void 0,o=0;o<t;o++)if(o in e&&r.call(n,e[o],o,e))return!0;return!1}),Array.prototype.every||(Array.prototype.every=function(r,e){var t,n;if(null==this)throw new TypeError("this is null or not defined");var o=Object(this),i=o.length>>>0;if("function"!=typeof r)throw new TypeError;for(arguments.length>1&&(t=e),n=0;n<i;){var f;if(n in o){f=o[n];var u=r.call(t,f,n,o);if(!u)return!1}n++}return!0}),"function"!=typeof Object.assign&&Object.defineProperty(Object,"assign",{value:function(r,e){if(null==r)throw new TypeError("Cannot convert undefined or null to object");for(var t=Object(r),n=1;n<arguments.length;n++){var o=arguments[n];if(null!=o)for(var i in o)Object.prototype.hasOwnProperty.call(o,i)&&(t[i]=o[i])}return t},writable:!0,configurable:!0}),function(){function r(r,e){e=e||{bubbles:!1,cancelable:!1,detail:void 0};var t=document.createEvent("CustomEvent");return t.initCustomEvent(r,e.bubbles,e.cancelable,e.detail),t}return"function"!=typeof window.CustomEvent&&(r.prototype=window.Event.prototype,void(window.CustomEvent=r))}()});
/* eslint-disable */
!function(r){"function"==typeof define&&define.amd?define(r):r()}(function(){"use strict";var r,t,e,n;Array.prototype.find||Object.defineProperty(Array.prototype,"find",{value:function(r){if(null==this)throw new TypeError('"this" is null or not defined');var t=Object(this),e=t.length>>>0;if("function"!=typeof r)throw new TypeError("predicate must be a function");for(var n=arguments[1],o=0;o<e;){var i=t[o];if(r.call(n,i,o,t))return i;o++}}}),Array.prototype.findIndex||Object.defineProperty(Array.prototype,"findIndex",{value:function(r){if(null==this)throw new TypeError('"this" is null or not defined');var t=Object(this),e=t.length>>>0;if("function"!=typeof r)throw new TypeError("predicate must be a function");for(var n=arguments[1],o=0;o<e;){var i=t[o];if(r.call(n,i,o,t))return o;o++}return-1}}),Array.from||(Array.from=(r=Object.prototype.toString,t=function(t){return"function"==typeof t||"[object Function]"===r.call(t)},e=Math.pow(2,53)-1,n=function(r){var t=function(r){var t=Number(r);return isNaN(t)?0:0!==t&&isFinite(t)?(t>0?1:-1)*Math.floor(Math.abs(t)):t}(r);return Math.min(Math.max(t,0),e)},function(r){var e=Object(r);if(null==r)throw new TypeError("Array.from requires an array-like object - not null or undefined");var o,i=arguments.length>1?arguments[1]:void 0;if(void 0!==i){if(!t(i))throw new TypeError("Array.from: when provided, the second argument must be a function");arguments.length>2&&(o=arguments[2])}for(var f,a=n(e.length),u=t(this)?Object(new this(a)):new Array(a),l=0;l<a;)f=e[l],u[l]=i?void 0===o?i(f,l):i.call(o,f,l):f,l+=1;return u.length=a,u})),Array.prototype.includes||Object.defineProperty(Array.prototype,"includes",{value:function(r,t){if(null==this)throw new TypeError('"this" is null or not defined');var e=Object(this),n=e.length>>>0;if(0===n)return!1;var o,i,f=0|t,a=Math.max(f>=0?f:n-Math.abs(f),0);for(;a<n;){if((o=e[a])===(i=r)||"number"==typeof o&&"number"==typeof i&&isNaN(o)&&isNaN(i))return!0;a++}return!1}}),Array.prototype.some||(Array.prototype.some=function(r){if(null==this)throw new TypeError("Array.prototype.some called on null or undefined");if("function"!=typeof r)throw new TypeError;for(var t=Object(this),e=t.length>>>0,n=arguments.length>=2?arguments[1]:void 0,o=0;o<e;o++)if(o in t&&r.call(n,t[o],o,t))return!0;return!1}),Array.prototype.every||(Array.prototype.every=function(r,t){var e,n;if(null==this)throw new TypeError("this is null or not defined");var o=Object(this),i=o.length>>>0;if("function"!=typeof r)throw new TypeError;for(arguments.length>1&&(e=t),n=0;n<i;){var f;if(n in o)if(f=o[n],!r.call(e,f,n,o))return!1;n++}return!0}),"function"!=typeof Object.assign&&Object.defineProperty(Object,"assign",{value:function(r,t){if(null==r)throw new TypeError("Cannot convert undefined or null to object");for(var e=Object(r),n=1;n<arguments.length;n++){var o=arguments[n];if(null!=o)for(var i in o)Object.prototype.hasOwnProperty.call(o,i)&&(e[i]=o[i])}return e},writable:!0,configurable:!0}),function(){if("function"==typeof window.CustomEvent)return!1;function r(r,t){t=t||{bubbles:!1,cancelable:!1,detail:void 0};var e=document.createEvent("CustomEvent");return e.initCustomEvent(r,t.bubbles,t.cancelable,t.detail),e}r.prototype=window.Event.prototype,window.CustomEvent=r}()});

30

package.json
{
"name": "filepond-polyfill",
"version": "1.0.2",
"version": "1.0.3",
"description": "Polyfill for FilePond",
"homepage": "https://pqina.nl/filepond",
"license": "MIT",
"author": {
"name": "PQINA",
"url": "https://pqina.nl/"
},
"homepage": "https://pqina.nl/filepond/",
"repository": "pqina/filepond-polyfill",

@@ -10,7 +15,20 @@ "main": "dist/filepond-polyfill.js",

"module": "dist/filepond-polyfill.js",
"license": "MIT",
"author": {
"name": "PQINA",
"url": "https://pqina.nl"
"files": [
"dist"
],
"scripts": {
"start": "npx rollup -c -w",
"build": "npx rollup -c"
},
"devDependencies": {
"@babel/core": "^7.4.0",
"@babel/preset-env": "^7.4.2",
"rollup": "^1.7.0",
"rollup-plugin-babel": "^4.3.2",
"rollup-plugin-commonjs": "^9.2.1",
"rollup-plugin-license": "^0.8.1",
"rollup-plugin-node-resolve": "^4.0.1",
"rollup-plugin-prettier": "^0.6.0",
"rollup-plugin-terser": "^4.0.4"
}
}

2

README.md

@@ -5,2 +5,2 @@ # FilePond Polyfill

https://pqina.nl/filepond
https://pqina.nl/filepond/
.gitattributes
LICENSE

Sorry, the diff of this file is not supported yet

SocketSocket SOC 2 Logo

Product

  • Package Alerts
  • Integrations
  • Docs
  • Pricing
  • FAQ
  • Roadmap
  • Changelog

About

Packages

npm

Go

Maven

PyPI

Rubygems

Stay in touch

Get open source security insights delivered straight into your inbox.

  • Terms
  • Privacy
  • Security

Made with ⚡️ by Socket Inc