|
|
|
@ -2,7 +2,7 @@ package io.legado.app.model.analyzeRule |
|
|
|
|
|
|
|
|
|
//通用的规则切分处理 |
|
|
|
|
|
|
|
|
|
class RuleAnalyzer(data: String) { |
|
|
|
|
class RuleAnalyzer(data: String, code:Boolean = false) { |
|
|
|
|
|
|
|
|
|
private var queue: String = data //被处理字符串 |
|
|
|
|
private var pos = 0 //处理到的位置 |
|
|
|
@ -12,6 +12,8 @@ class RuleAnalyzer(data: String) { |
|
|
|
|
private var startX = 0 //规则的开始 |
|
|
|
|
private var step:Int = 0 //分割字符的长度 |
|
|
|
|
|
|
|
|
|
val chompBalanced = if(code) ::chompCodeBalanced else ::chompRuleBalanced //设置平衡组函数,json或JavaScript时设置成chompCodeBalanced,否则为chompRuleBalanced |
|
|
|
|
|
|
|
|
|
var elementsType = "" |
|
|
|
|
|
|
|
|
|
//当前平衡字段 |
|
|
|
@ -195,7 +197,7 @@ class RuleAnalyzer(data: String) { |
|
|
|
|
/** |
|
|
|
|
* 拉出一个代码平衡组,存在转义文本,没有实体字符,通常以{}作为模块 |
|
|
|
|
*/ |
|
|
|
|
fun chompCodeBalanced(open: Char = '{', close: Char = '}'): Boolean { |
|
|
|
|
fun chompCodeBalanced(open: Char, close: Char): Boolean { |
|
|
|
|
|
|
|
|
|
var pos = pos //声明临时变量记录匹配位置,匹配成功后才同步到类的pos |
|
|
|
|
|
|
|
|
@ -234,9 +236,9 @@ class RuleAnalyzer(data: String) { |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
/** |
|
|
|
|
* 拉出一个规则平衡组,没有转义文本,有实体字符,通常以[]作为选择器 |
|
|
|
|
* 拉出一个规则平衡组,经过仔细测试xpath和jsoup中,引号内转义字符无效。 |
|
|
|
|
*/ |
|
|
|
|
fun chompRuleBalanced(open: Char = '[', close: Char = ']'): Boolean { |
|
|
|
|
fun chompRuleBalanced(open: Char, close: Char): Boolean { |
|
|
|
|
|
|
|
|
|
var pos = pos //声明临时变量记录匹配位置,匹配成功后才同步到类的pos |
|
|
|
|
var depth = 0 //嵌套深度 |
|
|
|
@ -246,207 +248,210 @@ class RuleAnalyzer(data: String) { |
|
|
|
|
do { |
|
|
|
|
if (pos == queue.length) break |
|
|
|
|
val c = queue[pos++] |
|
|
|
|
|
|
|
|
|
if (c == '\'' && !inDoubleQuote) inSingleQuote = !inSingleQuote //匹配具有语法功能的单引号 |
|
|
|
|
else if (c == '"' && !inSingleQuote) inDoubleQuote = !inDoubleQuote //匹配具有语法功能的双引号 |
|
|
|
|
|
|
|
|
|
if (inSingleQuote || inDoubleQuote) continue //语法单元未匹配结束,直接进入下个循环 |
|
|
|
|
else if( c=='\\' ){ //不在引号中的转义字符才将下个字符转义 |
|
|
|
|
pos++ |
|
|
|
|
continue |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if ( c == open )depth++ //开始嵌套一层 |
|
|
|
|
else if ( c== close) depth-- //闭合一层嵌套 |
|
|
|
|
if ( c == open )depth++ //开始嵌套一层 |
|
|
|
|
else if ( c== close) depth-- //闭合一层嵌套 |
|
|
|
|
|
|
|
|
|
} while (depth > 0 ) //拉出一个平衡字串 |
|
|
|
|
} while (depth > 0 ) //拉出一个平衡字串 |
|
|
|
|
|
|
|
|
|
return if(depth > 0) false else { |
|
|
|
|
this.pos = pos //同步位置 |
|
|
|
|
true |
|
|
|
|
} |
|
|
|
|
return if(depth > 0) false else { |
|
|
|
|
this.pos = pos //同步位置 |
|
|
|
|
true |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
/** |
|
|
|
|
* 不用正则,不到最后不切片也不用中间变量存储,只在序列中标记当前查找字段的开头结尾,到返回时才切片,高效快速准确切割规则 |
|
|
|
|
* 解决jsonPath自带的"&&"和"||"与阅读的规则冲突,以及规则正则或字符串中包含"&&"、"||"、"%%"、"@"导致的冲突 |
|
|
|
|
*/ |
|
|
|
|
tailrec fun splitRule(vararg split: String): Array<String>{ //首段匹配,elementsType为空 |
|
|
|
|
/** |
|
|
|
|
* 不用正则,不到最后不切片也不用中间变量存储,只在序列中标记当前查找字段的开头结尾,到返回时才切片,高效快速准确切割规则 |
|
|
|
|
* 解决jsonPath自带的"&&"和"||"与阅读的规则冲突,以及规则正则或字符串中包含"&&"、"||"、"%%"、"@"导致的冲突 |
|
|
|
|
*/ |
|
|
|
|
tailrec fun splitRule(vararg split: String): Array<String>{ //首段匹配,elementsType为空 |
|
|
|
|
|
|
|
|
|
if(split.size == 1) { |
|
|
|
|
elementsType = split[0] //设置分割字串 |
|
|
|
|
return if(!consumeTo(elementsType)) { |
|
|
|
|
rule += queue.substring(startX) |
|
|
|
|
rule |
|
|
|
|
}else { |
|
|
|
|
step = elementsType.length //设置分隔符长度 |
|
|
|
|
splitRule() |
|
|
|
|
} //递归匹配 |
|
|
|
|
}else if (!consumeToAny(* split)) { //未找到分隔符 |
|
|
|
|
if(split.size == 1) { |
|
|
|
|
elementsType = split[0] //设置分割字串 |
|
|
|
|
return if(!consumeTo(elementsType)) { |
|
|
|
|
rule += queue.substring(startX) |
|
|
|
|
return rule |
|
|
|
|
} |
|
|
|
|
rule |
|
|
|
|
}else { |
|
|
|
|
step = elementsType.length //设置分隔符长度 |
|
|
|
|
splitRule() |
|
|
|
|
} //递归匹配 |
|
|
|
|
}else if (!consumeToAny(* split)) { //未找到分隔符 |
|
|
|
|
rule += queue.substring(startX) |
|
|
|
|
return rule |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
val end = pos //记录分隔位置 |
|
|
|
|
pos = start //重回开始,启动另一种查找 |
|
|
|
|
val end = pos //记录分隔位置 |
|
|
|
|
pos = start //重回开始,启动另一种查找 |
|
|
|
|
|
|
|
|
|
do{ |
|
|
|
|
val st = findToAny('[', '(') //查找筛选器位置 |
|
|
|
|
do{ |
|
|
|
|
val st = findToAny('[', '(') //查找筛选器位置 |
|
|
|
|
|
|
|
|
|
if (st == -1) { |
|
|
|
|
if (st == -1) { |
|
|
|
|
|
|
|
|
|
rule = arrayOf(queue.substring(startX, end)) //压入分隔的首段规则到数组 |
|
|
|
|
rule = arrayOf(queue.substring(startX, end)) //压入分隔的首段规则到数组 |
|
|
|
|
|
|
|
|
|
elementsType = queue.substring(end, end + step) //设置组合类型 |
|
|
|
|
pos = end + step //跳过分隔符 |
|
|
|
|
elementsType = queue.substring(end, end + step) //设置组合类型 |
|
|
|
|
pos = end + step //跳过分隔符 |
|
|
|
|
|
|
|
|
|
while (consumeTo(elementsType)) { //循环切分规则压入数组 |
|
|
|
|
rule += queue.substring(start, pos) |
|
|
|
|
pos += step //跳过分隔符 |
|
|
|
|
} |
|
|
|
|
while (consumeTo(elementsType)) { //循环切分规则压入数组 |
|
|
|
|
rule += queue.substring(start, pos) |
|
|
|
|
pos += step //跳过分隔符 |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
rule += queue.substring(pos) //将剩余字段压入数组末尾 |
|
|
|
|
rule += queue.substring(pos) //将剩余字段压入数组末尾 |
|
|
|
|
|
|
|
|
|
return rule |
|
|
|
|
} |
|
|
|
|
return rule |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if (st > end) { //先匹配到st1pos,表明分隔字串不在选择器中,将选择器前分隔字串分隔的字段依次压入数组 |
|
|
|
|
if (st > end) { //先匹配到st1pos,表明分隔字串不在选择器中,将选择器前分隔字串分隔的字段依次压入数组 |
|
|
|
|
|
|
|
|
|
rule = arrayOf(queue.substring(startX, end)) //压入分隔的首段规则到数组 |
|
|
|
|
rule = arrayOf(queue.substring(startX, end)) //压入分隔的首段规则到数组 |
|
|
|
|
|
|
|
|
|
elementsType = queue.substring(end, end + step) //设置组合类型 |
|
|
|
|
pos = end + step //跳过分隔符 |
|
|
|
|
elementsType = queue.substring(end, end + step) //设置组合类型 |
|
|
|
|
pos = end + step //跳过分隔符 |
|
|
|
|
|
|
|
|
|
while (consumeTo(elementsType) && pos < st) { //循环切分规则压入数组 |
|
|
|
|
rule += queue.substring(start, pos) |
|
|
|
|
pos += step //跳过分隔符 |
|
|
|
|
} |
|
|
|
|
while (consumeTo(elementsType) && pos < st) { //循环切分规则压入数组 |
|
|
|
|
rule += queue.substring(start, pos) |
|
|
|
|
pos += step //跳过分隔符 |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
return if(pos > st) { |
|
|
|
|
startX = start |
|
|
|
|
splitRule() //首段已匹配,但当前段匹配未完成,调用二段匹配 |
|
|
|
|
} |
|
|
|
|
else { //执行到此,证明后面再无分隔字符 |
|
|
|
|
rule += queue.substring(pos) //将剩余字段压入数组末尾 |
|
|
|
|
rule |
|
|
|
|
} |
|
|
|
|
return if(pos > st) { |
|
|
|
|
startX = start |
|
|
|
|
splitRule() //首段已匹配,但当前段匹配未完成,调用二段匹配 |
|
|
|
|
} |
|
|
|
|
else { //执行到此,证明后面再无分隔字符 |
|
|
|
|
rule += queue.substring(pos) //将剩余字段压入数组末尾 |
|
|
|
|
rule |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
pos = st //位置推移到筛选器处 |
|
|
|
|
val next = if (queue[pos] == '[') ']' else ')' //平衡组末尾字符 |
|
|
|
|
pos = st //位置推移到筛选器处 |
|
|
|
|
val next = if (queue[pos] == '[') ']' else ')' //平衡组末尾字符 |
|
|
|
|
|
|
|
|
|
if (!chompRuleBalanced(queue[pos], next)) throw Error( |
|
|
|
|
queue.substring( |
|
|
|
|
0, |
|
|
|
|
start |
|
|
|
|
) + "后未平衡" |
|
|
|
|
) //拉出一个筛选器,不平衡则报错 |
|
|
|
|
if (!chompBalanced(queue[pos], next)) throw Error( |
|
|
|
|
queue.substring( |
|
|
|
|
0, |
|
|
|
|
start |
|
|
|
|
) + "后未平衡" |
|
|
|
|
) //拉出一个筛选器,不平衡则报错 |
|
|
|
|
|
|
|
|
|
}while( end > pos ) |
|
|
|
|
}while( end > pos ) |
|
|
|
|
|
|
|
|
|
start = pos //设置开始查找筛选器位置的起始位置 |
|
|
|
|
start = pos //设置开始查找筛选器位置的起始位置 |
|
|
|
|
|
|
|
|
|
return splitRule(* split) //递归调用首段匹配 |
|
|
|
|
} |
|
|
|
|
return splitRule(* split) //递归调用首段匹配 |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
@JvmName("splitRuleNext") |
|
|
|
|
private tailrec fun splitRule(): Array<String>{ //二段匹配被调用,elementsType非空(已在首段赋值),直接按elementsType查找,比首段采用的方式更快 |
|
|
|
|
@JvmName("splitRuleNext") |
|
|
|
|
private tailrec fun splitRule(): Array<String>{ //二段匹配被调用,elementsType非空(已在首段赋值),直接按elementsType查找,比首段采用的方式更快 |
|
|
|
|
|
|
|
|
|
val end = pos //记录分隔位置 |
|
|
|
|
pos = start //重回开始,启动另一种查找 |
|
|
|
|
val end = pos //记录分隔位置 |
|
|
|
|
pos = start //重回开始,启动另一种查找 |
|
|
|
|
|
|
|
|
|
do{ |
|
|
|
|
val st = findToAny('[', '(') //查找筛选器位置 |
|
|
|
|
do{ |
|
|
|
|
val st = findToAny('[', '(') //查找筛选器位置 |
|
|
|
|
|
|
|
|
|
if (st == -1) { |
|
|
|
|
if (st == -1) { |
|
|
|
|
|
|
|
|
|
rule += arrayOf(queue.substring(startX, end)) //压入分隔的首段规则到数组 |
|
|
|
|
pos = end + step //跳过分隔符 |
|
|
|
|
rule += arrayOf(queue.substring(startX, end)) //压入分隔的首段规则到数组 |
|
|
|
|
pos = end + step //跳过分隔符 |
|
|
|
|
|
|
|
|
|
while (consumeTo(elementsType)) { //循环切分规则压入数组 |
|
|
|
|
rule += queue.substring(start, pos) |
|
|
|
|
pos += step //跳过分隔符 |
|
|
|
|
} |
|
|
|
|
while (consumeTo(elementsType)) { //循环切分规则压入数组 |
|
|
|
|
rule += queue.substring(start, pos) |
|
|
|
|
pos += step //跳过分隔符 |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
rule += queue.substring(pos) //将剩余字段压入数组末尾 |
|
|
|
|
rule += queue.substring(pos) //将剩余字段压入数组末尾 |
|
|
|
|
|
|
|
|
|
return rule |
|
|
|
|
} |
|
|
|
|
return rule |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if (st > end) { //先匹配到st1pos,表明分隔字串不在选择器中,将选择器前分隔字串分隔的字段依次压入数组 |
|
|
|
|
if (st > end) { //先匹配到st1pos,表明分隔字串不在选择器中,将选择器前分隔字串分隔的字段依次压入数组 |
|
|
|
|
|
|
|
|
|
rule += arrayOf(queue.substring(startX, end)) //压入分隔的首段规则到数组 |
|
|
|
|
pos = end + step //跳过分隔符 |
|
|
|
|
rule += arrayOf(queue.substring(startX, end)) //压入分隔的首段规则到数组 |
|
|
|
|
pos = end + step //跳过分隔符 |
|
|
|
|
|
|
|
|
|
while (consumeTo(elementsType) && pos < st) { //循环切分规则压入数组 |
|
|
|
|
rule += queue.substring(start, pos) |
|
|
|
|
pos += step //跳过分隔符 |
|
|
|
|
} |
|
|
|
|
while (consumeTo(elementsType) && pos < st) { //循环切分规则压入数组 |
|
|
|
|
rule += queue.substring(start, pos) |
|
|
|
|
pos += step //跳过分隔符 |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
return if(pos > st) { |
|
|
|
|
startX = start |
|
|
|
|
splitRule() //首段已匹配,但当前段匹配未完成,调用二段匹配 |
|
|
|
|
} |
|
|
|
|
else { //执行到此,证明后面再无分隔字符 |
|
|
|
|
rule += queue.substring(pos) //将剩余字段压入数组末尾 |
|
|
|
|
rule |
|
|
|
|
} |
|
|
|
|
return if(pos > st) { |
|
|
|
|
startX = start |
|
|
|
|
splitRule() //首段已匹配,但当前段匹配未完成,调用二段匹配 |
|
|
|
|
} |
|
|
|
|
else { //执行到此,证明后面再无分隔字符 |
|
|
|
|
rule += queue.substring(pos) //将剩余字段压入数组末尾 |
|
|
|
|
rule |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
pos = st //位置推移到筛选器处 |
|
|
|
|
val next = if (queue[pos] == '[') ']' else ')' //平衡组末尾字符 |
|
|
|
|
pos = st //位置推移到筛选器处 |
|
|
|
|
val next = if (queue[pos] == '[') ']' else ')' //平衡组末尾字符 |
|
|
|
|
|
|
|
|
|
if (!chompRuleBalanced(queue[pos], next)) throw Error( |
|
|
|
|
queue.substring( |
|
|
|
|
0, |
|
|
|
|
start |
|
|
|
|
) + "后未平衡" |
|
|
|
|
) //拉出一个筛选器,不平衡则报错 |
|
|
|
|
if (!chompBalanced(queue[pos], next)) throw Error( |
|
|
|
|
queue.substring( |
|
|
|
|
0, |
|
|
|
|
start |
|
|
|
|
) + "后未平衡" |
|
|
|
|
) //拉出一个筛选器,不平衡则报错 |
|
|
|
|
|
|
|
|
|
}while( end > pos ) |
|
|
|
|
}while( end > pos ) |
|
|
|
|
|
|
|
|
|
start = pos //设置开始查找筛选器位置的起始位置 |
|
|
|
|
start = pos //设置开始查找筛选器位置的起始位置 |
|
|
|
|
|
|
|
|
|
return if(!consumeTo(elementsType)) { |
|
|
|
|
rule += queue.substring(startX) |
|
|
|
|
rule |
|
|
|
|
}else splitRule() //递归匹配 |
|
|
|
|
return if(!consumeTo(elementsType)) { |
|
|
|
|
rule += queue.substring(startX) |
|
|
|
|
rule |
|
|
|
|
}else splitRule() //递归匹配 |
|
|
|
|
|
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/** |
|
|
|
|
* 替换内嵌规则 |
|
|
|
|
* @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 posPre = pos //记录上次结束位置 |
|
|
|
|
if (chompCodeBalanced()) { |
|
|
|
|
val frv= fr(currBalancedString(startStep,endStep)) |
|
|
|
|
if(frv != null) { |
|
|
|
|
st.append(queue.substring(start,posPre)+frv) //压入内嵌规则前的内容,及内嵌规则解析得到的字符串 |
|
|
|
|
continue //获取内容成功,继续选择下个内嵌规则 |
|
|
|
|
/** |
|
|
|
|
* 替换内嵌规则 |
|
|
|
|
* @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 //规则匹配前起点 |
|
|
|
|
|
|
|
|
|
pos += inner.length //拉出字段不平衡,inner只是个普通字串,跳到此inner后继续匹配 |
|
|
|
|
val st = StringBuilder() |
|
|
|
|
|
|
|
|
|
} |
|
|
|
|
while (!isEmpty && consumeTo(inner)) { //拉取成功返回true,ruleAnalyzes里的字符序列索引变量pos后移相应位置,否则返回false,且isEmpty为true |
|
|
|
|
val posPre = pos //记录上次结束位置 |
|
|
|
|
if (chompBalanced('{', '}')) { |
|
|
|
|
val frv= fr(currBalancedString(startStep,endStep)) |
|
|
|
|
if(frv != null) { |
|
|
|
|
st.append(queue.substring(start,posPre)+frv) //压入内嵌规则前的内容,及内嵌规则解析得到的字符串 |
|
|
|
|
continue //获取内容成功,继续选择下个内嵌规则 |
|
|
|
|
|
|
|
|
|
//匹配前起点与当前规则起点相同,证明无替换成功的内嵌规则,返回空字符串。否则返回替换后的字符串 |
|
|
|
|
return if(start0 == start) "" else { |
|
|
|
|
st.append(remainingString()) //压入剩余字符串 |
|
|
|
|
st.toString() |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
pos += inner.length //拉出字段不平衡,inner只是个普通字串,跳到此inner后继续匹配 |
|
|
|
|
|
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
//匹配前起点与当前规则起点相同,证明无替换成功的内嵌规则,返回空字符串。否则返回替换后的字符串 |
|
|
|
|
return if(start0 == start) "" else { |
|
|
|
|
st.append(remainingString()) //压入剩余字符串 |
|
|
|
|
st.toString() |
|
|
|
|
} |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
// /** |
|
|
|
|
// * 匹配并返回标签中的属性键字串(字母、数字、-、_、:) |
|
|
|
|
// * @return 属性键字串 |
|
|
|
@ -480,84 +485,83 @@ class RuleAnalyzer(data: String) { |
|
|
|
|
// 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("-",".","!","@","@@") |
|
|
|
|
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("-",".","!","@","@@") |
|
|
|
|
|
|
|
|
|
}} |
|
|
|
|