@mcp-b/chrome-devtools-mcp 1.1.0 → 1.1.1

package/build/node_modules/chrome-devtools-frontend/front_end/models/emulation/emulation.js

@@ -0,0 +1,6 @@
+// Copyright 2021 The Chromium Authors
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+import * as DeviceModeModel from './DeviceModeModel.js';
+import * as EmulatedDevices from './EmulatedDevices.js';
+export { DeviceModeModel, EmulatedDevices, };

package/build/node_modules/chrome-devtools-frontend/front_end/models/formatter/FormatterWorkerPool.js

@@ -0,0 +1,145 @@
+// Copyright 2016 The Chromium Authors
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+import * as Platform from '../../core/platform/platform.js';
+let formatterWorkerPoolInstance;
+export class FormatterWorkerPool {
+    taskQueue;
+    workerTasks;
+    constructor() {
+        this.taskQueue = [];
+        this.workerTasks = new Map();
+    }
+    static instance() {
+        if (!formatterWorkerPoolInstance) {
+            formatterWorkerPoolInstance = new FormatterWorkerPool();
+        }
+        return formatterWorkerPoolInstance;
+    }
+    dispose() {
+        for (const task of this.taskQueue) {
+            console.error('rejecting task');
+            task.errorCallback(new Event('Worker terminated'));
+        }
+        for (const [worker, task] of this.workerTasks.entries()) {
+            task?.errorCallback(new Event('Worker terminated'));
+            worker.terminate(/* immediately=*/ true);
+        }
+    }
+    static removeInstance() {
+        formatterWorkerPoolInstance?.dispose();
+        formatterWorkerPoolInstance = undefined;
+    }
+    createWorker() {
+        const worker = Platform.HostRuntime.HOST_RUNTIME.createWorker(new URL('../../entrypoints/formatter_worker/formatter_worker-entrypoint.js', import.meta.url).toString());
+        worker.onmessage = this.onWorkerMessage.bind(this, worker);
+        worker.onerror = this.onWorkerError.bind(this, worker);
+        return worker;
+    }
+    processNextTask() {
+        const maxWorkers = Math.max(2, navigator.hardwareConcurrency - 1);
+        if (!this.taskQueue.length) {
+            return;
+        }
+        let freeWorker = [...this.workerTasks.keys()].find(worker => !this.workerTasks.get(worker));
+        if (!freeWorker && this.workerTasks.size < maxWorkers) {
+            freeWorker = this.createWorker();
+        }
+        if (!freeWorker) {
+            return;
+        }
+        const task = this.taskQueue.shift();
+        if (task) {
+            this.workerTasks.set(freeWorker, task);
+            freeWorker.postMessage({ method: task.method, params: task.params });
+        }
+    }
+    onWorkerMessage(worker, event) {
+        const task = this.workerTasks.get(worker);
+        if (!task) {
+            return;
+        }
+        if (task.isChunked && event.data && !event.data['isLastChunk']) {
+            task.callback(event.data);
+            return;
+        }
+        this.workerTasks.set(worker, null);
+        this.processNextTask();
+        task.callback(event.data ? event.data : null);
+    }
+    onWorkerError(worker, event) {
+        console.error(event);
+        const task = this.workerTasks.get(worker);
+        worker.terminate();
+        this.workerTasks.delete(worker);
+        const newWorker = this.createWorker();
+        this.workerTasks.set(newWorker, null);
+        this.processNextTask();
+        if (task) {
+            task.errorCallback(event);
+        }
+    }
+    runChunkedTask(methodName, params, callback) {
+        const task = new Task(methodName, params, onData, () => onData(null), true);
+        this.taskQueue.push(task);
+        this.processNextTask();
+        function onData(data) {
+            if (!data) {
+                callback(true, null);
+                return;
+            }
+            const isLastChunk = 'isLastChunk' in data && Boolean(data['isLastChunk']);
+            const chunk = 'chunk' in data && data['chunk'];
+            callback(isLastChunk, chunk);
+        }
+    }
+    // eslint-disable-next-line @typescript-eslint/no-explicit-any
+    runTask(methodName, params) {
+        return new Promise((resolve, reject) => {
+            const task = new Task(methodName, params, resolve, reject, false);
+            this.taskQueue.push(task);
+            this.processNextTask();
+        });
+    }
+    format(mimeType, content, indentString) {
+        const parameters = { mimeType, content, indentString };
+        return this.runTask("format" /* FormatterActions.FormatterActions.FORMAT */, parameters);
+    }
+    javaScriptSubstitute(expression, mapping) {
+        if (mapping.size === 0) {
+            return Promise.resolve(expression);
+        }
+        return this.runTask("javaScriptSubstitute" /* FormatterActions.FormatterActions.JAVASCRIPT_SUBSTITUTE */, { content: expression, mapping })
+            .then(result => result || '');
+    }
+    javaScriptScopeTree(expression, sourceType = 'script') {
+        return this.runTask("javaScriptScopeTree" /* FormatterActions.FormatterActions.JAVASCRIPT_SCOPE_TREE */, { content: expression, sourceType })
+            .then(result => result || null);
+    }
+    parseCSS(content, callback) {
+        this.runChunkedTask("parseCSS" /* FormatterActions.FormatterActions.PARSE_CSS */, { content }, onDataChunk);
+        // TODO(crbug.com/1172300) Ignored during the jsdoc to ts migration
+        // eslint-disable-next-line @typescript-eslint/no-explicit-any
+        function onDataChunk(isLastChunk, data) {
+            const rules = (data || []);
+            callback(isLastChunk, rules);
+        }
+    }
+}
+class Task {
+    method;
+    params;
+    callback;
+    errorCallback;
+    isChunked;
+    constructor(method, params, callback, errorCallback, isChunked) {
+        this.method = method;
+        this.params = params;
+        this.callback = callback;
+        this.errorCallback = errorCallback;
+        this.isChunked = isChunked;
+    }
+}
+export function formatterWorkerPool() {
+    return FormatterWorkerPool.instance();
+}

package/build/node_modules/chrome-devtools-frontend/front_end/models/formatter/ScriptFormatter.js

@@ -0,0 +1,77 @@
+// Copyright 2011 The Chromium Authors
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+import * as Common from '../../core/common/common.js';
+import * as Platform from '../../core/platform/platform.js';
+import { formatterWorkerPool } from './FormatterWorkerPool.js';
+function locationToPosition(lineEndings, lineNumber, columnNumber) {
+    const position = lineNumber ? lineEndings[lineNumber - 1] + 1 : 0;
+    return position + columnNumber;
+}
+function positionToLocation(lineEndings, position) {
+    const lineNumber = Platform.ArrayUtilities.upperBound(lineEndings, position - 1, Platform.ArrayUtilities.DEFAULT_COMPARATOR);
+    let columnNumber;
+    if (!lineNumber) {
+        columnNumber = position;
+    }
+    else {
+        columnNumber = position - lineEndings[lineNumber - 1] - 1;
+    }
+    return [lineNumber, columnNumber];
+}
+export async function format(contentType, mimeType, content, indent = Common.Settings.Settings.instance().moduleSetting('text-editor-indent').get()) {
+    if (contentType.isDocumentOrScriptOrStyleSheet()) {
+        return await formatScriptContent(mimeType, content, indent);
+    }
+    return { formattedContent: content, formattedMapping: new IdentityFormatterSourceMapping() };
+}
+export async function formatScriptContent(mimeType, content, indent = Common.Settings.Settings.instance().moduleSetting('text-editor-indent').get()) {
+    const originalContent = content.replace(/\r\n?|[\n\u2028\u2029]/g, '\n').replace(/^\uFEFF/, '');
+    const pool = formatterWorkerPool();
+    let formatResult = { content: originalContent, mapping: { original: [], formatted: [] } };
+    try {
+        formatResult = await pool.format(mimeType, originalContent, indent);
+    }
+    catch {
+    }
+    const originalContentLineEndings = Platform.StringUtilities.findLineEndingIndexes(originalContent);
+    const formattedContentLineEndings = Platform.StringUtilities.findLineEndingIndexes(formatResult.content);
+    const sourceMapping = new FormatterSourceMappingImpl(originalContentLineEndings, formattedContentLineEndings, formatResult.mapping);
+    return { formattedContent: formatResult.content, formattedMapping: sourceMapping };
+}
+class IdentityFormatterSourceMapping {
+    originalToFormatted(lineNumber, columnNumber = 0) {
+        return [lineNumber, columnNumber];
+    }
+    formattedToOriginal(lineNumber, columnNumber = 0) {
+        return [lineNumber, columnNumber];
+    }
+}
+class FormatterSourceMappingImpl {
+    originalLineEndings;
+    formattedLineEndings;
+    mapping;
+    constructor(originalLineEndings, formattedLineEndings, mapping) {
+        this.originalLineEndings = originalLineEndings;
+        this.formattedLineEndings = formattedLineEndings;
+        this.mapping = mapping;
+    }
+    originalToFormatted(lineNumber, columnNumber) {
+        const originalPosition = locationToPosition(this.originalLineEndings, lineNumber, columnNumber || 0);
+        const formattedPosition = this.convertPosition(this.mapping.original, this.mapping.formatted, originalPosition);
+        return positionToLocation(this.formattedLineEndings, formattedPosition);
+    }
+    formattedToOriginal(lineNumber, columnNumber) {
+        const formattedPosition = locationToPosition(this.formattedLineEndings, lineNumber, columnNumber || 0);
+        const originalPosition = this.convertPosition(this.mapping.formatted, this.mapping.original, formattedPosition);
+        return positionToLocation(this.originalLineEndings, originalPosition);
+    }
+    convertPosition(positions1, positions2, position) {
+        const index = Platform.ArrayUtilities.upperBound(positions1, position, Platform.ArrayUtilities.DEFAULT_COMPARATOR) - 1;
+        let convertedPosition = positions2[index] + position - positions1[index];
+        if (index < positions2.length - 1 && convertedPosition > positions2[index + 1]) {
+            convertedPosition = positions2[index + 1];
+        }
+        return convertedPosition;
+    }
+}

package/build/node_modules/chrome-devtools-frontend/front_end/models/formatter/formatter.js

@@ -0,0 +1,6 @@
+// Copyright 2019 The Chromium Authors
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+import * as FormatterWorkerPool from './FormatterWorkerPool.js';
+import * as ScriptFormatter from './ScriptFormatter.js';
+export { FormatterWorkerPool, ScriptFormatter };

package/build/node_modules/chrome-devtools-frontend/front_end/models/geometry/GeometryImpl.js

@@ -0,0 +1,347 @@
+// Copyright 2013 The Chromium Authors
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+import * as SDK from '../../core/sdk/sdk.js';
+const EPS = 1e-5;
+export class Vector {
+    x;
+    y;
+    z;
+    constructor(x, y, z) {
+        this.x = x;
+        this.y = y;
+        this.z = z;
+    }
+    length() {
+        return Math.sqrt(this.x * this.x + this.y * this.y + this.z * this.z);
+    }
+    normalize() {
+        const length = this.length();
+        if (length <= EPS) {
+            return;
+        }
+        this.x /= length;
+        this.y /= length;
+        this.z /= length;
+    }
+}
+export class Point {
+    x;
+    y;
+    constructor(x, y) {
+        this.x = x;
+        this.y = y;
+    }
+    distanceTo(p) {
+        return Math.sqrt(Math.pow(p.x - this.x, 2) + Math.pow(p.y - this.y, 2));
+    }
+    projectOn(line) {
+        if (line.x === 0 && line.y === 0) {
+            return new Point(0, 0);
+        }
+        return line.scale((this.x * line.x + this.y * line.y) / (Math.pow(line.x, 2) + Math.pow(line.y, 2)));
+    }
+    scale(scalar) {
+        return new Point(this.x * scalar, this.y * scalar);
+    }
+    toString() {
+        return Math.round(this.x * 100) / 100 + ', ' + Math.round(this.y * 100) / 100;
+    }
+}
+export class CubicBezier {
+    controlPoints;
+    constructor(point1, point2) {
+        this.controlPoints = [point1, point2];
+    }
+    static parse(text) {
+        const keywordValues = SDK.CSSMetadata.CubicBezierKeywordValues;
+        const value = text.toLowerCase().replace(/\s+/g, '');
+        if (keywordValues.has(value)) {
+            return CubicBezier.parse(keywordValues.get(value));
+        }
+        const bezierRegex = /^cubic-bezier\(([^,]+),([^,]+),([^,]+),([^,]+)\)$/;
+        const match = value.match(bezierRegex);
+        if (match) {
+            const control1 = new Point(parseFloat(match[1]), parseFloat(match[2]));
+            const control2 = new Point(parseFloat(match[3]), parseFloat(match[4]));
+            return new CubicBezier(control1, control2);
+        }
+        return null;
+    }
+    evaluateAt(t) {
+        function evaluate(v1, v2, t) {
+            return 3 * (1 - t) * (1 - t) * t * v1 + 3 * (1 - t) * t * t * v2 + Math.pow(t, 3);
+        }
+        const x = evaluate(this.controlPoints[0].x, this.controlPoints[1].x, t);
+        const y = evaluate(this.controlPoints[0].y, this.controlPoints[1].y, t);
+        return new Point(x, y);
+    }
+    asCSSText() {
+        const raw = 'cubic-bezier(' + this.controlPoints.join(', ') + ')';
+        const keywordValues = SDK.CSSMetadata.CubicBezierKeywordValues;
+        for (const [keyword, value] of keywordValues) {
+            // We special case `linear` in here as we
+            // treat `linear` keyword as a CSSLinearEasingModel.
+            // We return its full value instead of the keyword
+            // since otherwise it will be parsed as a CSSLinearEasingModel
+            // instead of a cubic bezier.
+            if (raw === value && keyword !== 'linear') {
+                return keyword;
+            }
+        }
+        return raw;
+    }
+    // TODO(crbug.com/1172300) Ignored during the jsdoc to ts migration
+    // eslint-disable-next-line @typescript-eslint/naming-convention
+    static Regex = /((cubic-bezier\([^)]+\))|\b(linear(?![-\(])|ease-in-out|ease-in|ease-out|ease)\b)|(linear\([^)]+\))/g;
+}
+export const LINEAR_BEZIER = new CubicBezier(new Point(0, 0), new Point(1, 1));
+export class EulerAngles {
+    alpha;
+    beta;
+    gamma;
+    constructor(alpha, beta, gamma) {
+        this.alpha = alpha;
+        this.beta = beta;
+        this.gamma = gamma;
+    }
+    /**
+     * Derives orientation angles from a rotation matrix.
+     *
+     * The angles alpha, beta and gamma are in the [0, 360), [-180, 180) and
+     * [-90, 90) intervals respectively, as specified in the Device Orientation
+     * spec (https://w3c.github.io/deviceorientation/#deviceorientation).
+     *
+     * The Euler angles derived here follow a Z-X'-Y'' sequence.
+     *
+     * In particular we compute the decomposition of a given rotation matrix r
+     * such that
+     *    r = rz(alpha) * rx(beta) * ry(gamma)
+     * where rz, rx and ry are rotation matrices around z, x and y axes in the
+     * world coordinate reference frame respectively. The reference frame
+     * consists of three orthogonal axes x, y, z where x points East, y points
+     * north and z points upwards perpendicular to the ground plane. The computed
+     * angles alpha, beta and gamma are in degrees and clockwise-positive when
+     * viewed along the positive direction of the corresponding axis. Except for
+     * the special case when the beta angle is +-90 these angles uniquely
+     * define the orientation of a mobile device in 3D space. The
+     * alpha-beta-gamma representation resembles the yaw-pitch-roll convention
+     * used in vehicle dynamics, however it does not exactly match it. One of the
+     * differences is that the 'pitch' angle beta is allowed to be within [-180,
+     * 180). A mobile device with pitch angle greater than 90 could
+     * correspond to a user lying down and looking upward at the screen.
+     */
+    static fromDeviceOrientationRotationMatrix(rotationMatrix) {
+        let alpha, beta, gamma;
+        // A few implementation notes:
+        // - This code has been ported from Chromium's
+        //   //services/device/generic_sensor/orientation_util.cc at commit
+        //   1be837b6f142.
+        //
+        // - Since |rotationMatrix| contains non-integer numbers, directly
+        //   comparing them to 0 will not be accurate, so we use |_Eps| to check if
+        //   some numbers are close enough to 0.
+        //
+        // - The C++ code in Chromium uses a std::vector<double> to represent a 3x3
+        //   rotation matrix in row-major order. |rotationMatrix| is a 4x4 matrix
+        //   defined in column-major order, so |rotationMatrix.m13| here
+        //   corresponds to |r[8]| in the original C++ code.
+        //
+        // - There are rounding errors and approximations in the floating-point
+        //   arithmetics below, but it does not interfere with the use cases in
+        //   DevTools (i.e. angles that are mostly within the allowed intervals). A
+        //   rotation around the Z axis by 360 degrees will correctly return
+        //   alpha=0, but a rotation around the Z axis by 360 * 20000000000000000
+        //   will return alpha=~75 degrees, for example.
+        if (Math.abs(rotationMatrix.m33) < EPS) { // m33 == 0
+            if (Math.abs(rotationMatrix.m13) < EPS) { // m13 == 0, cos(beta) == 0
+                // Gimbal lock discontinuity: in the Z-X'-Y'' angle system used here, a
+                // rotation of 90 or -90 degrees around the X axis (beta) causes a
+                // Gimbal lock, which we handle by always setting gamma = 0 and
+                // handling the rotation in alpha.
+                alpha = Math.atan2(rotationMatrix.m12, rotationMatrix.m11);
+                beta = (rotationMatrix.m23 > 0) ? (Math.PI / 2) : -(Math.PI / 2); // beta = +-pi/2
+                gamma = 0; // gamma = 0
+            }
+            else if (rotationMatrix.m13 > 0) { // cos(gamma) == 0, cos(beta) > 0
+                alpha = Math.atan2(-rotationMatrix.m21, rotationMatrix.m22);
+                beta = Math.asin(rotationMatrix.m23); // beta [-pi/2, pi/2]
+                gamma = -(Math.PI / 2); // gamma = -pi/2
+            }
+            else { // cos(gamma) == 0, cos(beta) < 0
+                alpha = Math.atan2(rotationMatrix.m21, -rotationMatrix.m22);
+                beta = -Math.asin(rotationMatrix.m23);
+                beta += (beta > 0 || Math.abs(beta) < EPS) ? -Math.PI : Math.PI; // beta [-pi,-pi/2) U (pi/2,pi)
+                gamma = -(Math.PI / 2); // gamma = -pi/2
+            }
+        }
+        else if (rotationMatrix.m33 > 0) { // cos(beta) > 0
+            alpha = Math.atan2(-rotationMatrix.m21, rotationMatrix.m22);
+            beta = Math.asin(rotationMatrix.m23); // beta (-pi/2, pi/2)
+            gamma = Math.atan2(-rotationMatrix.m13, rotationMatrix.m33); // gamma (-pi/2, pi/2)
+        }
+        else { // cos(beta) < 0
+            alpha = Math.atan2(rotationMatrix.m21, -rotationMatrix.m22);
+            beta = -Math.asin(rotationMatrix.m23);
+            beta += (beta > 0 || Math.abs(beta) < EPS) ? -Math.PI : Math.PI; // beta [-pi,-pi/2) U (pi/2,pi)
+            gamma = Math.atan2(rotationMatrix.m13, -rotationMatrix.m33); // gamma (-pi/2, pi/2)
+        }
+        // alpha is in [-pi, pi], make sure it is in [0, 2*pi).
+        if (alpha < -EPS) {
+            alpha += 2 * Math.PI; // alpha [0, 2*pi)
+        }
+        // We do not need a lot of precision in degrees. Arbitrarily set it to 6
+        // digits after the decimal point. In most use cases, this may be rounded
+        // even further in SensorsView and when passing these degrees to CSS.
+        alpha = Number(radiansToDegrees(alpha).toFixed(6));
+        beta = Number(radiansToDegrees(beta).toFixed(6));
+        gamma = Number(radiansToDegrees(gamma).toFixed(6));
+        return new EulerAngles(alpha, beta, gamma);
+    }
+}
+export const scalarProduct = function (u, v) {
+    return u.x * v.x + u.y * v.y + u.z * v.z;
+};
+export const crossProduct = function (u, v) {
+    const x = u.y * v.z - u.z * v.y;
+    const y = u.z * v.x - u.x * v.z;
+    const z = u.x * v.y - u.y * v.x;
+    return new Vector(x, y, z);
+};
+export const subtract = function (u, v) {
+    const x = u.x - v.x;
+    const y = u.y - v.y;
+    const z = u.z - v.z;
+    return new Vector(x, y, z);
+};
+export const multiplyVectorByMatrixAndNormalize = function (v, m) {
+    const t = v.x * m.m14 + v.y * m.m24 + v.z * m.m34 + m.m44;
+    const x = (v.x * m.m11 + v.y * m.m21 + v.z * m.m31 + m.m41) / t;
+    const y = (v.x * m.m12 + v.y * m.m22 + v.z * m.m32 + m.m42) / t;
+    const z = (v.x * m.m13 + v.y * m.m23 + v.z * m.m33 + m.m43) / t;
+    return new Vector(x, y, z);
+};
+export const calculateAngle = function (u, v) {
+    const uLength = u.length();
+    const vLength = v.length();
+    if (uLength <= EPS || vLength <= EPS) {
+        return 0;
+    }
+    const cos = scalarProduct(u, v) / uLength / vLength;
+    if (Math.abs(cos) > 1) {
+        return 0;
+    }
+    return radiansToDegrees(Math.acos(cos));
+};
+export const degreesToRadians = function (deg) {
+    return deg * Math.PI / 180;
+};
+export const degreesToGradians = function (deg) {
+    return deg / 9 * 10;
+};
+export const degreesToTurns = function (deg) {
+    return deg / 360;
+};
+export const radiansToDegrees = function (rad) {
+    return rad * 180 / Math.PI;
+};
+export const radiansToGradians = function (rad) {
+    return rad * 200 / Math.PI;
+};
+export const radiansToTurns = function (rad) {
+    return rad / (2 * Math.PI);
+};
+export const gradiansToRadians = function (grad) {
+    return grad * Math.PI / 200;
+};
+export const turnsToRadians = function (turns) {
+    return turns * 2 * Math.PI;
+};
+export const boundsForTransformedPoints = function (matrix, points, aggregateBounds) {
+    if (!aggregateBounds) {
+        aggregateBounds = { minX: Infinity, maxX: -Infinity, minY: Infinity, maxY: -Infinity };
+    }
+    if (points.length % 3) {
+        console.warn('Invalid size of points array');
+    }
+    for (let p = 0; p < points.length; p += 3) {
+        let vector = new Vector(points[p], points[p + 1], points[p + 2]);
+        vector = multiplyVectorByMatrixAndNormalize(vector, matrix);
+        aggregateBounds.minX = Math.min(aggregateBounds.minX, vector.x);
+        aggregateBounds.maxX = Math.max(aggregateBounds.maxX, vector.x);
+        aggregateBounds.minY = Math.min(aggregateBounds.minY, vector.y);
+        aggregateBounds.maxY = Math.max(aggregateBounds.maxY, vector.y);
+    }
+    return aggregateBounds;
+};
+export class Size {
+    width;
+    height;
+    constructor(width, height) {
+        this.width = width;
+        this.height = height;
+    }
+    clipTo(size) {
+        if (!size) {
+            return this;
+        }
+        return new Size(Math.min(this.width, size.width), Math.min(this.height, size.height));
+    }
+    scale(scale) {
+        return new Size(this.width * scale, this.height * scale);
+    }
+    isEqual(size) {
+        return size !== null && this.width === size.width && this.height === size.height;
+    }
+    widthToMax(size) {
+        return new Size(Math.max(this.width, (typeof size === 'number' ? size : size.width)), this.height);
+    }
+    addWidth(size) {
+        return new Size(this.width + (typeof size === 'number' ? size : size.width), this.height);
+    }
+    heightToMax(size) {
+        return new Size(this.width, Math.max(this.height, (typeof size === 'number' ? size : size.height)));
+    }
+    addHeight(size) {
+        return new Size(this.width, this.height + (typeof size === 'number' ? size : size.height));
+    }
+}
+export class Constraints {
+    minimum;
+    preferred;
+    constructor(minimum, preferred) {
+        this.minimum = minimum || new Size(0, 0);
+        this.preferred = preferred || this.minimum;
+        if (this.minimum.width > this.preferred.width || this.minimum.height > this.preferred.height) {
+            throw new Error('Minimum size is greater than preferred.');
+        }
+    }
+    isEqual(constraints) {
+        return constraints !== null && this.minimum.isEqual(constraints.minimum) &&
+            this.preferred.isEqual(constraints.preferred);
+    }
+    widthToMax(value) {
+        if (typeof value === 'number') {
+            return new Constraints(this.minimum.widthToMax(value), this.preferred.widthToMax(value));
+        }
+        return new Constraints(this.minimum.widthToMax(value.minimum), this.preferred.widthToMax(value.preferred));
+    }
+    addWidth(value) {
+        if (typeof value === 'number') {
+            return new Constraints(this.minimum.addWidth(value), this.preferred.addWidth(value));
+        }
+        return new Constraints(this.minimum.addWidth(value.minimum), this.preferred.addWidth(value.preferred));
+    }
+    heightToMax(value) {
+        if (typeof value === 'number') {
+            return new Constraints(this.minimum.heightToMax(value), this.preferred.heightToMax(value));
+        }
+        return new Constraints(this.minimum.heightToMax(value.minimum), this.preferred.heightToMax(value.preferred));
+    }
+    addHeight(value) {
+        if (typeof value === 'number') {
+            return new Constraints(this.minimum.addHeight(value), this.preferred.addHeight(value));
+        }
+        return new Constraints(this.minimum.addHeight(value.minimum), this.preferred.addHeight(value.preferred));
+    }
+}

package/build/node_modules/chrome-devtools-frontend/front_end/models/geometry/geometry.js

@@ -0,0 +1,4 @@
+// Copyright 2025 The Chromium Authors
+// Use of this source code is governed by a BSD-style license that can be
+// found in the LICENSE file.
+export * from './GeometryImpl.js';