Merge pull request #1097 from bushixuanqi/master
新增专用规则切分类，用于解决原来各种可能的切分错误。默认规则新增类jsonPath的索引选择写法，支持单索引与区间混合，支持负数，支持[!index…]排除写法。pull/1101/head
kunfei
3 years ago
committed by
GitHub
commit
610b4ac536
@ -0,0 +1,515 @@ |
||||
package io.legado.app.model.analyzeRule |
||||
|
||||
//通用的规则切分处理 |
||||
|
||||
class RuleAnalyzer(data: String) { |
||||
|
||||
private var queue: String = data //被处理字符串 |
||||
private var pos = 0 //处理到的位置 |
||||
|
||||
private var start = 0 //每次处理字段的开始 |
||||
private var end:Int = queue.length //每次处理字段的终点 |
||||
private var step:Int = 0 //分割字符的长度 |
||||
|
||||
var elementsType = "" |
||||
|
||||
//当前平衡字段 |
||||
fun currBalancedString( stepStart:Int = 1 , stepEnd:Int = 1): String { //stepStart平衡字符的起始分隔字串长度，stepEnd平衡字符的结束分隔字串长度 |
||||
return queue.substring(start+stepStart,pos-stepEnd) //当前平衡字段 |
||||
} |
||||
|
||||
//将pos重置为0，方便复用 |
||||
fun reSetPos() { |
||||
pos = 0 |
||||
} |
||||
|
||||
//当前拉取字段 |
||||
fun currString(): String { |
||||
return queue.substring(start,pos) //当前拉取到的字段 |
||||
} |
||||
|
||||
//剩余字串 |
||||
fun remainingString(): String { |
||||
start = pos |
||||
pos = queue.length |
||||
return queue.substring(start) |
||||
} |
||||
|
||||
/** |
||||
* pos位置回退 |
||||
*/ |
||||
fun back(num :Int = 0) { |
||||
if(num == 0)pos = start //回退 |
||||
else pos -= num |
||||
} |
||||
|
||||
/** |
||||
* pos位置后移 |
||||
*/ |
||||
fun advance(num :Int = 1) { |
||||
pos+=num |
||||
} |
||||
|
||||
/** |
||||
* 是否已无剩余字符? |
||||
* @return 若剩余字串中已无字符则返回true |
||||
*/ |
||||
val isEmpty: Boolean |
||||
get() = queue.length - pos == 0 //是否处理到最后 |
||||
|
||||
/** |
||||
* 检索并返回首字符,但pos不变 |
||||
* @return 首字符：若为空则为 0 号字符 |
||||
*/ |
||||
fun peek(): Char { //检索首字符 |
||||
return if (isEmpty) 0.toChar() else queue[pos] |
||||
} |
||||
|
||||
/** |
||||
* 消耗剩余字串中一个字符。 |
||||
* @return 返回剩余字串中的下个字符。 |
||||
*/ |
||||
fun consume(): Char { |
||||
return queue[pos++] |
||||
} |
||||
|
||||
/** |
||||
* 字串与剩余字串是否匹配，不区分大小写 |
||||
* @param seq 字符串被检查 |
||||
* @return 若下字符串匹配返回 true |
||||
*/ |
||||
fun matches(seq: String): Boolean { |
||||
return queue.regionMatches(pos, seq, 0, seq.length, ignoreCase = true) |
||||
} |
||||
|
||||
/** |
||||
* 测试下个字符是否与序列中相应位置的字符相等。 |
||||
* @param seq ：被检查的字符列表 |
||||
* @return 相等就为 true ，不相等则为 false |
||||
*/ |
||||
fun matchesAny(vararg seq: Char): Boolean { |
||||
if (isEmpty) return false |
||||
for (c in seq) { |
||||
if (queue[pos] == c) { |
||||
return true |
||||
} |
||||
} |
||||
return false |
||||
} |
||||
|
||||
/** |
||||
* 测试下个字符（串）是否与参数列表里的序列存在匹配。 不区分大小写。 |
||||
* @param seq ：被不区分大小写检查的字符串列表 |
||||
* @return 只要匹配就为 true ，没有匹配则为 false |
||||
*/ |
||||
fun matchesAny(vararg seq: String): Boolean { |
||||
for (s in seq) { |
||||
if (matches(s)) { |
||||
step = s.length |
||||
return true |
||||
} |
||||
} |
||||
return false |
||||
} |
||||
|
||||
/** |
||||
* 从剩余字串中拉出一个字符串，直到但不包括匹配序列，或剩余字串用完。 |
||||
* @param seq ：分隔字符 **区分大小写** |
||||
* @return 是否找到相应字段。 |
||||
*/ |
||||
fun consumeTo(seq: String,setStartPos:Boolean = true): Boolean { |
||||
if(setStartPos)start = pos //将处理到的位置设置为规则起点 |
||||
val offset = queue.indexOf(seq, pos) |
||||
return if (offset != -1) { |
||||
pos = offset |
||||
true |
||||
} else false |
||||
} |
||||
|
||||
/** |
||||
* 从剩余字串中拉出一个字符串，直到但不包括匹配序列（匹配参数列表中一项即为匹配），或剩余字串用完。 |
||||
* @param f 消费函数，返回true表示消费，fasle表示不消费 |
||||
* @param setStartPos 设置开始消费位置 |
||||
* @return 消耗的字符串 |
||||
*/ |
||||
fun consumeToAny(setStartPos:Boolean = true, f:()->Boolean,): Boolean { |
||||
if(setStartPos)start = pos //将处理到的位置设置为规则起点 |
||||
while (!isEmpty && !f()) { |
||||
pos++ |
||||
} |
||||
return !isEmpty |
||||
} |
||||
|
||||
//其中js只要符合语法，就不用避开任何阅读关键字，自由发挥 |
||||
fun chompJsBalanced(f: ((Char) -> Boolean?) = { |
||||
if ( it == '{' )true //开始嵌套一层 |
||||
else if ( it == '}') false //闭合一层嵌套 |
||||
else null |
||||
} ): Boolean { |
||||
start = pos |
||||
var depth = 0 //嵌套深度 |
||||
var bracketsDepth = 0 //[]嵌套深度 |
||||
|
||||
var inSingleQuote = false //单引号 |
||||
var inDoubleQuote = false //双引号 |
||||
var inOtherQuote = false //js原始字串分隔字符 |
||||
var regex = false //正则 |
||||
var commit = false //单行注释 |
||||
var commits = false //多行注释 |
||||
|
||||
do { |
||||
if (isEmpty) break |
||||
var c = consume() |
||||
if (c != '\\') { //非转义字符 |
||||
if (c == '\'' && !commits && !commit && !regex && !inDoubleQuote && !inOtherQuote) inSingleQuote = !inSingleQuote //匹配具有语法功能的单引号 |
||||
else if (c == '"' && !commits && !commit && !regex && !inSingleQuote && !inOtherQuote) inDoubleQuote = !inDoubleQuote //匹配具有语法功能的双引号 |
||||
else if (c == '`' && !commits && !commit && !regex && !inSingleQuote && !inDoubleQuote) inOtherQuote = !inOtherQuote //匹配具有语法功能的'`' |
||||
else if (c == '/' && !commits && !commit && !regex && !inSingleQuote && !inDoubleQuote && !inOtherQuote) { //匹配注释或正则起点 |
||||
c = consume() |
||||
when(c){ |
||||
'/'->commit=true //匹配单行注释起点 |
||||
'*'->commits=true //匹配多行注释起点 |
||||
else ->regex=true //匹配正则起点 |
||||
} |
||||
} |
||||
else if(commits && c == '*') { //匹配多行注释终点 |
||||
c = consume() |
||||
if(c == '/')commits = false |
||||
} |
||||
else if(regex && c == '/') { //正则的终点或[]平衡 |
||||
|
||||
if(c == '/')regex = false//匹配正则终点 |
||||
|
||||
//为了保证当open为（ 且 close 为 ）时，正则中[(]或[)]的合法性。故对[]这对在任何规则中都平衡的成对符号做匹配。 |
||||
// 注：正则里[(]、[)]、[{]、[}]都是合法的，所以只有[]必须平衡。 |
||||
|
||||
else if ( c == '[' )bracketsDepth++ //开始嵌套一层[] |
||||
else if ( c== ']') bracketsDepth-- //闭合一层嵌套[] |
||||
|
||||
} |
||||
|
||||
if (commits || commit || regex || inSingleQuote || inDoubleQuote || inOtherQuote) continue //语法单元未匹配结束，直接进入下个循环 |
||||
|
||||
val fn = f(c) |
||||
if (fn == null) continue |
||||
if (fn) depth++ else depth-- //嵌套或者闭合 |
||||
|
||||
}else { //转义字符 |
||||
var next = consume() //拉出被转义字符 |
||||
if(commit && next == 'n') commit = false //匹配单行注释终点。当前为\,下个为n，表示换行 |
||||
else if (!commits && !commit && next == '\\') { |
||||
consume() //当前为\,下个为\，双重转义中"\\"表示转义字符本身，根据if条件"\\"字串不在注释中，则只能在字串或正则中 |
||||
next = consume() //拉出下个字符，因为在双重转义的字串或正则中，类似于 \\/ 这样的结构才是转义结构 |
||||
if(next == '\\')consume() //若为转义字符则继续拉出，因为双重转义中转义字符成对存在,即 \\\\ |
||||
} |
||||
} |
||||
} while (depth > 0 || bracketsDepth >0) //拉出全部符合js语法的字段 |
||||
|
||||
if(depth > 0 || bracketsDepth >0) start = pos |
||||
|
||||
return pos > start |
||||
} |
||||
|
||||
/** |
||||
* 在双重转义字串中拉出一个规则平衡组 |
||||
*/ |
||||
fun chompRuleBalanced(open: Char = '[', close: Char = ']',f: ((Char) ->Boolean?)? = null ): Boolean { |
||||
start = pos |
||||
var depth = 0 //嵌套深度 |
||||
var otherDepth = 0 //其他对称符合嵌套深度 |
||||
|
||||
var inSingleQuote = false //单引号 |
||||
var inDoubleQuote = false //双引号 |
||||
|
||||
do { |
||||
if (isEmpty) break |
||||
val c = consume() |
||||
if (c != ESC) { //非转义字符 |
||||
if (c == '\'' && !inDoubleQuote) inSingleQuote = !inSingleQuote //匹配具有语法功能的单引号 |
||||
else if (c == '"' && !inSingleQuote) inDoubleQuote = !inDoubleQuote //匹配具有语法功能的双引号 |
||||
|
||||
if (inSingleQuote || inDoubleQuote) continue //语法单元未匹配结束，直接进入下个循环 |
||||
|
||||
if ( c == open )depth++ //开始嵌套一层 |
||||
else if ( c== close) depth-- //闭合一层嵌套 |
||||
else if(depth == 0 && f != null) { //处于默认嵌套中的非默认字符不需要平衡，仅depth为0时默认嵌套全部闭合，此字符才进行嵌套 |
||||
val fn = f(c) |
||||
if (fn == null) continue |
||||
if (fn) otherDepth++ else otherDepth-- |
||||
} |
||||
|
||||
}else { //转义字符 |
||||
var next = consume() //拉出被转义字符，匹配\/、\"、\'等 |
||||
if (next == ESC) { |
||||
consume() //当前为\,下个为\，双重转义中"\\"表示转义字符本身，根据语法特征当前字段在字串或正则中 |
||||
next = consume() //拉出下个字符，因为在双重转义的字串或正则中，类似于 \\/ 这样的结构才是转义结构 |
||||
if(next == ESC)consume() //若为转义字符则继续拉出，因为双重转义中转义字符成对存在,即 \\\\ |
||||
} |
||||
} |
||||
} while (depth > 0 || otherDepth > 0) //拉出一个平衡字串 |
||||
|
||||
return !(depth > 0 || otherDepth > 0) //平衡返回false，不平衡返回true |
||||
} |
||||
|
||||
/** |
||||
* 不用正则,不到最后不切片也不用中间变量存储,只在序列中标记当前查找字段的开头结尾,到返回时才切片,高效快速准确切割规则 |
||||
* 解决jsonPath自带的"&&"和"||"与阅读的规则冲突,以及规则正则或字符串中包含"&&"或"||"或"%%"而导致的冲突 |
||||
*/ |
||||
tailrec fun splitRule(vararg split: String): Array<String>{ //首段匹配,elementsType为空 |
||||
|
||||
if (!consumeToAny { matchesAny(* split) }) return arrayOf(queue) //未找到分隔符 |
||||
|
||||
end = pos |
||||
val st = if( consumeToAny(false){ matchesAny( '(','[' ) } )pos else -1 //查找筛选器 |
||||
pos = end |
||||
|
||||
if(st == -1) { |
||||
|
||||
var rule = arrayOf(queue.substring(0, pos)) //压入分隔的首段规则到数组 |
||||
|
||||
pos += step //跳过分隔符 |
||||
elementsType = queue.substring(pos - step, pos) //设置组合类型 |
||||
|
||||
while (consumeToAny { matchesAny(* split) }) { //循环切分规则压入数组 |
||||
rule += queue.substring(start, pos) |
||||
pos += step //跳过分隔符 |
||||
} |
||||
rule+= queue.substring(start) //将剩余字段压入数组末尾 |
||||
return rule |
||||
} |
||||
|
||||
val rule = if(st >pos ){ //先匹配到st1pos，表明"&&","||"不在选择器中，将选择器前"&&","||"分隔的字段依次压入数组 |
||||
|
||||
var rule = arrayOf(queue.substring(0, pos)) //压入分隔的首段规则到数组 |
||||
|
||||
pos += step //跳过分隔符 |
||||
elementsType = queue.substring(pos - step, pos) //设置组合类型 |
||||
|
||||
while (pos < st && consumeToAny { matchesAny( * split ) }) { |
||||
rule += queue.substring(start, pos) //循环切分规则压入数组 |
||||
pos += step //跳过分隔符 |
||||
} |
||||
rule |
||||
}else null |
||||
|
||||
pos = st //位置推移到筛选器处 |
||||
val next = if(queue[pos] == '[' ) ']' else ')' //平衡组末尾字符 |
||||
|
||||
return if (rule == null) { //rule为空,首段未匹配完成 |
||||
|
||||
if(!chompRuleBalanced(queue[pos],next)) throw Error(queue.substring(0, start)+"后未平衡") //拉出一个筛选器,不平衡则报错 |
||||
splitRule(* split) //递归调用首段匹配 |
||||
|
||||
} else { |
||||
|
||||
val start0 = start //记录当前规则开头位置 |
||||
if(!chompRuleBalanced(queue[pos],next)) throw Error(queue.substring(0, start)+"后未平衡") //拉出一个筛选器,不平衡则报错 |
||||
start = start0 //筛选器的开头不是本段规则开头,故恢复开头设置 |
||||
splitRule(rule) //首段已匹配,但当前段匹配未完成,调用二段匹配 |
||||
|
||||
} |
||||
|
||||
} |
||||
|
||||
@JvmName("splitRuleNext") |
||||
private tailrec fun splitRule(rules:Array<String>): Array<String>{ //二段匹配被调用,elementsType非空(已在首段赋值),直接按elementsType查找,比首段采用的方式更快 |
||||
|
||||
if (!consumeTo(elementsType,false)) return rules + queue.substring(start) //此处consumeTo(...)开始位置不是规则的开始位置,start沿用上次设置 |
||||
|
||||
end = pos |
||||
val st = if( consumeToAny(false){ matchesAny( '(','[' ) } )pos else -1 //查找筛选器 |
||||
pos = end |
||||
|
||||
if(st == -1) { |
||||
var rule = rules + queue.substring(start, pos) //压入本次分隔的首段规则到数组 |
||||
pos += step //跳过分隔符 |
||||
while (consumeTo(elementsType)) { //循环切分规则压入数组 |
||||
rule += queue.substring(start, pos) |
||||
pos += step //跳过分隔符 |
||||
} |
||||
rule += queue.substring(start) //将剩余字段压入数组末尾 |
||||
return rule |
||||
} |
||||
|
||||
val rule = if(st > pos ){//先匹配到st1pos，表明"&&","||"不在选择器中，将选择器前"&&","||"分隔的字段依次压入数组 |
||||
var rule = rules + queue.substring(start, pos) //压入本次分隔的首段规则到数组 |
||||
pos += step //跳过分隔符 |
||||
while (pos < st && consumeTo(elementsType)) { //循环切分规则压入数组 |
||||
rule += queue.substring(start, pos) |
||||
pos += step //跳过分隔符 |
||||
} |
||||
rule |
||||
}else rules |
||||
|
||||
pos = st //位置推移到筛选器处 |
||||
val next = if(queue[pos] == '[' ) ']' else ')' //平衡组末尾字符 |
||||
|
||||
val start0 = start //记录当前规则开头位置 |
||||
if(!chompRuleBalanced(queue[pos],next)) throw Error(queue.substring(0, start)+"后未平衡") //拉出一个筛选器,不平衡时返回true,表示未平衡 |
||||
start = start0 //筛选器平衡,但筛选器的开头不是当前规则开头,故恢复开头设置 |
||||
|
||||
return splitRule(rule) //递归匹配 |
||||
|
||||
} |
||||
|
||||
|
||||
/** |
||||
* 替换内嵌规则 |
||||
* @param inner 起始标志,如{$. 或 {{ |
||||
* @param startStep 不属于规则部分的前置字符长度，如{$.中{不属于规则的组成部分，故startStep为1 |
||||
* @param endStep 不属于规则部分的后置字符长度，如}}长度为2 |
||||
* @param fr 查找到内嵌规则时，用于解析的函数 |
||||
* |
||||
* */ |
||||
fun innerRule( inner:String,startStep:Int = 1,endStep:Int = 1,fr:(String)->String?): String { |
||||
|
||||
val start0 = pos //规则匹配前起点 |
||||
|
||||
val st = StringBuilder() |
||||
|
||||
while (!isEmpty && consumeTo(inner)) { //拉取成功返回true，ruleAnalyzes里的字符序列索引变量pos后移相应位置，否则返回false,且isEmpty为true |
||||
|
||||
val start1 = start //记录拉取前起点 |
||||
|
||||
if (chompRuleBalanced {//拉出一个以[]为默认嵌套、以{}为补充嵌套的平衡字段 |
||||
when (it) { |
||||
'{' -> true |
||||
'}' -> false |
||||
else -> null |
||||
} |
||||
}) { |
||||
val frv= fr(currBalancedString(startStep,endStep)) |
||||
if(frv != null) { |
||||
|
||||
st.append(queue.substring(start1,start)+frv) //压入内嵌规则前的内容，及内嵌规则解析得到的字符串 |
||||
continue //获取内容成功，继续选择下个内嵌规则 |
||||
|
||||
} |
||||
} |
||||
|
||||
start = start1 //拉出字段不平衡，重置起点 |
||||
pos = start + inner.length //拉出字段不平衡，inner只是个普通字串，规则回退到开头，并跳到此inner后继续匹配 |
||||
|
||||
} |
||||
|
||||
//匹配前起点与当前规则起点相同，证明无替换成功的内嵌规则,返回空字符串。否则返回替换后的字符串 |
||||
return if(start0 == start) "" else { |
||||
st.append(remainingString()) //压入剩余字符串 |
||||
st.toString() |
||||
} |
||||
} |
||||
|
||||
// /** |
||||
// * 匹配并返回标签中的属性键字串（字母、数字、-、_、:） |
||||
// * @return 属性键字串 |
||||
// */ |
||||
// fun consumeAttributeKey(start:Int = pos): String { |
||||
// while (!isEmpty && (Character.isLetterOrDigit(queue[pos]) || matchesAny('-', '_', ':'))) pos++ |
||||
// return queue.substring(start, pos) |
||||
// } |
||||
|
||||
// fun splitRule(query:String,item:String = "other",listItem:String = "allInOne"):String{ |
||||
// |
||||
// val cuurItem = item //当前项类型，list->列表项 mulu->章节列表项 url->链接项 search->搜索链接项 find发现链接列表项 other->其他项 |
||||
// val cuurList = listItem//当前界面总列表项类型，allInOne，json，xml，kotin，java |
||||
// var Reverse = false //是否反转列表 |
||||
// |
||||
// consumeWhitespace() //消耗开头空白 |
||||
// var fisrt = consume() //拉出并消费首字符 |
||||
// |
||||
// when(item){ |
||||
// "search" -> |
||||
// "find" -> |
||||
// "mulu" -> if(fisrt == '-'){ |
||||
// Reverse=true //开启反转 |
||||
// consumeWhitespace() //拉出所有空白符 |
||||
// fisrt = consume() //首字符后移 |
||||
// } |
||||
// else -> |
||||
// |
||||
// } |
||||
// |
||||
// return query |
||||
// } |
||||
|
||||
companion object { |
||||
/** |
||||
* 转义字符 |
||||
*/ |
||||
private const val ESC = '\\' |
||||
|
||||
/** |
||||
* 阅读共有分隔字串起始部分 |
||||
* "##","@@","{{","{[","<js>", "@js:" |
||||
*/ |
||||
val splitList =arrayOf("##","@@","{{","{[","<js>", "@js:") |
||||
|
||||
/** |
||||
* 发现‘名称-链接’分隔字串 |
||||
* "::" |
||||
*/ |
||||
const val splitListFaXian = "::" |
||||
|
||||
/** |
||||
* 目录专有起始字符 |
||||
* "-" |
||||
*/ |
||||
const val splitListMulu = "-" |
||||
|
||||
/** |
||||
* 结果为元素列表的 all in one 模式起始字符 |
||||
* "+" |
||||
*/ |
||||
const val splitListTongYi = "+" |
||||
|
||||
/** |
||||
* 结果为元素列表的项的同规则组合结构 |
||||
* "||","&&","%%" |
||||
*/ |
||||
val splitListReSplit = arrayOf("||","&&","%%") |
||||
|
||||
/** |
||||
* js脚本结束字串 |
||||
* "</js>" |
||||
*/ |
||||
const val splitListEndJS = "</js>" |
||||
|
||||
/** |
||||
*内嵌js结束字串 |
||||
* "}}" |
||||
*/ |
||||
const val splitListEndInnerJS = "}}" |
||||
|
||||
/** |
||||
* 内嵌规则结束字串 |
||||
* "]}" |
||||
*/ |
||||
const val splitListEndInnerRule = "]}" |
||||
|
||||
/** |
||||
* '[', ']', '(', ')','{','}' |
||||
*/ |
||||
val splitListPublic = charArrayOf('[', ']', '(', ')','{','}') |
||||
|
||||
/** |
||||
* '*',"/","//",":","::","@","|","@xpath:" |
||||
*/ |
||||
val splitListXpath = arrayOf("*","/","//",":","::","@","|","@xpath:") |
||||
|
||||
/** |
||||
* '*','$',".","..", "@json:" |
||||
*/ |
||||
val splitListJson = arrayOf('*','$',".","..", "@json:") |
||||
|
||||
/** |
||||
* '*',"+","~",".",",","|","@","@css:",":" |
||||
*/ |
||||
val splitListCss = arrayOf('*',"+","~",".",",","|","@","@css:",":") |
||||
|
||||
/** |
||||
* "-",".","!","@","@@" |
||||
*/ |
||||
val splitListDefault = arrayOf("-",".","!","@","@@") |
||||
|
||||
} |
||||
} |
||||
Loading…
Reference in new issue