File size: 3,307 Bytes
305487b | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 | /*
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;
}
|