@checkly/playwright-core 1.48.22 → 1.51.11-beta.2

package/lib/utils/isomorphic/stackTrace.js

@@ -0,0 +1,169 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.captureRawStack = captureRawStack;
+exports.parseErrorStack = parseErrorStack;
+exports.parseStackFrame = parseStackFrame;
+exports.rewriteErrorMessage = rewriteErrorMessage;
+exports.splitErrorMessage = splitErrorMessage;
+exports.stringifyStackFrames = stringifyStackFrames;
+/**
+ * The MIT License (MIT)
+ * Modifications copyright (c) Microsoft Corporation.
+ *
+ * Copyright (c) 2016-2023 Isaac Z. Schlueter i@izs.me, James Talmage james@talmage.io (github.com/jamestalmage), and
+ * Contributors
+ *
+ * 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.
+ */
+
+function captureRawStack() {
+  const stackTraceLimit = Error.stackTraceLimit;
+  Error.stackTraceLimit = 50;
+  const error = new Error();
+  const stack = error.stack || '';
+  Error.stackTraceLimit = stackTraceLimit;
+  return stack.split('\n');
+}
+function parseStackFrame(text, pathSeparator, showInternalStackFrames) {
+  const match = text && text.match(re);
+  if (!match) return null;
+  let fname = match[2];
+  let file = match[7];
+  if (!file) return null;
+  if (!showInternalStackFrames && (file.startsWith('internal') || file.startsWith('node:'))) return null;
+  const line = match[8];
+  const column = match[9];
+  const closeParen = match[11] === ')';
+  const frame = {
+    file: '',
+    line: 0,
+    column: 0
+  };
+  if (line) frame.line = Number(line);
+  if (column) frame.column = Number(column);
+  if (closeParen && file) {
+    // make sure parens are balanced
+    // if we have a file like "asdf) [as foo] (xyz.js", then odds are
+    // that the fname should be += " (asdf) [as foo]" and the file
+    // should be just "xyz.js"
+    // walk backwards from the end to find the last unbalanced (
+    let closes = 0;
+    for (let i = file.length - 1; i > 0; i--) {
+      if (file.charAt(i) === ')') {
+        closes++;
+      } else if (file.charAt(i) === '(' && file.charAt(i - 1) === ' ') {
+        closes--;
+        if (closes === -1 && file.charAt(i - 1) === ' ') {
+          const before = file.slice(0, i - 1);
+          const after = file.slice(i + 1);
+          file = after;
+          fname += ` (${before}`;
+          break;
+        }
+      }
+    }
+  }
+  if (fname) {
+    const methodMatch = fname.match(methodRe);
+    if (methodMatch) fname = methodMatch[1];
+  }
+  if (file) {
+    if (file.startsWith('file://')) file = fileURLToPath(file, pathSeparator);
+    frame.file = file;
+  }
+  if (fname) frame.function = fname;
+  return frame;
+}
+function rewriteErrorMessage(e, newMessage) {
+  var _e$stack;
+  const lines = (((_e$stack = e.stack) === null || _e$stack === void 0 ? void 0 : _e$stack.split('\n')) || []).filter(l => l.startsWith('    at '));
+  e.message = newMessage;
+  const errorTitle = `${e.name}: ${e.message}`;
+  if (lines.length) e.stack = `${errorTitle}\n${lines.join('\n')}`;
+  return e;
+}
+function stringifyStackFrames(frames) {
+  const stackLines = [];
+  for (const frame of frames) {
+    if (frame.function) stackLines.push(`    at ${frame.function} (${frame.file}:${frame.line}:${frame.column})`);else stackLines.push(`    at ${frame.file}:${frame.line}:${frame.column}`);
+  }
+  return stackLines;
+}
+function splitErrorMessage(message) {
+  const separationIdx = message.indexOf(':');
+  return {
+    name: separationIdx !== -1 ? message.slice(0, separationIdx) : '',
+    message: separationIdx !== -1 && separationIdx + 2 <= message.length ? message.substring(separationIdx + 2) : message
+  };
+}
+function parseErrorStack(stack, pathSeparator, showInternalStackFrames = false) {
+  const lines = stack.split('\n');
+  let firstStackLine = lines.findIndex(line => line.startsWith('    at '));
+  if (firstStackLine === -1) firstStackLine = lines.length;
+  const message = lines.slice(0, firstStackLine).join('\n');
+  const stackLines = lines.slice(firstStackLine);
+  let location;
+  for (const line of stackLines) {
+    const frame = parseStackFrame(line, pathSeparator, showInternalStackFrames);
+    if (!frame || !frame.file) continue;
+    if (belongsToNodeModules(frame.file, pathSeparator)) continue;
+    location = {
+      file: frame.file,
+      column: frame.column || 0,
+      line: frame.line || 0
+    };
+    break;
+  }
+  return {
+    message,
+    stackLines,
+    location
+  };
+}
+function belongsToNodeModules(file, pathSeparator) {
+  return file.includes(`${pathSeparator}node_modules${pathSeparator}`);
+}
+const re = new RegExp('^' +
+// Sometimes we strip out the '    at' because it's noisy
+'(?:\\s*at )?' +
+// $1 = ctor if 'new'
+'(?:(new) )?' +
+// $2 = function name (can be literally anything)
+// May contain method at the end as [as xyz]
+'(?:(.*?) \\()?' +
+// (eval at <anonymous> (file.js:1:1),
+// $3 = eval origin
+// $4:$5:$6 are eval file/line/col, but not normally reported
+'(?:eval at ([^ ]+) \\((.+?):(\\d+):(\\d+)\\), )?' +
+// file:line:col
+// $7:$8:$9
+// $10 = 'native' if native
+'(?:(.+?):(\\d+):(\\d+)|(native))' +
+// maybe close the paren, then end
+// if $11 is ), then we only allow balanced parens in the filename
+// any imbalance is placed on the fname.  This is a heuristic, and
+// bound to be incorrect in some edge cases.  The bet is that
+// having weird characters in method names is more common than
+// having weird characters in filenames, which seems reasonable.
+'(\\)?)$');
+const methodRe = /^(.*?) \[as (.*?)\]$/;
+function fileURLToPath(fileUrl, pathSeparator) {
+  if (!fileUrl.startsWith('file://')) return fileUrl;
+  let path = decodeURIComponent(fileUrl.slice(7));
+  if (path.startsWith('/') && /^[a-zA-Z]:/.test(path.slice(1))) path = path.slice(1);
+  return path.replace(/\//g, pathSeparator);
+}

package/lib/utils/isomorphic/stringUtils.js

@@ -10,8 +10,10 @@ exports.escapeForTextSelector = escapeForTextSelector;
 exports.escapeHTML = escapeHTML;
 exports.escapeHTMLAttribute = escapeHTMLAttribute;
 exports.escapeRegExp = escapeRegExp;
+exports.escapeTemplateString = escapeTemplateString;
 exports.escapeWithQuotes = escapeWithQuotes;
 exports.isString = isString;
+exports.longestCommonSubstring = longestCommonSubstring;
 exports.normalizeEscapedRegexQuotes = normalizeEscapedRegexQuotes;
 exports.normalizeWhiteSpace = normalizeWhiteSpace;
 exports.quoteCSSAttributeValue = quoteCSSAttributeValue;
@@ -44,6 +46,9 @@ function escapeWithQuotes(text, char = '\'') {
   if (char === '`') return char + escapedText.replace(/[`]/g, '`') + char;
   throw new Error('Invalid escape char');
 }
+function escapeTemplateString(text) {
+  return text.replace(/\\/g, '\\\\').replace(/`/g, '\\`').replace(/\$\{/g, '\\${');
+}
 function isString(obj) {
   return typeof obj === 'string' || obj instanceof String;
 }
@@ -80,7 +85,7 @@ function normalizeWhiteSpace(text) {
   let result = (_normalizedWhitespace = normalizedWhitespaceCache) === null || _normalizedWhitespace === void 0 ? void 0 : _normalizedWhitespace.get(text);
   if (result === undefined) {
     var _normalizedWhitespace2;
-    result = text.replace(/\u200b/g, '').trim().replace(/\s+/g, ' ');
+    result = text.replace(/[\u200b\u00ad]/g, '').trim().replace(/\s+/g, ' ');
     (_normalizedWhitespace2 = normalizedWhitespaceCache) === null || _normalizedWhitespace2 === void 0 || _normalizedWhitespace2.set(text, result);
   }
   return result;
@@ -136,4 +141,29 @@ function escapeHTMLAttribute(s) {
 }
 function escapeHTML(s) {
   return s.replace(/[&<]/ug, char => escaped[char]);
+}
+function longestCommonSubstring(s1, s2) {
+  const n = s1.length;
+  const m = s2.length;
+  let maxLen = 0;
+  let endingIndex = 0;
+
+  // Initialize a 2D array with zeros
+  const dp = Array(n + 1).fill(null).map(() => Array(m + 1).fill(0));
+
+  // Build the dp table
+  for (let i = 1; i <= n; i++) {
+    for (let j = 1; j <= m; j++) {
+      if (s1[i - 1] === s2[j - 1]) {
+        dp[i][j] = dp[i - 1][j - 1] + 1;
+        if (dp[i][j] > maxLen) {
+          maxLen = dp[i][j];
+          endingIndex = i;
+        }
+      }
+    }
+  }
+
+  // Extract the longest common substring
+  return s1.slice(endingIndex - maxLen, endingIndex);
 }

package/lib/utils/isomorphic/time.js

@@ -0,0 +1,25 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.monotonicTime = monotonicTime;
+/**
+ * Copyright (c) Microsoft Corporation.
+ *
+ * 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.
+ */
+
+function monotonicTime() {
+  return Math.floor(performance.now() * 1000) / 1000;
+}

package/lib/utils/isomorphic/timeoutRunner.js

@@ -0,0 +1,66 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.pollAgainstDeadline = pollAgainstDeadline;
+exports.raceAgainstDeadline = raceAgainstDeadline;
+var _time = require("./time");
+/**
+ * Copyright (c) Microsoft Corporation.
+ *
+ * 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.
+ */
+
+async function raceAgainstDeadline(cb, deadline) {
+  let timer;
+  return Promise.race([cb().then(result => {
+    return {
+      result,
+      timedOut: false
+    };
+  }), new Promise(resolve => {
+    const kMaxDeadline = 2147483647; // 2^31-1
+    const timeout = (deadline || kMaxDeadline) - (0, _time.monotonicTime)();
+    timer = setTimeout(() => resolve({
+      timedOut: true
+    }), timeout);
+  })]).finally(() => {
+    clearTimeout(timer);
+  });
+}
+async function pollAgainstDeadline(callback, deadline, pollIntervals = [100, 250, 500, 1000]) {
+  var _pollIntervals$pop;
+  const lastPollInterval = (_pollIntervals$pop = pollIntervals.pop()) !== null && _pollIntervals$pop !== void 0 ? _pollIntervals$pop : 1000;
+  let lastResult;
+  const wrappedCallback = () => Promise.resolve().then(callback);
+  while (true) {
+    var _shift;
+    const time = (0, _time.monotonicTime)();
+    if (deadline && time >= deadline) break;
+    const received = await raceAgainstDeadline(wrappedCallback, deadline);
+    if (received.timedOut) break;
+    lastResult = received.result.result;
+    if (!received.result.continuePolling) return {
+      result: lastResult,
+      timedOut: false
+    };
+    const interval = (_shift = pollIntervals.shift()) !== null && _shift !== void 0 ? _shift : lastPollInterval;
+    if (deadline && deadline <= (0, _time.monotonicTime)() + interval) break;
+    await new Promise(x => setTimeout(x, interval));
+  }
+  return {
+    timedOut: true,
+    result: lastResult
+  };
+}

package/lib/utils/isomorphic/traceUtils.js

@@ -4,6 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.parseClientSideCallMetadata = parseClientSideCallMetadata;
+exports.serializeClientSideCallMetadata = serializeClientSideCallMetadata;
 /**
  * Copyright (c) Microsoft Corporation.
  *
@@ -36,4 +37,26 @@ function parseClientSideCallMetadata(data) {
     })));
   }
   return result;
+}
+function serializeClientSideCallMetadata(metadatas) {
+  const fileNames = new Map();
+  const stacks = [];
+  for (const m of metadatas) {
+    if (!m.stack || !m.stack.length) continue;
+    const stack = [];
+    for (const frame of m.stack) {
+      let ordinal = fileNames.get(frame.file);
+      if (typeof ordinal !== 'number') {
+        ordinal = fileNames.size;
+        fileNames.set(frame.file, ordinal);
+      }
+      const stackFrame = [ordinal, frame.line || 0, frame.column || 0, frame.function || ''];
+      stack.push(stackFrame);
+    }
+    stacks.push([m.id, stack]);
+  }
+  return {
+    files: [...fileNames.keys()],
+    stacks
+  };
 }

package/lib/utils/isomorphic/types.js

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

package/lib/utils/isomorphic/urlMatch.js

@@ -94,17 +94,19 @@ function urlMatchesEqual(match1, match2) {
 }
 function urlMatches(baseURL, urlString, match) {
   if (match === undefined || match === '') return true;
-  if ((0, _stringUtils.isString)(match) && !match.startsWith('*')) match = constructURLBasedOnBaseURL(baseURL, match);
+  if ((0, _stringUtils.isString)(match) && !match.startsWith('*')) {
+    // Allow http(s) baseURL to match ws(s) urls.
+    if (baseURL && /^https?:\/\//.test(baseURL) && /^wss?:\/\//.test(urlString)) baseURL = baseURL.replace(/^http/, 'ws');
+    match = constructURLBasedOnBaseURL(baseURL, match);
+  }
   if ((0, _stringUtils.isString)(match)) match = globToRegex(match);
   if (isRegExp(match)) return match.test(urlString);
-  if (typeof match === 'string' && match === urlString) return true;
-  const url = parsedURL(urlString);
+  const url = parseURL(urlString);
   if (!url) return false;
-  if (typeof match === 'string') return url.pathname === match;
   if (typeof match !== 'function') throw new Error('url parameter should be string, RegExp or function');
   return match(url);
 }
-function parsedURL(url) {
+function parseURL(url) {
   try {
     return new URL(url);
   } catch (e) {

package/lib/utils/mimeType.js

@@ -0,0 +1,30 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.isJsonMimeType = isJsonMimeType;
+exports.isTextualMimeType = isTextualMimeType;
+/**
+ * Copyright (c) Microsoft Corporation.
+ *
+ * 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.
+ */
+
+function isJsonMimeType(mimeType) {
+  return !!mimeType.match(/^(application\/json|application\/.*?\+json|text\/(x-)?json)(;\s*charset=.*)?$/);
+}
+function isTextualMimeType(mimeType) {
+  return !!mimeType.match(/^(text\/.*?|application\/(json|(x-)?javascript|xml.*?|ecmascript|graphql|x-www-form-urlencoded)|image\/svg(\+xml)?|application\/.*?(\+json|\+xml))(;\s*charset=.*)?$/);
+}
+//# sourceMappingURL=mimeType.js.map

package/lib/utils/stackTrace.js

@@ -14,7 +14,7 @@ exports.stringifyStackFrames = stringifyStackFrames;
 var _path = _interopRequireDefault(require("path"));
 var _utilsBundle = require("../utilsBundle");
 var _ = require("./");
-function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
 /**
  * Copyright (c) Microsoft Corporation.
  *