@sitecore/sc-contenthub-blok 2.0.1 → 2.1.1

package/node_modules/@jridgewell/trace-mapping/src/binary-search.ts

@@ -1,115 +0,0 @@
-import type { SourceMapSegment, ReverseSegment } from './sourcemap-segment';
-import { COLUMN } from './sourcemap-segment';
-
-export type MemoState = {
-  lastKey: number;
-  lastNeedle: number;
-  lastIndex: number;
-};
-
-export let found = false;
-
-/**
- * A binary search implementation that returns the index if a match is found.
- * If no match is found, then the left-index (the index associated with the item that comes just
- * before the desired index) is returned. To maintain proper sort order, a splice would happen at
- * the next index:
- *
- * ```js
- * const array = [1, 3];
- * const needle = 2;
- * const index = binarySearch(array, needle, (item, needle) => item - needle);
- *
- * assert.equal(index, 0);
- * array.splice(index + 1, 0, needle);
- * assert.deepEqual(array, [1, 2, 3]);
- * ```
- */
-export function binarySearch(
-  haystack: SourceMapSegment[] | ReverseSegment[],
-  needle: number,
-  low: number,
-  high: number,
-): number {
-  while (low <= high) {
-    const mid = low + ((high - low) >> 1);
-    const cmp = haystack[mid][COLUMN] - needle;
-
-    if (cmp === 0) {
-      found = true;
-      return mid;
-    }
-
-    if (cmp < 0) {
-      low = mid + 1;
-    } else {
-      high = mid - 1;
-    }
-  }
-
-  found = false;
-  return low - 1;
-}
-
-export function upperBound(
-  haystack: SourceMapSegment[] | ReverseSegment[],
-  needle: number,
-  index: number,
-): number {
-  for (let i = index + 1; i < haystack.length; index = i++) {
-    if (haystack[i][COLUMN] !== needle) break;
-  }
-  return index;
-}
-
-export function lowerBound(
-  haystack: SourceMapSegment[] | ReverseSegment[],
-  needle: number,
-  index: number,
-): number {
-  for (let i = index - 1; i >= 0; index = i--) {
-    if (haystack[i][COLUMN] !== needle) break;
-  }
-  return index;
-}
-
-export function memoizedState(): MemoState {
-  return {
-    lastKey: -1,
-    lastNeedle: -1,
-    lastIndex: -1,
-  };
-}
-
-/**
- * This overly complicated beast is just to record the last tested line/column and the resulting
- * index, allowing us to skip a few tests if mappings are monotonically increasing.
- */
-export function memoizedBinarySearch(
-  haystack: SourceMapSegment[] | ReverseSegment[],
-  needle: number,
-  state: MemoState,
-  key: number,
-): number {
-  const { lastKey, lastNeedle, lastIndex } = state;
-
-  let low = 0;
-  let high = haystack.length - 1;
-  if (key === lastKey) {
-    if (needle === lastNeedle) {
-      found = lastIndex !== -1 && haystack[lastIndex][COLUMN] === needle;
-      return lastIndex;
-    }
-
-    if (needle >= lastNeedle) {
-      // lastIndex may be -1 if the previous needle was not found.
-      low = lastIndex === -1 ? 0 : lastIndex;
-    } else {
-      high = lastIndex;
-    }
-  }
-  state.lastKey = key;
-  state.lastNeedle = needle;
-
-  return (state.lastIndex = binarySearch(haystack, needle, low, high));
-}

package/node_modules/@jridgewell/trace-mapping/src/by-source.ts

@@ -1,41 +0,0 @@
-import { COLUMN, SOURCES_INDEX, SOURCE_LINE, SOURCE_COLUMN } from './sourcemap-segment';
-import { sortComparator } from './sort';
-
-import type { ReverseSegment, SourceMapSegment } from './sourcemap-segment';
-
-export type Source = ReverseSegment[][];
-
-// Rebuilds the original source files, with mappings that are ordered by source line/column instead
-// of generated line/column.
-export default function buildBySources(
-  decoded: readonly SourceMapSegment[][],
-  memos: unknown[],
-): Source[] {
-  const sources: Source[] = memos.map(() => []);
-
-  for (let i = 0; i < decoded.length; i++) {
-    const line = decoded[i];
-    for (let j = 0; j < line.length; j++) {
-      const seg = line[j];
-      if (seg.length === 1) continue;
-
-      const sourceIndex = seg[SOURCES_INDEX];
-      const sourceLine = seg[SOURCE_LINE];
-      const sourceColumn = seg[SOURCE_COLUMN];
-
-      const source = sources[sourceIndex];
-      const segs = (source[sourceLine] ||= []);
-      segs.push([sourceColumn, i, seg[COLUMN]]);
-    }
-  }
-
-  for (let i = 0; i < sources.length; i++) {
-    const source = sources[i];
-    for (let j = 0; j < source.length; j++) {
-      const line = source[j];
-      if (line) line.sort(sortComparator);
-    }
-  }
-
-  return sources;
-}

package/node_modules/@jridgewell/trace-mapping/src/flatten-map.ts

@@ -1,192 +0,0 @@
-import { TraceMap, presortedDecodedMap, decodedMappings } from './trace-mapping';
-import {
-  COLUMN,
-  SOURCES_INDEX,
-  SOURCE_LINE,
-  SOURCE_COLUMN,
-  NAMES_INDEX,
-} from './sourcemap-segment';
-import { parse } from './types';
-
-import type {
-  DecodedSourceMap,
-  DecodedSourceMapXInput,
-  EncodedSourceMapXInput,
-  SectionedSourceMapXInput,
-  SectionedSourceMapInput,
-  SectionXInput,
-  Ro,
-} from './types';
-import type { SourceMapSegment } from './sourcemap-segment';
-
-type FlattenMap = {
-  new (map: Ro<SectionedSourceMapInput>, mapUrl?: string | null): TraceMap;
-  (map: Ro<SectionedSourceMapInput>, mapUrl?: string | null): TraceMap;
-};
-
-export const FlattenMap: FlattenMap = function (map, mapUrl) {
-  const parsed = parse(map as SectionedSourceMapInput);
-
-  if (!('sections' in parsed)) {
-    return new TraceMap(parsed as DecodedSourceMapXInput | EncodedSourceMapXInput, mapUrl);
-  }
-
-  const mappings: SourceMapSegment[][] = [];
-  const sources: string[] = [];
-  const sourcesContent: (string | null)[] = [];
-  const names: string[] = [];
-  const ignoreList: number[] = [];
-
-  recurse(
-    parsed,
-    mapUrl,
-    mappings,
-    sources,
-    sourcesContent,
-    names,
-    ignoreList,
-    0,
-    0,
-    Infinity,
-    Infinity,
-  );
-
-  const joined: DecodedSourceMap = {
-    version: 3,
-    file: parsed.file,
-    names,
-    sources,
-    sourcesContent,
-    mappings,
-    ignoreList,
-  };
-
-  return presortedDecodedMap(joined);
-} as FlattenMap;
-
-function recurse(
-  input: SectionedSourceMapXInput,
-  mapUrl: string | null | undefined,
-  mappings: SourceMapSegment[][],
-  sources: string[],
-  sourcesContent: (string | null)[],
-  names: string[],
-  ignoreList: number[],
-  lineOffset: number,
-  columnOffset: number,
-  stopLine: number,
-  stopColumn: number,
-) {
-  const { sections } = input;
-  for (let i = 0; i < sections.length; i++) {
-    const { map, offset } = sections[i];
-
-    let sl = stopLine;
-    let sc = stopColumn;
-    if (i + 1 < sections.length) {
-      const nextOffset = sections[i + 1].offset;
-      sl = Math.min(stopLine, lineOffset + nextOffset.line);
-
-      if (sl === stopLine) {
-        sc = Math.min(stopColumn, columnOffset + nextOffset.column);
-      } else if (sl < stopLine) {
-        sc = columnOffset + nextOffset.column;
-      }
-    }
-
-    addSection(
-      map,
-      mapUrl,
-      mappings,
-      sources,
-      sourcesContent,
-      names,
-      ignoreList,
-      lineOffset + offset.line,
-      columnOffset + offset.column,
-      sl,
-      sc,
-    );
-  }
-}
-
-function addSection(
-  input: SectionXInput['map'],
-  mapUrl: string | null | undefined,
-  mappings: SourceMapSegment[][],
-  sources: string[],
-  sourcesContent: (string | null)[],
-  names: string[],
-  ignoreList: number[],
-  lineOffset: number,
-  columnOffset: number,
-  stopLine: number,
-  stopColumn: number,
-) {
-  const parsed = parse(input);
-  if ('sections' in parsed) return recurse(...(arguments as unknown as Parameters<typeof recurse>));
-
-  const map = new TraceMap(parsed, mapUrl);
-  const sourcesOffset = sources.length;
-  const namesOffset = names.length;
-  const decoded = decodedMappings(map);
-  const { resolvedSources, sourcesContent: contents, ignoreList: ignores } = map;
-
-  append(sources, resolvedSources);
-  append(names, map.names);
-
-  if (contents) append(sourcesContent, contents);
-  else for (let i = 0; i < resolvedSources.length; i++) sourcesContent.push(null);
-
-  if (ignores) for (let i = 0; i < ignores.length; i++) ignoreList.push(ignores[i] + sourcesOffset);
-
-  for (let i = 0; i < decoded.length; i++) {
-    const lineI = lineOffset + i;
-
-    // We can only add so many lines before we step into the range that the next section's map
-    // controls. When we get to the last line, then we'll start checking the segments to see if
-    // they've crossed into the column range. But it may not have any columns that overstep, so we
-    // still need to check that we don't overstep lines, too.
-    if (lineI > stopLine) return;
-
-    // The out line may already exist in mappings (if we're continuing the line started by a
-    // previous section). Or, we may have jumped ahead several lines to start this section.
-    const out = getLine(mappings, lineI);
-    // On the 0th loop, the section's column offset shifts us forward. On all other lines (since the
-    // map can be multiple lines), it doesn't.
-    const cOffset = i === 0 ? columnOffset : 0;
-
-    const line = decoded[i];
-    for (let j = 0; j < line.length; j++) {
-      const seg = line[j];
-      const column = cOffset + seg[COLUMN];
-
-      // If this segment steps into the column range that the next section's map controls, we need
-      // to stop early.
-      if (lineI === stopLine && column >= stopColumn) return;
-
-      if (seg.length === 1) {
-        out.push([column]);
-        continue;
-      }
-
-      const sourcesIndex = sourcesOffset + seg[SOURCES_INDEX];
-      const sourceLine = seg[SOURCE_LINE];
-      const sourceColumn = seg[SOURCE_COLUMN];
-      out.push(
-        seg.length === 4
-          ? [column, sourcesIndex, sourceLine, sourceColumn]
-          : [column, sourcesIndex, sourceLine, sourceColumn, namesOffset + seg[NAMES_INDEX]],
-      );
-    }
-  }
-}
-
-function append<T>(arr: T[], other: T[]) {
-  for (let i = 0; i < other.length; i++) arr.push(other[i]);
-}
-
-function getLine<T>(arr: T[][], index: number): T[] {
-  for (let i = arr.length; i <= index; i++) arr[i] = [];
-  return arr[index];
-}

package/node_modules/@jridgewell/trace-mapping/src/resolve.ts

@@ -1,16 +0,0 @@
-import resolveUri from '@jridgewell/resolve-uri';
-import stripFilename from './strip-filename';
-
-type Resolve = (source: string | null) => string;
-export default function resolver(
-  mapUrl: string | null | undefined,
-  sourceRoot: string | undefined,
-): Resolve {
-  const from = stripFilename(mapUrl);
-  // The sourceRoot is always treated as a directory, if it's not empty.
-  // https://github.com/mozilla/source-map/blob/8cb3ee57/lib/util.js#L327
-  // https://github.com/chromium/chromium/blob/da4adbb3/third_party/blink/renderer/devtools/front_end/sdk/SourceMap.js#L400-L401
-  const prefix = sourceRoot ? sourceRoot + '/' : '';
-
-  return (source) => resolveUri(prefix + (source || ''), from);
-}

package/node_modules/@jridgewell/trace-mapping/src/sort.ts

@@ -1,45 +0,0 @@
-import { COLUMN } from './sourcemap-segment';
-
-import type { ReverseSegment, SourceMapSegment } from './sourcemap-segment';
-
-export default function maybeSort(
-  mappings: SourceMapSegment[][],
-  owned: boolean,
-): SourceMapSegment[][] {
-  const unsortedIndex = nextUnsortedSegmentLine(mappings, 0);
-  if (unsortedIndex === mappings.length) return mappings;
-
-  // If we own the array (meaning we parsed it from JSON), then we're free to directly mutate it. If
-  // not, we do not want to modify the consumer's input array.
-  if (!owned) mappings = mappings.slice();
-
-  for (let i = unsortedIndex; i < mappings.length; i = nextUnsortedSegmentLine(mappings, i + 1)) {
-    mappings[i] = sortSegments(mappings[i], owned);
-  }
-  return mappings;
-}
-
-function nextUnsortedSegmentLine(mappings: SourceMapSegment[][], start: number): number {
-  for (let i = start; i < mappings.length; i++) {
-    if (!isSorted(mappings[i])) return i;
-  }
-  return mappings.length;
-}
-
-function isSorted(line: SourceMapSegment[]): boolean {
-  for (let j = 1; j < line.length; j++) {
-    if (line[j][COLUMN] < line[j - 1][COLUMN]) {
-      return false;
-    }
-  }
-  return true;
-}
-
-function sortSegments(line: SourceMapSegment[], owned: boolean): SourceMapSegment[] {
-  if (!owned) line = line.slice();
-  return line.sort(sortComparator);
-}
-
-export function sortComparator<T extends SourceMapSegment | ReverseSegment>(a: T, b: T): number {
-  return a[COLUMN] - b[COLUMN];
-}

package/node_modules/@jridgewell/trace-mapping/src/sourcemap-segment.ts

@@ -1,23 +0,0 @@
-type GeneratedColumn = number;
-type SourcesIndex = number;
-type SourceLine = number;
-type SourceColumn = number;
-type NamesIndex = number;
-
-type GeneratedLine = number;
-
-export type SourceMapSegment =
-  | [GeneratedColumn]
-  | [GeneratedColumn, SourcesIndex, SourceLine, SourceColumn]
-  | [GeneratedColumn, SourcesIndex, SourceLine, SourceColumn, NamesIndex];
-
-export type ReverseSegment = [SourceColumn, GeneratedLine, GeneratedColumn];
-
-export const COLUMN = 0;
-export const SOURCES_INDEX = 1;
-export const SOURCE_LINE = 2;
-export const SOURCE_COLUMN = 3;
-export const NAMES_INDEX = 4;
-
-export const REV_GENERATED_LINE = 1;
-export const REV_GENERATED_COLUMN = 2;

package/node_modules/@jridgewell/trace-mapping/src/strip-filename.ts

@@ -1,8 +0,0 @@
-/**
- * Removes everything after the last "/", but leaves the slash.
- */
-export default function stripFilename(path: string | undefined | null): string {
-  if (!path) return '';
-  const index = path.lastIndexOf('/');
-  return path.slice(0, index + 1);
-}