Files
AzooKeyKanaKanjiConverter/Sources/KanaKanjiConverterModule/ConversionAlgorithms/Core/SuffixDeletionProcessing.swift
2025-07-03 22:55:30 +09:00

61 lines
2.2 KiB
Swift
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

//
// afterLastCharacterDeleted.swift
// Keyboard
//
// Created by ensan on 2020/09/14.
// Copyright © 2020 ensan. All rights reserved.
//
import Foundation
import SwiftUtils
extension Kana2Kanji {
/// ,
/// - Parameters:
/// - deletedCount:
/// - N_best: N_best
/// - previousResult:
/// - Returns:
///
///
/// ###
/// (1)resultregister
/// N_best
///
/// (2)filter
func kana2lattice_deletedLast(deletedCount: Int, N_best: Int, previousResult: (inputData: ComposingText, nodes: Nodes)) -> (result: LatticeNode, nodes: Nodes) {
debug("削除の連続性を利用した変換、元の文字は:", previousResult.inputData.convertTarget)
let count = previousResult.inputData.input.count - deletedCount
// (1)
let result = LatticeNode.EOSNode
for nodeArray in previousResult.nodes {
for node in nodeArray {
if node.prevs.isEmpty {
continue
}
if self.dicdataStore.shouldBeRemoved(data: node.data) {
continue
}
let nextIndex = node.inputRange.endIndex
if nextIndex == count {
//
for (index, value) in node.values.enumerated() {
let newnode = node.getRegisteredNode(index, value: value)
result.prevs.append(newnode)
}
}
}
}
// (2)
let updatedNodes = previousResult.nodes.prefix(count).map {(nodeArray: [LatticeNode]) in
nodeArray.filter {$0.inputRange.endIndex <= count}
}
return (result: result, nodes: updatedNodes)
}
}