mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2025-01-08 12:19:37 +03:00
Userland: Implemented a simple cut command.
The current version supports only the -b list option for a single file. Ranges are also supported.
This commit is contained in:
marprok
Andreas Kling
parent
5465795dc3
commit
338ba238ca
Notes:
sideshowbarker
2024-07-19 12:36:17 +09:00
Author: https://github.com/marprok 🔰 Commit: https://github.com/SerenityOS/serenity/commit/338ba238ca0 Pull-request: https://github.com/SerenityOS/serenity/pull/466
198
Userland/cut.cpp
Normal file
198
Userland/cut.cpp
Normal file
@ -0,0 +1,198 @@
|
||||
#include <AK/AKString.h>
|
||||
#include <AK/QuickSort.h>
|
||||
#include <AK/Vector.h>
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
struct Index {
|
||||
enum class Type {
|
||||
SingleIndex,
|
||||
RangedInex
|
||||
};
|
||||
ssize_t m_from { -1 };
|
||||
ssize_t m_to { -1 };
|
||||
Type m_type { Type::SingleIndex };
|
||||
};
|
||||
|
||||
static void print_usage_and_exit(int ret)
|
||||
{
|
||||
printf("Usage: cut -b list [File]\n");
|
||||
exit(ret);
|
||||
}
|
||||
|
||||
static void add_if_not_exists(Vector<Index>& indexes, Index data)
|
||||
{
|
||||
auto find = [data](auto& other) { return other.m_from == data.m_from && other.m_to == data.m_to; };
|
||||
if (indexes.find(find) == indexes.end()) {
|
||||
indexes.append(data);
|
||||
}
|
||||
}
|
||||
|
||||
static void expand_list(Vector<String>& tokens, Vector<Index>& indexes)
|
||||
{
|
||||
for (auto& token : tokens) {
|
||||
if (token.length() == 0) {
|
||||
fprintf(stderr, "cut: byte/character positions are numbered from 1\n");
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
if (token == "-") {
|
||||
fprintf(stderr, "cut: invalid range with no endpoint: %s\n", token.characters());
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
if (token[0] == '-') {
|
||||
bool ok = true;
|
||||
ssize_t index = token.substring(1, token.length() - 1).to_int(ok);
|
||||
if (!ok) {
|
||||
fprintf(stderr, "cut: invalid byte/character position '%s'\n", token.characters());
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
if (index == 0) {
|
||||
fprintf(stderr, "cut: byte/character positions are numbered from 1\n");
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
for (ssize_t i = 1; i <= index; ++i) {
|
||||
Index tmp = { i, i, Index::Type::SingleIndex };
|
||||
add_if_not_exists(indexes, tmp);
|
||||
}
|
||||
} else if (token[token.length() - 1] == '-') {
|
||||
bool ok = true;
|
||||
ssize_t index = token.substring(0, token.length() - 1).to_int(ok);
|
||||
if (!ok) {
|
||||
fprintf(stderr, "cut: invalid byte/character position '%s'\n", token.characters());
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
if (index == 0) {
|
||||
fprintf(stderr, "cut: byte/character positions are numbered from 1\n");
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
Index tmp = { index, -1, Index::Type::RangedInex };
|
||||
add_if_not_exists(indexes, tmp);
|
||||
} else {
|
||||
auto range = token.split('-');
|
||||
if (range.size() == 2) {
|
||||
bool ok = true;
|
||||
ssize_t index1 = range[0].to_int(ok);
|
||||
if (!ok) {
|
||||
fprintf(stderr, "cut: invalid byte/character position '%s'\n", range[0].characters());
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
ssize_t index2 = range[1].to_int(ok);
|
||||
if (!ok) {
|
||||
fprintf(stderr, "cut: invalid byte/character position '%s'\n", range[1].characters());
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
if (index1 > index2) {
|
||||
fprintf(stderr, "cut: invalid decreasing range\n");
|
||||
print_usage_and_exit(1);
|
||||
} else if (index1 == 0 || index2 == 0) {
|
||||
fprintf(stderr, "cut: byte/character positions are numbered from 1\n");
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
for (; index1 <= index2; ++index1) {
|
||||
Index tmp = { index1, index1, Index::Type::SingleIndex };
|
||||
add_if_not_exists(indexes, tmp);
|
||||
}
|
||||
} else if (range.size() == 1) {
|
||||
bool ok = true;
|
||||
ssize_t index = range[0].to_int(ok);
|
||||
if (!ok) {
|
||||
fprintf(stderr, "cut: invalid byte/character position '%s'\n", range[0].characters());
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
if (index == 0) {
|
||||
fprintf(stderr, "cut: byte/character positions are numbered from 1\n");
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
Index tmp = { index, index, Index::Type::SingleIndex };
|
||||
add_if_not_exists(indexes, tmp);
|
||||
} else {
|
||||
fprintf(stderr, "cut: invalid byte or character range\n");
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main(int argc, char** argv)
|
||||
{
|
||||
const char* file = nullptr;
|
||||
String byte_list = "";
|
||||
Vector<String> tokens;
|
||||
|
||||
if (argc == 1) {
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
for (int i = 1; i < argc;) {
|
||||
if (!strcmp(argv[i], "-b")) {
|
||||
/* The next argument should be a list of bytes. */
|
||||
byte_list = (i + 1 < argc) ? argv[i + 1] : "";
|
||||
|
||||
if (byte_list == "") {
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
tokens = byte_list.split(',');
|
||||
i += 2;
|
||||
} else if (!strcmp(argv[i], "--help") || !strcmp(argv[i], "-h")) {
|
||||
print_usage_and_exit(1);
|
||||
} else if (argv[i][0] != '-') {
|
||||
file = argv[i++];
|
||||
} else {
|
||||
fprintf(stderr, "cut: invalid argument %s\n", argv[i]);
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
}
|
||||
|
||||
if (!file || byte_list == "") {
|
||||
print_usage_and_exit(1);
|
||||
}
|
||||
|
||||
FILE* fp = nullptr;
|
||||
fp = fopen(file, "r");
|
||||
|
||||
if (!fp) {
|
||||
fprintf(stderr, "cut: Could not open file '%s'\n", file);
|
||||
return 1;
|
||||
}
|
||||
|
||||
Vector<Index> byte_vector;
|
||||
expand_list(tokens, byte_vector);
|
||||
quick_sort(byte_vector.begin(), byte_vector.end(), [](auto& a, auto& b) { return a.m_from < b.m_from; });
|
||||
|
||||
char* line = nullptr;
|
||||
ssize_t line_length = 0;
|
||||
size_t line_capacity = 0;
|
||||
while ((line_length = getline(&line, &line_capacity, fp)) != -1) {
|
||||
line[line_length - 1] = '\0';
|
||||
line_length--;
|
||||
for (auto& i : byte_vector) {
|
||||
if (i.m_type == Index::Type::RangedInex && i.m_from < line_length) {
|
||||
printf("%s", line + i.m_from - 1);
|
||||
break;
|
||||
}
|
||||
|
||||
if (i.m_from <= line_length)
|
||||
printf("%c", line[i.m_from - 1]);
|
||||
else
|
||||
break;
|
||||
}
|
||||
printf("\n");
|
||||
}
|
||||
|
||||
if (line)
|
||||
free(line);
|
||||
fclose(fp);
|
||||
|
||||
return 0;
|
||||
}
|
||||
Loading…
Reference in New Issue
Block a user