@difizen/libro-common 0.1.0 → 0.1.2

package/es/array.d.ts

@@ -0,0 +1,368 @@
+/**
+ * Find the index of the first occurrence of a value in an array.
+ *
+ * @param array - The array-like object to search.
+ *
+ * @param value - The value to locate in the array. Values are
+ *   compared using strict `===` equality.
+ *
+ * @param start - The index of the first element in the range to be
+ *   searched, inclusive. The default value is `0`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @param stop - The index of the last element in the range to be
+ *   searched, inclusive. The default value is `-1`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @returns The index of the first occurrence of the value, or `-1`
+ *   if the value is not found.
+ *
+ * #### Notes
+ * If `stop < start` the search will wrap at the end of the array.
+ *
+ * #### Complexity
+ * Linear.
+ *
+ * #### Undefined Behavior
+ * A `start` or `stop` which is non-integral.
+ *
+ * #### Example
+ * ```typescript
+ *
+ * let data = ['one', 'two', 'three', 'four', 'one'];
+ * firstIndexOfArray(data, 'red');        // -1
+ * firstIndexOfArray(data, 'one');        // 0
+ * firstIndexOfArray(data, 'one', 1);     // 4
+ * firstIndexOfArray(data, 'two', 2);     // -1
+ * firstIndexOfArray(data, 'two', 2, 1);  // 1
+ * ```
+ */
+export declare function firstIndexOfArray<T>(array: ArrayLike<T>, value: T, start?: number, stop?: number): number;
+/**
+ * Find the index of the first value which matches a predicate.
+ *
+ * @param array - The array-like object to search.
+ *
+ * @param fn - The predicate function to apply to the values.
+ *
+ * @param start - The index of the first element in the range to be
+ *   searched, inclusive. The default value is `0`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @param stop - The index of the last element in the range to be
+ *   searched, inclusive. The default value is `-1`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @returns The index of the first matching value, or `-1` if no
+ *   matching value is found.
+ *
+ * #### Notes
+ * If `stop < start` the search will wrap at the end of the array.
+ *
+ * #### Complexity
+ * Linear.
+ *
+ * #### Undefined Behavior
+ * A `start` or `stop` which is non-integral.
+ *
+ * Modifying the length of the array while searching.
+ *
+ * #### Example
+ * ```typescript
+ *
+ * function isEven(value: number): boolean {
+ *   return value % 2 === 0;
+ * }
+ *
+ * let data = [1, 2, 3, 4, 3, 2, 1];
+ * findFirstArrayIndex(data, isEven);       // 1
+ * findFirstArrayIndex(data, isEven, 4);    // 5
+ * findFirstArrayIndex(data, isEven, 6);    // -1
+ * findFirstArrayIndex(data, isEven, 6, 5); // 1
+ * ```
+ */
+export declare function findFirstArrayIndex<T>(array: ArrayLike<T>, fn: (value: T, index: number) => boolean, start?: number, stop?: number): number;
+/**
+ * Find the index of the last value which matches a predicate.
+ *
+ * @param object - The array-like object to search.
+ *
+ * @param fn - The predicate function to apply to the values.
+ *
+ * @param start - The index of the first element in the range to be
+ *   searched, inclusive. The default value is `-1`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @param stop - The index of the last element in the range to be
+ *   searched, inclusive. The default value is `0`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @returns The index of the last matching value, or `-1` if no
+ *   matching value is found.
+ *
+ * #### Notes
+ * If `start < stop` the search will wrap at the front of the array.
+ *
+ * #### Complexity
+ * Linear.
+ *
+ * #### Undefined Behavior
+ * A `start` or `stop` which is non-integral.
+ *
+ * Modifying the length of the array while searching.
+ *
+ * #### Example
+ * ```typescript
+ *
+ * function isEven(value: number): boolean {
+ *   return value % 2 === 0;
+ * }
+ *
+ * let data = [1, 2, 3, 4, 3, 2, 1];
+ * findLastArrayIndex(data, isEven);        // 5
+ * findLastArrayIndex(data, isEven, 4);     // 3
+ * findLastArrayIndex(data, isEven, 0);     // -1
+ * findLastArrayIndex(data, isEven, 0, 1);  // 5
+ * ```
+ */
+export declare function findLastArrayIndex<T>(array: ArrayLike<T>, fn: (value: T, index: number) => boolean, start?: number, stop?: number): number;
+/**
+ * Find the first value which matches a predicate.
+ *
+ * @param array - The array-like object to search.
+ *
+ * @param fn - The predicate function to apply to the values.
+ *
+ * @param start - The index of the first element in the range to be
+ *   searched, inclusive. The default value is `0`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @param stop - The index of the last element in the range to be
+ *   searched, inclusive. The default value is `-1`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @returns The first matching value, or `undefined` if no matching
+ *   value is found.
+ *
+ * #### Notes
+ * If `stop < start` the search will wrap at the end of the array.
+ *
+ * #### Complexity
+ * Linear.
+ *
+ * #### Undefined Behavior
+ * A `start` or `stop` which is non-integral.
+ *
+ * Modifying the length of the array while searching.
+ *
+ * #### Example
+ * ```typescript
+ *
+ * function isEven(value: number): boolean {
+ *   return value % 2 === 0;
+ * }
+ *
+ * let data = [1, 2, 3, 4, 3, 2, 1];
+ * findFirstArrayValue(data, isEven);       // 2
+ * findFirstArrayValue(data, isEven, 2);    // 4
+ * findFirstArrayValue(data, isEven, 6);    // undefined
+ * findFirstArrayValue(data, isEven, 6, 5); // 2
+ * ```
+ */
+export declare function findFirstArrayValue<T>(array: ArrayLike<T>, fn: (value: T, index: number) => boolean, start?: number, stop?: number): T | undefined;
+/**
+ * Find the last value which matches a predicate.
+ *
+ * @param object - The array-like object to search.
+ *
+ * @param fn - The predicate function to apply to the values.
+ *
+ * @param start - The index of the first element in the range to be
+ *   searched, inclusive. The default value is `-1`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @param stop - The index of the last element in the range to be
+ *   searched, inclusive. The default value is `0`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @returns The last matching value, or `undefined` if no matching
+ *   value is found.
+ *
+ * #### Notes
+ * If `start < stop` the search will wrap at the front of the array.
+ *
+ * #### Complexity
+ * Linear.
+ *
+ * #### Undefined Behavior
+ * A `start` or `stop` which is non-integral.
+ *
+ * Modifying the length of the array while searching.
+ *
+ * #### Example
+ * ```typescript
+ *
+ * function isEven(value: number): boolean {
+ *   return value % 2 === 0;
+ * }
+ *
+ * let data = [1, 2, 3, 4, 3, 2, 1];
+ * findLastArrayValue(data, isEven);        // 2
+ * findLastArrayValue(data, isEven, 4);     // 4
+ * findLastArrayValue(data, isEven, 0);     // undefined
+ * findLastArrayValue(data, isEven, 0, 1);  // 2
+ * ```
+ */
+export declare function findLastArrayValue<T>(array: ArrayLike<T>, fn: (value: T, index: number) => boolean, start?: number, stop?: number): T | undefined;
+/**
+ * Find the index of the first element which compares `>=` to a value.
+ *
+ * @param array - The sorted array-like object to search.
+ *
+ * @param value - The value to locate in the array.
+ *
+ * @param fn - The 3-way comparison function to apply to the values.
+ *   It should return `< 0` if an element is less than a value, `0` if
+ *   an element is equal to a value, or `> 0` if an element is greater
+ *   than a value.
+ *
+ * @param start - The index of the first element in the range to be
+ *   searched, inclusive. The default value is `0`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @param stop - The index of the last element in the range to be
+ *   searched, inclusive. The default value is `-1`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @returns The index of the first element which compares `>=` to the
+ *   value, or `length` if there is no such element. If the computed
+ *   index for `stop` is less than `start`, then the computed index
+ *   for `start` is returned.
+ *
+ * #### Notes
+ * The array must already be sorted in ascending order according to
+ * the comparison function.
+ *
+ * #### Complexity
+ * Logarithmic.
+ *
+ * #### Undefined Behavior
+ * Searching a range which is not sorted in ascending order.
+ *
+ * A `start` or `stop` which is non-integral.
+ *
+ * Modifying the length of the array while searching.
+ *
+ * #### Example
+ * ```typescript
+ *
+ * function numberCmp(a: number, b: number): number {
+ *   return a - b;
+ * }
+ *
+ * let data = [0, 3, 4, 7, 7, 9];
+ * lowerArrayBound(data, 0, numberCmp);   // 0
+ * lowerArrayBound(data, 6, numberCmp);   // 3
+ * lowerArrayBound(data, 7, numberCmp);   // 3
+ * lowerArrayBound(data, -1, numberCmp);  // 0
+ * lowerArrayBound(data, 10, numberCmp);  // 6
+ * ```
+ */
+export declare function lowerArrayBound<T, U>(array: ArrayLike<T>, value: U, fn: (element: T, value: U) => number, start?: number, stop?: number): number;
+/**
+ * Find the index of the first element which compares `>` than a value.
+ *
+ * @param array - The sorted array-like object to search.
+ *
+ * @param value - The value to locate in the array.
+ *
+ * @param fn - The 3-way comparison function to apply to the values.
+ *   It should return `< 0` if an element is less than a value, `0` if
+ *   an element is equal to a value, or `> 0` if an element is greater
+ *   than a value.
+ *
+ * @param start - The index of the first element in the range to be
+ *   searched, inclusive. The default value is `0`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @param stop - The index of the last element in the range to be
+ *   searched, inclusive. The default value is `-1`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @returns The index of the first element which compares `>` than the
+ *   value, or `length` if there is no such element. If the computed
+ *   index for `stop` is less than `start`, then the computed index
+ *   for `start` is returned.
+ *
+ * #### Notes
+ * The array must already be sorted in ascending order according to
+ * the comparison function.
+ *
+ * #### Complexity
+ * Logarithmic.
+ *
+ * #### Undefined Behavior
+ * Searching a range which is not sorted in ascending order.
+ *
+ * A `start` or `stop` which is non-integral.
+ *
+ * Modifying the length of the array while searching.
+ *
+ * #### Example
+ * ```typescript
+ *
+ * function numberCmp(a: number, b: number): number {
+ *   return a - b;
+ * }
+ *
+ * let data = [0, 3, 4, 7, 7, 9];
+ * upperArrayBound(data, 0, numberCmp);   // 1
+ * upperArrayBound(data, 6, numberCmp);   // 3
+ * upperArrayBound(data, 7, numberCmp);   // 5
+ * upperArrayBound(data, -1, numberCmp);  // 0
+ * upperArrayBound(data, 10, numberCmp);  // 6
+ * ```
+ */
+export declare function upperArrayBound<T, U>(array: ArrayLike<T>, value: U, fn: (element: T, value: U) => number, start?: number, stop?: number): number;
+/**
+ * Remove all occurrences of values which match a predicate.
+ *
+ * @param array - The array of interest.
+ *
+ * @param fn - The predicate function to apply to the values.
+ *
+ * @param start - The index of the first element in the range to be
+ *   searched, inclusive. The default value is `0`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @param stop - The index of the last element in the range to be
+ *   searched, inclusive. The default value is `-1`. Negative values
+ *   are taken as an offset from the end of the array.
+ *
+ * @returns The number of elements removed from the array.
+ *
+ * #### Notes
+ * If `stop < start` the search will conceptually wrap at the end of
+ * the array, however the array will be traversed front-to-back.
+ *
+ * #### Complexity
+ * Linear.
+ *
+ * #### Example
+ * ```typescript
+ *
+ * function isEven(value: number): boolean {
+ *   return value % 2 === 0;
+ * }
+ *
+ * function isNegative(value: number): boolean {
+ *   return value < 0;
+ * }
+ *
+ * let data = [0, 12, -13, -9, 23, 39, 14, -15, 12, 75];
+ * removeAllWhereFromArray(data, isEven);            // 4
+ * removeAllWhereFromArray(data, isNegative, 0, 3);  // 2
+ * ```
+ */
+export declare function removeAllWhereFromArray<T>(array: T[], fn: (value: T, index: number) => boolean, start?: number, stop?: number): number;
+//# sourceMappingURL=array.d.ts.map

package/es/array.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../src/array.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,wBAAgB,iBAAiB,CAAC,CAAC,EACjC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,CAAC,EACR,KAAK,SAAI,EACT,IAAI,SAAK,GACR,MAAM,CA8BR;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EACnC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,EACxC,KAAK,SAAI,EACT,IAAI,SAAK,GACR,MAAM,CA8BR;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,EACxC,KAAK,SAAK,EACV,IAAI,SAAI,GACP,MAAM,CA+BR;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AACH,wBAAgB,mBAAmB,CAAC,CAAC,EACnC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,EACxC,KAAK,SAAI,EACT,IAAI,SAAK,GACR,CAAC,GAAG,SAAS,CAGf;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA0CG;AACH,wBAAgB,kBAAkB,CAAC,CAAC,EAClC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,EACxC,KAAK,SAAK,EACV,IAAI,SAAI,GACP,CAAC,GAAG,SAAS,CAGf;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqDG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,CAAC,EAClC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,CAAC,EACR,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,EACpC,KAAK,SAAI,EACT,IAAI,SAAK,GACR,MAAM,CA8BR;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqDG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAAE,CAAC,EAClC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAC,EACnB,KAAK,EAAE,CAAC,EACR,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,EACpC,KAAK,SAAI,EACT,IAAI,SAAK,GACR,MAAM,CA8BR;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAuCG;AACH,wBAAgB,uBAAuB,CAAC,CAAC,EACvC,KAAK,EAAE,CAAC,EAAE,EACV,EAAE,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,EACxC,KAAK,SAAI,EACT,IAAI,SAAK,GACR,MAAM,CAmCR"}

package/es/display-wrapper.d.ts

@@ -0,0 +1,6 @@
+import React from 'react';
+export declare const DisplayWrapComponent: React.FC<{
+    children: any;
+    mode: boolean | undefined;
+}>;
+//# sourceMappingURL=display-wrapper.d.ts.map

package/es/display-wrapper.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"display-wrapper.d.ts","sourceRoot":"","sources":["../src/display-wrapper.tsx"],"names":[],"mappings":"AAAA,OAAO,KAAK,MAAM,OAAO,CAAC;AAE1B,eAAO,MAAM,oBAAoB,EAAE,KAAK,CAAC,EAAE,CAAC;IAC1C,QAAQ,EAAE,GAAG,CAAC;IACd,IAAI,EAAE,OAAO,GAAG,SAAS,CAAC;CAC3B,CAKA,CAAC"}

package/es/dom.d.ts

@@ -0,0 +1,3 @@
+export declare const copy2clipboard: (string: string) => void;
+export declare const readFromClipboard: () => Promise<string>;
+//# sourceMappingURL=dom.d.ts.map

package/es/dom.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dom.d.ts","sourceRoot":"","sources":["../src/dom.ts"],"names":[],"mappings":"AAYA,eAAO,MAAM,cAAc,WAAY,MAAM,SA0B5C,CAAC;AAgBF,eAAO,MAAM,iBAAiB,uBAgB7B,CAAC"}

package/es/dom.js

@@ -0,0 +1,97 @@
+function _typeof(o) { "@babel/helpers - typeof"; return _typeof = "function" == typeof Symbol && "symbol" == typeof Symbol.iterator ? function (o) { return typeof o; } : function (o) { return o && "function" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? "symbol" : typeof o; }, _typeof(o); }
+function _regeneratorRuntime() { "use strict"; /*! regenerator-runtime -- Copyright (c) 2014-present, Facebook, Inc. -- license (MIT): https://github.com/facebook/regenerator/blob/main/LICENSE */ _regeneratorRuntime = function _regeneratorRuntime() { return e; }; var t, e = {}, r = Object.prototype, n = r.hasOwnProperty, o = Object.defineProperty || function (t, e, r) { t[e] = r.value; }, i = "function" == typeof Symbol ? Symbol : {}, a = i.iterator || "@@iterator", c = i.asyncIterator || "@@asyncIterator", u = i.toStringTag || "@@toStringTag"; function define(t, e, r) { return Object.defineProperty(t, e, { value: r, enumerable: !0, configurable: !0, writable: !0 }), t[e]; } try { define({}, ""); } catch (t) { define = function define(t, e, r) { return t[e] = r; }; } function wrap(t, e, r, n) { var i = e && e.prototype instanceof Generator ? e : Generator, a = Object.create(i.prototype), c = new Context(n || []); return o(a, "_invoke", { value: makeInvokeMethod(t, r, c) }), a; } function tryCatch(t, e, r) { try { return { type: "normal", arg: t.call(e, r) }; } catch (t) { return { type: "throw", arg: t }; } } e.wrap = wrap; var h = "suspendedStart", l = "suspendedYield", f = "executing", s = "completed", y = {}; function Generator() {} function GeneratorFunction() {} function GeneratorFunctionPrototype() {} var p = {}; define(p, a, function () { return this; }); var d = Object.getPrototypeOf, v = d && d(d(values([]))); v && v !== r && n.call(v, a) && (p = v); var g = GeneratorFunctionPrototype.prototype = Generator.prototype = Object.create(p); function defineIteratorMethods(t) { ["next", "throw", "return"].forEach(function (e) { define(t, e, function (t) { return this._invoke(e, t); }); }); } function AsyncIterator(t, e) { function invoke(r, o, i, a) { var c = tryCatch(t[r], t, o); if ("throw" !== c.type) { var u = c.arg, h = u.value; return h && "object" == _typeof(h) && n.call(h, "__await") ? e.resolve(h.__await).then(function (t) { invoke("next", t, i, a); }, function (t) { invoke("throw", t, i, a); }) : e.resolve(h).then(function (t) { u.value = t, i(u); }, function (t) { return invoke("throw", t, i, a); }); } a(c.arg); } var r; o(this, "_invoke", { value: function value(t, n) { function callInvokeWithMethodAndArg() { return new e(function (e, r) { invoke(t, n, e, r); }); } return r = r ? r.then(callInvokeWithMethodAndArg, callInvokeWithMethodAndArg) : callInvokeWithMethodAndArg(); } }); } function makeInvokeMethod(e, r, n) { var o = h; return function (i, a) { if (o === f) throw new Error("Generator is already running"); if (o === s) { if ("throw" === i) throw a; return { value: t, done: !0 }; } for (n.method = i, n.arg = a;;) { var c = n.delegate; if (c) { var u = maybeInvokeDelegate(c, n); if (u) { if (u === y) continue; return u; } } if ("next" === n.method) n.sent = n._sent = n.arg;else if ("throw" === n.method) { if (o === h) throw o = s, n.arg; n.dispatchException(n.arg); } else "return" === n.method && n.abrupt("return", n.arg); o = f; var p = tryCatch(e, r, n); if ("normal" === p.type) { if (o = n.done ? s : l, p.arg === y) continue; return { value: p.arg, done: n.done }; } "throw" === p.type && (o = s, n.method = "throw", n.arg = p.arg); } }; } function maybeInvokeDelegate(e, r) { var n = r.method, o = e.iterator[n]; if (o === t) return r.delegate = null, "throw" === n && e.iterator.return && (r.method = "return", r.arg = t, maybeInvokeDelegate(e, r), "throw" === r.method) || "return" !== n && (r.method = "throw", r.arg = new TypeError("The iterator does not provide a '" + n + "' method")), y; var i = tryCatch(o, e.iterator, r.arg); if ("throw" === i.type) return r.method = "throw", r.arg = i.arg, r.delegate = null, y; var a = i.arg; return a ? a.done ? (r[e.resultName] = a.value, r.next = e.nextLoc, "return" !== r.method && (r.method = "next", r.arg = t), r.delegate = null, y) : a : (r.method = "throw", r.arg = new TypeError("iterator result is not an object"), r.delegate = null, y); } function pushTryEntry(t) { var e = { tryLoc: t[0] }; 1 in t && (e.catchLoc = t[1]), 2 in t && (e.finallyLoc = t[2], e.afterLoc = t[3]), this.tryEntries.push(e); } function resetTryEntry(t) { var e = t.completion || {}; e.type = "normal", delete e.arg, t.completion = e; } function Context(t) { this.tryEntries = [{ tryLoc: "root" }], t.forEach(pushTryEntry, this), this.reset(!0); } function values(e) { if (e || "" === e) { var r = e[a]; if (r) return r.call(e); if ("function" == typeof e.next) return e; if (!isNaN(e.length)) { var o = -1, i = function next() { for (; ++o < e.length;) if (n.call(e, o)) return next.value = e[o], next.done = !1, next; return next.value = t, next.done = !0, next; }; return i.next = i; } } throw new TypeError(_typeof(e) + " is not iterable"); } return GeneratorFunction.prototype = GeneratorFunctionPrototype, o(g, "constructor", { value: GeneratorFunctionPrototype, configurable: !0 }), o(GeneratorFunctionPrototype, "constructor", { value: GeneratorFunction, configurable: !0 }), GeneratorFunction.displayName = define(GeneratorFunctionPrototype, u, "GeneratorFunction"), e.isGeneratorFunction = function (t) { var e = "function" == typeof t && t.constructor; return !!e && (e === GeneratorFunction || "GeneratorFunction" === (e.displayName || e.name)); }, e.mark = function (t) { return Object.setPrototypeOf ? Object.setPrototypeOf(t, GeneratorFunctionPrototype) : (t.__proto__ = GeneratorFunctionPrototype, define(t, u, "GeneratorFunction")), t.prototype = Object.create(g), t; }, e.awrap = function (t) { return { __await: t }; }, defineIteratorMethods(AsyncIterator.prototype), define(AsyncIterator.prototype, c, function () { return this; }), e.AsyncIterator = AsyncIterator, e.async = function (t, r, n, o, i) { void 0 === i && (i = Promise); var a = new AsyncIterator(wrap(t, r, n, o), i); return e.isGeneratorFunction(r) ? a : a.next().then(function (t) { return t.done ? t.value : a.next(); }); }, defineIteratorMethods(g), define(g, u, "Generator"), define(g, a, function () { return this; }), define(g, "toString", function () { return "[object Generator]"; }), e.keys = function (t) { var e = Object(t), r = []; for (var n in e) r.push(n); return r.reverse(), function next() { for (; r.length;) { var t = r.pop(); if (t in e) return next.value = t, next.done = !1, next; } return next.done = !0, next; }; }, e.values = values, Context.prototype = { constructor: Context, reset: function reset(e) { if (this.prev = 0, this.next = 0, this.sent = this._sent = t, this.done = !1, this.delegate = null, this.method = "next", this.arg = t, this.tryEntries.forEach(resetTryEntry), !e) for (var r in this) "t" === r.charAt(0) && n.call(this, r) && !isNaN(+r.slice(1)) && (this[r] = t); }, stop: function stop() { this.done = !0; var t = this.tryEntries[0].completion; if ("throw" === t.type) throw t.arg; return this.rval; }, dispatchException: function dispatchException(e) { if (this.done) throw e; var r = this; function handle(n, o) { return a.type = "throw", a.arg = e, r.next = n, o && (r.method = "next", r.arg = t), !!o; } for (var o = this.tryEntries.length - 1; o >= 0; --o) { var i = this.tryEntries[o], a = i.completion; if ("root" === i.tryLoc) return handle("end"); if (i.tryLoc <= this.prev) { var c = n.call(i, "catchLoc"), u = n.call(i, "finallyLoc"); if (c && u) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } else if (c) { if (this.prev < i.catchLoc) return handle(i.catchLoc, !0); } else { if (!u) throw new Error("try statement without catch or finally"); if (this.prev < i.finallyLoc) return handle(i.finallyLoc); } } } }, abrupt: function abrupt(t, e) { for (var r = this.tryEntries.length - 1; r >= 0; --r) { var o = this.tryEntries[r]; if (o.tryLoc <= this.prev && n.call(o, "finallyLoc") && this.prev < o.finallyLoc) { var i = o; break; } } i && ("break" === t || "continue" === t) && i.tryLoc <= e && e <= i.finallyLoc && (i = null); var a = i ? i.completion : {}; return a.type = t, a.arg = e, i ? (this.method = "next", this.next = i.finallyLoc, y) : this.complete(a); }, complete: function complete(t, e) { if ("throw" === t.type) throw t.arg; return "break" === t.type || "continue" === t.type ? this.next = t.arg : "return" === t.type ? (this.rval = this.arg = t.arg, this.method = "return", this.next = "end") : "normal" === t.type && e && (this.next = e), y; }, finish: function finish(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.finallyLoc === t) return this.complete(r.completion, r.afterLoc), resetTryEntry(r), y; } }, catch: function _catch(t) { for (var e = this.tryEntries.length - 1; e >= 0; --e) { var r = this.tryEntries[e]; if (r.tryLoc === t) { var n = r.completion; if ("throw" === n.type) { var o = n.arg; resetTryEntry(r); } return o; } } throw new Error("illegal catch attempt"); }, delegateYield: function delegateYield(e, r, n) { return this.delegate = { iterator: values(e), resultName: r, nextLoc: n }, "next" === this.method && (this.arg = t), y; } }, e; }
+function asyncGeneratorStep(gen, resolve, reject, _next, _throw, key, arg) { try { var info = gen[key](arg); var value = info.value; } catch (error) { reject(error); return; } if (info.done) { resolve(value); } else { Promise.resolve(value).then(_next, _throw); } }
+function _asyncToGenerator(fn) { return function () { var self = this, args = arguments; return new Promise(function (resolve, reject) { var gen = fn.apply(self, args); function _next(value) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "next", value); } function _throw(err) { asyncGeneratorStep(gen, resolve, reject, _next, _throw, "throw", err); } _next(undefined); }); }; }
+function copyFallback(string) {
+  function handler(event) {
+    var clipboardData = event.clipboardData || window.clipboardData;
+    clipboardData.setData('text/plain', string);
+    event.preventDefault();
+    document.removeEventListener('copy', handler, true);
+  }
+  document.addEventListener('copy', handler, true);
+  document.execCommand('copy');
+}
+// 复制到剪贴板
+export var copy2clipboard = function copy2clipboard(string) {
+  navigator.permissions.query({
+    name: 'clipboard-write'
+  }).then(function (result) {
+    if (result.state === 'granted' || result.state === 'prompt') {
+      if (window.navigator && window.navigator.clipboard) {
+        window.navigator.clipboard.writeText(string).then(function () {
+          return;
+        }).catch(function (err) {
+          console.error('Could not copy text: ', err);
+        });
+      } else {
+        console.warn('navigator is not  exist');
+      }
+    } else {
+      console.warn('浏览器权限不允许复制');
+      copyFallback(string);
+    }
+    return;
+  }).catch(console.error);
+};
+function readFallback() {
+  function handler(event) {
+    // 获取剪贴板数据
+    var clipboardData = event.clipboardData || window.clipboardData;
+    // 读取文本内容
+    var pastedData = clipboardData.getData('text/plain');
+    event.preventDefault();
+    document.removeEventListener('paste', handler, true);
+    return pastedData;
+  }
+  document.addEventListener('paste', handler, true);
+}
+
+// 从剪贴板读取
+export var readFromClipboard = /*#__PURE__*/function () {
+  var _ref = _asyncToGenerator( /*#__PURE__*/_regeneratorRuntime().mark(function _callee() {
+    var clipboardValue, result;
+    return _regeneratorRuntime().wrap(function _callee$(_context) {
+      while (1) switch (_context.prev = _context.next) {
+        case 0:
+          clipboardValue = '';
+          _context.next = 3;
+          return navigator.permissions.query({
+            name: 'clipboard-read'
+          });
+        case 3:
+          result = _context.sent;
+          if (!(result.state === 'granted' || result.state === 'prompt')) {
+            _context.next = 14;
+            break;
+          }
+          if (!(window.navigator && window.navigator.clipboard)) {
+            _context.next = 11;
+            break;
+          }
+          _context.next = 8;
+          return window.navigator.clipboard.readText();
+        case 8:
+          clipboardValue = _context.sent;
+          _context.next = 12;
+          break;
+        case 11:
+          console.warn('navigator is not  exist');
+        case 12:
+          _context.next = 16;
+          break;
+        case 14:
+          console.warn('浏览器权限不允许粘贴');
+          readFallback();
+        case 16:
+          return _context.abrupt("return", clipboardValue);
+        case 17:
+        case "end":
+          return _context.stop();
+      }
+    }, _callee);
+  }));
+  return function readFromClipboard() {
+    return _ref.apply(this, arguments);
+  };
+}();

package/es/index.d.ts

@@ -0,0 +1,12 @@
+export * from './array.js';
+export * from './iter.js';
+export * from './json.js';
+export * from './utils.js';
+export * from './sanitizer.js';
+export * from './url.js';
+export * from './path.js';
+export * from './polling/index.js';
+export * from './display-wrapper.js';
+export * from './protocol/index.js';
+export * from './dom.js';
+//# sourceMappingURL=index.d.ts.map

package/es/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../src/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,WAAW,CAAC;AAC1B,cAAc,WAAW,CAAC;AAC1B,cAAc,YAAY,CAAC;AAC3B,cAAc,gBAAgB,CAAC;AAC/B,cAAc,UAAU,CAAC;AACzB,cAAc,WAAW,CAAC;AAC1B,cAAc,oBAAoB,CAAC;AACnC,cAAc,sBAAsB,CAAC;AACrC,cAAc,qBAAqB,CAAC;AACpC,cAAc,UAAU,CAAC"}

package/es/index.js

@@ -7,4 +7,5 @@ export * from "./url.js";
 export * from "./path.js";
 export * from "./polling/index.js";
 export * from "./display-wrapper.js";
-export * from "./protocol/index.js";
+export * from "./protocol/index.js";
+export * from "./dom.js";

package/es/iter.d.ts

@@ -0,0 +1,147 @@
+/**
+ * An object which can produce an iterator over its values.
+ */
+export interface IIterable<T> {
+    /**
+     * Get an iterator over the object's values.
+     *
+     * @returns An iterator which yields the object's values.
+     *
+     * #### Notes
+     * Depending on the iterable, the returned iterator may or may not be
+     * a new object. A collection or other container-like object should
+     * typically return a new iterator, while an iterator itself should
+     * normally return `this`.
+     */
+    iter: () => IIterator<T>;
+}
+/**
+ * An object which traverses a collection of values.
+ *
+ * #### Notes
+ * An `IIterator` is itself an `IIterable`. Most implementations of
+ * `IIterator` should simply return `this` from the `iter()` method.
+ */
+export interface IIterator<T> extends IIterable<T> {
+    /**
+     * Create an independent clone of the iterator.
+     *
+     * @returns A new independent clone of the iterator.
+     *
+     * #### Notes
+     * The cloned iterator can be consumed independently of the current
+     * iterator. In essence, it is a copy of the iterator value stream
+     * which starts at the current location.
+     *
+     * This can be useful for lookahead and stream duplication.
+     */
+    clone: () => IIterator<T>;
+    /**
+     * Get the next value from the iterator.
+     *
+     * @returns The next value from the iterator, or `undefined`.
+     *
+     * #### Notes
+     * The `undefined` value is used to signal the end of iteration and
+     * should therefore not be used as a value in a collection.
+     *
+     * The use of the `undefined` sentinel is an explicit design choice
+     * which favors performance over purity. The ES6 iterator design of
+     * returning a `{ value, done }` pair is suboptimal, as it requires
+     * an object allocation on each iteration; and an `isDone()` method
+     * would increase implementation and runtime complexity.
+     */
+    next: () => T | undefined;
+}
+/**
+ * A type alias for an iterable or builtin array-like object.
+ */
+export type IterableOrArrayLike<T> = IIterable<T> | ArrayLike<T>;
+/**
+ * An iterator for an array-like object.
+ *
+ * #### Notes
+ * This iterator can be used for any builtin JS array-like object.
+ */
+export declare class ArrayIterator<T> implements IIterator<T> {
+    /**
+     * Construct a new array iterator.
+     *
+     * @param source - The array-like object of interest.
+     */
+    constructor(source: ArrayLike<T>);
+    /**
+     * Get an iterator over the object's values.
+     *
+     * @returns An iterator which yields the object's values.
+     */
+    iter(): IIterator<T>;
+    /**
+     * Create an independent clone of the iterator.
+     *
+     * @returns A new independent clone of the iterator.
+     */
+    clone(): IIterator<T>;
+    /**
+     * Get the next value from the iterator.
+     *
+     * @returns The next value from the iterator, or `undefined`.
+     */
+    next(): T | undefined;
+    protected _index: number;
+    protected _source: ArrayLike<T>;
+}
+/**
+ * Create an iterator for an iterable object.
+ *
+ * @param object - The iterable or array-like object of interest.
+ *
+ * @returns A new iterator for the given object.
+ *
+ * #### Notes
+ * This function allows iteration algorithms to operate on user-defined
+ * iterable types and builtin array-like objects in a uniform fashion.
+ */
+export declare function iter<T>(object: IterableOrArrayLike<T>): IIterator<T>;
+/**
+ * Invoke a function for each value in an iterable.
+ *
+ * @param object - The iterable or array-like object of interest.
+ *
+ * @param fn - The callback function to invoke for each value.
+ *
+ * #### Notes
+ * Iteration can be terminated early by returning `false` from the
+ * callback function.
+ *
+ * #### Complexity
+ * Linear.
+ *
+ * #### Example
+ * ```typescript
+ *
+ * let data = [5, 7, 0, -2, 9];
+ *
+ * each(data, value => { console.log(value); });
+ * ```
+ */
+export declare function each<T>(object: IterableOrArrayLike<T>, fn: (value: T, index: number) => boolean | void): void;
+/**
+ * Create an array from an iterable of values.
+ *
+ * @param object - The iterable or array-like object of interest.
+ *
+ * @returns A new array of values from the given object.
+ *
+ * #### Example
+ * ```typescript
+ *
+ * let data = [1, 2, 3, 4, 5, 6];
+ *
+ * let stream = iter(data);
+ *
+ * toArray(stream);  // [1, 2, 3, 4, 5, 6];
+ * ```
+ */
+export declare function toArray<T>(object: IterableOrArrayLike<T>): T[];
+//# sourceMappingURL=iter.d.ts.map