f244a9e661
* fix: channel affinity log styles * fix: Issue with incorrect data storage when switching key sources * feat: support not retrying after a single rule configuration fails * fix: render channel affinity tooltip as multiline content * feat: channel affinity cache hit * fix: prevent ChannelAffinityUsageCacheModal infinite loading and hide data before fetch * chore: format backend with gofmt and frontend with prettier/eslint autofix
119 lines
3.1 KiB
JavaScript
Vendored
119 lines
3.1 KiB
JavaScript
Vendored
/*
|
||
Copyright (C) 2025 QuantumNous
|
||
|
||
This program is free software: you can redistribute it and/or modify
|
||
it under the terms of the GNU Affero General Public License as
|
||
published by the Free Software Foundation, either version 3 of the
|
||
License, or (at your option) any later version.
|
||
|
||
This program is distributed in the hope that it will be useful,
|
||
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
GNU Affero General Public License for more details.
|
||
|
||
You should have received a copy of the GNU Affero General Public License
|
||
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||
|
||
For commercial licensing, please contact support@quantumnous.com
|
||
*/
|
||
export function parseHttpStatusCodeRules(input) {
|
||
const raw = (input ?? '').toString().trim();
|
||
if (raw.length === 0) {
|
||
return {
|
||
ok: true,
|
||
ranges: [],
|
||
tokens: [],
|
||
normalized: '',
|
||
invalidTokens: [],
|
||
};
|
||
}
|
||
|
||
const sanitized = raw.replace(/[，]/g, ',');
|
||
const segments = sanitized.split(/[,]/g);
|
||
|
||
const ranges = [];
|
||
const invalidTokens = [];
|
||
|
||
for (const segment of segments) {
|
||
const trimmed = segment.trim();
|
||
if (!trimmed) continue;
|
||
const parsed = parseToken(trimmed);
|
||
if (!parsed) invalidTokens.push(trimmed);
|
||
else ranges.push(parsed);
|
||
}
|
||
|
||
if (invalidTokens.length > 0) {
|
||
return {
|
||
ok: false,
|
||
ranges: [],
|
||
tokens: [],
|
||
normalized: raw,
|
||
invalidTokens,
|
||
};
|
||
}
|
||
|
||
const merged = mergeRanges(ranges);
|
||
const tokens = merged.map((r) =>
|
||
r.start === r.end ? `${r.start}` : `${r.start}-${r.end}`,
|
||
);
|
||
const normalized = tokens.join(',');
|
||
|
||
return {
|
||
ok: true,
|
||
ranges: merged,
|
||
tokens,
|
||
normalized,
|
||
invalidTokens: [],
|
||
};
|
||
}
|
||
|
||
function parseToken(token) {
|
||
const cleaned = (token ?? '').toString().trim().replaceAll(' ', '');
|
||
if (!cleaned) return null;
|
||
|
||
if (cleaned.includes('-')) {
|
||
const parts = cleaned.split('-');
|
||
if (parts.length !== 2) return null;
|
||
const [a, b] = parts;
|
||
if (!isNumber(a) || !isNumber(b)) return null;
|
||
const start = Number.parseInt(a, 10);
|
||
const end = Number.parseInt(b, 10);
|
||
if (!Number.isFinite(start) || !Number.isFinite(end)) return null;
|
||
if (start > end) return null;
|
||
if (start < 100 || end > 599) return null;
|
||
return { start, end };
|
||
}
|
||
|
||
if (!isNumber(cleaned)) return null;
|
||
const code = Number.parseInt(cleaned, 10);
|
||
if (!Number.isFinite(code)) return null;
|
||
if (code < 100 || code > 599) return null;
|
||
return { start: code, end: code };
|
||
}
|
||
|
||
function isNumber(s) {
|
||
return typeof s === 'string' && /^\d+$/.test(s);
|
||
}
|
||
|
||
function mergeRanges(ranges) {
|
||
if (!Array.isArray(ranges) || ranges.length === 0) return [];
|
||
|
||
const sorted = [...ranges].sort((a, b) =>
|
||
a.start !== b.start ? a.start - b.start : a.end - b.end,
|
||
);
|
||
const merged = [sorted[0]];
|
||
|
||
for (let i = 1; i < sorted.length; i += 1) {
|
||
const current = sorted[i];
|
||
const last = merged[merged.length - 1];
|
||
|
||
if (current.start <= last.end + 1) {
|
||
last.end = Math.max(last.end, current.end);
|
||
continue;
|
||
}
|
||
merged.push({ ...current });
|
||
}
|
||
|
||
return merged;
|
||
}
|