@gitkraken/core-gitlens 0.5.116 → 0.7.0

package/dist/utils/fuzzy.js.map

@@ -1 +1 @@
-{"version":3,"file":"fuzzy.js","sourceRoot":"","sources":["../../src/utils/fuzzy.ts"],"names":[],"mappings":"AA0BA,MAAM,cAAc,GAAgC;IACnD,aAAa,EAAE,KAAK;IACpB,gBAAgB,EAAE,IAAI;IACtB,WAAW,EAAE,GAAG;IAChB,gBAAgB,EAAE,IAAI;CACtB,CAAC;AAEF;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,UAAU,CAAC,OAAe,EAAE,MAAc,EAAE,OAA2B;IACtF,MAAM,IAAI,GAAG,EAAE,GAAG,cAAc,EAAE,GAAG,OAAO,EAAE,CAAC;IAE/C,IAAI,CAAC,OAAO,EAAE,CAAC;QACd,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;IACxD,CAAC;IAED,IAAI,CAAC,MAAM,EAAE,CAAC;QACb,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;IACzD,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,WAAW,EAAE,CAAC;IACxE,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;IAErE,8BAA8B;IAC9B,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC9B,OAAO;YACN,OAAO,EAAE,IAAI;YACb,KAAK,EAAE,CAAC;YACR,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;SAClE,CAAC;IACH,CAAC;IAED,yCAAyC;IACzC,IAAI,SAAS,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QACtC,OAAO;YACN,OAAO,EAAE,IAAI;YACb,KAAK,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC,GAAG,GAAG;YACzD,cAAc,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;SACnE,CAAC;IACH,CAAC;IAED,yBAAyB;IACzB,MAAM,cAAc,GAAa,EAAE,CAAC;IACpC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,kBAAkB,GAAG,CAAC,CAAC;IAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,UAAU,GAAG,UAAU,CAAC,MAAM,IAAI,SAAS,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC;QACvE,IAAI,UAAU,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YACrD,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAE/B,4BAA4B;YAC5B,KAAK,IAAI,CAAC,CAAC;YAEX,gCAAgC;YAChC,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,IAAI,cAAc,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,cAAc,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC1G,kBAAkB,EAAE,CAAC;gBACrB,KAAK,IAAI,IAAI,CAAC,gBAAgB,GAAG,kBAAkB,CAAC;YACrD,CAAC;iBAAM,CAAC;gBACP,kBAAkB,GAAG,CAAC,CAAC;YACxB,CAAC;YAED,iCAAiC;YACjC,IAAI,SAAS,KAAK,UAAU,EAAE,CAAC;gBAC9B,KAAK,IAAI,IAAI,CAAC,WAAW,CAAC;YAC3B,CAAC;YAED,UAAU,EAAE,CAAC;QACd,CAAC;QACD,SAAS,EAAE,CAAC;IACb,CAAC;IAED,+CAA+C;IAC/C,IAAI,UAAU,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;QACpC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE,CAAC;IACzD,CAAC;IAED,yCAAyC;IACzC,MAAM,cAAc,GAAG,SAAS,CAAC,MAAM,GAAG,cAAc,CAAC,MAAM,CAAC;IAChE,KAAK,IAAI,cAAc,GAAG,IAAI,CAAC,gBAAgB,CAAC;IAEhD,+BAA+B;IAC/B,qDAAqD;IACrD,MAAM,QAAQ,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC;IACpF,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC;IAEnE,OAAO;QACN,OAAO,EAAE,IAAI;QACb,KAAK,EAAE,eAAe;QACtB,cAAc,EAAE,cAAc;KAC9B,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,WAAW,CAC1B,OAAe,EACf,KAAU,EACV,OAA4B,EAC5B,OAA2B;IAE3B,IAAI,CAAC,OAAO,EAAE,CAAC;QACd,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzB,IAAI,EAAE,IAAI;YACV,KAAK,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAE,cAAc,EAAE,EAAE,EAAE;SACtD,CAAC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,OAAO,GAAgD,EAAE,CAAC;IAEhE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAEjD,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACnB,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAC;QAC5C,CAAC;IACF,CAAC;IAED,6BAA6B;IAC7B,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAEtD,OAAO,OAAO,CAAC;AAChB,CAAC"}
+{"version":3,"file":"fuzzy.js","names":[],"sources":["../../../utils/src/fuzzy.ts"],"sourcesContent":["/**\n * Result of a fuzzy match operation\n */\nexport interface FuzzyMatchResult {\n\t/** Whether the pattern matches the target */\n\tmatches: boolean;\n\t/** Score of the match (higher is better, 0-1 range) */\n\tscore: number;\n\t/** Indices of matched characters in the target string */\n\tmatchedIndices: number[];\n}\n\n/**\n * Options for fuzzy matching\n */\nexport interface FuzzyMatchOptions {\n\t/** Whether to perform case-sensitive matching (default: false) */\n\tcaseSensitive?: boolean;\n\t/** Bonus for consecutive character matches (default: 0.15) */\n\tconsecutiveBonus?: number;\n\t/** Bonus for matches at the start of the string (default: 0.2) */\n\tprefixBonus?: number;\n\t/** Penalty for each unmatched character (default: 0.05) */\n\tunmatchedPenalty?: number;\n}\n\nconst defaultOptions: Required<FuzzyMatchOptions> = {\n\tcaseSensitive: false,\n\tconsecutiveBonus: 0.15,\n\tprefixBonus: 0.2,\n\tunmatchedPenalty: 0.05,\n};\n\n/**\n * Performs fuzzy matching of a pattern against a target string with scoring.\n *\n * The algorithm:\n * 1. Checks if all characters in the pattern exist in the target (in order)\n * 2. Calculates a score based on:\n *    - Exact prefix matches (highest priority)\n *    - Consecutive character matches\n *    - Position of matches (earlier is better)\n *    - Unmatched characters (penalty)\n *\n * @param pattern The search pattern\n * @param target The string to match against\n * @param options Matching options\n * @returns Match result with score and matched indices\n *\n * @example\n * fuzzyMatch('mes', 'message:') // { matches: true, score: 0.95, matchedIndices: [0, 1, 2] }\n * fuzzyMatch('aut', 'author:')  // { matches: true, score: 0.93, matchedIndices: [0, 1, 2] }\n * fuzzyMatch('msg', 'message:') // { matches: true, score: 0.65, matchedIndices: [0, 2, 3] }\n */\nexport function fuzzyMatch(pattern: string, target: string, options?: FuzzyMatchOptions): FuzzyMatchResult {\n\tconst opts = { ...defaultOptions, ...options };\n\n\tif (!pattern) {\n\t\treturn { matches: true, score: 1, matchedIndices: [] };\n\t}\n\n\tif (!target) {\n\t\treturn { matches: false, score: 0, matchedIndices: [] };\n\t}\n\n\tconst patternStr = opts.caseSensitive ? pattern : pattern.toLowerCase();\n\tconst targetStr = opts.caseSensitive ? target : target.toLowerCase();\n\n\t// Check for exact match first\n\tif (patternStr === targetStr) {\n\t\treturn {\n\t\t\tmatches: true,\n\t\t\tscore: 1,\n\t\t\tmatchedIndices: Array.from({ length: target.length }, (_, i) => i),\n\t\t};\n\t}\n\n\t// Check if pattern is a prefix of target\n\tif (targetStr.startsWith(patternStr)) {\n\t\treturn {\n\t\t\tmatches: true,\n\t\t\tscore: 0.9 + (patternStr.length / targetStr.length) * 0.1,\n\t\t\tmatchedIndices: Array.from({ length: pattern.length }, (_, i) => i),\n\t\t};\n\t}\n\n\t// Perform fuzzy matching\n\tconst matchedIndices: number[] = [];\n\tlet patternIdx = 0;\n\tlet targetIdx = 0;\n\tlet consecutiveMatches = 0;\n\tlet score = 0;\n\n\twhile (patternIdx < patternStr.length && targetIdx < targetStr.length) {\n\t\tif (patternStr[patternIdx] === targetStr[targetIdx]) {\n\t\t\tmatchedIndices.push(targetIdx);\n\n\t\t\t// Base score for each match\n\t\t\tscore += 1;\n\n\t\t\t// Bonus for consecutive matches\n\t\t\tif (matchedIndices.length > 1 && matchedIndices.at(-1) === matchedIndices[matchedIndices.length - 2] + 1) {\n\t\t\t\tconsecutiveMatches++;\n\t\t\t\tscore += opts.consecutiveBonus * consecutiveMatches;\n\t\t\t} else {\n\t\t\t\tconsecutiveMatches = 0;\n\t\t\t}\n\n\t\t\t// Bonus for matches at the start\n\t\t\tif (targetIdx === patternIdx) {\n\t\t\t\tscore += opts.prefixBonus;\n\t\t\t}\n\n\t\t\tpatternIdx++;\n\t\t}\n\t\ttargetIdx++;\n\t}\n\n\t// Check if all pattern characters were matched\n\tif (patternIdx < patternStr.length) {\n\t\treturn { matches: false, score: 0, matchedIndices: [] };\n\t}\n\n\t// Apply penalty for unmatched characters\n\tconst unmatchedCount = targetStr.length - matchedIndices.length;\n\tscore -= unmatchedCount * opts.unmatchedPenalty;\n\n\t// Normalize score to 0-1 range\n\t// Maximum possible score is pattern.length + bonuses\n\tconst maxScore = patternStr.length * (1 + opts.consecutiveBonus + opts.prefixBonus);\n\tconst normalizedScore = Math.max(0, Math.min(1, score / maxScore));\n\n\treturn {\n\t\tmatches: true,\n\t\tscore: normalizedScore,\n\t\tmatchedIndices: matchedIndices,\n\t};\n}\n\n/**\n * Filters and sorts an array of items by fuzzy matching against a pattern.\n *\n * @param pattern The search pattern\n * @param items The items to filter and sort\n * @param getText Function to extract searchable text from each item\n * @param options Matching options\n * @returns Filtered and sorted items with their match results\n *\n * @example\n * const operators = [\n *   { name: 'message:', desc: 'Search messages' },\n *   { name: 'author:', desc: 'Search authors' }\n * ];\n * fuzzyFilter('mes', operators, op => op.name)\n * // Returns [{ item: { name: 'message:', ... }, match: { score: 0.95, ... } }]\n */\nexport function fuzzyFilter<T>(\n\tpattern: string,\n\titems: T[],\n\tgetText: (item: T) => string,\n\toptions?: FuzzyMatchOptions,\n): Array<{ item: T; match: FuzzyMatchResult }> {\n\tif (!pattern) {\n\t\treturn items.map(item => ({\n\t\t\titem: item,\n\t\t\tmatch: { matches: true, score: 1, matchedIndices: [] },\n\t\t}));\n\t}\n\n\tconst results: Array<{ item: T; match: FuzzyMatchResult }> = [];\n\n\tfor (const item of items) {\n\t\tconst text = getText(item);\n\t\tconst match = fuzzyMatch(pattern, text, options);\n\n\t\tif (match.matches) {\n\t\t\tresults.push({ item: item, match: match });\n\t\t}\n\t}\n\n\t// Sort by score (descending)\n\tresults.sort((a, b) => b.match.score - a.match.score);\n\n\treturn results;\n}\n"],"mappings":";AA0BA,MAAM,iBAA8C;CACnD,eAAe;CACf,kBAAkB;CAClB,aAAa;CACb,kBAAkB;AACnB;;;;;;;;;;;;;;;;;;;;;;AAuBA,SAAgB,WAAW,SAAiB,QAAgB,SAA+C;CAC1G,MAAM,OAAO;EAAE,GAAG;EAAgB,GAAG;CAAQ;CAE7C,IAAI,CAAC,SACJ,OAAO;EAAE,SAAS;EAAM,OAAO;EAAG,gBAAgB,CAAC;CAAE;CAGtD,IAAI,CAAC,QACJ,OAAO;EAAE,SAAS;EAAO,OAAO;EAAG,gBAAgB,CAAC;CAAE;CAGvD,MAAM,aAAa,KAAK,gBAAgB,UAAU,QAAQ,YAAY;CACtE,MAAM,YAAY,KAAK,gBAAgB,SAAS,OAAO,YAAY;CAGnE,IAAI,eAAe,WAClB,OAAO;EACN,SAAS;EACT,OAAO;EACP,gBAAgB,MAAM,KAAK,EAAE,QAAQ,OAAO,OAAO,IAAI,GAAG,MAAM,CAAC;CAClE;CAID,IAAI,UAAU,WAAW,UAAU,GAClC,OAAO;EACN,SAAS;EACT,OAAO,KAAO,WAAW,SAAS,UAAU,SAAU;EACtD,gBAAgB,MAAM,KAAK,EAAE,QAAQ,QAAQ,OAAO,IAAI,GAAG,MAAM,CAAC;CACnE;CAID,MAAM,iBAA2B,CAAC;CAClC,IAAI,aAAa;CACjB,IAAI,YAAY;CAChB,IAAI,qBAAqB;CACzB,IAAI,QAAQ;CAEZ,OAAO,aAAa,WAAW,UAAU,YAAY,UAAU,QAAQ;EACtE,IAAI,WAAW,gBAAgB,UAAU,YAAY;GACpD,eAAe,KAAK,SAAS;GAG7B,SAAS;GAGT,IAAI,eAAe,SAAS,KAAK,eAAe,GAAG,EAAE,MAAM,eAAe,eAAe,SAAS,KAAK,GAAG;IACzG;IACA,SAAS,KAAK,mBAAmB;GAClC,OACC,qBAAqB;GAItB,IAAI,cAAc,YACjB,SAAS,KAAK;GAGf;EACD;EACA;CACD;CAGA,IAAI,aAAa,WAAW,QAC3B,OAAO;EAAE,SAAS;EAAO,OAAO;EAAG,gBAAgB,CAAC;CAAE;CAIvD,MAAM,iBAAiB,UAAU,SAAS,eAAe;CACzD,SAAS,iBAAiB,KAAK;CAI/B,MAAM,WAAW,WAAW,UAAU,IAAI,KAAK,mBAAmB,KAAK;CAGvE,OAAO;EACN,SAAS;EACT,OAJuB,KAAK,IAAI,GAAG,KAAK,IAAI,GAAG,QAAQ,QAAQ,CAI1C;EACL;CACjB;AACD;;;;;;;;;;;;;;;;;;AAmBA,SAAgB,YACf,SACA,OACA,SACA,SAC8C;CAC9C,IAAI,CAAC,SACJ,OAAO,MAAM,KAAI,UAAS;EACnB;EACN,OAAO;GAAE,SAAS;GAAM,OAAO;GAAG,gBAAgB,CAAC;EAAE;CACtD,EAAE;CAGH,MAAM,UAAuD,CAAC;CAE9D,KAAK,MAAM,QAAQ,OAAO;EAEzB,MAAM,QAAQ,WAAW,SADZ,QAAQ,IACgB,GAAG,OAAO;EAE/C,IAAI,MAAM,SACT,QAAQ,KAAK;GAAQ;GAAa;EAAM,CAAC;CAE3C;CAGA,QAAQ,MAAM,GAAG,MAAM,EAAE,MAAM,QAAQ,EAAE,MAAM,KAAK;CAEpD,OAAO;AACR"}

package/dist/utils/gitRefs.d.ts

@@ -0,0 +1,11 @@
+//#region ../utils/src/gitRefs.d.ts
+/** Dependency-free git vocabulary shared by `packages/git`, the host, and the renderer kernel
+ *  (`@gitkraken/commit-graph-ui`), which must not depend on `@gitkraken/core-gitlens/git`; it lives here for that reason. */
+/** The branch id format `refRowIndex` and the WIP row's upstream lookup key are keyed on. */
+export declare function getBranchId(repoPath: string, remote: boolean, name: string): string;
+/** Returns the separator between a remote name and its branch name, including `remotes/` refs. */
+export declare function getRemoteNameSlashIndex(name: string): number;
+export declare function getBranchNameWithoutRemote(name: string): string;
+export declare function getRemoteNameFromBranchName(name: string): string;
+//#endregion
+//# sourceMappingURL=gitRefs.d.ts.map

package/dist/utils/gitRefs.js

@@ -0,0 +1,21 @@
+//#region ../utils/src/gitRefs.ts
+/** Dependency-free git vocabulary shared by `packages/git`, the host, and the renderer kernel
+*  (`@gitkraken/commit-graph-ui`), which must not depend on `@gitkraken/core-gitlens/git`; it lives here for that reason. */
+/** The branch id format `refRowIndex` and the WIP row's upstream lookup key are keyed on. */
+function getBranchId(repoPath, remote, name) {
+	return `${repoPath}|${remote ? "remotes/" : "heads/"}${name}`;
+}
+/** Returns the separator between a remote name and its branch name, including `remotes/` refs. */
+function getRemoteNameSlashIndex(name) {
+	return name.startsWith("remotes/") ? name.indexOf("/", 8) : name.indexOf("/");
+}
+function getBranchNameWithoutRemote(name) {
+	return name.substring(getRemoteNameSlashIndex(name) + 1);
+}
+function getRemoteNameFromBranchName(name) {
+	return name.substring(0, getRemoteNameSlashIndex(name));
+}
+//#endregion
+export { getBranchId, getBranchNameWithoutRemote, getRemoteNameFromBranchName, getRemoteNameSlashIndex };
+
+//# sourceMappingURL=gitRefs.js.map

package/dist/utils/gitRefs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"gitRefs.js","names":[],"sources":["../../../utils/src/gitRefs.ts"],"sourcesContent":["/** Dependency-free git vocabulary shared by `packages/git`, the host, and the renderer kernel\n *  (`@gitkraken/commit-graph-ui`), which must not depend on `@gitlens/git`; it lives here for that reason. */\n\n/** The branch id format `refRowIndex` and the WIP row's upstream lookup key are keyed on. */\nexport function getBranchId(repoPath: string, remote: boolean, name: string): string {\n\treturn `${repoPath}|${remote ? 'remotes/' : 'heads/'}${name}`;\n}\n\n/** Returns the separator between a remote name and its branch name, including `remotes/` refs. */\nexport function getRemoteNameSlashIndex(name: string): number {\n\treturn name.startsWith('remotes/') ? name.indexOf('/', 8) : name.indexOf('/');\n}\n\nexport function getBranchNameWithoutRemote(name: string): string {\n\treturn name.substring(getRemoteNameSlashIndex(name) + 1);\n}\n\nexport function getRemoteNameFromBranchName(name: string): string {\n\treturn name.substring(0, getRemoteNameSlashIndex(name));\n}\n"],"mappings":";;;;AAIA,SAAgB,YAAY,UAAkB,QAAiB,MAAsB;CACpF,OAAO,GAAG,SAAS,GAAG,SAAS,aAAa,WAAW;AACxD;;AAGA,SAAgB,wBAAwB,MAAsB;CAC7D,OAAO,KAAK,WAAW,UAAU,IAAI,KAAK,QAAQ,KAAK,CAAC,IAAI,KAAK,QAAQ,GAAG;AAC7E;AAEA,SAAgB,2BAA2B,MAAsB;CAChE,OAAO,KAAK,UAAU,wBAAwB,IAAI,IAAI,CAAC;AACxD;AAEA,SAAgB,4BAA4B,MAAsB;CACjE,OAAO,KAAK,UAAU,GAAG,wBAAwB,IAAI,CAAC;AACvD"}

package/dist/utils/hash.d.ts

@@ -1,3 +1,4 @@
+//#region ../utils/src/hash.d.ts
 /**
  * FNV-1a 32-bit hash — fast, non-cryptographic hash with excellent distribution.
  * Pure integer math, no allocations.
@@ -29,4 +30,5 @@ export declare function fnv1aHash64(str: string): string;
 export declare function microhash(s: undefined, length: number): undefined;
 export declare function microhash(s: string, length?: number): string;
 export declare function microhash(s: string | undefined, length?: number): string | undefined;
+//#endregion
 //# sourceMappingURL=hash.d.ts.map

package/dist/utils/hash.js

@@ -1,53 +1,55 @@
+//#region ../utils/src/hash.ts
 /**
- * FNV-1a 32-bit hash — fast, non-cryptographic hash with excellent distribution.
- * Pure integer math, no allocations.
- */
-export function fnv1aHash(s) {
-    let hash = 0x811c9dc5; // FNV offset basis
-    for (let i = 0; i < s.length; i++) {
-        hash ^= s.charCodeAt(i);
-        hash = Math.imul(hash, 0x01000193); // FNV prime, true 32-bit multiply
-    }
-    return hash;
+* FNV-1a 32-bit hash — fast, non-cryptographic hash with excellent distribution.
+* Pure integer math, no allocations.
+*/
+function fnv1aHash(s) {
+	let hash = 2166136261;
+	for (let i = 0; i < s.length; i++) {
+		hash ^= s.charCodeAt(i);
+		hash = Math.imul(hash, 16777619);
+	}
+	return hash;
 }
 /**
- * FNV-1a 64-bit hash — fast, non-cryptographic hash with excellent distribution.
- * Uses split hi/lo 32-bit integers to avoid BigInt allocation overhead.
- * The 64-bit prime 0x100000001b3 decomposes as (0x100 << 32) + 0x1b3,
- * keeping all intermediate products under 2^41 (safe for JS number math).
- *
- * Why 64-bit instead of 32-bit:
- *
- * The probability of successful token regeneration without a hash collision is
- * P1 ≈ 1 - 2^-32, which is very high.
- * But if the token is updated hourly, then the probability for a user
- * of having a year without consecutive collisions:
- * PY = P1^hours
- * which measn that probability of having at least one collision is:
- * EY = 1 - PY = 2 * 10^-6
- * Which means that 2 users of 1M have a chance to have it.
- *
- * It does not mean that they open an issue, they probably won't even notice.
- * But it might happen with a real person in real life.
- *
- * By using fnv1aHash64 we reduce the chance to 0.
- */
-export function fnv1aHash64(str) {
-    // FNV-1a 64-bit offset basis: 0xcbf29ce484222325
-    let hi = 0xcbf29ce4;
-    let lo = 0x84222325;
-    for (let i = 0; i < str.length; i++) {
-        lo = (lo ^ str.charCodeAt(i)) >>> 0;
-        // Multiply (hi:lo) by prime 0x100000001b3 = (0x100:0x1b3)
-        const loProduct = lo * 0x1b3;
-        const newLo = loProduct >>> 0;
-        const carry = (loProduct - newLo) / 0x100000000;
-        hi = (hi * 0x1b3 + lo * 0x100 + carry) >>> 0;
-        lo = newLo;
-    }
-    return (hi >>> 0).toString(16).padStart(8, '0') + (lo >>> 0).toString(16).padStart(8, '0');
+* FNV-1a 64-bit hash — fast, non-cryptographic hash with excellent distribution.
+* Uses split hi/lo 32-bit integers to avoid BigInt allocation overhead.
+* The 64-bit prime 0x100000001b3 decomposes as (0x100 << 32) + 0x1b3,
+* keeping all intermediate products under 2^41 (safe for JS number math).
+*
+* Why 64-bit instead of 32-bit:
+*
+* The probability of successful token regeneration without a hash collision is
+* P1 ≈ 1 - 2^-32, which is very high.
+* But if the token is updated hourly, then the probability for a user
+* of having a year without consecutive collisions:
+* PY = P1^hours
+* which measn that probability of having at least one collision is:
+* EY = 1 - PY = 2 * 10^-6
+* Which means that 2 users of 1M have a chance to have it.
+*
+* It does not mean that they open an issue, they probably won't even notice.
+* But it might happen with a real person in real life.
+*
+* By using fnv1aHash64 we reduce the chance to 0.
+*/
+function fnv1aHash64(str) {
+	let hi = 3421674724;
+	let lo = 2216829733;
+	for (let i = 0; i < str.length; i++) {
+		lo = (lo ^ str.charCodeAt(i)) >>> 0;
+		const loProduct = lo * 435;
+		const newLo = loProduct >>> 0;
+		const carry = (loProduct - newLo) / 4294967296;
+		hi = hi * 435 + lo * 256 + carry >>> 0;
+		lo = newLo;
+	}
+	return (hi >>> 0).toString(16).padStart(8, "0") + (lo >>> 0).toString(16).padStart(8, "0");
 }
-export function microhash(s, length = 4) {
-    return !s ? undefined : `@${(fnv1aHash(s) >>> 0).toString(16).padStart(8, '0').substring(0, length)}`;
+function microhash(s, length = 4) {
+	return !s ? void 0 : `@${(fnv1aHash(s) >>> 0).toString(16).padStart(8, "0").substring(0, length)}`;
 }
+//#endregion
+export { fnv1aHash, fnv1aHash64, microhash };
+
 //# sourceMappingURL=hash.js.map

package/dist/utils/hash.js.map

@@ -1 +1 @@
-{"version":3,"file":"hash.js","sourceRoot":"","sources":["../../src/utils/hash.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,MAAM,UAAU,SAAS,CAAC,CAAS;IAClC,IAAI,IAAI,GAAG,UAAU,CAAC,CAAC,mBAAmB;IAC1C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACxB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,kCAAkC;IACvE,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,MAAM,UAAU,WAAW,CAAC,GAAW;IACtC,iDAAiD;IACjD,IAAI,EAAE,GAAG,UAAU,CAAC;IACpB,IAAI,EAAE,GAAG,UAAU,CAAC;IAEpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,EAAE,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAEpC,0DAA0D;QAC1D,MAAM,SAAS,GAAG,EAAE,GAAG,KAAK,CAAC;QAC7B,MAAM,KAAK,GAAG,SAAS,KAAK,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,SAAS,GAAG,KAAK,CAAC,GAAG,WAAW,CAAC;QAChD,EAAE,GAAG,CAAC,EAAE,GAAG,KAAK,GAAG,EAAE,GAAG,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;QAC7C,EAAE,GAAG,KAAK,CAAC;IACZ,CAAC;IAED,OAAO,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC5F,CAAC;AAKD,MAAM,UAAU,SAAS,CAAC,CAAqB,EAAE,MAAM,GAAW,CAAC;IAClE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC;AACvG,CAAC"}
+{"version":3,"file":"hash.js","names":[],"sources":["../../../utils/src/hash.ts"],"sourcesContent":["/**\n * FNV-1a 32-bit hash — fast, non-cryptographic hash with excellent distribution.\n * Pure integer math, no allocations.\n */\nexport function fnv1aHash(s: string): number {\n\tlet hash = 0x811c9dc5; // FNV offset basis\n\tfor (let i = 0; i < s.length; i++) {\n\t\thash ^= s.charCodeAt(i);\n\t\thash = Math.imul(hash, 0x01000193); // FNV prime, true 32-bit multiply\n\t}\n\treturn hash;\n}\n\n/**\n * FNV-1a 64-bit hash — fast, non-cryptographic hash with excellent distribution.\n * Uses split hi/lo 32-bit integers to avoid BigInt allocation overhead.\n * The 64-bit prime 0x100000001b3 decomposes as (0x100 << 32) + 0x1b3,\n * keeping all intermediate products under 2^41 (safe for JS number math).\n *\n * Why 64-bit instead of 32-bit:\n *\n * The probability of successful token regeneration without a hash collision is\n * P1 ≈ 1 - 2^-32, which is very high.\n * But if the token is updated hourly, then the probability for a user\n * of having a year without consecutive collisions:\n * PY = P1^hours\n * which measn that probability of having at least one collision is:\n * EY = 1 - PY = 2 * 10^-6\n * Which means that 2 users of 1M have a chance to have it.\n *\n * It does not mean that they open an issue, they probably won't even notice.\n * But it might happen with a real person in real life.\n *\n * By using fnv1aHash64 we reduce the chance to 0.\n */\nexport function fnv1aHash64(str: string): string {\n\t// FNV-1a 64-bit offset basis: 0xcbf29ce484222325\n\tlet hi = 0xcbf29ce4;\n\tlet lo = 0x84222325;\n\n\tfor (let i = 0; i < str.length; i++) {\n\t\tlo = (lo ^ str.charCodeAt(i)) >>> 0;\n\n\t\t// Multiply (hi:lo) by prime 0x100000001b3 = (0x100:0x1b3)\n\t\tconst loProduct = lo * 0x1b3;\n\t\tconst newLo = loProduct >>> 0;\n\t\tconst carry = (loProduct - newLo) / 0x100000000;\n\t\thi = (hi * 0x1b3 + lo * 0x100 + carry) >>> 0;\n\t\tlo = newLo;\n\t}\n\n\treturn (hi >>> 0).toString(16).padStart(8, '0') + (lo >>> 0).toString(16).padStart(8, '0');\n}\n\nexport function microhash(s: undefined, length: number): undefined;\nexport function microhash(s: string, length?: number): string;\nexport function microhash(s: string | undefined, length?: number): string | undefined;\nexport function microhash(s: string | undefined, length: number = 4): string | undefined {\n\treturn !s ? undefined : `@${(fnv1aHash(s) >>> 0).toString(16).padStart(8, '0').substring(0, length)}`;\n}\n"],"mappings":";;;;;AAIA,SAAgB,UAAU,GAAmB;CAC5C,IAAI,OAAO;CACX,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK;EAClC,QAAQ,EAAE,WAAW,CAAC;EACtB,OAAO,KAAK,KAAK,MAAM,QAAU;CAClC;CACA,OAAO;AACR;;;;;;;;;;;;;;;;;;;;;;;AAwBA,SAAgB,YAAY,KAAqB;CAEhD,IAAI,KAAK;CACT,IAAI,KAAK;CAET,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,KAAK;EACpC,MAAM,KAAK,IAAI,WAAW,CAAC,OAAO;EAGlC,MAAM,YAAY,KAAK;EACvB,MAAM,QAAQ,cAAc;EAC5B,MAAM,SAAS,YAAY,SAAS;EACpC,KAAM,KAAK,MAAQ,KAAK,MAAQ,UAAW;EAC3C,KAAK;CACN;CAEA,QAAQ,OAAO,EAAA,CAAG,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG,KAAK,OAAO,EAAA,CAAG,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG;AAC1F;AAKA,SAAgB,UAAU,GAAuB,SAAiB,GAAuB;CACxF,OAAO,CAAC,IAAI,KAAA,IAAY,KAAK,UAAU,CAAC,MAAM,EAAA,CAAG,SAAS,EAAE,CAAC,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,UAAU,GAAG,MAAM;AACnG"}

package/dist/utils/hex.d.ts

@@ -1,2 +1,2 @@
-export { convertToHex, decodeUtf8Hex, encodeUtf8Hex } from '#env/hex.js';
-//# sourceMappingURL=hex.d.ts.map
+import { convertToHex, decodeUtf8Hex, encodeUtf8Hex } from "#env/hex.js";
+export { convertToHex, decodeUtf8Hex, encodeUtf8Hex };

package/dist/utils/hex.js

@@ -1,2 +1,2 @@
-export { convertToHex, decodeUtf8Hex, encodeUtf8Hex } from '#env/hex.js';
-//# sourceMappingURL=hex.js.map
+import { convertToHex, decodeUtf8Hex, encodeUtf8Hex } from "#env/hex.js";
+export { convertToHex, decodeUtf8Hex, encodeUtf8Hex };

package/dist/utils/hostingServiceType.d.ts

@@ -0,0 +1,8 @@
+//#region ../utils/src/hostingServiceType.d.ts
+/** Dependency-free git-hosting vocabulary shared by `packages/git`, the host, and the renderer kernel
+ *  (`@gitkraken/commit-graph-ui`); lives here because none of them may depend on `@gitkraken/core-gitlens/git`. */
+/** Mirrors `GkProviderId`'s members (this package can't import `@gitkraken/core-gitlens/git`); drift fails the build
+ *  there via a type assertion in `models/repositoryIdentities.ts`. */
+export type HostingServiceType = 'github' | 'githubEnterprise' | 'gitlab' | 'gitlabSelfHosted' | 'bitbucket' | 'bitbucketServer' | 'azureDevops';
+//#endregion
+//# sourceMappingURL=hostingServiceType.d.ts.map

package/dist/utils/hrtime.d.ts

@@ -1,4 +1,6 @@
-import { hrtime } from '#env/hrtime.js';
-export { hrtime };
+import { hrtime } from "#env/hrtime.js";
+//#region ../utils/src/hrtime.d.ts
 export declare function getDurationMilliseconds(start: [number, number]): number;
+//#endregion
+export { hrtime };
 //# sourceMappingURL=hrtime.d.ts.map

package/dist/utils/hrtime.js

@@ -1,7 +1,10 @@
-import { hrtime } from '#env/hrtime.js';
-export { hrtime };
-export function getDurationMilliseconds(start) {
-    const [secs, nanosecs] = hrtime(start);
-    return secs * 1000 + Math.floor(nanosecs / 1000000);
+import { hrtime } from "#env/hrtime.js";
+//#region ../utils/src/hrtime.ts
+function getDurationMilliseconds(start) {
+	const [secs, nanosecs] = hrtime(start);
+	return secs * 1e3 + Math.floor(nanosecs / 1e6);
 }
+//#endregion
+export { getDurationMilliseconds, hrtime };
+
 //# sourceMappingURL=hrtime.js.map

package/dist/utils/hrtime.js.map

@@ -1 +1 @@
-{"version":3,"file":"hrtime.js","sourceRoot":"","sources":["../../src/utils/hrtime.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,gBAAgB,CAAC;AAExC,OAAO,EAAE,MAAM,EAAE,CAAC;AAElB,MAAM,UAAU,uBAAuB,CAAC,KAAuB;IAC9D,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;IACvC,OAAO,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,OAAO,CAAC,CAAC;AACrD,CAAC"}
+{"version":3,"file":"hrtime.js","names":[],"sources":["../../../utils/src/hrtime.ts"],"sourcesContent":["import { hrtime } from '#env/hrtime.js';\n\nexport { hrtime };\n\nexport function getDurationMilliseconds(start: [number, number]): number {\n\tconst [secs, nanosecs] = hrtime(start);\n\treturn secs * 1000 + Math.floor(nanosecs / 1000000);\n}\n"],"mappings":";;AAIA,SAAgB,wBAAwB,OAAiC;CACxE,MAAM,CAAC,MAAM,YAAY,OAAO,KAAK;CACrC,OAAO,OAAO,MAAO,KAAK,MAAM,WAAW,GAAO;AACnD"}

package/dist/utils/iterable.d.ts

@@ -1,3 +1,4 @@
+//#region ../utils/src/iterable.d.ts
 export declare function chunk<T>(source: T[], size: number): Iterable<T[]>;
 /**
  * Chunks strings so each chunk's total serialized length stays within `maxLength`.
@@ -23,7 +24,7 @@ export declare function flatMap<T, TMapped>(source: Iterable<T> | IterableIterat
 export declare function flatten<T>(source: Iterable<Iterable<T>> | IterableIterator<IterableIterator<T>>): IterableIterator<T>;
 export declare function groupBy<T, K extends PropertyKey>(source: Iterable<T> | IterableIterator<T>, getGroupingKey: (item: T) => K): Record<string, T[]>;
 export declare function groupByMap<TKey, TValue>(source: Iterable<TValue> | IterableIterator<TValue>, getGroupingKey: (item: TValue) => TKey, options?: {
-    filterNullGroups?: boolean;
+  filterNullGroups?: boolean;
 }): Map<TKey, TValue[]>;
 export declare function groupByFilterMap<TKey, TValue, TMapped>(source: Iterable<TValue> | IterableIterator<TValue>, getGroupingKey: (item: TValue) => TKey, predicateMapper: (item: TValue) => TMapped | null | undefined): Map<TKey, TMapped[]>;
 export declare function has<T>(source: Iterable<T> | IterableIterator<T>, item: T): boolean;
@@ -68,4 +69,5 @@ export declare function uniqueBy<TKey, TValue>(source: Iterable<TValue> | Iterab
  * ```
  */
 export declare function getAsyncGeneratorReturnValue<TYield, TReturn>(generator: AsyncGenerator<TYield, TReturn, void>, onProgress?: (value: TYield) => void | Promise<void>): Promise<TReturn | undefined>;
+//#endregion
 //# sourceMappingURL=iterable.d.ts.map