@backblaze-labs/b2-sdk 0.1.0 → 0.2.0

package/dist/sync/filters.cjs

@@ -0,0 +1,217 @@
+const require_regexp_safety = require("./regexp-safety.cjs");
+const require_scan_events = require("./scan-events.cjs");
+//#region src/sync/filters.ts
+/**
+* Tests whether a relative sync path is included by the configured include/exclude filters.
+* Exclude filters win over include filters when both match the same path.
+*
+* @param relativePath - Folder-relative path using forward slashes.
+* @param filters - Optional include and exclude filters.
+*
+* @returns True when the path should remain in the sync scan.
+*/
+function pathPassesSyncFilters(relativePath, filters) {
+	require_regexp_safety.validateSyncFilters(filters);
+	const path = normalizePath(relativePath);
+	if (normalizedPathSkippedByRegExpInputLimit(path, filters)) return false;
+	const include = filters?.include ?? [];
+	const exclude = filters?.exclude ?? [];
+	if (include.length > 0) {
+		if (!include.some((pattern) => matchesPattern(path, pattern))) return false;
+	}
+	return !exclude.some((pattern) => matchesPattern(path, pattern));
+}
+/**
+* Tests whether a directory may contain paths admitted by the configured filters.
+*
+* @param relativePath - Folder-relative directory path using forward slashes.
+* @param filters - Optional include and exclude filters.
+*
+* @returns True when the scanner should descend into the directory.
+*/
+function directoryMayContainSyncPaths(relativePath, filters) {
+	require_regexp_safety.validateSyncFilters(filters);
+	const path = normalizePath(relativePath);
+	if (path === "") return true;
+	if ((filters?.exclude ?? []).some((pattern) => stringPatternExcludesAllDescendants(path, pattern))) return false;
+	const include = filters?.include ?? [];
+	return include.length === 0 || include.some((pattern) => patternMayMatchDescendant(path, pattern));
+}
+/**
+* Returns the safe literal prefix that B2 listing can use for include filters.
+* Exclude filters are not considered because they cannot narrow a B2 prefix.
+*
+* @param filters - Optional include and exclude filters.
+*
+* @returns A folder-relative literal prefix, or an empty string when no safe narrowing exists.
+*/
+function literalPrefixForSyncFilters(filters) {
+	require_regexp_safety.validateSyncFilters(filters);
+	const include = filters?.include ?? [];
+	let commonPrefix;
+	for (const pattern of include) {
+		if (patternIsRegExp(pattern)) return "";
+		const glob = normalizePath(pattern);
+		if (!glob.includes("/")) return "";
+		const prefix = literalPrefixForGlob(glob);
+		if (prefix === "") return "";
+		commonPrefix = commonPrefix === void 0 ? prefix : commonLiteralPrefix(commonPrefix, prefix);
+	}
+	return commonPrefix ?? "";
+}
+/**
+* Filters an async iterable of sync paths while preserving the original item type.
+*
+* @typeParam T - Concrete sync path shape yielded by the source folder.
+*
+* @param paths - Async iterable of folder scan results.
+* @param filters - Optional include and exclude filters.
+*
+* @returns A filtered async generator of sync paths.
+*/
+async function* filterSyncPaths(paths, filters) {
+	for await (const path of paths) if (pathPassesSyncFilters(path.relativePath, filters)) yield path;
+	else if (pathSkippedByRegExpInputLimit(path.relativePath, filters)) require_scan_events.emitScannerSkip(filters, require_scan_events.regexpInputTooLongSkip(normalizePath(path.relativePath)));
+}
+/**
+* Tests whether a path is skipped because RegExp filters are configured and the normalized path
+* exceeds the SDK RegExp input guard.
+*
+* @param relativePath - Folder-relative path using forward slashes.
+* @param filters - Optional include and exclude filters.
+*
+* @returns True when any RegExp filter is present and the path is too long to evaluate.
+*/
+function pathSkippedByRegExpInputLimit(relativePath, filters) {
+	require_regexp_safety.validateSyncFilters(filters);
+	return normalizedPathSkippedByRegExpInputLimit(normalizePath(relativePath), filters);
+}
+function normalizedPathSkippedByRegExpInputLimit(normalizedPath, filters) {
+	if (!require_regexp_safety.pathExceedsSafeRegExpInput(normalizedPath) || !filtersContainRegExp(filters)) return false;
+	return true;
+}
+function matchesPattern(relativePath, pattern) {
+	if (patternIsRegExp(pattern)) return require_regexp_safety.regexpMatchesSyncPath(relativePath, pattern);
+	const glob = normalizePath(pattern);
+	if (glob === "") return relativePath === "";
+	const segments = splitPath(relativePath);
+	if (!glob.includes("/")) return segments.some((segment) => matchSegmentGlob(segment, glob));
+	return matchPathGlob(segments, splitPath(glob));
+}
+function stringPatternExcludesAllDescendants(relativePath, pattern) {
+	if (patternIsRegExp(pattern)) return false;
+	const glob = normalizePath(pattern);
+	if (glob === "") return false;
+	if (!glob.includes("/")) return matchesPattern(relativePath, pattern);
+	const globSegments = splitPath(glob);
+	return globSegments.at(-1) === "**" && matchPathGlob(splitPath(relativePath), globSegments);
+}
+function filtersContainRegExp(filters) {
+	return filters?.include?.some(patternIsRegExp) === true || filters?.exclude?.some(patternIsRegExp) === true;
+}
+function patternMayMatchDescendant(relativePath, pattern) {
+	if (patternIsRegExp(pattern)) return true;
+	const glob = normalizePath(pattern);
+	if (glob === "" || !glob.includes("/")) return true;
+	const pathSegments = splitPath(relativePath);
+	const globSegments = splitPath(glob);
+	const length = Math.min(pathSegments.length, globSegments.length);
+	for (let i = 0; i < length; i++) {
+		const globSegment = globSegments[i];
+		if (globSegment === "**" || globSegment === void 0 || hasGlobWildcard(globSegment)) return true;
+		if (globSegment !== pathSegments[i]) return false;
+	}
+	return true;
+}
+function matchPathGlob(pathSegments, globSegments) {
+	let reachable = new Array(pathSegments.length + 1).fill(false);
+	reachable[0] = true;
+	for (const globSegment of globSegments) {
+		const next = new Array(pathSegments.length + 1).fill(false);
+		if (globSegment === "**") {
+			let canReach = false;
+			for (let i = 0; i <= pathSegments.length; i++) {
+				canReach = canReach || reachable[i] === true;
+				next[i] = canReach;
+			}
+		} else for (let i = 0; i < pathSegments.length; i++) if (reachable[i] === true && matchSegmentGlob(pathSegments[i] ?? "", globSegment)) next[i + 1] = true;
+		reachable = next;
+	}
+	return reachable[pathSegments.length] === true;
+}
+function matchSegmentGlob(segment, glob) {
+	let segmentIndex = 0;
+	let globIndex = 0;
+	let starIndex = -1;
+	let starMatchIndex = 0;
+	while (segmentIndex < segment.length) {
+		const globChar = glob[globIndex];
+		if (globChar === "?" || globChar === segment[segmentIndex]) {
+			globIndex++;
+			segmentIndex++;
+		} else if (globChar === "*") {
+			while (glob[globIndex + 1] === "*") globIndex++;
+			starIndex = globIndex;
+			starMatchIndex = segmentIndex;
+			globIndex++;
+		} else if (starIndex !== -1) {
+			globIndex = starIndex + 1;
+			starMatchIndex++;
+			segmentIndex = starMatchIndex;
+		} else return false;
+	}
+	while (glob[globIndex] === "*") globIndex++;
+	return globIndex === glob.length;
+}
+function literalPrefixForGlob(glob) {
+	const segments = splitPath(glob);
+	const literalSegments = [];
+	let firstWildcardIndex = segments.length;
+	for (const [index, segment] of segments.entries()) {
+		if (segment === "**" || hasGlobWildcard(segment)) {
+			firstWildcardIndex = index;
+			break;
+		}
+		literalSegments.push(segment);
+	}
+	if (literalSegments.length === 0) return "";
+	const prefix = literalSegments.join("/");
+	const wildcardTail = segments.slice(firstWildcardIndex);
+	if (wildcardTail.length > 0 && wildcardTail.every((segment) => segment === "**")) return prefix;
+	return literalSegments.length < segments.length ? `${prefix}/` : prefix;
+}
+function commonLiteralPrefix(a, b) {
+	let end = 0;
+	const max = Math.min(a.length, b.length);
+	while (end < max && a[end] === b[end]) end++;
+	return trimTrailingHighSurrogate(a.slice(0, end));
+}
+function trimTrailingHighSurrogate(value) {
+	const lastCodeUnit = value.charCodeAt(value.length - 1);
+	return lastCodeUnit >= 55296 && lastCodeUnit <= 56319 ? value.slice(0, -1) : value;
+}
+function hasGlobWildcard(glob) {
+	return glob.includes("*") || glob.includes("?");
+}
+function patternIsRegExp(pattern) {
+	return typeof pattern !== "string";
+}
+function splitPath(path) {
+	if (path === "") return [];
+	return path.split("/").filter((segment) => segment !== "");
+}
+function normalizePath(path) {
+	let normalized = path.split("\\").join("/");
+	while (normalized.startsWith("./")) normalized = normalized.slice(2);
+	while (normalized.startsWith("/")) normalized = normalized.slice(1);
+	while (normalized.endsWith("/") && normalized.length > 1) normalized = normalized.slice(0, -1);
+	return normalized;
+}
+//#endregion
+exports.directoryMayContainSyncPaths = directoryMayContainSyncPaths;
+exports.filterSyncPaths = filterSyncPaths;
+exports.literalPrefixForSyncFilters = literalPrefixForSyncFilters;
+exports.pathPassesSyncFilters = pathPassesSyncFilters;
+exports.pathSkippedByRegExpInputLimit = pathSkippedByRegExpInputLimit;
+
+//# sourceMappingURL=filters.cjs.map

package/dist/sync/filters.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"filters.cjs","names":[],"sources":["../../src/sync/filters.ts"],"sourcesContent":["import {\n  pathExceedsSafeRegExpInput,\n  regexpMatchesSyncPath,\n  validateSyncFilters,\n} from './regexp-safety.ts'\nimport { emitScannerSkip, regexpInputTooLongSkip } from './scan-events.ts'\nimport type { SyncFilterOptions, SyncFilterPattern, SyncPath, SyncScanOptions } from './types.ts'\n\n/**\n * Tests whether a relative sync path is included by the configured include/exclude filters.\n * Exclude filters win over include filters when both match the same path.\n *\n * @param relativePath - Folder-relative path using forward slashes.\n * @param filters - Optional include and exclude filters.\n *\n * @returns True when the path should remain in the sync scan.\n */\nexport function pathPassesSyncFilters(\n  relativePath: string,\n  filters: SyncFilterOptions | undefined,\n): boolean {\n  validateSyncFilters(filters)\n  const path = normalizePath(relativePath)\n\n  if (normalizedPathSkippedByRegExpInputLimit(path, filters)) return false\n\n  const include = filters?.include ?? []\n  const exclude = filters?.exclude ?? []\n\n  if (include.length > 0) {\n    if (!include.some((pattern) => matchesPattern(path, pattern))) return false\n  }\n\n  return !exclude.some((pattern) => matchesPattern(path, pattern))\n}\n\n/**\n * Tests whether a directory may contain paths admitted by the configured filters.\n *\n * @param relativePath - Folder-relative directory path using forward slashes.\n * @param filters - Optional include and exclude filters.\n *\n * @returns True when the scanner should descend into the directory.\n */\nexport function directoryMayContainSyncPaths(\n  relativePath: string,\n  filters: SyncFilterOptions | undefined,\n): boolean {\n  validateSyncFilters(filters)\n  const path = normalizePath(relativePath)\n  if (path === '') return true\n\n  const exclude = filters?.exclude ?? []\n  if (exclude.some((pattern) => stringPatternExcludesAllDescendants(path, pattern))) {\n    return false\n  }\n\n  const include = filters?.include ?? []\n  return include.length === 0 || include.some((pattern) => patternMayMatchDescendant(path, pattern))\n}\n\n/**\n * Returns the safe literal prefix that B2 listing can use for include filters.\n * Exclude filters are not considered because they cannot narrow a B2 prefix.\n *\n * @param filters - Optional include and exclude filters.\n *\n * @returns A folder-relative literal prefix, or an empty string when no safe narrowing exists.\n */\nexport function literalPrefixForSyncFilters(filters: SyncFilterOptions | undefined): string {\n  validateSyncFilters(filters)\n  const include = filters?.include ?? []\n  let commonPrefix: string | undefined\n\n  for (const pattern of include) {\n    if (patternIsRegExp(pattern)) return ''\n\n    const glob = normalizePath(pattern)\n    if (!glob.includes('/')) return ''\n\n    const prefix = literalPrefixForGlob(glob)\n    if (prefix === '') return ''\n    commonPrefix = commonPrefix === undefined ? prefix : commonLiteralPrefix(commonPrefix, prefix)\n  }\n\n  return commonPrefix ?? ''\n}\n\n/**\n * Filters an async iterable of sync paths while preserving the original item type.\n *\n * @typeParam T - Concrete sync path shape yielded by the source folder.\n *\n * @param paths - Async iterable of folder scan results.\n * @param filters - Optional include and exclude filters.\n *\n * @returns A filtered async generator of sync paths.\n */\nexport async function* filterSyncPaths<T extends SyncPath>(\n  paths: AsyncIterable<T>,\n  filters: SyncScanOptions | undefined,\n): AsyncGenerator<T> {\n  for await (const path of paths) {\n    if (pathPassesSyncFilters(path.relativePath, filters)) {\n      yield path\n    } else if (pathSkippedByRegExpInputLimit(path.relativePath, filters)) {\n      emitScannerSkip(filters, regexpInputTooLongSkip(normalizePath(path.relativePath)))\n    }\n  }\n}\n\n/**\n * Tests whether a path is skipped because RegExp filters are configured and the normalized path\n * exceeds the SDK RegExp input guard.\n *\n * @param relativePath - Folder-relative path using forward slashes.\n * @param filters - Optional include and exclude filters.\n *\n * @returns True when any RegExp filter is present and the path is too long to evaluate.\n */\nexport function pathSkippedByRegExpInputLimit(\n  relativePath: string,\n  filters: SyncFilterOptions | undefined,\n): boolean {\n  validateSyncFilters(filters)\n  return normalizedPathSkippedByRegExpInputLimit(normalizePath(relativePath), filters)\n}\n\nfunction normalizedPathSkippedByRegExpInputLimit(\n  normalizedPath: string,\n  filters: SyncFilterOptions | undefined,\n): boolean {\n  if (!pathExceedsSafeRegExpInput(normalizedPath) || !filtersContainRegExp(filters)) {\n    return false\n  }\n  return true\n}\n\nfunction matchesPattern(relativePath: string, pattern: SyncFilterPattern): boolean {\n  if (patternIsRegExp(pattern)) {\n    return regexpMatchesSyncPath(relativePath, pattern)\n  }\n\n  const glob = normalizePath(pattern)\n  if (glob === '') return relativePath === ''\n\n  const segments = splitPath(relativePath)\n  if (!glob.includes('/')) {\n    return segments.some((segment) => matchSegmentGlob(segment, glob))\n  }\n\n  return matchPathGlob(segments, splitPath(glob))\n}\n\nfunction stringPatternExcludesAllDescendants(\n  relativePath: string,\n  pattern: SyncFilterPattern,\n): boolean {\n  if (patternIsRegExp(pattern)) return false\n\n  const glob = normalizePath(pattern)\n  if (glob === '') return false\n  if (!glob.includes('/')) return matchesPattern(relativePath, pattern)\n\n  const globSegments = splitPath(glob)\n  return globSegments.at(-1) === '**' && matchPathGlob(splitPath(relativePath), globSegments)\n}\n\nfunction filtersContainRegExp(filters: SyncFilterOptions | undefined): boolean {\n  return (\n    filters?.include?.some(patternIsRegExp) === true ||\n    filters?.exclude?.some(patternIsRegExp) === true\n  )\n}\n\nfunction patternMayMatchDescendant(relativePath: string, pattern: SyncFilterPattern): boolean {\n  if (patternIsRegExp(pattern)) return true\n\n  const glob = normalizePath(pattern)\n  if (glob === '' || !glob.includes('/')) return true\n\n  const pathSegments = splitPath(relativePath)\n  const globSegments = splitPath(glob)\n  const length = Math.min(pathSegments.length, globSegments.length)\n\n  for (let i = 0; i < length; i++) {\n    const globSegment = globSegments[i]\n    if (globSegment === '**' || globSegment === undefined || hasGlobWildcard(globSegment)) {\n      return true\n    }\n    if (globSegment !== pathSegments[i]) {\n      return false\n    }\n  }\n\n  return true\n}\n\nfunction matchPathGlob(pathSegments: readonly string[], globSegments: readonly string[]): boolean {\n  let reachable = new Array<boolean>(pathSegments.length + 1).fill(false)\n  reachable[0] = true\n\n  for (const globSegment of globSegments) {\n    const next = new Array<boolean>(pathSegments.length + 1).fill(false)\n\n    if (globSegment === '**') {\n      // A whole-segment `**` consumes zero or more complete path segments.\n      let canReach = false\n      for (let i = 0; i <= pathSegments.length; i++) {\n        canReach = canReach || reachable[i] === true\n        next[i] = canReach\n      }\n    } else {\n      for (let i = 0; i < pathSegments.length; i++) {\n        if (reachable[i] === true && matchSegmentGlob(pathSegments[i] ?? '', globSegment)) {\n          next[i + 1] = true\n        }\n      }\n    }\n\n    reachable = next\n  }\n\n  return reachable[pathSegments.length] === true\n}\n\nfunction matchSegmentGlob(segment: string, glob: string): boolean {\n  let segmentIndex = 0\n  let globIndex = 0\n  let starIndex = -1\n  let starMatchIndex = 0\n\n  while (segmentIndex < segment.length) {\n    const globChar = glob[globIndex]\n    if (globChar === '?' || globChar === segment[segmentIndex]) {\n      globIndex++\n      segmentIndex++\n    } else if (globChar === '*') {\n      // Repeated `*` in one segment is still one segment-local wildcard.\n      while (glob[globIndex + 1] === '*') globIndex++\n      starIndex = globIndex\n      starMatchIndex = segmentIndex\n      globIndex++\n    } else if (starIndex !== -1) {\n      globIndex = starIndex + 1\n      starMatchIndex++\n      segmentIndex = starMatchIndex\n    } else {\n      return false\n    }\n  }\n\n  while (glob[globIndex] === '*') globIndex++\n  return globIndex === glob.length\n}\n\nfunction literalPrefixForGlob(glob: string): string {\n  const segments = splitPath(glob)\n  const literalSegments: string[] = []\n  let firstWildcardIndex = segments.length\n\n  for (const [index, segment] of segments.entries()) {\n    if (segment === '**' || hasGlobWildcard(segment)) {\n      firstWildcardIndex = index\n      break\n    }\n    literalSegments.push(segment)\n  }\n\n  if (literalSegments.length === 0) return ''\n  const prefix = literalSegments.join('/')\n  const wildcardTail = segments.slice(firstWildcardIndex)\n  const tailMayMatchBarePrefix =\n    wildcardTail.length > 0 && wildcardTail.every((segment) => segment === '**')\n  if (tailMayMatchBarePrefix) return prefix\n  return literalSegments.length < segments.length ? `${prefix}/` : prefix\n}\n\nfunction commonLiteralPrefix(a: string, b: string): string {\n  let end = 0\n  const max = Math.min(a.length, b.length)\n  while (end < max && a[end] === b[end]) end++\n  return trimTrailingHighSurrogate(a.slice(0, end))\n}\n\nfunction trimTrailingHighSurrogate(value: string): string {\n  const lastCodeUnit = value.charCodeAt(value.length - 1)\n  return lastCodeUnit >= 0xd800 && lastCodeUnit <= 0xdbff ? value.slice(0, -1) : value\n}\n\nfunction hasGlobWildcard(glob: string): boolean {\n  return glob.includes('*') || glob.includes('?')\n}\n\nfunction patternIsRegExp(pattern: SyncFilterPattern): pattern is RegExp {\n  return typeof pattern !== 'string'\n}\n\nfunction splitPath(path: string): string[] {\n  if (path === '') return []\n  return path.split('/').filter((segment) => segment !== '')\n}\n\nfunction normalizePath(path: string): string {\n  let normalized = path.split('\\\\').join('/')\n  while (normalized.startsWith('./')) normalized = normalized.slice(2)\n  while (normalized.startsWith('/')) normalized = normalized.slice(1)\n  while (normalized.endsWith('/') && normalized.length > 1) {\n    normalized = normalized.slice(0, -1)\n  }\n  return normalized\n}\n"],"mappings":";;;;;;;;;;;;AAiBA,SAAgB,sBACd,cACA,SACS;CACT,sBAAA,oBAAoB,OAAO;CAC3B,MAAM,OAAO,cAAc,YAAY;CAEvC,IAAI,wCAAwC,MAAM,OAAO,GAAG,OAAO;CAEnE,MAAM,UAAU,SAAS,WAAW,CAAC;CACrC,MAAM,UAAU,SAAS,WAAW,CAAC;CAErC,IAAI,QAAQ,SAAS;MACf,CAAC,QAAQ,MAAM,YAAY,eAAe,MAAM,OAAO,CAAC,GAAG,OAAO;CAAA;CAGxE,OAAO,CAAC,QAAQ,MAAM,YAAY,eAAe,MAAM,OAAO,CAAC;AACjE;;;;;;;;;AAUA,SAAgB,6BACd,cACA,SACS;CACT,sBAAA,oBAAoB,OAAO;CAC3B,MAAM,OAAO,cAAc,YAAY;CACvC,IAAI,SAAS,IAAI,OAAO;CAGxB,KADgB,SAAS,WAAW,CAAC,EAAA,CACzB,MAAM,YAAY,oCAAoC,MAAM,OAAO,CAAC,GAC9E,OAAO;CAGT,MAAM,UAAU,SAAS,WAAW,CAAC;CACrC,OAAO,QAAQ,WAAW,KAAK,QAAQ,MAAM,YAAY,0BAA0B,MAAM,OAAO,CAAC;AACnG;;;;;;;;;AAUA,SAAgB,4BAA4B,SAAgD;CAC1F,sBAAA,oBAAoB,OAAO;CAC3B,MAAM,UAAU,SAAS,WAAW,CAAC;CACrC,IAAI;CAEJ,KAAK,MAAM,WAAW,SAAS;EAC7B,IAAI,gBAAgB,OAAO,GAAG,OAAO;EAErC,MAAM,OAAO,cAAc,OAAO;EAClC,IAAI,CAAC,KAAK,SAAS,GAAG,GAAG,OAAO;EAEhC,MAAM,SAAS,qBAAqB,IAAI;EACxC,IAAI,WAAW,IAAI,OAAO;EAC1B,eAAe,iBAAiB,KAAA,IAAY,SAAS,oBAAoB,cAAc,MAAM;CAC/F;CAEA,OAAO,gBAAgB;AACzB;;;;;;;;;;;AAYA,gBAAuB,gBACrB,OACA,SACmB;CACnB,WAAW,MAAM,QAAQ,OACvB,IAAI,sBAAsB,KAAK,cAAc,OAAO,GAClD,MAAM;MACD,IAAI,8BAA8B,KAAK,cAAc,OAAO,GACjE,oBAAA,gBAAgB,SAAS,oBAAA,uBAAuB,cAAc,KAAK,YAAY,CAAC,CAAC;AAGvF;;;;;;;;;;AAWA,SAAgB,8BACd,cACA,SACS;CACT,sBAAA,oBAAoB,OAAO;CAC3B,OAAO,wCAAwC,cAAc,YAAY,GAAG,OAAO;AACrF;AAEA,SAAS,wCACP,gBACA,SACS;CACT,IAAI,CAAC,sBAAA,2BAA2B,cAAc,KAAK,CAAC,qBAAqB,OAAO,GAC9E,OAAO;CAET,OAAO;AACT;AAEA,SAAS,eAAe,cAAsB,SAAqC;CACjF,IAAI,gBAAgB,OAAO,GACzB,OAAO,sBAAA,sBAAsB,cAAc,OAAO;CAGpD,MAAM,OAAO,cAAc,OAAO;CAClC,IAAI,SAAS,IAAI,OAAO,iBAAiB;CAEzC,MAAM,WAAW,UAAU,YAAY;CACvC,IAAI,CAAC,KAAK,SAAS,GAAG,GACpB,OAAO,SAAS,MAAM,YAAY,iBAAiB,SAAS,IAAI,CAAC;CAGnE,OAAO,cAAc,UAAU,UAAU,IAAI,CAAC;AAChD;AAEA,SAAS,oCACP,cACA,SACS;CACT,IAAI,gBAAgB,OAAO,GAAG,OAAO;CAErC,MAAM,OAAO,cAAc,OAAO;CAClC,IAAI,SAAS,IAAI,OAAO;CACxB,IAAI,CAAC,KAAK,SAAS,GAAG,GAAG,OAAO,eAAe,cAAc,OAAO;CAEpE,MAAM,eAAe,UAAU,IAAI;CACnC,OAAO,aAAa,GAAG,EAAE,MAAM,QAAQ,cAAc,UAAU,YAAY,GAAG,YAAY;AAC5F;AAEA,SAAS,qBAAqB,SAAiD;CAC7E,OACE,SAAS,SAAS,KAAK,eAAe,MAAM,QAC5C,SAAS,SAAS,KAAK,eAAe,MAAM;AAEhD;AAEA,SAAS,0BAA0B,cAAsB,SAAqC;CAC5F,IAAI,gBAAgB,OAAO,GAAG,OAAO;CAErC,MAAM,OAAO,cAAc,OAAO;CAClC,IAAI,SAAS,MAAM,CAAC,KAAK,SAAS,GAAG,GAAG,OAAO;CAE/C,MAAM,eAAe,UAAU,YAAY;CAC3C,MAAM,eAAe,UAAU,IAAI;CACnC,MAAM,SAAS,KAAK,IAAI,aAAa,QAAQ,aAAa,MAAM;CAEhE,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;EAC/B,MAAM,cAAc,aAAa;EACjC,IAAI,gBAAgB,QAAQ,gBAAgB,KAAA,KAAa,gBAAgB,WAAW,GAClF,OAAO;EAET,IAAI,gBAAgB,aAAa,IAC/B,OAAO;CAEX;CAEA,OAAO;AACT;AAEA,SAAS,cAAc,cAAiC,cAA0C;CAChG,IAAI,YAAY,IAAI,MAAe,aAAa,SAAS,CAAC,CAAC,CAAC,KAAK,KAAK;CACtE,UAAU,KAAK;CAEf,KAAK,MAAM,eAAe,cAAc;EACtC,MAAM,OAAO,IAAI,MAAe,aAAa,SAAS,CAAC,CAAC,CAAC,KAAK,KAAK;EAEnE,IAAI,gBAAgB,MAAM;GAExB,IAAI,WAAW;GACf,KAAK,IAAI,IAAI,GAAG,KAAK,aAAa,QAAQ,KAAK;IAC7C,WAAW,YAAY,UAAU,OAAO;IACxC,KAAK,KAAK;GACZ;EACF,OACE,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KACvC,IAAI,UAAU,OAAO,QAAQ,iBAAiB,aAAa,MAAM,IAAI,WAAW,GAC9E,KAAK,IAAI,KAAK;EAKpB,YAAY;CACd;CAEA,OAAO,UAAU,aAAa,YAAY;AAC5C;AAEA,SAAS,iBAAiB,SAAiB,MAAuB;CAChE,IAAI,eAAe;CACnB,IAAI,YAAY;CAChB,IAAI,YAAY;CAChB,IAAI,iBAAiB;CAErB,OAAO,eAAe,QAAQ,QAAQ;EACpC,MAAM,WAAW,KAAK;EACtB,IAAI,aAAa,OAAO,aAAa,QAAQ,eAAe;GAC1D;GACA;EACF,OAAO,IAAI,aAAa,KAAK;GAE3B,OAAO,KAAK,YAAY,OAAO,KAAK;GACpC,YAAY;GACZ,iBAAiB;GACjB;EACF,OAAO,IAAI,cAAc,IAAI;GAC3B,YAAY,YAAY;GACxB;GACA,eAAe;EACjB,OACE,OAAO;CAEX;CAEA,OAAO,KAAK,eAAe,KAAK;CAChC,OAAO,cAAc,KAAK;AAC5B;AAEA,SAAS,qBAAqB,MAAsB;CAClD,MAAM,WAAW,UAAU,IAAI;CAC/B,MAAM,kBAA4B,CAAC;CACnC,IAAI,qBAAqB,SAAS;CAElC,KAAK,MAAM,CAAC,OAAO,YAAY,SAAS,QAAQ,GAAG;EACjD,IAAI,YAAY,QAAQ,gBAAgB,OAAO,GAAG;GAChD,qBAAqB;GACrB;EACF;EACA,gBAAgB,KAAK,OAAO;CAC9B;CAEA,IAAI,gBAAgB,WAAW,GAAG,OAAO;CACzC,MAAM,SAAS,gBAAgB,KAAK,GAAG;CACvC,MAAM,eAAe,SAAS,MAAM,kBAAkB;CAGtD,IADE,aAAa,SAAS,KAAK,aAAa,OAAO,YAAY,YAAY,IAAI,GACjD,OAAO;CACnC,OAAO,gBAAgB,SAAS,SAAS,SAAS,GAAG,OAAO,KAAK;AACnE;AAEA,SAAS,oBAAoB,GAAW,GAAmB;CACzD,IAAI,MAAM;CACV,MAAM,MAAM,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;CACvC,OAAO,MAAM,OAAO,EAAE,SAAS,EAAE,MAAM;CACvC,OAAO,0BAA0B,EAAE,MAAM,GAAG,GAAG,CAAC;AAClD;AAEA,SAAS,0BAA0B,OAAuB;CACxD,MAAM,eAAe,MAAM,WAAW,MAAM,SAAS,CAAC;CACtD,OAAO,gBAAgB,SAAU,gBAAgB,QAAS,MAAM,MAAM,GAAG,EAAE,IAAI;AACjF;AAEA,SAAS,gBAAgB,MAAuB;CAC9C,OAAO,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG;AAChD;AAEA,SAAS,gBAAgB,SAA+C;CACtE,OAAO,OAAO,YAAY;AAC5B;AAEA,SAAS,UAAU,MAAwB;CACzC,IAAI,SAAS,IAAI,OAAO,CAAC;CACzB,OAAO,KAAK,MAAM,GAAG,CAAC,CAAC,QAAQ,YAAY,YAAY,EAAE;AAC3D;AAEA,SAAS,cAAc,MAAsB;CAC3C,IAAI,aAAa,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,GAAG;CAC1C,OAAO,WAAW,WAAW,IAAI,GAAG,aAAa,WAAW,MAAM,CAAC;CACnE,OAAO,WAAW,WAAW,GAAG,GAAG,aAAa,WAAW,MAAM,CAAC;CAClE,OAAO,WAAW,SAAS,GAAG,KAAK,WAAW,SAAS,GACrD,aAAa,WAAW,MAAM,GAAG,EAAE;CAErC,OAAO;AACT"}

package/dist/sync/filters.d.cts

@@ -0,0 +1,51 @@
+import { SyncFilterOptions, SyncPath, SyncScanOptions } from './types.js';
+/**
+ * Tests whether a relative sync path is included by the configured include/exclude filters.
+ * Exclude filters win over include filters when both match the same path.
+ *
+ * @param relativePath - Folder-relative path using forward slashes.
+ * @param filters - Optional include and exclude filters.
+ *
+ * @returns True when the path should remain in the sync scan.
+ */
+export declare function pathPassesSyncFilters(relativePath: string, filters: SyncFilterOptions | undefined): boolean;
+/**
+ * Tests whether a directory may contain paths admitted by the configured filters.
+ *
+ * @param relativePath - Folder-relative directory path using forward slashes.
+ * @param filters - Optional include and exclude filters.
+ *
+ * @returns True when the scanner should descend into the directory.
+ */
+export declare function directoryMayContainSyncPaths(relativePath: string, filters: SyncFilterOptions | undefined): boolean;
+/**
+ * Returns the safe literal prefix that B2 listing can use for include filters.
+ * Exclude filters are not considered because they cannot narrow a B2 prefix.
+ *
+ * @param filters - Optional include and exclude filters.
+ *
+ * @returns A folder-relative literal prefix, or an empty string when no safe narrowing exists.
+ */
+export declare function literalPrefixForSyncFilters(filters: SyncFilterOptions | undefined): string;
+/**
+ * Filters an async iterable of sync paths while preserving the original item type.
+ *
+ * @typeParam T - Concrete sync path shape yielded by the source folder.
+ *
+ * @param paths - Async iterable of folder scan results.
+ * @param filters - Optional include and exclude filters.
+ *
+ * @returns A filtered async generator of sync paths.
+ */
+export declare function filterSyncPaths<T extends SyncPath>(paths: AsyncIterable<T>, filters: SyncScanOptions | undefined): AsyncGenerator<T>;
+/**
+ * Tests whether a path is skipped because RegExp filters are configured and the normalized path
+ * exceeds the SDK RegExp input guard.
+ *
+ * @param relativePath - Folder-relative path using forward slashes.
+ * @param filters - Optional include and exclude filters.
+ *
+ * @returns True when any RegExp filter is present and the path is too long to evaluate.
+ */
+export declare function pathSkippedByRegExpInputLimit(relativePath: string, filters: SyncFilterOptions | undefined): boolean;
+//# sourceMappingURL=filters.d.ts.map

package/dist/sync/filters.d.cts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filters.d.ts","sourceRoot":"","sources":["../../src/sync/filters.js"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,iBAAiB,EAAqB,QAAQ,EAAE,eAAe,EAAE,MAAM,YAAY,CAAA;AAEjG;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,iBAAiB,GAAG,SAAS,GACrC,OAAO,CAcT;AAED;;;;;;;GAOG;AACH,wBAAgB,4BAA4B,CAC1C,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,iBAAiB,GAAG,SAAS,GACrC,OAAO,CAYT;AAED;;;;;;;GAOG;AACH,wBAAgB,2BAA2B,CAAC,OAAO,EAAE,iBAAiB,GAAG,SAAS,GAAG,MAAM,CAiB1F;AAED;;;;;;;;;GASG;AACH,wBAAuB,eAAe,CAAC,CAAC,SAAS,QAAQ,EACvD,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,OAAO,EAAE,eAAe,GAAG,SAAS,GACnC,cAAc,CAAC,CAAC,CAAC,CAQnB;AAED;;;;;;;;GAQG;AACH,wBAAgB,6BAA6B,CAC3C,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,iBAAiB,GAAG,SAAS,GACrC,OAAO,CAGT"}

package/dist/sync/filters.d.ts

@@ -0,0 +1,51 @@
+import { SyncFilterOptions, SyncPath, SyncScanOptions } from './types.js';
+/**
+ * Tests whether a relative sync path is included by the configured include/exclude filters.
+ * Exclude filters win over include filters when both match the same path.
+ *
+ * @param relativePath - Folder-relative path using forward slashes.
+ * @param filters - Optional include and exclude filters.
+ *
+ * @returns True when the path should remain in the sync scan.
+ */
+export declare function pathPassesSyncFilters(relativePath: string, filters: SyncFilterOptions | undefined): boolean;
+/**
+ * Tests whether a directory may contain paths admitted by the configured filters.
+ *
+ * @param relativePath - Folder-relative directory path using forward slashes.
+ * @param filters - Optional include and exclude filters.
+ *
+ * @returns True when the scanner should descend into the directory.
+ */
+export declare function directoryMayContainSyncPaths(relativePath: string, filters: SyncFilterOptions | undefined): boolean;
+/**
+ * Returns the safe literal prefix that B2 listing can use for include filters.
+ * Exclude filters are not considered because they cannot narrow a B2 prefix.
+ *
+ * @param filters - Optional include and exclude filters.
+ *
+ * @returns A folder-relative literal prefix, or an empty string when no safe narrowing exists.
+ */
+export declare function literalPrefixForSyncFilters(filters: SyncFilterOptions | undefined): string;
+/**
+ * Filters an async iterable of sync paths while preserving the original item type.
+ *
+ * @typeParam T - Concrete sync path shape yielded by the source folder.
+ *
+ * @param paths - Async iterable of folder scan results.
+ * @param filters - Optional include and exclude filters.
+ *
+ * @returns A filtered async generator of sync paths.
+ */
+export declare function filterSyncPaths<T extends SyncPath>(paths: AsyncIterable<T>, filters: SyncScanOptions | undefined): AsyncGenerator<T>;
+/**
+ * Tests whether a path is skipped because RegExp filters are configured and the normalized path
+ * exceeds the SDK RegExp input guard.
+ *
+ * @param relativePath - Folder-relative path using forward slashes.
+ * @param filters - Optional include and exclude filters.
+ *
+ * @returns True when any RegExp filter is present and the path is too long to evaluate.
+ */
+export declare function pathSkippedByRegExpInputLimit(relativePath: string, filters: SyncFilterOptions | undefined): boolean;
+//# sourceMappingURL=filters.d.ts.map

package/dist/sync/filters.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filters.d.ts","sourceRoot":"","sources":["../../src/sync/filters.js"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,iBAAiB,EAAqB,QAAQ,EAAE,eAAe,EAAE,MAAM,YAAY,CAAA;AAEjG;;;;;;;;GAQG;AACH,wBAAgB,qBAAqB,CACnC,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,iBAAiB,GAAG,SAAS,GACrC,OAAO,CAcT;AAED;;;;;;;GAOG;AACH,wBAAgB,4BAA4B,CAC1C,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,iBAAiB,GAAG,SAAS,GACrC,OAAO,CAYT;AAED;;;;;;;GAOG;AACH,wBAAgB,2BAA2B,CAAC,OAAO,EAAE,iBAAiB,GAAG,SAAS,GAAG,MAAM,CAiB1F;AAED;;;;;;;;;GASG;AACH,wBAAuB,eAAe,CAAC,CAAC,SAAS,QAAQ,EACvD,KAAK,EAAE,aAAa,CAAC,CAAC,CAAC,EACvB,OAAO,EAAE,eAAe,GAAG,SAAS,GACnC,cAAc,CAAC,CAAC,CAAC,CAQnB;AAED;;;;;;;;GAQG;AACH,wBAAgB,6BAA6B,CAC3C,YAAY,EAAE,MAAM,EACpB,OAAO,EAAE,iBAAiB,GAAG,SAAS,GACrC,OAAO,CAGT"}

package/dist/sync/filters.js

@@ -0,0 +1,213 @@
+import { pathExceedsSafeRegExpInput, regexpMatchesSyncPath, validateSyncFilters } from "./regexp-safety.js";
+import { emitScannerSkip, regexpInputTooLongSkip } from "./scan-events.js";
+//#region src/sync/filters.ts
+/**
+* Tests whether a relative sync path is included by the configured include/exclude filters.
+* Exclude filters win over include filters when both match the same path.
+*
+* @param relativePath - Folder-relative path using forward slashes.
+* @param filters - Optional include and exclude filters.
+*
+* @returns True when the path should remain in the sync scan.
+*/
+function pathPassesSyncFilters(relativePath, filters) {
+	validateSyncFilters(filters);
+	const path = normalizePath(relativePath);
+	if (normalizedPathSkippedByRegExpInputLimit(path, filters)) return false;
+	const include = filters?.include ?? [];
+	const exclude = filters?.exclude ?? [];
+	if (include.length > 0) {
+		if (!include.some((pattern) => matchesPattern(path, pattern))) return false;
+	}
+	return !exclude.some((pattern) => matchesPattern(path, pattern));
+}
+/**
+* Tests whether a directory may contain paths admitted by the configured filters.
+*
+* @param relativePath - Folder-relative directory path using forward slashes.
+* @param filters - Optional include and exclude filters.
+*
+* @returns True when the scanner should descend into the directory.
+*/
+function directoryMayContainSyncPaths(relativePath, filters) {
+	validateSyncFilters(filters);
+	const path = normalizePath(relativePath);
+	if (path === "") return true;
+	if ((filters?.exclude ?? []).some((pattern) => stringPatternExcludesAllDescendants(path, pattern))) return false;
+	const include = filters?.include ?? [];
+	return include.length === 0 || include.some((pattern) => patternMayMatchDescendant(path, pattern));
+}
+/**
+* Returns the safe literal prefix that B2 listing can use for include filters.
+* Exclude filters are not considered because they cannot narrow a B2 prefix.
+*
+* @param filters - Optional include and exclude filters.
+*
+* @returns A folder-relative literal prefix, or an empty string when no safe narrowing exists.
+*/
+function literalPrefixForSyncFilters(filters) {
+	validateSyncFilters(filters);
+	const include = filters?.include ?? [];
+	let commonPrefix;
+	for (const pattern of include) {
+		if (patternIsRegExp(pattern)) return "";
+		const glob = normalizePath(pattern);
+		if (!glob.includes("/")) return "";
+		const prefix = literalPrefixForGlob(glob);
+		if (prefix === "") return "";
+		commonPrefix = commonPrefix === void 0 ? prefix : commonLiteralPrefix(commonPrefix, prefix);
+	}
+	return commonPrefix ?? "";
+}
+/**
+* Filters an async iterable of sync paths while preserving the original item type.
+*
+* @typeParam T - Concrete sync path shape yielded by the source folder.
+*
+* @param paths - Async iterable of folder scan results.
+* @param filters - Optional include and exclude filters.
+*
+* @returns A filtered async generator of sync paths.
+*/
+async function* filterSyncPaths(paths, filters) {
+	for await (const path of paths) if (pathPassesSyncFilters(path.relativePath, filters)) yield path;
+	else if (pathSkippedByRegExpInputLimit(path.relativePath, filters)) emitScannerSkip(filters, regexpInputTooLongSkip(normalizePath(path.relativePath)));
+}
+/**
+* Tests whether a path is skipped because RegExp filters are configured and the normalized path
+* exceeds the SDK RegExp input guard.
+*
+* @param relativePath - Folder-relative path using forward slashes.
+* @param filters - Optional include and exclude filters.
+*
+* @returns True when any RegExp filter is present and the path is too long to evaluate.
+*/
+function pathSkippedByRegExpInputLimit(relativePath, filters) {
+	validateSyncFilters(filters);
+	return normalizedPathSkippedByRegExpInputLimit(normalizePath(relativePath), filters);
+}
+function normalizedPathSkippedByRegExpInputLimit(normalizedPath, filters) {
+	if (!pathExceedsSafeRegExpInput(normalizedPath) || !filtersContainRegExp(filters)) return false;
+	return true;
+}
+function matchesPattern(relativePath, pattern) {
+	if (patternIsRegExp(pattern)) return regexpMatchesSyncPath(relativePath, pattern);
+	const glob = normalizePath(pattern);
+	if (glob === "") return relativePath === "";
+	const segments = splitPath(relativePath);
+	if (!glob.includes("/")) return segments.some((segment) => matchSegmentGlob(segment, glob));
+	return matchPathGlob(segments, splitPath(glob));
+}
+function stringPatternExcludesAllDescendants(relativePath, pattern) {
+	if (patternIsRegExp(pattern)) return false;
+	const glob = normalizePath(pattern);
+	if (glob === "") return false;
+	if (!glob.includes("/")) return matchesPattern(relativePath, pattern);
+	const globSegments = splitPath(glob);
+	return globSegments.at(-1) === "**" && matchPathGlob(splitPath(relativePath), globSegments);
+}
+function filtersContainRegExp(filters) {
+	return filters?.include?.some(patternIsRegExp) === true || filters?.exclude?.some(patternIsRegExp) === true;
+}
+function patternMayMatchDescendant(relativePath, pattern) {
+	if (patternIsRegExp(pattern)) return true;
+	const glob = normalizePath(pattern);
+	if (glob === "" || !glob.includes("/")) return true;
+	const pathSegments = splitPath(relativePath);
+	const globSegments = splitPath(glob);
+	const length = Math.min(pathSegments.length, globSegments.length);
+	for (let i = 0; i < length; i++) {
+		const globSegment = globSegments[i];
+		if (globSegment === "**" || globSegment === void 0 || hasGlobWildcard(globSegment)) return true;
+		if (globSegment !== pathSegments[i]) return false;
+	}
+	return true;
+}
+function matchPathGlob(pathSegments, globSegments) {
+	let reachable = new Array(pathSegments.length + 1).fill(false);
+	reachable[0] = true;
+	for (const globSegment of globSegments) {
+		const next = new Array(pathSegments.length + 1).fill(false);
+		if (globSegment === "**") {
+			let canReach = false;
+			for (let i = 0; i <= pathSegments.length; i++) {
+				canReach = canReach || reachable[i] === true;
+				next[i] = canReach;
+			}
+		} else for (let i = 0; i < pathSegments.length; i++) if (reachable[i] === true && matchSegmentGlob(pathSegments[i] ?? "", globSegment)) next[i + 1] = true;
+		reachable = next;
+	}
+	return reachable[pathSegments.length] === true;
+}
+function matchSegmentGlob(segment, glob) {
+	let segmentIndex = 0;
+	let globIndex = 0;
+	let starIndex = -1;
+	let starMatchIndex = 0;
+	while (segmentIndex < segment.length) {
+		const globChar = glob[globIndex];
+		if (globChar === "?" || globChar === segment[segmentIndex]) {
+			globIndex++;
+			segmentIndex++;
+		} else if (globChar === "*") {
+			while (glob[globIndex + 1] === "*") globIndex++;
+			starIndex = globIndex;
+			starMatchIndex = segmentIndex;
+			globIndex++;
+		} else if (starIndex !== -1) {
+			globIndex = starIndex + 1;
+			starMatchIndex++;
+			segmentIndex = starMatchIndex;
+		} else return false;
+	}
+	while (glob[globIndex] === "*") globIndex++;
+	return globIndex === glob.length;
+}
+function literalPrefixForGlob(glob) {
+	const segments = splitPath(glob);
+	const literalSegments = [];
+	let firstWildcardIndex = segments.length;
+	for (const [index, segment] of segments.entries()) {
+		if (segment === "**" || hasGlobWildcard(segment)) {
+			firstWildcardIndex = index;
+			break;
+		}
+		literalSegments.push(segment);
+	}
+	if (literalSegments.length === 0) return "";
+	const prefix = literalSegments.join("/");
+	const wildcardTail = segments.slice(firstWildcardIndex);
+	if (wildcardTail.length > 0 && wildcardTail.every((segment) => segment === "**")) return prefix;
+	return literalSegments.length < segments.length ? `${prefix}/` : prefix;
+}
+function commonLiteralPrefix(a, b) {
+	let end = 0;
+	const max = Math.min(a.length, b.length);
+	while (end < max && a[end] === b[end]) end++;
+	return trimTrailingHighSurrogate(a.slice(0, end));
+}
+function trimTrailingHighSurrogate(value) {
+	const lastCodeUnit = value.charCodeAt(value.length - 1);
+	return lastCodeUnit >= 55296 && lastCodeUnit <= 56319 ? value.slice(0, -1) : value;
+}
+function hasGlobWildcard(glob) {
+	return glob.includes("*") || glob.includes("?");
+}
+function patternIsRegExp(pattern) {
+	return typeof pattern !== "string";
+}
+function splitPath(path) {
+	if (path === "") return [];
+	return path.split("/").filter((segment) => segment !== "");
+}
+function normalizePath(path) {
+	let normalized = path.split("\\").join("/");
+	while (normalized.startsWith("./")) normalized = normalized.slice(2);
+	while (normalized.startsWith("/")) normalized = normalized.slice(1);
+	while (normalized.endsWith("/") && normalized.length > 1) normalized = normalized.slice(0, -1);
+	return normalized;
+}
+//#endregion
+export { directoryMayContainSyncPaths, filterSyncPaths, literalPrefixForSyncFilters, pathPassesSyncFilters, pathSkippedByRegExpInputLimit };
+
+//# sourceMappingURL=filters.js.map

package/dist/sync/filters.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"filters.js","names":[],"sources":["../../src/sync/filters.ts"],"sourcesContent":["import {\n  pathExceedsSafeRegExpInput,\n  regexpMatchesSyncPath,\n  validateSyncFilters,\n} from './regexp-safety.ts'\nimport { emitScannerSkip, regexpInputTooLongSkip } from './scan-events.ts'\nimport type { SyncFilterOptions, SyncFilterPattern, SyncPath, SyncScanOptions } from './types.ts'\n\n/**\n * Tests whether a relative sync path is included by the configured include/exclude filters.\n * Exclude filters win over include filters when both match the same path.\n *\n * @param relativePath - Folder-relative path using forward slashes.\n * @param filters - Optional include and exclude filters.\n *\n * @returns True when the path should remain in the sync scan.\n */\nexport function pathPassesSyncFilters(\n  relativePath: string,\n  filters: SyncFilterOptions | undefined,\n): boolean {\n  validateSyncFilters(filters)\n  const path = normalizePath(relativePath)\n\n  if (normalizedPathSkippedByRegExpInputLimit(path, filters)) return false\n\n  const include = filters?.include ?? []\n  const exclude = filters?.exclude ?? []\n\n  if (include.length > 0) {\n    if (!include.some((pattern) => matchesPattern(path, pattern))) return false\n  }\n\n  return !exclude.some((pattern) => matchesPattern(path, pattern))\n}\n\n/**\n * Tests whether a directory may contain paths admitted by the configured filters.\n *\n * @param relativePath - Folder-relative directory path using forward slashes.\n * @param filters - Optional include and exclude filters.\n *\n * @returns True when the scanner should descend into the directory.\n */\nexport function directoryMayContainSyncPaths(\n  relativePath: string,\n  filters: SyncFilterOptions | undefined,\n): boolean {\n  validateSyncFilters(filters)\n  const path = normalizePath(relativePath)\n  if (path === '') return true\n\n  const exclude = filters?.exclude ?? []\n  if (exclude.some((pattern) => stringPatternExcludesAllDescendants(path, pattern))) {\n    return false\n  }\n\n  const include = filters?.include ?? []\n  return include.length === 0 || include.some((pattern) => patternMayMatchDescendant(path, pattern))\n}\n\n/**\n * Returns the safe literal prefix that B2 listing can use for include filters.\n * Exclude filters are not considered because they cannot narrow a B2 prefix.\n *\n * @param filters - Optional include and exclude filters.\n *\n * @returns A folder-relative literal prefix, or an empty string when no safe narrowing exists.\n */\nexport function literalPrefixForSyncFilters(filters: SyncFilterOptions | undefined): string {\n  validateSyncFilters(filters)\n  const include = filters?.include ?? []\n  let commonPrefix: string | undefined\n\n  for (const pattern of include) {\n    if (patternIsRegExp(pattern)) return ''\n\n    const glob = normalizePath(pattern)\n    if (!glob.includes('/')) return ''\n\n    const prefix = literalPrefixForGlob(glob)\n    if (prefix === '') return ''\n    commonPrefix = commonPrefix === undefined ? prefix : commonLiteralPrefix(commonPrefix, prefix)\n  }\n\n  return commonPrefix ?? ''\n}\n\n/**\n * Filters an async iterable of sync paths while preserving the original item type.\n *\n * @typeParam T - Concrete sync path shape yielded by the source folder.\n *\n * @param paths - Async iterable of folder scan results.\n * @param filters - Optional include and exclude filters.\n *\n * @returns A filtered async generator of sync paths.\n */\nexport async function* filterSyncPaths<T extends SyncPath>(\n  paths: AsyncIterable<T>,\n  filters: SyncScanOptions | undefined,\n): AsyncGenerator<T> {\n  for await (const path of paths) {\n    if (pathPassesSyncFilters(path.relativePath, filters)) {\n      yield path\n    } else if (pathSkippedByRegExpInputLimit(path.relativePath, filters)) {\n      emitScannerSkip(filters, regexpInputTooLongSkip(normalizePath(path.relativePath)))\n    }\n  }\n}\n\n/**\n * Tests whether a path is skipped because RegExp filters are configured and the normalized path\n * exceeds the SDK RegExp input guard.\n *\n * @param relativePath - Folder-relative path using forward slashes.\n * @param filters - Optional include and exclude filters.\n *\n * @returns True when any RegExp filter is present and the path is too long to evaluate.\n */\nexport function pathSkippedByRegExpInputLimit(\n  relativePath: string,\n  filters: SyncFilterOptions | undefined,\n): boolean {\n  validateSyncFilters(filters)\n  return normalizedPathSkippedByRegExpInputLimit(normalizePath(relativePath), filters)\n}\n\nfunction normalizedPathSkippedByRegExpInputLimit(\n  normalizedPath: string,\n  filters: SyncFilterOptions | undefined,\n): boolean {\n  if (!pathExceedsSafeRegExpInput(normalizedPath) || !filtersContainRegExp(filters)) {\n    return false\n  }\n  return true\n}\n\nfunction matchesPattern(relativePath: string, pattern: SyncFilterPattern): boolean {\n  if (patternIsRegExp(pattern)) {\n    return regexpMatchesSyncPath(relativePath, pattern)\n  }\n\n  const glob = normalizePath(pattern)\n  if (glob === '') return relativePath === ''\n\n  const segments = splitPath(relativePath)\n  if (!glob.includes('/')) {\n    return segments.some((segment) => matchSegmentGlob(segment, glob))\n  }\n\n  return matchPathGlob(segments, splitPath(glob))\n}\n\nfunction stringPatternExcludesAllDescendants(\n  relativePath: string,\n  pattern: SyncFilterPattern,\n): boolean {\n  if (patternIsRegExp(pattern)) return false\n\n  const glob = normalizePath(pattern)\n  if (glob === '') return false\n  if (!glob.includes('/')) return matchesPattern(relativePath, pattern)\n\n  const globSegments = splitPath(glob)\n  return globSegments.at(-1) === '**' && matchPathGlob(splitPath(relativePath), globSegments)\n}\n\nfunction filtersContainRegExp(filters: SyncFilterOptions | undefined): boolean {\n  return (\n    filters?.include?.some(patternIsRegExp) === true ||\n    filters?.exclude?.some(patternIsRegExp) === true\n  )\n}\n\nfunction patternMayMatchDescendant(relativePath: string, pattern: SyncFilterPattern): boolean {\n  if (patternIsRegExp(pattern)) return true\n\n  const glob = normalizePath(pattern)\n  if (glob === '' || !glob.includes('/')) return true\n\n  const pathSegments = splitPath(relativePath)\n  const globSegments = splitPath(glob)\n  const length = Math.min(pathSegments.length, globSegments.length)\n\n  for (let i = 0; i < length; i++) {\n    const globSegment = globSegments[i]\n    if (globSegment === '**' || globSegment === undefined || hasGlobWildcard(globSegment)) {\n      return true\n    }\n    if (globSegment !== pathSegments[i]) {\n      return false\n    }\n  }\n\n  return true\n}\n\nfunction matchPathGlob(pathSegments: readonly string[], globSegments: readonly string[]): boolean {\n  let reachable = new Array<boolean>(pathSegments.length + 1).fill(false)\n  reachable[0] = true\n\n  for (const globSegment of globSegments) {\n    const next = new Array<boolean>(pathSegments.length + 1).fill(false)\n\n    if (globSegment === '**') {\n      // A whole-segment `**` consumes zero or more complete path segments.\n      let canReach = false\n      for (let i = 0; i <= pathSegments.length; i++) {\n        canReach = canReach || reachable[i] === true\n        next[i] = canReach\n      }\n    } else {\n      for (let i = 0; i < pathSegments.length; i++) {\n        if (reachable[i] === true && matchSegmentGlob(pathSegments[i] ?? '', globSegment)) {\n          next[i + 1] = true\n        }\n      }\n    }\n\n    reachable = next\n  }\n\n  return reachable[pathSegments.length] === true\n}\n\nfunction matchSegmentGlob(segment: string, glob: string): boolean {\n  let segmentIndex = 0\n  let globIndex = 0\n  let starIndex = -1\n  let starMatchIndex = 0\n\n  while (segmentIndex < segment.length) {\n    const globChar = glob[globIndex]\n    if (globChar === '?' || globChar === segment[segmentIndex]) {\n      globIndex++\n      segmentIndex++\n    } else if (globChar === '*') {\n      // Repeated `*` in one segment is still one segment-local wildcard.\n      while (glob[globIndex + 1] === '*') globIndex++\n      starIndex = globIndex\n      starMatchIndex = segmentIndex\n      globIndex++\n    } else if (starIndex !== -1) {\n      globIndex = starIndex + 1\n      starMatchIndex++\n      segmentIndex = starMatchIndex\n    } else {\n      return false\n    }\n  }\n\n  while (glob[globIndex] === '*') globIndex++\n  return globIndex === glob.length\n}\n\nfunction literalPrefixForGlob(glob: string): string {\n  const segments = splitPath(glob)\n  const literalSegments: string[] = []\n  let firstWildcardIndex = segments.length\n\n  for (const [index, segment] of segments.entries()) {\n    if (segment === '**' || hasGlobWildcard(segment)) {\n      firstWildcardIndex = index\n      break\n    }\n    literalSegments.push(segment)\n  }\n\n  if (literalSegments.length === 0) return ''\n  const prefix = literalSegments.join('/')\n  const wildcardTail = segments.slice(firstWildcardIndex)\n  const tailMayMatchBarePrefix =\n    wildcardTail.length > 0 && wildcardTail.every((segment) => segment === '**')\n  if (tailMayMatchBarePrefix) return prefix\n  return literalSegments.length < segments.length ? `${prefix}/` : prefix\n}\n\nfunction commonLiteralPrefix(a: string, b: string): string {\n  let end = 0\n  const max = Math.min(a.length, b.length)\n  while (end < max && a[end] === b[end]) end++\n  return trimTrailingHighSurrogate(a.slice(0, end))\n}\n\nfunction trimTrailingHighSurrogate(value: string): string {\n  const lastCodeUnit = value.charCodeAt(value.length - 1)\n  return lastCodeUnit >= 0xd800 && lastCodeUnit <= 0xdbff ? value.slice(0, -1) : value\n}\n\nfunction hasGlobWildcard(glob: string): boolean {\n  return glob.includes('*') || glob.includes('?')\n}\n\nfunction patternIsRegExp(pattern: SyncFilterPattern): pattern is RegExp {\n  return typeof pattern !== 'string'\n}\n\nfunction splitPath(path: string): string[] {\n  if (path === '') return []\n  return path.split('/').filter((segment) => segment !== '')\n}\n\nfunction normalizePath(path: string): string {\n  let normalized = path.split('\\\\').join('/')\n  while (normalized.startsWith('./')) normalized = normalized.slice(2)\n  while (normalized.startsWith('/')) normalized = normalized.slice(1)\n  while (normalized.endsWith('/') && normalized.length > 1) {\n    normalized = normalized.slice(0, -1)\n  }\n  return normalized\n}\n"],"mappings":";;;;;;;;;;;;AAiBA,SAAgB,sBACd,cACA,SACS;CACT,oBAAoB,OAAO;CAC3B,MAAM,OAAO,cAAc,YAAY;CAEvC,IAAI,wCAAwC,MAAM,OAAO,GAAG,OAAO;CAEnE,MAAM,UAAU,SAAS,WAAW,CAAC;CACrC,MAAM,UAAU,SAAS,WAAW,CAAC;CAErC,IAAI,QAAQ,SAAS;MACf,CAAC,QAAQ,MAAM,YAAY,eAAe,MAAM,OAAO,CAAC,GAAG,OAAO;CAAA;CAGxE,OAAO,CAAC,QAAQ,MAAM,YAAY,eAAe,MAAM,OAAO,CAAC;AACjE;;;;;;;;;AAUA,SAAgB,6BACd,cACA,SACS;CACT,oBAAoB,OAAO;CAC3B,MAAM,OAAO,cAAc,YAAY;CACvC,IAAI,SAAS,IAAI,OAAO;CAGxB,KADgB,SAAS,WAAW,CAAC,EAAA,CACzB,MAAM,YAAY,oCAAoC,MAAM,OAAO,CAAC,GAC9E,OAAO;CAGT,MAAM,UAAU,SAAS,WAAW,CAAC;CACrC,OAAO,QAAQ,WAAW,KAAK,QAAQ,MAAM,YAAY,0BAA0B,MAAM,OAAO,CAAC;AACnG;;;;;;;;;AAUA,SAAgB,4BAA4B,SAAgD;CAC1F,oBAAoB,OAAO;CAC3B,MAAM,UAAU,SAAS,WAAW,CAAC;CACrC,IAAI;CAEJ,KAAK,MAAM,WAAW,SAAS;EAC7B,IAAI,gBAAgB,OAAO,GAAG,OAAO;EAErC,MAAM,OAAO,cAAc,OAAO;EAClC,IAAI,CAAC,KAAK,SAAS,GAAG,GAAG,OAAO;EAEhC,MAAM,SAAS,qBAAqB,IAAI;EACxC,IAAI,WAAW,IAAI,OAAO;EAC1B,eAAe,iBAAiB,KAAA,IAAY,SAAS,oBAAoB,cAAc,MAAM;CAC/F;CAEA,OAAO,gBAAgB;AACzB;;;;;;;;;;;AAYA,gBAAuB,gBACrB,OACA,SACmB;CACnB,WAAW,MAAM,QAAQ,OACvB,IAAI,sBAAsB,KAAK,cAAc,OAAO,GAClD,MAAM;MACD,IAAI,8BAA8B,KAAK,cAAc,OAAO,GACjE,gBAAgB,SAAS,uBAAuB,cAAc,KAAK,YAAY,CAAC,CAAC;AAGvF;;;;;;;;;;AAWA,SAAgB,8BACd,cACA,SACS;CACT,oBAAoB,OAAO;CAC3B,OAAO,wCAAwC,cAAc,YAAY,GAAG,OAAO;AACrF;AAEA,SAAS,wCACP,gBACA,SACS;CACT,IAAI,CAAC,2BAA2B,cAAc,KAAK,CAAC,qBAAqB,OAAO,GAC9E,OAAO;CAET,OAAO;AACT;AAEA,SAAS,eAAe,cAAsB,SAAqC;CACjF,IAAI,gBAAgB,OAAO,GACzB,OAAO,sBAAsB,cAAc,OAAO;CAGpD,MAAM,OAAO,cAAc,OAAO;CAClC,IAAI,SAAS,IAAI,OAAO,iBAAiB;CAEzC,MAAM,WAAW,UAAU,YAAY;CACvC,IAAI,CAAC,KAAK,SAAS,GAAG,GACpB,OAAO,SAAS,MAAM,YAAY,iBAAiB,SAAS,IAAI,CAAC;CAGnE,OAAO,cAAc,UAAU,UAAU,IAAI,CAAC;AAChD;AAEA,SAAS,oCACP,cACA,SACS;CACT,IAAI,gBAAgB,OAAO,GAAG,OAAO;CAErC,MAAM,OAAO,cAAc,OAAO;CAClC,IAAI,SAAS,IAAI,OAAO;CACxB,IAAI,CAAC,KAAK,SAAS,GAAG,GAAG,OAAO,eAAe,cAAc,OAAO;CAEpE,MAAM,eAAe,UAAU,IAAI;CACnC,OAAO,aAAa,GAAG,EAAE,MAAM,QAAQ,cAAc,UAAU,YAAY,GAAG,YAAY;AAC5F;AAEA,SAAS,qBAAqB,SAAiD;CAC7E,OACE,SAAS,SAAS,KAAK,eAAe,MAAM,QAC5C,SAAS,SAAS,KAAK,eAAe,MAAM;AAEhD;AAEA,SAAS,0BAA0B,cAAsB,SAAqC;CAC5F,IAAI,gBAAgB,OAAO,GAAG,OAAO;CAErC,MAAM,OAAO,cAAc,OAAO;CAClC,IAAI,SAAS,MAAM,CAAC,KAAK,SAAS,GAAG,GAAG,OAAO;CAE/C,MAAM,eAAe,UAAU,YAAY;CAC3C,MAAM,eAAe,UAAU,IAAI;CACnC,MAAM,SAAS,KAAK,IAAI,aAAa,QAAQ,aAAa,MAAM;CAEhE,KAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,KAAK;EAC/B,MAAM,cAAc,aAAa;EACjC,IAAI,gBAAgB,QAAQ,gBAAgB,KAAA,KAAa,gBAAgB,WAAW,GAClF,OAAO;EAET,IAAI,gBAAgB,aAAa,IAC/B,OAAO;CAEX;CAEA,OAAO;AACT;AAEA,SAAS,cAAc,cAAiC,cAA0C;CAChG,IAAI,YAAY,IAAI,MAAe,aAAa,SAAS,CAAC,CAAC,CAAC,KAAK,KAAK;CACtE,UAAU,KAAK;CAEf,KAAK,MAAM,eAAe,cAAc;EACtC,MAAM,OAAO,IAAI,MAAe,aAAa,SAAS,CAAC,CAAC,CAAC,KAAK,KAAK;EAEnE,IAAI,gBAAgB,MAAM;GAExB,IAAI,WAAW;GACf,KAAK,IAAI,IAAI,GAAG,KAAK,aAAa,QAAQ,KAAK;IAC7C,WAAW,YAAY,UAAU,OAAO;IACxC,KAAK,KAAK;GACZ;EACF,OACE,KAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,KACvC,IAAI,UAAU,OAAO,QAAQ,iBAAiB,aAAa,MAAM,IAAI,WAAW,GAC9E,KAAK,IAAI,KAAK;EAKpB,YAAY;CACd;CAEA,OAAO,UAAU,aAAa,YAAY;AAC5C;AAEA,SAAS,iBAAiB,SAAiB,MAAuB;CAChE,IAAI,eAAe;CACnB,IAAI,YAAY;CAChB,IAAI,YAAY;CAChB,IAAI,iBAAiB;CAErB,OAAO,eAAe,QAAQ,QAAQ;EACpC,MAAM,WAAW,KAAK;EACtB,IAAI,aAAa,OAAO,aAAa,QAAQ,eAAe;GAC1D;GACA;EACF,OAAO,IAAI,aAAa,KAAK;GAE3B,OAAO,KAAK,YAAY,OAAO,KAAK;GACpC,YAAY;GACZ,iBAAiB;GACjB;EACF,OAAO,IAAI,cAAc,IAAI;GAC3B,YAAY,YAAY;GACxB;GACA,eAAe;EACjB,OACE,OAAO;CAEX;CAEA,OAAO,KAAK,eAAe,KAAK;CAChC,OAAO,cAAc,KAAK;AAC5B;AAEA,SAAS,qBAAqB,MAAsB;CAClD,MAAM,WAAW,UAAU,IAAI;CAC/B,MAAM,kBAA4B,CAAC;CACnC,IAAI,qBAAqB,SAAS;CAElC,KAAK,MAAM,CAAC,OAAO,YAAY,SAAS,QAAQ,GAAG;EACjD,IAAI,YAAY,QAAQ,gBAAgB,OAAO,GAAG;GAChD,qBAAqB;GACrB;EACF;EACA,gBAAgB,KAAK,OAAO;CAC9B;CAEA,IAAI,gBAAgB,WAAW,GAAG,OAAO;CACzC,MAAM,SAAS,gBAAgB,KAAK,GAAG;CACvC,MAAM,eAAe,SAAS,MAAM,kBAAkB;CAGtD,IADE,aAAa,SAAS,KAAK,aAAa,OAAO,YAAY,YAAY,IAAI,GACjD,OAAO;CACnC,OAAO,gBAAgB,SAAS,SAAS,SAAS,GAAG,OAAO,KAAK;AACnE;AAEA,SAAS,oBAAoB,GAAW,GAAmB;CACzD,IAAI,MAAM;CACV,MAAM,MAAM,KAAK,IAAI,EAAE,QAAQ,EAAE,MAAM;CACvC,OAAO,MAAM,OAAO,EAAE,SAAS,EAAE,MAAM;CACvC,OAAO,0BAA0B,EAAE,MAAM,GAAG,GAAG,CAAC;AAClD;AAEA,SAAS,0BAA0B,OAAuB;CACxD,MAAM,eAAe,MAAM,WAAW,MAAM,SAAS,CAAC;CACtD,OAAO,gBAAgB,SAAU,gBAAgB,QAAS,MAAM,MAAM,GAAG,EAAE,IAAI;AACjF;AAEA,SAAS,gBAAgB,MAAuB;CAC9C,OAAO,KAAK,SAAS,GAAG,KAAK,KAAK,SAAS,GAAG;AAChD;AAEA,SAAS,gBAAgB,SAA+C;CACtE,OAAO,OAAO,YAAY;AAC5B;AAEA,SAAS,UAAU,MAAwB;CACzC,IAAI,SAAS,IAAI,OAAO,CAAC;CACzB,OAAO,KAAK,MAAM,GAAG,CAAC,CAAC,QAAQ,YAAY,YAAY,EAAE;AAC3D;AAEA,SAAS,cAAc,MAAsB;CAC3C,IAAI,aAAa,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,GAAG;CAC1C,OAAO,WAAW,WAAW,IAAI,GAAG,aAAa,WAAW,MAAM,CAAC;CACnE,OAAO,WAAW,WAAW,GAAG,GAAG,aAAa,WAAW,MAAM,CAAC;CAClE,OAAO,WAAW,SAAS,GAAG,KAAK,WAAW,SAAS,GACrD,aAAa,WAAW,MAAM,GAAG,EAAE;CAErC,OAAO;AACT"}