YanLongChangAn/legado
1
0
Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

优化

Browse Source
This commit is contained in:
kunfei
2022-01-27 22:43:09 +08:00
parent c2fa51ede7
commit 53b18e18e3
2 changed files with 7 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files
app/src/main/java/io/legado/app/help/JsExtensions.kt
+4 -4
View File
@@ -496,14 +496,14 @@ interface JsExtensions {
correctQueryTTF: QueryTTF? correctQueryTTF: QueryTTF?
): String { ): String {
if (errorQueryTTF == null || correctQueryTTF == null) return text if (errorQueryTTF == null || correctQueryTTF == null) return text
val contentArray = text.toCharArray() val contentArray = text.toStringArray()
contentArray.forEachIndexed { index, s -> contentArray.forEachIndexed { index, s ->
val oldCode = s.code val oldCode = s.codePointAt(0)
if (errorQueryTTF.inLimit(s)) { if (errorQueryTTF.inLimit(oldCode)) {
val glyf = errorQueryTTF.getGlyfByCode(oldCode) val glyf = errorQueryTTF.getGlyfByCode(oldCode)
val code = correctQueryTTF.getCodeByGlyf(glyf) val code = correctQueryTTF.getCodeByGlyf(glyf)
if (code != 0) { if (code != 0) {
contentArray[index] = code.toChar() contentArray[index] = code.toChar().toString()
} }
} }
} }
app/src/main/java/io/legado/app/model/analyzeRule/QueryTTF.java
+3 -1
View File
@@ -479,6 +479,8 @@ public class QueryTTF {
for (short b : glyf.get(gid).yCoordinates) sb.append(b); for (short b : glyf.get(gid).yCoordinates) sb.append(b);
String val = sb.toString(); String val = sb.toString();
if (limitMix == 0) limitMix = key; if (limitMix == 0) limitMix = key;
if (limitMix > key) limitMix = key;
if (limitMax < key) limitMax = key;
limitMax = key; limitMax = key;
codeToGlyph.put(key, val); codeToGlyph.put(key, val);
if (glyphToCode.containsKey(val)) continue; if (glyphToCode.containsKey(val)) continue;
@@ -576,7 +578,7 @@ public class QueryTTF {
* @param code 传入Unicode十进制值 * @param code 传入Unicode十进制值
* @return 返回bool查询结果 * @return 返回bool查询结果
*/ */
public boolean inLimit(char code) { public boolean inLimit(int code) {
return (limitMix <= code) && (code < limitMax); return (limitMix <= code) && (code < limitMax);
} }