@splitsoftware/splitio-commons 2.4.2-rc.3 → 11.5.0-rc.0

package/cjs/trackers/strategy/strategyNone.js

@@ -1,24 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.strategyNoneFactory = void 0;
-/**
- * None strategy for impressions tracker.
- *
- * @param impressionCounts - cache to save impressions count. impressions will be deduped (OPTIMIZED mode)
- * @param uniqueKeysTracker - unique keys tracker in charge of tracking the unique keys per split.
- * @returns None strategy
- */
-function strategyNoneFactory(impressionCounts, uniqueKeysTracker) {
-    return {
-        process: function (impression) {
-            var now = Date.now();
-            // Increments impression counter per featureName
-            impressionCounts.track(impression.feature, now, 1);
-            // Keep track by unique key
-            uniqueKeysTracker.track(impression.keyName, impression.feature);
-            // Do not store impressions
-            return false;
-        }
-    };
-}
-exports.strategyNoneFactory = strategyNoneFactory;

package/cjs/trackers/strategy/strategyOptimized.js

@@ -1,28 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.strategyOptimizedFactory = void 0;
-var time_1 = require("../../utils/time");
-/**
- * Optimized strategy for impressions tracker. Wraps impressions to store and adds previousTime if it corresponds
- *
- * @param impressionsObserver - impression observer. previous time (pt property) is included in impression instances
- * @param impressionCounts - cache to save impressions count. impressions will be deduped (OPTIMIZED mode)
- * @returns Optimized strategy
- */
-function strategyOptimizedFactory(impressionsObserver, impressionCounts) {
-    return {
-        process: function (impression) {
-            // DEBUG mode without previous time, for impressions with properties
-            if (impression.properties)
-                return true;
-            impression.pt = impressionsObserver.testAndSet(impression);
-            var now = Date.now();
-            // Increments impression counter per featureName
-            if (impression.pt)
-                impressionCounts.track(impression.feature, now, 1);
-            // Checks if the impression should be added in queue to be sent
-            return (!impression.pt || impression.pt < (0, time_1.truncateTimeFrame)(now)) ? true : false;
-        }
-    };
-}
-exports.strategyOptimizedFactory = strategyOptimizedFactory;

package/cjs/trackers/telemetryTracker.js

@@ -1,75 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.telemetryTrackerFactory = void 0;
-var labels_1 = require("../utils/labels");
-var timer_1 = require("../utils/timeTracker/timer");
-var constants_1 = require("../utils/constants");
-function telemetryTrackerFactory(telemetryCache, now) {
-    if (telemetryCache && now) {
-        var startTime_1 = (0, timer_1.timer)(now);
-        return {
-            trackEval: function (method) {
-                var evalTime = (0, timer_1.timer)(now);
-                return function (label) {
-                    switch (label) {
-                        case labels_1.EXCEPTION:
-                            telemetryCache.recordException(method);
-                            return; // Don't track latency on exceptions
-                        case labels_1.SDK_NOT_READY: // @ts-ignore ITelemetryCacheAsync doesn't implement the method
-                            if (telemetryCache.recordNonReadyUsage)
-                                telemetryCache.recordNonReadyUsage();
-                    }
-                    telemetryCache.recordLatency(method, evalTime());
-                };
-            },
-            trackHttp: function (operation) {
-                var httpTime = (0, timer_1.timer)(now);
-                return function (error) {
-                    telemetryCache.recordHttpLatency(operation, httpTime());
-                    if (error && error.statusCode)
-                        telemetryCache.recordHttpError(operation, error.statusCode);
-                    else
-                        telemetryCache.recordSuccessfulSync(operation, Date.now());
-                };
-            },
-            sessionLength: function () {
-                if (telemetryCache.recordSessionLength)
-                    telemetryCache.recordSessionLength(startTime_1());
-            },
-            streamingEvent: function (e, d) {
-                if (e === constants_1.AUTH_REJECTION) {
-                    telemetryCache.recordAuthRejections();
-                }
-                else {
-                    telemetryCache.recordStreamingEvents({
-                        e: e,
-                        d: d,
-                        t: Date.now()
-                    });
-                    if (e === constants_1.TOKEN_REFRESH)
-                        telemetryCache.recordTokenRefreshes();
-                }
-            },
-            addTag: function (tag) {
-                // @ts-ignore
-                if (telemetryCache.addTag)
-                    telemetryCache.addTag(tag);
-            },
-            trackUpdatesFromSSE: function (type) {
-                telemetryCache.recordUpdatesFromSSE(type);
-            }
-        };
-    }
-    else { // If there is not `telemetryCache` or `now` time tracker, return a no-op telemetry tracker
-        var noopTrack = function () { return function () { }; };
-        return {
-            trackEval: noopTrack,
-            trackHttp: noopTrack,
-            sessionLength: function () { },
-            streamingEvent: function () { },
-            addTag: function () { },
-            trackUpdatesFromSSE: function () { },
-        };
-    }
-}
-exports.telemetryTrackerFactory = telemetryTrackerFactory;

package/cjs/trackers/types.js

@@ -1,2 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });

package/cjs/trackers/uniqueKeysTracker.js

@@ -1,40 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.uniqueKeysTrackerFactory = void 0;
-var constants_1 = require("../logger/constants");
-var noopFilterAdapter = {
-    add: function () { return true; },
-    contains: function () { return true; },
-    clear: function () { }
-};
-/**
- * Tracks uniques keys
- * Unique Keys Tracker will be in charge of checking if the MTK was already sent to the BE in the last period
- * or schedule to be sent; if not it will be added in an internal cache and sent in the next post.
- *
- * @param log - Logger instance
- * @param uniqueKeysCache - cache to save unique keys
- * @param filterAdapter - filter adapter
- */
-function uniqueKeysTrackerFactory(log, uniqueKeysCache, filterAdapter) {
-    if (filterAdapter === void 0) { filterAdapter = noopFilterAdapter; }
-    var intervalId;
-    return {
-        track: function (key, featureName) {
-            if (!filterAdapter.add(key, featureName)) {
-                log.debug(constants_1.LOG_PREFIX_UNIQUE_KEYS_TRACKER + "The feature " + featureName + " and key " + key + " exist in the filter");
-                return;
-            }
-            uniqueKeysCache.track(key, featureName);
-        },
-        start: function () {
-            if (filterAdapter.refreshRate) {
-                intervalId = setInterval(filterAdapter.clear, filterAdapter.refreshRate);
-            }
-        },
-        stop: function () {
-            clearInterval(intervalId);
-        }
-    };
-}
-exports.uniqueKeysTrackerFactory = uniqueKeysTrackerFactory;

package/cjs/types.js

@@ -1,2 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });

package/cjs/utils/Backoff.js

@@ -1,41 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Backoff = void 0;
-var Backoff = /** @class */ (function () {
-    /**
-     * Schedule function calls with exponential backoff
-     */
-    function Backoff(cb, baseMillis, maxMillis) {
-        this.baseMillis = Backoff.__TEST__BASE_MILLIS || baseMillis || Backoff.DEFAULT_BASE_MILLIS;
-        this.maxMillis = Backoff.__TEST__MAX_MILLIS || maxMillis || Backoff.DEFAULT_MAX_MILLIS;
-        this.attempts = 0;
-        this.cb = cb;
-    }
-    /**
-     * Schedule a next call to `cb`
-     * @returns scheduled delay in milliseconds
-     */
-    Backoff.prototype.scheduleCall = function () {
-        var _this = this;
-        var delayInMillis = Math.min(this.baseMillis * Math.pow(2, this.attempts), this.maxMillis);
-        if (this.timeoutID)
-            clearTimeout(this.timeoutID);
-        this.timeoutID = setTimeout(function () {
-            _this.timeoutID = undefined;
-            _this.cb();
-        }, delayInMillis);
-        this.attempts++;
-        return delayInMillis;
-    };
-    Backoff.prototype.reset = function () {
-        this.attempts = 0;
-        if (this.timeoutID) {
-            clearTimeout(this.timeoutID);
-            this.timeoutID = undefined;
-        }
-    };
-    Backoff.DEFAULT_BASE_MILLIS = 1000; // 1 second
-    Backoff.DEFAULT_MAX_MILLIS = 1800000; // 30 minutes
-    return Backoff;
-}());
-exports.Backoff = Backoff;

package/cjs/utils/LRUCache/LinkedList.js

@@ -1,114 +0,0 @@
-"use strict";
-/* eslint-disable no-use-before-define */
-/**
- * yallist implementation based on isaacs/yallist (https://github.com/isaacs/yallist/yallist.js),
- * with the minimal features used by the SDK.
-
-Copyright (c) Isaac Z. Schlueter and Contributors
-
-Permission to use, copy, modify, and/or distribute this software for any
-purpose with or without fee is hereby granted, provided that the above
-copyright notice and this permission notice appear in all copies.
-
-THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR
-IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
-**/
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LinkedList = exports.Node = void 0;
-var Node = /** @class */ (function () {
-    function Node(value, prev, next, list) {
-        this.list = list;
-        this.value = value;
-        if (prev) {
-            prev.next = this;
-            this.prev = prev;
-        }
-        else {
-            this.prev = null;
-        }
-        if (next) {
-            next.prev = this;
-            this.next = next;
-        }
-        else {
-            this.next = null;
-        }
-    }
-    return Node;
-}());
-exports.Node = Node;
-var LinkedList = /** @class */ (function () {
-    function LinkedList() {
-        this.tail = null;
-        this.head = null;
-        this.length = 0;
-    }
-    // removes the given node of `this` list and returns the next node.
-    LinkedList.prototype.removeNode = function (node) {
-        if (!node || !(node instanceof Node))
-            return;
-        if (node.list !== this) {
-            throw new Error('removing node which does not belong to this list');
-        }
-        var next = node.next;
-        var prev = node.prev;
-        if (next) {
-            next.prev = prev;
-        }
-        if (prev) {
-            prev.next = next;
-        }
-        if (node === this.head) {
-            this.head = next;
-        }
-        if (node === this.tail) {
-            this.tail = prev;
-        }
-        node.list.length--;
-        node.next = null;
-        node.prev = null;
-        node.list = null;
-        return next;
-    };
-    // Move a Node object to the front of the list. (That is, pull it out of wherever it lives, and make it the new head.)
-    // If the node belongs to a different list, then that list will remove it first.
-    LinkedList.prototype.unshiftNode = function (node) {
-        if (!node || !(node instanceof Node))
-            return;
-        if (node === this.head) {
-            return;
-        }
-        if (node.list) {
-            node.list.removeNode(node);
-        }
-        var head = this.head;
-        node.list = this;
-        node.next = head;
-        if (head) {
-            head.prev = node;
-        }
-        this.head = node;
-        if (!this.tail) {
-            this.tail = node;
-        }
-        this.length++;
-    };
-    // similar to Array.prototype.unshift, it adds one or more elements to the head of the list and returns the new length of the list.
-    LinkedList.prototype.unshift = function () {
-        for (var i = 0, l = arguments.length; i < l; i++) {
-            this.head = new Node(arguments[i], null, this.head, this);
-            if (!this.tail) {
-                this.tail = this.head;
-            }
-            this.length++;
-        }
-        return this.length;
-    };
-    return LinkedList;
-}());
-exports.LinkedList = LinkedList;

package/cjs/utils/LRUCache/index.js

@@ -1,42 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.LRUCache = void 0;
-var LinkedList_1 = require("./LinkedList");
-var LRUCache = /** @class */ (function () {
-    function LRUCache(maxSize) {
-        this.maxLen = maxSize || 1;
-        this.items = new Map();
-        this.lru = new LinkedList_1.LinkedList();
-    }
-    LRUCache.prototype.get = function (key) {
-        var node = this.items.get(key);
-        if (!node || !(node instanceof LinkedList_1.Node))
-            return;
-        this.lru.unshiftNode(node); // Move to front
-        return node.value.value;
-    };
-    LRUCache.prototype.set = function (key, value) {
-        var node = this.items.get(key);
-        if (node) {
-            if (!(node instanceof LinkedList_1.Node))
-                return false;
-            this.lru.unshiftNode(node); // Move to front
-            this.lru.head.value.value = value; // Update value
-        }
-        else {
-            if (this.lru.length === this.maxLen) { // Remove last
-                var last = this.lru.tail;
-                if (!last)
-                    return false;
-                this.items.delete(last.value.key);
-                this.lru.removeNode(this.lru.tail); // Remove node
-            }
-            // @ts-ignore
-            this.lru.unshift({ key: key, value: value }); // Push front
-            this.items.set(key, this.lru.head);
-        }
-        return true;
-    };
-    return LRUCache;
-}());
-exports.LRUCache = LRUCache;

package/cjs/utils/MinEventEmitter.js

@@ -1,100 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.EventEmitter = void 0;
-var NEW_LISTENER_EVENT = 'newListener';
-var REMOVE_LISTENER_EVENT = 'removeListener';
-function checkListener(listener) {
-    if (typeof listener !== 'function') {
-        throw new TypeError('The "listener" argument must be of type Function. Received type ' + typeof listener);
-    }
-}
-// @TODO implement missing methods, check spec and add UTs
-var EventEmitter = /** @class */ (function () {
-    function EventEmitter() {
-        this.listeners = {};
-    }
-    EventEmitter.prototype.registerListener = function (type, listener, oneTime) {
-        checkListener(listener);
-        // To avoid recursion in the case that type === "newListener" before
-        // adding it to the listeners, first emit "newListener".
-        this.emit(NEW_LISTENER_EVENT, type, listener);
-        if (!this.listeners[type]) {
-            this.listeners[type] = [[listener, oneTime]];
-        }
-        else {
-            this.listeners[type].push([listener, oneTime]);
-        }
-        return this;
-    };
-    EventEmitter.prototype.addListener = function (type, listener) {
-        return this.registerListener(type, listener, false);
-    };
-    // alias of addListener
-    EventEmitter.prototype.on = function (type, listener) {
-        return this.addListener(type, listener);
-    };
-    EventEmitter.prototype.once = function (type, listener) {
-        return this.registerListener(type, listener, true);
-    };
-    // @ts-ignore
-    EventEmitter.prototype.removeListener = function ( /* type: string, listener: (...args: any[]) => void */) {
-        throw new Error('Method not implemented.');
-    };
-    // @ts-ignore alias of removeListener
-    EventEmitter.prototype.off = function ( /* type: string, listener: (...args: any[]) => void */) {
-        return this.removeListener( /* type, listener */);
-    };
-    EventEmitter.prototype.emit = function (type) {
-        var args = [];
-        for (var _i = 1; _i < arguments.length; _i++) {
-            args[_i - 1] = arguments[_i];
-        }
-        // Returns false if the event doesn't have listeners
-        if (!this.listeners[type] || this.listeners[type].length === 0)
-            return false;
-        // Call listeners while removing one-time listeners
-        this.listeners[type] = this.listeners[type].filter(function (listenerEntry) {
-            listenerEntry[0].apply(listenerEntry, args);
-            return !listenerEntry[1];
-        });
-        return true;
-    };
-    EventEmitter.prototype.removeAllListeners = function (type) {
-        if (!this.listeners[REMOVE_LISTENER_EVENT]) {
-            // if not listening for `removeListener`, no need to emit
-            if (type) {
-                if (this.listeners[type])
-                    delete this.listeners[type];
-            }
-            else {
-                this.listeners = {};
-            }
-        }
-        else {
-            // emit `removeListener` for all listeners
-            if (type) {
-                var listeners = this.listeners[type];
-                if (listeners) {
-                    // LIFO order
-                    for (var i = listeners.length - 1; i >= 0; i--) {
-                        this.emit(REMOVE_LISTENER_EVENT, type, listeners[i]);
-                    }
-                    delete this.listeners[type];
-                }
-            }
-            else {
-                var keys = Object.keys(this.listeners);
-                for (var i = 0; i < keys.length; ++i) {
-                    var key = keys[i];
-                    if (key === REMOVE_LISTENER_EVENT)
-                        continue;
-                    this.removeAllListeners(key);
-                }
-                this.listeners = {};
-            }
-        }
-        return this;
-    };
-    return EventEmitter;
-}());
-exports.EventEmitter = EventEmitter;

package/cjs/utils/Semver.js

@@ -1,103 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.Semver = void 0;
-var lang_1 = require("../utils/lang");
-var NUMERIC_IDENTIFIER_REGEX = /^[0-9]+$/;
-var METADATA_DELIMITER = '+';
-var PRERELEASE_DELIMITER = '-';
-var VALUE_DELIMITER = '.';
-/**
- * Compares two strings. If both strings are numeric identifiers, they are compared numerically. Otherwise, they are compared lexicographically.
- * This could be implemented using `a.localeCompare(b, undefined, { numeric: true })` but locale options are not broadly supported.
- */
-function compareStrings(a, b) {
-    if (NUMERIC_IDENTIFIER_REGEX.test(a) && NUMERIC_IDENTIFIER_REGEX.test(b)) {
-        var result = a.length - b.length;
-        if (result !== 0) {
-            return result;
-        }
-    }
-    return a < b ? -1 : a > b ? 1 : 0;
-}
-// Sanitizes a numeric identifier by removing leading zeros
-function sanitizeNumericIdentifier(value) {
-    return value.replace(/^0+(?=\d)/, '');
-}
-function throwError(version) {
-    throw new Error('Unable to convert to Semver, incorrect format: ' + version);
-}
-var Semver = /** @class */ (function () {
-    function Semver(version) {
-        if (!(0, lang_1.isString)(version))
-            throwError(version);
-        // Separate metadata if exists
-        var index = version.indexOf(METADATA_DELIMITER);
-        var _a = index === -1 ? [version] : [version.slice(0, index), version.slice(index + 1)], vWithoutMetadata = _a[0], metadata = _a[1];
-        if (metadata === '')
-            throwError(version);
-        // Set pre-release versions if exists
-        index = vWithoutMetadata.indexOf(PRERELEASE_DELIMITER);
-        if (index === -1) {
-            this._isStable = true;
-            this._preRelease = [];
-        }
-        else {
-            this._isStable = false;
-            this._preRelease = vWithoutMetadata.slice(index + 1).split(VALUE_DELIMITER).map(function (value) {
-                if (!value)
-                    throwError(version);
-                return NUMERIC_IDENTIFIER_REGEX.test(value) ?
-                    sanitizeNumericIdentifier(value) :
-                    value;
-            });
-            vWithoutMetadata = vWithoutMetadata.slice(0, index);
-        }
-        // Set major, minor, and patch versions
-        var vParts = vWithoutMetadata.split(VALUE_DELIMITER).map(function (value) {
-            if (!value || !NUMERIC_IDENTIFIER_REGEX.test(value))
-                throwError(version);
-            return sanitizeNumericIdentifier(value);
-        });
-        if (vParts.length !== 3)
-            throwError(version);
-        this._major = vParts[0];
-        this._minor = vParts[1];
-        this._patch = vParts[2];
-        // Set version string
-        this.version = vParts.join(VALUE_DELIMITER);
-        if (this._preRelease.length)
-            this.version += PRERELEASE_DELIMITER + this._preRelease.join(VALUE_DELIMITER);
-        if (metadata)
-            this.version += METADATA_DELIMITER + metadata;
-    }
-    /**
-     * Precedence comparision between 2 Semver objects.
-     *
-     * @returns `0` if `this === toCompare`, `-1` if `this < toCompare`, and `1` if `this > toCompare`
-     */
-    Semver.prototype.compare = function (toCompare) {
-        if (this.version === toCompare.version)
-            return 0;
-        var result = compareStrings(this._major, toCompare._major);
-        if (result !== 0)
-            return result;
-        result = compareStrings(this._minor, toCompare._minor);
-        if (result !== 0)
-            return result;
-        result = compareStrings(this._patch, toCompare._patch);
-        if (result !== 0)
-            return result;
-        if (!this._isStable && toCompare._isStable)
-            return -1;
-        if (this._isStable && !toCompare._isStable)
-            return 1;
-        for (var i = 0, length_1 = Math.min(this._preRelease.length, toCompare._preRelease.length); i < length_1; i++) {
-            var result_1 = compareStrings(this._preRelease[i], toCompare._preRelease[i]);
-            if (result_1 !== 0)
-                return result_1;
-        }
-        return this._preRelease.length - toCompare._preRelease.length;
-    };
-    return Semver;
-}());
-exports.Semver = Semver;

package/cjs/utils/base64/index.js

@@ -1,75 +0,0 @@
-"use strict";
-/**
- * Base64 utils in pure JS, for browser, node and others which don't provide globals `btoa` and `atob`.
- * Implementation based on davidchambers/Base64 (https://github.com/davidchambers/Base64.js).
-
-   Copyright 2019 David Chambers
-
-   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.
- */
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.encodeToBase64 = exports.decodeFromBase64 = void 0;
-var chars = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
-/**
- * Decode a given string value in Base64 format
- *
- * @param input - value to decode
- */
-function decodeFromBase64(input) {
-    var str = (String(input)).replace(/[=]+$/, ''); // #31: ExtendScript bad parse of /=
-    if (str.length % 4 === 1) {
-        throw new Error("'atob' failed: The string to be decoded is not correctly encoded.");
-    }
-    var output = '';
-    for (
-    // initialize result and counters
-    var bc = 0, bs = void 0, buffer = void 0, idx = 0; 
-    // get next character
-    buffer = str.charAt(idx++); // eslint-disable-line no-cond-assign
-     
-    // character found in table? initialize bit storage and add its ascii value;
-    // @ts-ignore
-    ~buffer && (bs = bc % 4 ? bs * 64 + buffer : buffer, bc++ % 4) ? output += String.fromCharCode(255 & bs >> (-2 * bc & 6)) : 0) {
-        // try to find character in table (0-63, not found => -1)
-        buffer = chars.indexOf(buffer);
-    }
-    return output;
-}
-exports.decodeFromBase64 = decodeFromBase64;
-/**
- * Encode a given string value to Base64 format.
- *
- * @param input - value to encode
- */
-function encodeToBase64(input) {
-    var str = String(input);
-    var output = '';
-    for (
-    // initialize result and counter
-    var block = void 0, charCode = void 0, idx = 0, map = chars; 
-    // if the next str index does not exist:
-    //   change the mapping table to "="
-    //   check if d has no fractional digits
-    str.charAt(idx | 0) || (map = '=', idx % 1); 
-    // "8 - idx % 1 * 8" generates the sequence 2, 4, 6, 8
-    output += map.charAt(63 & block >> 8 - idx % 1 * 8)) {
-        charCode = str.charCodeAt(idx += 3 / 4);
-        if (charCode > 0xFF) {
-            throw new Error("'btoa' failed: The string to be encoded contains characters outside of the Latin1 range.");
-        }
-        // @ts-ignore
-        block = block << 8 | charCode;
-    }
-    return output;
-}
-exports.encodeToBase64 = encodeToBase64;