rx-player 4.4.1 → 4.5.0-dev.2026012301

package/dist/es2017/utils/url-utils.js

@@ -1,323 +0,0 @@
-/**
- * Copyright 2015 CANAL+ Group
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-import isNonEmptyString from "./is_non_empty_string";
-import startsWith from "./starts_with";
-// Scheme part of an url (e.g. "http://").
-const schemeRe = /^(?:[a-z]+:)?\/\//i;
-/**
- * Match the different components of an URL.
- *
- *     foo://example.com:8042/over/there?name=ferret#nose
-       \_/   \______________/\_________/ \_________/ \__/
-        |           |            |            |        |
-      scheme     authority       path        query   fragment
- * 1st match is the scheme: (e.g. "foo://")
- * 2nd match is the authority (e.g "example.com:8042")
- * 3rd match is the path (e.g "/over/there")
- * 4th match is the query params (e.g "name=ferret")
- * 5th match is the fragment (e.g "nose")
- * */
-const urlComponentRegex = /^(?:([^:/?#]+):)?(?:\/\/([^/?#]*))?([^?#]*)(?:\?([^#]*))?(?:#(.*))?$/;
-/**
- * In a given URL, find the index at which the filename begins.
- * That is, this function finds the index of the last `/` character and returns
- * the index after it, returning the length of the whole URL if no `/` was found
- * after the scheme (i.e. in `http://`, the slashes are not considered).
- * @param {string} url
- * @returns {number}
- */
-function getFilenameIndexInUrl(url) {
-    const indexOfLastSlash = url.lastIndexOf("/");
-    if (indexOfLastSlash < 0) {
-        return url.length;
-    }
-    if (schemeRe.test(url)) {
-        const firstSlashIndex = url.indexOf("/");
-        if (firstSlashIndex >= 0 && indexOfLastSlash === firstSlashIndex + 1) {
-            // The "/" detected is actually the one from the protocol part of the URL
-            // ("https://")
-            return url.length;
-        }
-    }
-    const indexOfQuestionMark = url.indexOf("?");
-    if (indexOfQuestionMark >= 0 && indexOfQuestionMark < indexOfLastSlash) {
-        // There are query parameters. Let's ignore them and re-run the logic
-        // without
-        return getFilenameIndexInUrl(url.substring(0, indexOfQuestionMark));
-    }
-    return indexOfLastSlash + 1;
-}
-/**
- * Take two URLs and try to construct a relative URL for the second (`newUrl`)
- * relative to the first (`baseUrl`).
- *
- * Returns `null` if they appear to be on different domains, depend on
- * different schemes or if we don't have enough information to compute the
- * relative URL.
- * @param {string} baseUrl
- * @param {string} newUrl
- * @returns {string}
- */
-function getRelativeUrl(baseUrl, newUrl) {
-    const baseParts = parseURL(baseUrl);
-    const newParts = parseURL(newUrl);
-    if (baseParts.scheme !== newParts.scheme ||
-        baseParts.authority !== newParts.authority) {
-        return null;
-    }
-    if (
-    // if base and new path are mixed between absolute and relative path, return null
-    (baseParts.path[0] !== undefined &&
-        baseParts.path[0] !== "/" &&
-        newParts.path[0] === "/") ||
-        (newParts.path[0] !== undefined &&
-            newParts.path[0] !== "/" &&
-            baseParts.path[0] === "/")) {
-        return null;
-    }
-    const baseNormalizedPath = removeDotSegment(baseParts.path);
-    const newNormalizedPath = removeDotSegment(newParts.path);
-    let relativePath;
-    if (baseNormalizedPath === newNormalizedPath) {
-        relativePath = "";
-    }
-    else {
-        const basePathSplitted = baseNormalizedPath.split("/");
-        // remove everything after the last trailing /
-        basePathSplitted.pop();
-        const newPathSplitted = newNormalizedPath.split("/");
-        while (basePathSplitted.length > 0 &&
-            newPathSplitted.length > 0 &&
-            basePathSplitted[0] === newPathSplitted[0]) {
-            basePathSplitted.shift();
-            newPathSplitted.shift();
-        }
-        while (basePathSplitted.length > 0) {
-            basePathSplitted.shift();
-            newPathSplitted.unshift("..");
-        }
-        let pathJoined = newPathSplitted.join("/");
-        if (pathJoined.endsWith("../") || pathJoined.endsWith("./")) {
-            pathJoined = pathJoined.slice(0, pathJoined.length - 1);
-        }
-        relativePath = pathJoined === "" ? "." : pathJoined;
-    }
-    let result = relativePath;
-    if (relativePath === "" && newParts.query === baseParts.query) {
-        // path and query is the same, we don't need to rewrite it
-    }
-    else if (isNonEmptyString(newParts.query)) {
-        result += "?";
-        result += newParts.query;
-    }
-    if (isNonEmptyString(newParts.fragment)) {
-        result += "#";
-        result += newParts.fragment;
-    }
-    return result;
-}
-/**
- * Resolve the output URL from the baseURL and the relative reference as
- * specified by RFC 3986 section 5.
- * @param base
- * @param relative
- * @see https://datatracker.ietf.org/doc/html/rfc3986#section-5
- * @example base: http://example.com | relative: /b/c | output: http://example.com/b/c
- * @returns the resolved url
- */
-function _resolveURL(base, relative) {
-    const baseParts = parseURL(base);
-    const relativeParts = parseURL(relative);
-    if (isNonEmptyString(relativeParts.scheme)) {
-        return formatURL(relativeParts);
-    }
-    const target = {
-        scheme: baseParts.scheme,
-        authority: baseParts.authority,
-        path: "",
-        query: relativeParts.query,
-        fragment: relativeParts.fragment,
-    };
-    if (isNonEmptyString(relativeParts.authority)) {
-        target.authority = relativeParts.authority;
-        target.path = removeDotSegment(relativeParts.path);
-        return formatURL(target);
-    }
-    if (relativeParts.path === "") {
-        target.path = baseParts.path;
-        if (!isNonEmptyString(relativeParts.query)) {
-            target.query = baseParts.query;
-        }
-    }
-    else {
-        if (startsWith(relativeParts.path, "/")) {
-            // path is absolute
-            target.path = removeDotSegment(relativeParts.path);
-        }
-        else {
-            // path is relative
-            target.path = removeDotSegment(mergePaths(baseParts, relativeParts.path));
-        }
-    }
-    return formatURL(target);
-}
-/**
- * Cache to store already parsed URLs to avoid unnecessary computation when parsing the same URL again.
- */
-const parsedUrlCache = new Map();
-/**
- * Sets the maximum number of entries allowed in the parsedUrlCache map.
- * This limit helps prevent excessive memory usage. The value is arbitrary.
- */
-const MAX_URL_CACHE_ENTRIES = 200;
-/**
- * Parses a URL into its components.
- * @param {string} url - The URL to parse.
- * @returns {IParsedURL} The parsed URL components.
- */
-function parseURL(url) {
-    var _a, _b, _c, _d, _e;
-    if (parsedUrlCache.has(url)) {
-        return parsedUrlCache.get(url);
-    }
-    const matches = url.match(urlComponentRegex);
-    let parsed;
-    if (matches === null) {
-        parsed = {
-            scheme: "",
-            authority: "",
-            path: "",
-            query: "",
-            fragment: "",
-        };
-    }
-    else {
-        parsed = {
-            scheme: (_a = matches[1]) !== null && _a !== void 0 ? _a : "",
-            authority: (_b = matches[2]) !== null && _b !== void 0 ? _b : "",
-            path: (_c = matches[3]) !== null && _c !== void 0 ? _c : "",
-            query: (_d = matches[4]) !== null && _d !== void 0 ? _d : "",
-            fragment: (_e = matches[5]) !== null && _e !== void 0 ? _e : "",
-        };
-    }
-    if (parsedUrlCache.size >= MAX_URL_CACHE_ENTRIES) {
-        parsedUrlCache.clear();
-    }
-    parsedUrlCache.set(url, parsed);
-    return parsed;
-}
-/**
- * Formats a parsed URL into a string.
- * @param {IParsedURL} parts - The parsed URL components.
- * @returns {string} The formatted URL string.
- */
-function formatURL(parts) {
-    let url = "";
-    if (isNonEmptyString(parts.scheme)) {
-        url += parts.scheme + ":";
-    }
-    if (isNonEmptyString(parts.authority)) {
-        url += "//" + parts.authority;
-    }
-    url += parts.path;
-    if (isNonEmptyString(parts.query)) {
-        url += "?" + parts.query;
-    }
-    if (isNonEmptyString(parts.fragment)) {
-        url += "#" + parts.fragment;
-    }
-    return url;
-}
-/**
- * Removes "." and ".." from the URL path, as described by the algorithm
- * in RFC 3986 Section 5.2.4. Remove Dot Segments
- * @param {string} path - The URL path
- * @see https://datatracker.ietf.org/doc/html/rfc3986#section-5.2.4
- * @returns The path with dot segments removed.
- * @example "/baz/booz/../biz" => "/baz/biz"
- */
-function removeDotSegment(path) {
-    const segments = path.split(/(?=\/)/);
-    const output = [];
-    for (let i = 0; i < segments.length; i++) {
-        const segment = segments[i];
-        if (segment === ".." || segment === "." || segment === "") {
-            continue;
-        }
-        if (segment === "/..") {
-            output.pop();
-            // if it's last segment push a trailing "/"
-            if (i === segments.length - 1) {
-                output.push("/");
-            }
-            continue;
-        }
-        if (segment === "/.") {
-            // if it's last segment push a trailing "/"
-            if (i === segments.length - 1) {
-                output.push("/");
-            }
-            continue;
-        }
-        output.push(segment);
-    }
-    return output.join("");
-}
-/**
- * Merges a base URL path with a relative URL path, as described by
- * the algorithm merge paths in RFC 3986 Section 5.2.3. Merge Paths
- * @param {IParsedURL} baseParts - The parsed base URL components.
- * @param {string} relativePath - The relative URL path.
- * @returns {string} The merged URL path.
- * @see https://datatracker.ietf.org/doc/html/rfc3986#section-5.2.3
- */
-function mergePaths(baseParts, relativePath) {
-    if (isNonEmptyString(baseParts.authority) && baseParts.path === "") {
-        return "/" + relativePath;
-    }
-    const basePath = baseParts.path;
-    return basePath.substring(0, basePath.lastIndexOf("/") + 1) + relativePath;
-}
-/**
- * Resolves multiple URL segments using the RFC 3986 URL resolution algorithm.
- *
- * This function takes a variable number of URL segments and resolves them
- * sequentially according to the RFC 3986 URL resolution algorithm.
- * First argument is the base URL.
- * Empty string arguments are ignored.
- *
- * @param {...(string|undefined)} args - The URL segments to resolve.
- * @returns {string} The resolved URL as a string.
- */
-function resolveURL(...args) {
-    var _a, _b, _c;
-    const filteredArgs = args.filter((val) => val !== "");
-    const len = filteredArgs.length;
-    if (len === 0) {
-        return "";
-    }
-    if (len === 1) {
-        return (_a = filteredArgs[0]) !== null && _a !== void 0 ? _a : "";
-    }
-    else {
-        const basePart = (_b = filteredArgs[0]) !== null && _b !== void 0 ? _b : "";
-        const relativeParts = (_c = filteredArgs[1]) !== null && _c !== void 0 ? _c : "";
-        const resolvedURL = _resolveURL(basePart, relativeParts);
-        const remainingArgs = filteredArgs.slice(2);
-        return resolveURL(resolvedURL, ...remainingArgs);
-    }
-}
-export { getFilenameIndexInUrl, getRelativeUrl, resolveURL };

package/dist/es2017/utils/warn_once.d.ts

@@ -1,24 +0,0 @@
-/**
- * Copyright 2015 CANAL+ Group
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-/**
- * Perform a console.warn only once in the application lifetime.
- *
- * Useful for deprecated messages, for example.
- *
- * @param {string} message
- */
-export default function warnOnce(message: string): void;
-//# sourceMappingURL=warn_once.d.ts.map

package/dist/es2017/utils/warn_once.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"warn_once.d.ts","sourceRoot":"","sources":["../../../src/utils/warn_once.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAMH;;;;;;GAMG;AACH,MAAM,CAAC,OAAO,UAAU,QAAQ,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAMtD"}

package/dist/es2017/utils/warn_once.js

@@ -1,31 +0,0 @@
-/**
- * Copyright 2015 CANAL+ Group
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-import arrayIncludes from "./array_includes";
-const WARNED_MESSAGES = [];
-/**
- * Perform a console.warn only once in the application lifetime.
- *
- * Useful for deprecated messages, for example.
- *
- * @param {string} message
- */
-export default function warnOnce(message) {
-    if (!arrayIncludes(WARNED_MESSAGES, message)) {
-        // eslint-disable-next-line no-console
-        console.warn(message);
-        WARNED_MESSAGES.push(message);
-    }
-}

package/dist/es2017/utils/weak_map_memory.d.ts

@@ -1,71 +0,0 @@
-/**
- * Copyright 2015 CANAL+ Group
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-/**
- * Memoize Function results linked to an object, through a WeakMap.
- *
- * @example
- * ```js
- * // Initialize the WeakMapMemory with its logic:
- * const memory = new WeakMapMemory(arg => {
- *   console.log("side-effect");
- *   return [arg.a, arg.b];
- * });
- *
- * const obj = { a: 1, b: 2 };
- *
- * // first time obj is given: call the function, save the result and return it:
- * const arr1 = memory.get(obj);
- * // >  "side-effect"
- * // <- [1, 2]
- *
- * // nth time obj is given, returns the saved result without calling the
- * // function:
- * const arr2 = memory.get(obj);
- * // <- [1, 2]
- *
- * // both of these use the same object, so the result is also the exact same
- * // one
- * console.log(arr1 === arr2); // => true
- *
- * // /!\ with a new object however:
- * const obj2 = { a: 1, b: 2 };
- *
- * const arr3 = memory.get(obj2);
- * // >  "side-effect"
- * // <- [1, 2]
- *
- * console.log(arr1 === arr3); // => false
- * ```
- * @class WeakMapMemory
- */
-export default class WeakMapMemory<T extends object, U> {
-    private readonly _fn;
-    private _weakMap;
-    /**
-     * @param {Function}
-     */
-    constructor(fn: (obj: T) => U);
-    /**
-     * @param {Object} obj
-     * @returns {*}
-     */
-    get(obj: T): U;
-    /**
-     * @param {Object} obj
-     */
-    destroy(obj: T): void;
-}
-//# sourceMappingURL=weak_map_memory.d.ts.map

package/dist/es2017/utils/weak_map_memory.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"weak_map_memory.d.ts","sourceRoot":"","sources":["../../../src/utils/weak_map_memory.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAEH;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AACH,MAAM,CAAC,OAAO,OAAO,aAAa,CAAC,CAAC,SAAS,MAAM,EAAE,CAAC;IACpD,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAgB;IACpC,OAAO,CAAC,QAAQ,CAAgB;IAEhC;;OAEG;gBACS,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;IAK7B;;;OAGG;IACI,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC;IAWrB;;OAEG;IACI,OAAO,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI;CAG7B"}

package/dist/es2017/utils/weak_map_memory.js

@@ -1,83 +0,0 @@
-/**
- * Copyright 2015 CANAL+ Group
- *
- * Licensed under the Apache License, Version 2.0 (the "License");
- * you may not use this file except in compliance with the License.
- * You may obtain a copy of the License at
- *
- *     http://www.apache.org/licenses/LICENSE-2.0
- *
- * Unless required by applicable law or agreed to in writing, software
- * distributed under the License is distributed on an "AS IS" BASIS,
- * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
- * See the License for the specific language governing permissions and
- * limitations under the License.
- */
-/**
- * Memoize Function results linked to an object, through a WeakMap.
- *
- * @example
- * ```js
- * // Initialize the WeakMapMemory with its logic:
- * const memory = new WeakMapMemory(arg => {
- *   console.log("side-effect");
- *   return [arg.a, arg.b];
- * });
- *
- * const obj = { a: 1, b: 2 };
- *
- * // first time obj is given: call the function, save the result and return it:
- * const arr1 = memory.get(obj);
- * // >  "side-effect"
- * // <- [1, 2]
- *
- * // nth time obj is given, returns the saved result without calling the
- * // function:
- * const arr2 = memory.get(obj);
- * // <- [1, 2]
- *
- * // both of these use the same object, so the result is also the exact same
- * // one
- * console.log(arr1 === arr2); // => true
- *
- * // /!\ with a new object however:
- * const obj2 = { a: 1, b: 2 };
- *
- * const arr3 = memory.get(obj2);
- * // >  "side-effect"
- * // <- [1, 2]
- *
- * console.log(arr1 === arr3); // => false
- * ```
- * @class WeakMapMemory
- */
-export default class WeakMapMemory {
-    /**
-     * @param {Function}
-     */
-    constructor(fn) {
-        this._weakMap = new WeakMap();
-        this._fn = fn;
-    }
-    /**
-     * @param {Object} obj
-     * @returns {*}
-     */
-    get(obj) {
-        const fromMemory = this._weakMap.get(obj);
-        if (fromMemory === undefined) {
-            const newElement = this._fn(obj);
-            this._weakMap.set(obj, newElement);
-            return newElement;
-        }
-        else {
-            return fromMemory;
-        }
-    }
-    /**
-     * @param {Object} obj
-     */
-    destroy(obj) {
-        this._weakMap.delete(obj);
-    }
-}

package/dist/es2017/utils/wrapInPromise.d.ts

@@ -1,8 +0,0 @@
-/**
- * Force function output to be wrapped in a Promise instance, which also rejects
- * if the function call threw.
- * @param {Function} val
- * @returns {Promise}
- */
-export default function wrapInPromise<T>(val: () => T | Promise<T>): Promise<T>;
-//# sourceMappingURL=wrapInPromise.d.ts.map

package/dist/es2017/utils/wrapInPromise.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"wrapInPromise.d.ts","sourceRoot":"","sources":["../../../src/utils/wrapInPromise.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AACH,MAAM,CAAC,OAAO,UAAU,aAAa,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAe9E"}

package/dist/es2017/utils/wrapInPromise.js

@@ -1,22 +0,0 @@
-/**
- * Force function output to be wrapped in a Promise instance, which also rejects
- * if the function call threw.
- * @param {Function} val
- * @returns {Promise}
- */
-export default function wrapInPromise(val) {
-    try {
-        const ret = val();
-        if (typeof ret === "object" &&
-            ret !== null &&
-            typeof ret.then === "function") {
-            return ret;
-        }
-        else {
-            return Promise.resolve(ret);
-        }
-    }
-    catch (err) {
-        return Promise.reject(err);
-    }
-}

package/dist/es2017/utils/xml-parser.d.ts

@@ -1,71 +0,0 @@
-/**
- * This code is mainly a modified version of the tXml library.
- *
- * @author: Tobias Nickel
- * created: 06.04.2015
- * https://github.com/TobiasNickel/tXml
- */
-/**
- * The MIT License (MIT)
- *
- * Copyright (c) 2015 Tobias Nickel
- *
- * Permission is hereby granted, free of charge, to any person obtaining a copy
- * of this software and associated documentation files (the "Software"), to deal
- * in the Software without restriction, including without limitation the rights
- * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
- * copies of the Software, and to permit persons to whom the Software is
- * furnished to do so, subject to the following conditions:
- *
- *   The above copyright notice and this permission notice shall be included in all
- * copies or substantial portions of the Software.
- *
- *   THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
- *   AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- *     LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
- * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
- * SOFTWARE.
- */
-export interface ITNode {
-    tagName: string;
-    attributes: Partial<Record<string, string | null>>;
-    children: Array<ITNode | string>;
-    posStart: number;
-    posEnd: number;
-}
-export interface ITParseOptions {
-    pos?: number;
-    noChildNodes?: string[];
-    keepComments?: boolean;
-    keepWhitespace?: boolean;
-    simplify?: boolean;
-    filter?: (a: ITNode, i: number) => boolean;
-    attrName?: string;
-    attrValue?: string;
-}
-/**
- * parseXML / html into a DOM Object. with no validation and some failur tolerance
- * @param {string} src - Your XML to parse
- * @param {Object} [options = {}] -  all other options:
- * @return {Array.<Object | string>}
- */
-declare function parseXml(src: string, options?: ITParseOptions): Array<ITNode | string>;
-/**
- * behaves the same way as Array.filter, if the filter method return true, the element is in the resultList
- * @params {Array} children - the children of a node
- * @param {function} f - the filter method
- */
-declare function filter(children: Array<ITNode | string>, f: (a: ITNode, i: number, dept: number, path: string) => boolean, dept?: number, path?: string): Array<ITNode | string>;
-/**
- * use this method to read the text content, of some node.
- * It is great if you have mixed content like:
- * this text has some <b>big</b> text and a <a href=''>link</a>
- * @return {string}
- */
-declare function toContentString(tDom: ITNode | string | Array<ITNode | string>): string;
-declare function getElementById(src: string, id: string): ITNode | string | undefined;
-declare function getElementsByClassName(src: string, classname: string): Array<ITNode | string>;
-export { filter, getElementById, getElementsByClassName, parseXml, toContentString };
-//# sourceMappingURL=xml-parser.d.ts.map

package/dist/es2017/utils/xml-parser.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"xml-parser.d.ts","sourceRoot":"","sources":["../../../src/utils/xml-parser.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAMH;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,MAAM,WAAW,MAAM;IACrB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,OAAO,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IACnD,QAAQ,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,CAAC;IACjC,QAAQ,EAAE,MAAM,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,cAAc;IAC7B,GAAG,CAAC,EAAE,MAAM,CAAC;IACb,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,YAAY,CAAC,EAAE,OAAO,CAAC;IACvB,cAAc,CAAC,EAAE,OAAO,CAAC;IACzB,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,MAAM,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,KAAK,OAAO,CAAC;IAC3C,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAgBD;;;;;GAKG;AACH,iBAAS,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,GAAE,cAAmB,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,CA4OnF;AAED;;;;GAIG;AACH,iBAAS,MAAM,CACb,QAAQ,EAAE,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,EAChC,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,KAAK,OAAO,EAChE,IAAI,GAAE,MAAU,EAChB,IAAI,GAAE,MAAW,GAChB,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,CAmBxB;AAED;;;;;GAKG;AACH,iBAAS,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,MAAM,CAa/E;AAsBD,iBAAS,cAAc,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,MAAM,GAAG,MAAM,GAAG,SAAS,CAK5E;AAED,iBAAS,sBAAsB,CAAC,GAAG,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,KAAK,CAAC,MAAM,GAAG,MAAM,CAAC,CAMtF;AAED,OAAO,EAAE,MAAM,EAAE,cAAc,EAAE,sBAAsB,EAAE,QAAQ,EAAE,eAAe,EAAE,CAAC"}