@paulirish/trace_engine 0.0.17 → 0.0.19

package/core/platform/number-utilities.js

@@ -1,82 +0,0 @@
-// Copyright (c) 2020 The Chromium Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-export const clamp = (num, min, max) => {
-    let clampedNumber = num;
-    if (num < min) {
-        clampedNumber = min;
-    }
-    else if (num > max) {
-        clampedNumber = max;
-    }
-    return clampedNumber;
-};
-export const mod = (m, n) => {
-    return ((m % n) + n) % n;
-};
-export const bytesToString = (bytes) => {
-    if (bytes < 1000) {
-        return `${bytes.toFixed(0)}\xA0B`;
-    }
-    const kilobytes = bytes / 1000;
-    if (kilobytes < 100) {
-        return `${kilobytes.toFixed(1)}\xA0kB`;
-    }
-    if (kilobytes < 1000) {
-        return `${kilobytes.toFixed(0)}\xA0kB`;
-    }
-    const megabytes = kilobytes / 1000;
-    if (megabytes < 100) {
-        return `${megabytes.toFixed(1)}\xA0MB`;
-    }
-    return `${megabytes.toFixed(0)}\xA0MB`;
-};
-export const toFixedIfFloating = (value) => {
-    if (!value || Number.isNaN(Number(value))) {
-        return value;
-    }
-    const number = Number(value);
-    return number % 1 ? number.toFixed(3) : String(number);
-};
-/**
- * Rounds a number (including float) down.
- */
-export const floor = (value, precision = 0) => {
-    const mult = Math.pow(10, precision);
-    return Math.floor(value * mult) / mult;
-};
-/**
- * Computes the great common divisor for two numbers.
- * If the numbers are floats, they will be rounded to an integer.
- */
-export const greatestCommonDivisor = (a, b) => {
-    a = Math.round(a);
-    b = Math.round(b);
-    while (b !== 0) {
-        const t = b;
-        b = a % b;
-        a = t;
-    }
-    return a;
-};
-const commonRatios = new Map([
-    ['8∶5', '16∶10'],
-]);
-export const aspectRatio = (width, height) => {
-    const divisor = greatestCommonDivisor(width, height);
-    if (divisor !== 0) {
-        width /= divisor;
-        height /= divisor;
-    }
-    const result = `${width}∶${height}`;
-    return commonRatios.get(result) || result;
-};
-export const withThousandsSeparator = function (num) {
-    let str = String(num);
-    const re = /(\d+)(\d{3})/;
-    while (str.match(re)) {
-        str = str.replace(re, '$1\xA0$2');
-    } // \xa0 is a non-breaking space
-    return str;
-};
-//# sourceMappingURL=number-utilities.js.map

package/core/platform/number-utilities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"number-utilities.js","sourceRoot":"","sources":["../../../../../../front_end/core/platform/number-utilities.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAChE,yEAAyE;AACzE,6BAA6B;AAE7B,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,GAAW,EAAE,GAAW,EAAU,EAAE;IACrE,IAAI,aAAa,GAAG,GAAG,CAAC;IACxB,IAAI,GAAG,GAAG,GAAG,EAAE;QACb,aAAa,GAAG,GAAG,CAAC;KACrB;SAAM,IAAI,GAAG,GAAG,GAAG,EAAE;QACpB,aAAa,GAAG,GAAG,CAAC;KACrB;IACD,OAAO,aAAa,CAAC;AACvB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IAClD,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;AAC3B,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAa,EAAU,EAAE;IACrD,IAAI,KAAK,GAAG,IAAI,EAAE;QAChB,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;KACnC;IAED,MAAM,SAAS,GAAG,KAAK,GAAG,IAAI,CAAC;IAC/B,IAAI,SAAS,GAAG,GAAG,EAAE;QACnB,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;KACxC;IACD,IAAI,SAAS,GAAG,IAAI,EAAE;QACpB,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;KACxC;IAED,MAAM,SAAS,GAAG,SAAS,GAAG,IAAI,CAAC;IACnC,IAAI,SAAS,GAAG,GAAG,EAAE;QACnB,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;KACxC;IACD,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;AACzC,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,KAAa,EAAU,EAAE;IACzD,IAAI,CAAC,KAAK,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE;QACzC,OAAO,KAAK,CAAC;KACd;IACD,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7B,OAAO,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AACzD,CAAC,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,KAAa,EAAE,YAAoB,CAAC,EAAU,EAAE;IACpE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IACrC,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;AACzC,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;IACpE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAClB,OAAO,CAAC,KAAK,CAAC,EAAE;QACd,MAAM,CAAC,GAAG,CAAC,CAAC;QACZ,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACV,CAAC,GAAG,CAAC,CAAC;KACP;IACD,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC;IAC3B,CAAC,KAAK,EAAE,OAAO,CAAC;CACjB,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAa,EAAE,MAAc,EAAU,EAAE;IACnE,MAAM,OAAO,GAAG,qBAAqB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACrD,IAAI,OAAO,KAAK,CAAC,EAAE;QACjB,KAAK,IAAI,OAAO,CAAC;QACjB,MAAM,IAAI,OAAO,CAAC;KACnB;IACD,MAAM,MAAM,GAAG,GAAG,KAAK,IAAI,MAAM,EAAE,CAAC;IACpC,OAAO,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC;AAC5C,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,sBAAsB,GAAG,UAAS,GAAW;IACxD,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC;IACtB,MAAM,EAAE,GAAG,cAAc,CAAC;IAC1B,OAAO,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE;QACpB,GAAG,GAAG,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;KACnC,CAAE,+BAA+B;IAClC,OAAO,GAAG,CAAC;AACb,CAAC,CAAC","sourcesContent":["// Copyright (c) 2020 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\nexport const clamp = (num: number, min: number, max: number): number => {\n  let clampedNumber = num;\n  if (num < min) {\n    clampedNumber = min;\n  } else if (num > max) {\n    clampedNumber = max;\n  }\n  return clampedNumber;\n};\n\nexport const mod = (m: number, n: number): number => {\n  return ((m % n) + n) % n;\n};\n\nexport const bytesToString = (bytes: number): string => {\n  if (bytes < 1000) {\n    return `${bytes.toFixed(0)}\\xA0B`;\n  }\n\n  const kilobytes = bytes / 1000;\n  if (kilobytes < 100) {\n    return `${kilobytes.toFixed(1)}\\xA0kB`;\n  }\n  if (kilobytes < 1000) {\n    return `${kilobytes.toFixed(0)}\\xA0kB`;\n  }\n\n  const megabytes = kilobytes / 1000;\n  if (megabytes < 100) {\n    return `${megabytes.toFixed(1)}\\xA0MB`;\n  }\n  return `${megabytes.toFixed(0)}\\xA0MB`;\n};\n\nexport const toFixedIfFloating = (value: string): string => {\n  if (!value || Number.isNaN(Number(value))) {\n    return value;\n  }\n  const number = Number(value);\n  return number % 1 ? number.toFixed(3) : String(number);\n};\n\n/**\n * Rounds a number (including float) down.\n */\nexport const floor = (value: number, precision: number = 0): number => {\n  const mult = Math.pow(10, precision);\n  return Math.floor(value * mult) / mult;\n};\n\n/**\n * Computes the great common divisor for two numbers.\n * If the numbers are floats, they will be rounded to an integer.\n */\nexport const greatestCommonDivisor = (a: number, b: number): number => {\n  a = Math.round(a);\n  b = Math.round(b);\n  while (b !== 0) {\n    const t = b;\n    b = a % b;\n    a = t;\n  }\n  return a;\n};\n\nconst commonRatios = new Map([\n  ['8∶5', '16∶10'],\n]);\n\nexport const aspectRatio = (width: number, height: number): string => {\n  const divisor = greatestCommonDivisor(width, height);\n  if (divisor !== 0) {\n    width /= divisor;\n    height /= divisor;\n  }\n  const result = `${width}∶${height}`;\n  return commonRatios.get(result) || result;\n};\n\nexport const withThousandsSeparator = function(num: number): string {\n  let str = String(num);\n  const re = /(\\d+)(\\d{3})/;\n  while (str.match(re)) {\n    str = str.replace(re, '$1\\xA0$2');\n  }  // \\xa0 is a non-breaking space\n  return str;\n};\n"]}

package/core/platform/promise-utilities.d.ts

@@ -1,10 +0,0 @@
-/**
- * Returns a new pending promise together with it's resolve and reject functions.
- *
- * Polyfill for https://github.com/tc39/proposal-promise-with-resolvers.
- */
-export declare function promiseWithResolvers<T = unknown>(): {
-    promise: Promise<T>;
-    resolve: (value: T | PromiseLike<T>) => void;
-    reject: (error?: Error) => void;
-};

package/core/platform/promise-utilities.js

@@ -1,18 +0,0 @@
-// Copyright 2023 The Chromium Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-/**
- * Returns a new pending promise together with it's resolve and reject functions.
- *
- * Polyfill for https://github.com/tc39/proposal-promise-with-resolvers.
- */
-export function promiseWithResolvers() {
-    let resolve;
-    let reject;
-    const promise = new Promise((res, rej) => {
-        resolve = res;
-        reject = rej;
-    });
-    return { promise, resolve, reject };
-}
-//# sourceMappingURL=promise-utilities.js.map

package/core/platform/promise-utilities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"promise-utilities.js","sourceRoot":"","sources":["../../../../../../front_end/core/platform/promise-utilities.ts"],"names":[],"mappings":"AAAA,4DAA4D;AAC5D,yEAAyE;AACzE,6BAA6B;AAE7B;;;;GAIG;AACH,MAAM,UAAU,oBAAoB;IAKlC,IAAI,OAA2C,CAAC;IAChD,IAAI,MAAgC,CAAC;IACrC,MAAM,OAAO,GAAG,IAAI,OAAO,CAAI,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE;QAC1C,OAAO,GAAG,GAAG,CAAC;QACd,MAAM,GAAG,GAAG,CAAC;IACf,CAAC,CAAC,CAAC;IACH,OAAO,EAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAC,CAAC;AACpC,CAAC","sourcesContent":["// Copyright 2023 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\n/**\n * Returns a new pending promise together with it's resolve and reject functions.\n *\n * Polyfill for https://github.com/tc39/proposal-promise-with-resolvers.\n */\nexport function promiseWithResolvers<T = unknown>(): {\n  promise: Promise<T>,\n  resolve: (value: T|PromiseLike<T>) => void,\n  reject: (error?: Error) => void,\n} {\n  let resolve!: (value: T|PromiseLike<T>) => void;\n  let reject!: (error?: Error) => void;\n  const promise = new Promise<T>((res, rej) => {\n    resolve = res;\n    reject = rej;\n  });\n  return {promise, resolve, reject};\n}\n"]}

package/core/platform/set-utilities.d.ts

@@ -1,2 +0,0 @@
-export declare const addAll: <T>(set: Set<T>, iterable: Iterable<T>) => void;
-export declare const isEqual: <T>(setA: Set<T>, setB: Set<T>) => boolean;

package/core/platform/set-utilities.js

@@ -1,23 +0,0 @@
-// Copyright (c) 2020 The Chromium Authors. All rights reserved.
-// Use of this source code is governed by a BSD-style license that can be
-// found in the LICENSE file.
-export const addAll = function (set, iterable) {
-    for (const item of iterable) {
-        set.add(item);
-    }
-};
-export const isEqual = function (setA, setB) {
-    if (setA === setB) {
-        return true;
-    }
-    if (setA.size !== setB.size) {
-        return false;
-    }
-    for (const item of setA) {
-        if (!setB.has(item)) {
-            return false;
-        }
-    }
-    return true;
-};
-//# sourceMappingURL=set-utilities.js.map

package/core/platform/set-utilities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"set-utilities.js","sourceRoot":"","sources":["../../../../../../front_end/core/platform/set-utilities.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAChE,yEAAyE;AACzE,6BAA6B;AAE7B,MAAM,CAAC,MAAM,MAAM,GAAG,UAAY,GAAW,EAAE,QAAqB;IAClE,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;QAC3B,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;KACf;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,OAAO,GAAG,UAAY,IAAY,EAAE,IAAY;IAC3D,IAAI,IAAI,KAAK,IAAI,EAAE;QACjB,OAAO,IAAI,CAAC;KACb;IACD,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;QAC3B,OAAO,KAAK,CAAC;KACd;IACD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE;QACvB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;YACnB,OAAO,KAAK,CAAC;SACd;KACF;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC","sourcesContent":["// Copyright (c) 2020 The Chromium Authors. All rights reserved.\n// Use of this source code is governed by a BSD-style license that can be\n// found in the LICENSE file.\n\nexport const addAll = function<T>(set: Set<T>, iterable: Iterable<T>): void {\n  for (const item of iterable) {\n    set.add(item);\n  }\n};\n\nexport const isEqual = function<T>(setA: Set<T>, setB: Set<T>): boolean {\n  if (setA === setB) {\n    return true;\n  }\n  if (setA.size !== setB.size) {\n    return false;\n  }\n  for (const item of setA) {\n    if (!setB.has(item)) {\n      return false;\n    }\n  }\n  return true;\n};\n"]}

package/core/platform/string-utilities.d.ts

@@ -1,71 +0,0 @@
-export declare const escapeCharacters: (inputString: string, charsToEscape: string) => string;
-export declare const formatAsJSLiteral: (content: string) => string;
-/**
- * This implements a subset of the sprintf() function described in the Single UNIX
- * Specification. It supports the %s, %f, %d, and %% formatting specifiers, and
- * understands the %m$d notation to select the m-th parameter for this substitution,
- * as well as the optional precision for %s, %f, and %d.
- *
- * @param fmt format string.
- * @param args parameters to the format string.
- * @returns the formatted output string.
- */
-export declare const sprintf: (fmt: string, ...args: unknown[]) => string;
-export declare const toBase64: (inputString: string) => string;
-export declare const findIndexesOfSubString: (inputString: string, searchString: string) => number[];
-export declare const findLineEndingIndexes: (inputString: string) => number[];
-export declare const isWhitespace: (inputString: string) => boolean;
-export declare const trimURL: (url: string, baseURLDomain?: string) => string;
-export declare const collapseWhitespace: (inputString: string) => string;
-export declare const reverse: (inputString: string) => string;
-export declare const replaceControlCharacters: (inputString: string) => string;
-export declare const countWtf8Bytes: (inputString: string) => number;
-export declare const stripLineBreaks: (inputStr: string) => string;
-/**
- * Tests if the `inputStr` is following the extended Kebab Case naming convetion,
- * where words are separated with either a dash (`-`) or a dot (`.`), and all
- * characters must be lower-case alphanumeric.
- *
- * For example, it will yield `true` for `'my.amazing-string.literal'`, but `false`
- * for `'Another.AmazingLiteral'` or '`another_amazing_literal'`.
- *
- * @param inputStr the input string to test.
- * @return `true` if the `inputStr` follows the extended Kebab Case convention.
- */
-export declare const isExtendedKebabCase: (inputStr: string) => boolean;
-export declare const toTitleCase: (inputStr: string) => string;
-export declare const removeURLFragment: (inputStr: string) => string;
-export declare const regexSpecialCharacters: () => string;
-export declare const filterRegex: (query: string) => RegExp;
-export declare const createSearchRegex: (query: string, caseSensitive: boolean, isRegex: boolean, matchWholeWord?: boolean) => RegExp;
-export declare const caseInsensetiveComparator: (a: string, b: string) => number;
-export declare const hashCode: (string?: string) => number;
-export declare const compare: (a: string, b: string) => number;
-export declare const trimMiddle: (str: string, maxLength: number) => string;
-export declare const trimEndWithMaxLength: (str: string, maxLength: number) => string;
-export declare const escapeForRegExp: (str: string) => string;
-export declare const naturalOrderComparator: (a: string, b: string) => number;
-export declare const base64ToSize: (content: string | null) => number;
-export declare const SINGLE_QUOTE = "'";
-export declare const DOUBLE_QUOTE = "\"";
-export declare const findUnclosedCssQuote: (str: string) => string;
-export declare const countUnmatchedLeftParentheses: (str: string) => number;
-export declare const createPlainTextSearchRegex: (query: string, flags?: string) => RegExp;
-declare class LowerCaseStringTag {
-    private lowerCaseStringTag;
-}
-export type LowerCaseString = string & LowerCaseStringTag;
-export declare const toLowerCaseString: (input: string) => LowerCaseString;
-export declare const toKebabCase: (input: string) => Lowercase<string>;
-export declare function toKebabCaseKeys(settingValue: {
-    [x: string]: any;
-}): {
-    [x: string]: any;
-};
-export declare const replaceLast: (input: string, search: string, replacement: string) => string;
-export declare const stringifyWithPrecision: (s: number, precision?: number) => string;
-/**
- * Somewhat efficiently concatenates 2 base64 encoded strings.
- */
-export declare const concatBase64: (lhs: string, rhs: string) => string;
-export {};