Filip/playwright
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

fixes

Browse source
This commit is contained in:
Max Schmitt 2024-10-22 11:42:31 +02:00
parent bd7ba9e200
commit 3147fbeb94
2 changed files with 7 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

11
packages/playwright-core/src/utils/sequence.ts
View file

@ -20,10 +20,13 @@ export function findRepeatedSubsequences(s: string[]): { sequence: string[]; cou
let i = 0; let i = 0;
const arraysEqual = (a1: string[], a2: string[]) => { const arraysEqual = (a1: string[], a2: string[]) => {
if (a1.length !== a2.length) return false; if (a1.length !== a2.length)
return false;
for (let j = 0; j < a1.length; j++) { for (let j = 0; j < a1.length; j++) {
if (a1[j] !== a2[j]) return false; if (a1[j] !== a2[j])
return false;
} }
return true; return true;
}; };
@ -41,9 +44,9 @@ export function findRepeatedSubsequences(s: string[]): { sequence: string[]; cou
while ( while (
i + p * k <= n && i + p * k <= n &&
arraysEqual(s.slice(i + p * (k - 1), i + p * k), substr) arraysEqual(s.slice(i + p * (k - 1), i + p * k), substr)
) { )
k += 1; k += 1;
}
k -= 1; // Adjust k since it increments one extra time in the loop k -= 1; // Adjust k since it increments one extra time in the loop
// Update the maximal repeating substring if necessary // Update the maximal repeating substring if necessary

1
packages/playwright-core/src/utils/stackTrace.ts
View file

@ -16,7 +16,6 @@
import path from 'path'; import path from 'path';
import { parseStackTraceLine } from '../utilsBundle'; import { parseStackTraceLine } from '../utilsBundle';
import { isUnderTest } from './';
import type { StackFrame } from '@protocol/channels'; import type { StackFrame } from '@protocol/channels';
import { colors } from '../utilsBundle'; import { colors } from '../utilsBundle';
import { findRepeatedSubsequences } from './sequence'; import { findRepeatedSubsequences } from './sequence';