Deno/std
1
0
Fork 0
mirror of https://github.com/denoland/std.git synced 2024-11-22 04:59:05 +00:00
Code Issues Actions 1 Packages Projects Releases Wiki Activity

chore(cli): simplify parseArgs() logic (#5601)

Browse Source 
initial commit
This commit is contained in:
Tim Reichen 2024-08-02 02:30:25 +02:00 committed by GitHub
parent f600976152
commit 0d30f029e5
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 38 additions and 41 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

79
cli/parse_args.ts
View File

@ -650,26 +650,25 @@ export function parseArgs<
const next = args[i + 1];
if (
!booleanSet.has(key) &&
!allBools &&
next &&
!IS_FLAG_REGEXP.test(next) &&
(aliasMap.get(key)
? !aliasIsBoolean(aliasMap, booleanSet, key)
: true)
) {
value = next;
i++;
setArgument(key, value, arg, true);
continue;
}
if (next) {
if (
!booleanSet.has(key) &&
!allBools &&
!IS_FLAG_REGEXP.test(next) &&
(!aliasMap.has(key) || !aliasIsBoolean(aliasMap, booleanSet, key))
) {
value = next;
i++;
setArgument(key, value, arg, true);
continue;
}
if (next && isBooleanString(next)) {
value = parseBooleanString(next);
i++;
setArgument(key, value, arg, true);
continue;
if (isBooleanString(next)) {
value = parseBooleanString(next);
i++;
setArgument(key, value, arg, true);
continue;
}
}
value = stringSet.has(key) ? "" : true;
@ -698,38 +697,36 @@ export function parseArgs<
}
}
if (letters[j + 1] && letters[j + 1]!.match(SPECIAL_CHAR_REGEXP)) {
if (letters[j + 1]?.match(SPECIAL_CHAR_REGEXP)) {
setArgument(letter, arg.slice(j + 2), arg, true);
continue argsLoop;
}
setArgument(
letter,
stringSet.has(letter) ? "" : true,
arg,
true,
);
setArgument(letter, stringSet.has(letter) ? "" : true, arg, true);
}
key = arg.slice(-1);
if (key === "-") continue;
const nextArg = args[i + 1];
if (
nextArg &&
!HYPHEN_REGEXP.test(nextArg) &&
!booleanSet.has(key) &&
(aliasMap.get(key) ? !aliasIsBoolean(aliasMap, booleanSet, key) : true)
) {
setArgument(key, nextArg, arg, true);
i++;
} else if (nextArg && isBooleanString(nextArg)) {
const value = parseBooleanString(nextArg);
setArgument(key, value, arg, true);
i++;
} else {
setArgument(key, stringSet.has(key) ? "" : true, arg, true);
}
if (nextArg) {
if (
!HYPHEN_REGEXP.test(nextArg) &&
!booleanSet.has(key) &&
(!aliasMap.has(key) || !aliasIsBoolean(aliasMap, booleanSet, key))
) {
setArgument(key, nextArg, arg, true);
i++;
continue;
}
if (isBooleanString(nextArg)) {
const value = parseBooleanString(nextArg);
setArgument(key, value, arg, true);
i++;
continue;
}
}
setArgument(key, stringSet.has(key) ? "" : true, arg, true);
continue;
}