mirror of
https://github.com/KOP-XIAO/QuantumultX.git
synced 2026-01-26 01:35:09 +00:00
ignore failed sub parse
fix ntf evaluation ¯\_(ツ)_/¯
This commit is contained in:
@@ -877,12 +877,14 @@ function Subs2QX(subs, Pudp, Ptfo, Pcert, Ptls13) {
|
||||
var SurgeK = ["=ss", "=vmess", "=trojan", "=http", "=custom"];
|
||||
var LoonK = ["=shadowsocks", "=shadowsocksr"]
|
||||
var QXlist = [];
|
||||
var failedList = [];
|
||||
for (var i = 0; i < list0.length; i++) {
|
||||
var node = ""
|
||||
if (list0[i].trim().length > 3) {
|
||||
var type = list0[i].split("://")[0].trim()
|
||||
var listi = list0[i].replace(/ /g, "")
|
||||
const NodeCheck = (item) => listi.toLowerCase().indexOf(item) != -1;
|
||||
try {
|
||||
if (type == "vmess" && list0[i].indexOf("remarks=") == -1) {
|
||||
var bnode = Base64.decode(list0[i].split("vmess://")[1])
|
||||
if (bnode.indexOf("over-tls=") == -1) { //v2rayN
|
||||
@@ -915,6 +917,9 @@ function Subs2QX(subs, Pudp, Ptfo, Pcert, Ptls13) {
|
||||
} else if (LoonK.some(NodeCheck)) {
|
||||
node = Loon2QX(list0[i])
|
||||
}
|
||||
} catch (e) {
|
||||
failedList.push(`<<<\nContent: ${list0[i]}\nError: ${e}`)
|
||||
}
|
||||
if (node instanceof Array) {
|
||||
for (var j in node) {
|
||||
node[j] = Pudp != 0 ? XUDP(node[j],Pudp) : node[j]
|
||||
@@ -928,7 +933,10 @@ function Subs2QX(subs, Pudp, Ptfo, Pcert, Ptls13) {
|
||||
}
|
||||
}
|
||||
}
|
||||
return QXlist
|
||||
if (failedList.length > 0 && Pntf0 != 0) {
|
||||
$notify(`⚠️ 有 ${failedList.length} 条数据解析出错, 已跳过`, "出错内容", failedList.join("\n"));
|
||||
}
|
||||
return QXlist;
|
||||
}
|
||||
|
||||
//将sip008格式的订阅转换成quanx格式
|
||||
|
||||
Reference in New Issue
Block a user