@hominis/fireforge 0.43.1 → 0.44.1

package/dist/src/core/manifest-helpers.d.ts

@@ -1,38 +0,0 @@
-import type { JarMnToken, MozBuildToken } from './manifest-tokenizers.js';
-/**
- * Ordering comparator matching mozbuild's `StrictOrderingOnAppendList`
- * (`mozbuild.util.UnsortedError`): entries are compared **case-insensitively**,
- * so `HominisAppearanceController` (`appe`) sorts before
- * `HominisAppMenuIntegration` (`appm`) even though a raw byte comparison
- * places the uppercase `M` (0x4D) before the lowercase `e` (0x65).
- *
- * A naive `a > b` insertion landed the new entry in byte order, which
- * `mach configure` then rejected with `UnsortedError`, aborting the build.
- * Ties on the lower-cased key fall back to byte order so the comparison is
- * total and stable.
- */
-export declare function mozbuildSortCompare(a: string, b: string): number;
-/**
- * Inserts a line into an array of lines in alphabetical order within a
- * specified range. The comparison key is extracted from each line.
- *
- * @returns Object with insertIndex and previousEntry
- */
-export declare function findAlphabeticalPosition(lines: string[], startLine: number, endLine: number, newKey: string, extractKey: (line: string) => string | undefined): {
-    insertIndex: number;
-    previousEntry: string | undefined;
-};
-/**
- * Find alphabetical position within a tokenized jar.mn section.
- */
-export declare function findAlphabeticalTokenPosition(tokens: JarMnToken[], sectionTargetPattern: RegExp, newKey: string): {
-    insertIndex: number;
-    previousEntry: string | undefined;
-};
-/**
- * Find alphabetical position within tokenized moz.build list items.
- */
-export declare function findAlphabeticalMozBuildPosition(tokens: MozBuildToken[], newKey: string): {
-    insertIndex: number;
-    previousEntry: string | undefined;
-};

package/dist/src/core/manifest-helpers.js

@@ -1,120 +0,0 @@
-/**
- * Ordering comparator matching mozbuild's `StrictOrderingOnAppendList`
- * (`mozbuild.util.UnsortedError`): entries are compared **case-insensitively**,
- * so `HominisAppearanceController` (`appe`) sorts before
- * `HominisAppMenuIntegration` (`appm`) even though a raw byte comparison
- * places the uppercase `M` (0x4D) before the lowercase `e` (0x65).
- *
- * A naive `a > b` insertion landed the new entry in byte order, which
- * `mach configure` then rejected with `UnsortedError`, aborting the build.
- * Ties on the lower-cased key fall back to byte order so the comparison is
- * total and stable.
- */
-export function mozbuildSortCompare(a, b) {
-    const la = a.toLowerCase();
-    const lb = b.toLowerCase();
-    if (la < lb)
-        return -1;
-    if (la > lb)
-        return 1;
-    if (a < b)
-        return -1;
-    if (a > b)
-        return 1;
-    return 0;
-}
-/**
- * Inserts a line into an array of lines in alphabetical order within a
- * specified range. The comparison key is extracted from each line.
- *
- * @returns Object with insertIndex and previousEntry
- */
-export function findAlphabeticalPosition(lines, startLine, endLine, newKey, extractKey) {
-    // Check if existing entries are actually sorted; if not, append at end
-    const existingKeys = [];
-    for (let i = startLine; i < endLine; i++) {
-        const line = lines[i];
-        if (line === undefined)
-            continue;
-        const key = extractKey(line);
-        if (key !== undefined) {
-            existingKeys.push(key);
-        }
-    }
-    const isSorted = existingKeys.every((k, idx) => idx === 0 || mozbuildSortCompare(k, existingKeys[idx - 1] ?? '') >= 0);
-    if (!isSorted) {
-        return { insertIndex: endLine, previousEntry: undefined };
-    }
-    let insertIndex = endLine;
-    let previousEntry;
-    for (let i = startLine; i < endLine; i++) {
-        const line = lines[i];
-        if (line === undefined)
-            continue;
-        const key = extractKey(line);
-        if (key === undefined)
-            continue;
-        if (mozbuildSortCompare(key, newKey) > 0) {
-            insertIndex = i;
-            break;
-        }
-        insertIndex = i + 1;
-        previousEntry = line.trim();
-    }
-    return { insertIndex, previousEntry };
-}
-/**
- * Find alphabetical position within a tokenized jar.mn section.
- */
-export function findAlphabeticalTokenPosition(tokens, sectionTargetPattern, newKey) {
-    // Find entry tokens in the section matching the pattern
-    const sectionEntries = tokens.filter((t) => t.type === 'entry' && t.parsed && sectionTargetPattern.test(t.parsed.target));
-    let insertLineIndex;
-    let previousEntry;
-    if (sectionEntries.length === 0) {
-        // Empty section: find the section header and insert after it
-        const headerToken = tokens.find((t) => t.type === 'header' || (t.type === 'directive' && sectionTargetPattern.test(t.raw)));
-        if (headerToken) {
-            return { insertIndex: headerToken.lineIndex + 1, previousEntry: undefined };
-        }
-        return { insertIndex: -1, previousEntry: undefined };
-    }
-    // Default: after the last section entry
-    insertLineIndex = (sectionEntries[sectionEntries.length - 1]?.lineIndex ?? 0) + 1;
-    for (const entry of sectionEntries) {
-        if (!entry.parsed)
-            continue;
-        const match = sectionTargetPattern.exec(entry.parsed.target);
-        const key = match?.[1] ?? entry.parsed.target;
-        if (mozbuildSortCompare(key, newKey) > 0) {
-            insertLineIndex = entry.lineIndex;
-            break;
-        }
-        insertLineIndex = entry.lineIndex + 1;
-        previousEntry = entry.raw.trim();
-    }
-    return { insertIndex: insertLineIndex, previousEntry };
-}
-/**
- * Find alphabetical position within tokenized moz.build list items.
- */
-export function findAlphabeticalMozBuildPosition(tokens, newKey) {
-    const items = tokens.filter((t) => t.type === 'list-item');
-    if (items.length === 0) {
-        // Insert after list-open
-        const openToken = tokens.find((t) => t.type === 'list-open');
-        return { insertIndex: (openToken?.lineIndex ?? 0) + 1, previousEntry: undefined };
-    }
-    let insertLineIndex = (items[items.length - 1]?.lineIndex ?? 0) + 1;
-    let previousEntry;
-    for (const item of items) {
-        const key = item.parsed?.value ?? '';
-        if (mozbuildSortCompare(key, newKey) > 0) {
-            insertLineIndex = item.lineIndex;
-            break;
-        }
-        insertLineIndex = item.lineIndex + 1;
-        previousEntry = item.raw.trim();
-    }
-    return { insertIndex: insertLineIndex, previousEntry };
-}