CFBox/tests/unit/test_sort.cpp at main · Awesome-Embedded-Learning-Studio/CFBox · GitHub

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
#include <cfbox/applets.hpp>
#include <gtest/gtest.h>
#include "test_capture.hpp"
#include <cfbox/applet_config.hpp>

#if CFBOX_ENABLE_SORT

using namespace cfbox::test;

TEST(SortTest, BasicLexicographic) {
    TempDir tmp;
    auto f = tmp.write_file("data.txt", "banana\napple\ncherry\n");
    char a0[] = "sort", a1[256];
    std::snprintf(a1, sizeof(a1), "%s", f.c_str());
    char* argv[] = {a0, a1};
    auto out = capture_stdout([&]{ return sort_main(2, argv); });
    EXPECT_EQ(out, "apple\nbanana\ncherry\n");
}

TEST(SortTest, Reverse) {
    TempDir tmp;
    auto f = tmp.write_file("data.txt", "banana\napple\ncherry\n");
    char a0[] = "sort", a1[] = "-r", a2[256];
    std::snprintf(a2, sizeof(a2), "%s", f.c_str());
    char* argv[] = {a0, a1, a2};
    auto out = capture_stdout([&]{ return sort_main(3, argv); });
    EXPECT_EQ(out, "cherry\nbanana\napple\n");
}

TEST(SortTest, NumericSort) {
    TempDir tmp;
    auto f = tmp.write_file("data.txt", "10\n2\n1\n20\n3\n");
    char a0[] = "sort", a1[] = "-n", a2[256];
    std::snprintf(a2, sizeof(a2), "%s", f.c_str());
    char* argv[] = {a0, a1, a2};
    auto out = capture_stdout([&]{ return sort_main(3, argv); });
    EXPECT_EQ(out, "1\n2\n3\n10\n20\n");
}

TEST(SortTest, Unique) {
    TempDir tmp;
    auto f = tmp.write_file("data.txt", "b\na\na\nc\nb\n");
    char a0[] = "sort", a1[] = "-u", a2[256];
    std::snprintf(a2, sizeof(a2), "%s", f.c_str());
    char* argv[] = {a0, a1, a2};
    auto out = capture_stdout([&]{ return sort_main(3, argv); });
    EXPECT_EQ(out, "a\nb\nc\n");
}

TEST(SortTest, KeyField) {
    TempDir tmp;
    auto f = tmp.write_file("data.txt", "b a\nc b\na c\n");
    char a0[] = "sort", a1[] = "-k", a2[] = "2", a3[256];
    std::snprintf(a3, sizeof(a3), "%s", f.c_str());
    char* argv[] = {a0, a1, a2, a3};
    auto out = capture_stdout([&]{ return sort_main(4, argv); });
    EXPECT_EQ(out, "b a\nc b\na c\n");
}

TEST(SortTest, MultipleFiles) {
    TempDir tmp;
    auto f1 = tmp.write_file("a.txt", "banana\napple\n");
    auto f2 = tmp.write_file("b.txt", "cherry\napple\n");
    char a0[] = "sort", a1[256], a2[256];
    std::snprintf(a1, sizeof(a1), "%s", f1.c_str());
    std::snprintf(a2, sizeof(a2), "%s", f2.c_str());
    char* argv[] = {a0, a1, a2};
    auto out = capture_stdout([&]{ return sort_main(3, argv); });
    EXPECT_EQ(out, "apple\napple\nbanana\ncherry\n");
}

TEST(SortTest, EmptyFile) {
    TempDir tmp;
    auto f = tmp.write_file("empty.txt", "");
    char a0[] = "sort", a1[256];
    std::snprintf(a1, sizeof(a1), "%s", f.c_str());
    char* argv[] = {a0, a1};
    auto out = capture_stdout([&]{ return sort_main(2, argv); });
    EXPECT_EQ(out, "");
}

TEST(SortTest, ReverseNumericStableOnTies) {
    TempDir tmp;
    auto f = tmp.write_file("data.txt", "2 b\n2 a\n1 x\n2 c\n10 z\n9 y\n");
    char a0[] = "sort", a1[] = "-r", a2[] = "-n", a3[256];
    std::snprintf(a3, sizeof(a3), "%s", f.c_str());
    char* argv[] = {a0, a1, a2, a3};
    auto out = capture_stdout([&]{ return sort_main(4, argv); });
    // 数值降序；三个并列的 "2" 保持输入序 b,a,c。
    // 修前比较器用 `!less`，对相等数值键 (a,b) 与 (b,a) 都返回 true，违反
    // strict-weak-ordering（std::stable_sort 的 UB），顺序会被打乱。
    EXPECT_EQ(out, "10 z\n9 y\n2 b\n2 a\n2 c\n1 x\n");
}

#endif // CFBOX_ENABLE_SORT