mirror of
https://github.com/SerenityOS/serenity
synced 2024-07-23 02:55:15 +00:00
342b358341
The main difference was that our implementation was writing the final line of a series of repeated lines, whereas the spec says "The second and succeeding copies of repeated adjacent input lines shall not be written." Additionally, there was a mistake in the -f flag implementation causing the number of fields skipped to be one greater than required.
101 lines
2.9 KiB
C++
101 lines
2.9 KiB
C++
/*
|
|
* Copyright (c) 2023, Rodrigo Tobar <rtobarc@gmail.com>.
|
|
* Copyright (c) 2024, Daniel Gaston <tfd@tuta.io>.
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <AK/ScopeGuard.h>
|
|
#include <AK/StringView.h>
|
|
#include <LibCore/Command.h>
|
|
#include <LibCore/File.h>
|
|
#include <LibTest/Macros.h>
|
|
#include <LibTest/TestCase.h>
|
|
|
|
static void run_uniq(Vector<char const*>&& arguments, StringView standard_input, StringView expected_stdout)
|
|
{
|
|
MUST(arguments.try_insert(0, "uniq"));
|
|
MUST(arguments.try_append(nullptr));
|
|
auto uniq = MUST(Core::Command::create("uniq"sv, arguments.data()));
|
|
MUST(uniq->write(standard_input));
|
|
auto [stdout, stderr] = MUST(uniq->read_all());
|
|
auto status = MUST(uniq->status());
|
|
if (status != Core::Command::ProcessResult::DoneWithZeroExitCode) {
|
|
FAIL(ByteString::formatted("uniq didn't exit cleanly: status: {}, stdout: {}, stderr: {}", static_cast<int>(status), StringView { stdout.bytes() }, StringView { stderr.bytes() }));
|
|
}
|
|
EXPECT_EQ(StringView { expected_stdout.bytes() }, StringView { stdout.bytes() });
|
|
}
|
|
|
|
TEST_CASE(two_duplicate_lines)
|
|
{
|
|
run_uniq({}, "AAA\nAAA\n"sv, "AAA\n"sv);
|
|
}
|
|
|
|
TEST_CASE(two_unique_lines)
|
|
{
|
|
run_uniq({}, "AAA\nAaA\n"sv, "AAA\nAaA\n"sv);
|
|
}
|
|
|
|
TEST_CASE(long_line)
|
|
{
|
|
auto input = Array<u8, 4096> {};
|
|
auto expected_output = Array<u8, 2048> {};
|
|
// Create two lines of 2047 A's and a newline.
|
|
input.fill('A');
|
|
input[2047] = '\n';
|
|
input[4095] = '\n';
|
|
|
|
expected_output.fill('A');
|
|
expected_output[2047] = '\n';
|
|
|
|
run_uniq({}, StringView { input }, StringView { expected_output });
|
|
}
|
|
|
|
TEST_CASE(line_longer_than_internal_stream_buffer)
|
|
{
|
|
auto input = Array<u8, 131072> {};
|
|
auto expected_output = Array<u8, 65536> {};
|
|
// Create two lines of 65535 A's and a newline.
|
|
input.fill('A');
|
|
input[65535] = '\n';
|
|
input[131071] = '\n';
|
|
|
|
expected_output.fill('A');
|
|
expected_output[65535] = '\n';
|
|
|
|
run_uniq({}, StringView { input }, StringView { expected_output });
|
|
}
|
|
|
|
TEST_CASE(ignore_case_flag)
|
|
{
|
|
run_uniq({ "-i" }, "AAA\nAaA\n"sv, "AAA\n"sv);
|
|
run_uniq({ "-i" }, "AAA\naaa\nAaA\n"sv, "AAA\n"sv);
|
|
}
|
|
|
|
TEST_CASE(duplicate_flag)
|
|
{
|
|
run_uniq({ "-d" }, "AAA\nAAA\nBBB\n"sv, "AAA\n"sv);
|
|
run_uniq({ "-d" }, "AAA\nAAA\nBBB\nBBB\nCCC\n"sv, "AAA\nBBB\n"sv);
|
|
}
|
|
|
|
TEST_CASE(skip_chars_flag)
|
|
{
|
|
run_uniq({ "-s1" }, "AAA\nAaA\n"sv, "AAA\nAaA\n"sv);
|
|
run_uniq({ "-s2" }, "AAA\nAaA\n"sv, "AAA\n"sv);
|
|
run_uniq({ "-s200" }, "AAA\nAaA\n"sv, "AAA\n"sv);
|
|
}
|
|
|
|
TEST_CASE(skip_fields_flag)
|
|
{
|
|
run_uniq({ "-f1" }, "1 AA\n2 AA\n"sv, "1 AA\n"sv);
|
|
run_uniq({ "-f1" }, "1 a AA\n2 b AA\n"sv, "1 a AA\n2 b AA\n"sv);
|
|
run_uniq({ "-f2" }, "1 a AA\n2 b AA\n"sv, "1 a AA\n"sv);
|
|
run_uniq({ "-f200" }, "1 AA\n2 AA\n"sv, "1 AA\n"sv);
|
|
}
|
|
|
|
TEST_CASE(count_flag)
|
|
{
|
|
run_uniq({ "-c" }, "AAA\nAAA\n"sv, "2 AAA\n"sv);
|
|
run_uniq({ "-c" }, "AAA\nAAA\nBBB\n"sv, "2 AAA\n1 BBB\n"sv);
|
|
}
|