gitea/legado
gitea/legado
1
1
Fork 0
mirror of https://github.com/gedoor/legado.git synced 2024-07-06 23:47:49 +08:00
Code Issues 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
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
app/src/main/java/io/legado/app/help/JsExtensions.kt
View File

@ -496,14 +496,14 @@ interface JsExtensions {
correctQueryTTF: QueryTTF?
): String {
if (errorQueryTTF == null || correctQueryTTF == null) return text
val contentArray = text.toCharArray()
val contentArray = text.toStringArray()
contentArray.forEachIndexed { index, s ->
val oldCode = s.code
if (errorQueryTTF.inLimit(s)) {
val oldCode = s.codePointAt(0)
if (errorQueryTTF.inLimit(oldCode)) {
val glyf = errorQueryTTF.getGlyfByCode(oldCode)
val code = correctQueryTTF.getCodeByGlyf(glyf)
if (code != 0) {
contentArray[index] = code.toChar()
contentArray[index] = code.toChar().toString()
}
}
}

4
app/src/main/java/io/legado/app/model/analyzeRule/QueryTTF.java
View File

@ -479,6 +479,8 @@ public class QueryTTF {
for (short b : glyf.get(gid).yCoordinates) sb.append(b);
String val = sb.toString();
if (limitMix == 0) limitMix = key;
if (limitMix > key) limitMix = key;
if (limitMax < key) limitMax = key;
limitMax = key;
codeToGlyph.put(key, val);
if (glyphToCode.containsKey(val)) continue;
@ -576,7 +578,7 @@ public class QueryTTF {
* @param code 传入Unicode十进制值
* @return 返回bool查询结果
*/
public boolean inLimit(char code) {
public boolean inLimit(int code) {
return (limitMix <= code) && (code < limitMax);
}