erabo/spiegel-keyman
1
0
Fork 0
mirror of https://github.com/keymanapp/keyman.git synced 2026-08-31 20:57:41 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 15

refactor(web): relocate getMergeSplitParent

Browse source
This commit is contained in:
Joshua Horton 2025-09-04 13:00:28 -05:00
parent 8ca4b8b3cd
commit 36cee82da8
1 changed files with 50 additions and 46 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

96
web/src/engine/predictive-text/worker-thread/src/main/correction/segmentable-calculation.ts
View file

@ -29,50 +29,6 @@ export class SegmentableDistanceCalculation extends ClassicalDistanceCalculation
super(other);
}
private static getMergeSplitParent(
buffer: SegmentableDistanceCalculation,
r: number,
c: number
): [number, number] {
const mergeTarget = buffer.matchSequence[c];
const splitTarget = buffer.inputSequence[r];
// Block any operations where the initial tokens are identical.
// Other operations will be cheaper. Also, block cases where 'parents' are impossible.
if(r < 0 || c < 0 || splitTarget == mergeTarget) {
return [-1, -1];
}
// Merge checks
let mergedInputs = '';
let lastMergeIndex = -1;
for(let i = r; i >= 0; i--) {
mergedInputs = buffer.inputSequence[i] + mergedInputs;
if(mergedInputs == mergeTarget) {
lastMergeIndex = i;
break;
} else if(mergedInputs.length > mergeTarget.length) {
break;
}
}
// Split checks
let mergedMatches = '';
let lastSplitIndex = -1;
for(let i = c; i >= 0; i--) {
mergedMatches = buffer.matchSequence[i] + mergedMatches;
if(mergedMatches == splitTarget) {
lastSplitIndex = i;
break;
} else if(mergedMatches.length > splitTarget.length) {
break;
}
}
return [lastMergeIndex, lastSplitIndex];
}
private static selectInitialCostAt(
buffer: SegmentableDistanceCalculation,
r: number,
@ -82,7 +38,7 @@ export class SegmentableDistanceCalculation extends ClassicalDistanceCalculation
let mergeCost = Number.MAX_VALUE;
let splitCost = Number.MAX_VALUE;
const [lastMergeIndex, lastSplitIndex] = SegmentableDistanceCalculation.getMergeSplitParent(buffer, r, c);
const [lastMergeIndex, lastSplitIndex] = getMergeSplitParent(buffer, r, c);
mergeCost = lastMergeIndex == -1 ? mergeCost : (buffer.getCostAt(lastMergeIndex-1, c-1) + 1);
splitCost = lastSplitIndex == -1 ? splitCost : (buffer.getCostAt(r-1, lastSplitIndex-1) + 1);
@ -127,8 +83,56 @@ export class SegmentableDistanceCalculation extends ClassicalDistanceCalculation
return returnBuffer;
}
// TODO: diagonal expansion
public increaseMaxDistance(): ClassicalDistanceCalculation<string> {
// TODO: diagonal expansion
// But it's not particularly needed for our use cases.
throw new Error("Not yet supported for this edit-distance calculation type.");
}
// TODO: edit path with 'split', 'merge' handling // progress: infrastructure is likely prepped?
// TODO: visualization
}
function getMergeSplitParent (
buffer: ClassicalDistanceCalculation<string>,
r: number,
c: number
): [number, number] {
const mergeTarget = buffer.matchSequence[c];
const splitTarget = buffer.inputSequence[r];
// Block any operations where the initial tokens are identical.
// Other operations will be cheaper. Also, block cases where 'parents' are impossible.
if(r < 0 || c < 0 || splitTarget == mergeTarget) {
return [-1, -1];
}
// Merge checks
let mergedInputs = '';
let lastMergeIndex = -1;
for(let i = r; i >= 0; i--) {
mergedInputs = buffer.inputSequence[i] + mergedInputs;
if(mergedInputs == mergeTarget) {
lastMergeIndex = i;
break;
} else if(mergedInputs.length > mergeTarget.length) {
break;
}
}
// Split checks
let mergedMatches = '';
let lastSplitIndex = -1;
for(let i = c; i >= 0; i--) {
mergedMatches = buffer.matchSequence[i] + mergedMatches;
if(mergedMatches == splitTarget) {
lastSplitIndex = i;
break;
} else if(mergedMatches.length > splitTarget.length) {
break;
}
}
return [lastMergeIndex, lastSplitIndex];
}