Add testing suite for the library #7

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged

celonymire merged 45 commits into master from ci

Oct 3, 2025

.github/workflows/test.yml

-Original file line number
+Diff line change
@@ -0,0 +1,21 @@
+    on:
+        push:
+            branches:
+                - main
+        pull_request:
+    jobs:
+        test:
+            runs-on: ubuntu-latest
+            steps:
+                - name: Checkout repository
+                  uses: actions/checkout@v4
+                - name: Configure tests
+                  run: cmake . -B build
+                - name: Build tests
+                  run: cmake --build build --target all --parallel
+                - name: Run tests
+                  run: ctest --test-dir build --output-on-failure -j

.gitignore

-Original file line number
+Diff line change
@@ Expand Up / @@ -2,7 +2,10 @@ @@
     !library/
     !leetcode/
+    !test/
+    !.github/
     !.clang-format
     !ruff.toml
     !README.md
+    !CMakeLists.txt
     !ac-library

CMakeLists.txt

-Original file line number
+Diff line change
@@ -0,0 +1,8 @@
+    cmake_minimum_required(VERSION 3.30)
+    project(competitive-programming CXX)
+    include(CTest)
+    if(BUILD_TESTING)
+        add_subdirectory("test")
+    endif()

library/.gitignore

Original file line number	Diff line number	Diff line change
		@@ -0,0 +1 @@
		**/.cache

0 library/cpp/data_structures/union_find.hpp → library/cpp/data_structure/union_find.hpp

File renamed without changes.

test/.gitignore

-Original file line number
+Diff line change
@@ -0,0 +1,4 @@
+    **/__pycache__
+    build/
+    .cache/
+    compile_commands.json

test/CMakeLists.txt

-Original file line number
+Diff line change
@@ -0,0 +1,41 @@
+    find_package(Python COMPONENTS Interpreter REQUIRED)
+    set(CMAKE_CXX_STANDARD 17)
+    set(CMAKE_CXX_STANDARD_REQUIRED ON)
+    include_directories("../library/cpp")
+    function(add_library_test name)
+        add_executable(${name}_program "program/${name}.cpp")
+        add_executable(${name}_solution "solution/${name}.cpp")
+        add_test(NAME ${name}
+                COMMAND ${Python_EXECUTABLE} -m test.checker.${name} -p $<TARGET_FILE:${name}_program> -s $<TARGET_FILE:${name}_solution>
+                WORKING_DIRECTORY ${PROJECT_SOURCE_DIR}
+            )
+    endfunction()
+    # data_structure
+    add_library_test("union_find")
+    # graph
+    add_library_test("bridges")
+    add_library_test("lowest_common_ancestor")
+    add_library_test("strongly_connected_components")
+    # math
+    add_library_test("combinatorics")
+    add_library_test("matrix")
+    # range_query
+    add_library_test("fenwick")
+    add_library_test("heavy_light_decomposition")
+    add_library_test("mo_array")
+    add_library_test("segment_tree")
+    add_library_test("segment_tree_lazy")
+    add_library_test("sparse_table")
+    add_library_test("treap")
+    # string
+    add_library_test("aho_corasick")
+    add_library_test("rolling_hash")

test/__init__.py

Empty file.

test/checker/aho_corasick.py

-Original file line number
+Diff line change
@@ -0,0 +1,35 @@
+    from test.lib import cli, runner
+    from random import randint, choices
+    from string import ascii_lowercase
+    def main():
+        args = cli.args.parse_args()
+        iter = args.iterations
+        for _ in range(iter):
+            stdin = []
+            n = randint(1, 10**5)
+            s = "".join(choices(ascii_lowercase, k=n))
+            stdin.append(s)
+            tot = 5 * 10**5
+            k_max = randint(1, 5 * 10**5)
+            patterns = []
+            for _ in range(k_max):
+                if tot == 0:
+                    break
+                m = randint(1, tot)
+                p = "".join(choices(ascii_lowercase, k=m))
+                patterns.append(p)
+                tot -= m
+            stdin.append(str(len(patterns)))
+            stdin.extend(patterns)
+            proc_ans, sol_ans = runner.run(args.program, args.solution, "\n".join(stdin))
+            assert proc_ans == sol_ans
+    if __name__ == "__main__":
+        main()

test/checker/bridges.py

-Original file line number
+Diff line change
@@ -0,0 +1,32 @@
+    from test.lib import cli, runner, random
+    from random import randint
+    from itertools import batched
+    def main():
+        args = cli.args.parse_args()
+        iter = args.iterations
+        for _ in range(iter):
+            stdin = []
+            n = randint(1, 10**5)
+            m = randint(n - 1, min(10**5, n * (n - 1) // 2))
+            stdin.append(f"{n} {m}")
+            ed = random.rand_connected_graph_edges(n, m)
+            for a, b in ed:
+                stdin.append(f"{a} {b}")
+            proc_ans, sol_ans = runner.run(args.program, args.solution, "\n".join(stdin))
+            proc_ans = proc_ans.split()
+            sol_ans = sol_ans.split()
+            assert proc_ans[0] == sol_ans[0]
+            proc_ed = sorted([(min(a, b), max(a, b)) for a, b in batched(proc_ans[1:], 2)])
+            sol_ed = sorted([(min(a, b), max(a, b)) for a, b in batched(sol_ans[1:], 2)])
+            assert proc_ed == sol_ed
+    if __name__ == "__main__":
+        main()

test/checker/combinatorics.py

-Original file line number
+Diff line change
@@ -0,0 +1,24 @@
+    from test.lib import cli, runner
+    from random import randint
+    def main():
+        args = cli.args.parse_args()
+        iter = args.iterations
+        for _ in range(iter):
+            stdin = []
+            n = randint(1, 10**5)
+            stdin.append(str(n))
+            for _ in range(n):
+                a = randint(0, 10**6)
+                b = randint(0, a)
+                stdin.append(f"{a} {b}")
+            proc_ans, sol_ans = runner.run(args.program, args.solution, "\n".join(stdin))
+            assert proc_ans == sol_ans
+    if __name__ == "__main__":
+        main()

test/checker/fenwick.py

-Original file line number
+Diff line change
@@ -0,0 +1,34 @@
+    from test.lib import cli, runner
+    from random import randint
+    def main():
+        args = cli.args.parse_args()
+        iter = args.iterations
+        for _ in range(iter):
+            stdin = []
+            n = randint(1, 2 * 10**5)
+            q = randint(1, 2 * 10**5)
+            stdin.append(f"{n} {q}")
+            x = [randint(1, 10**9) for _ in range(n)]
+            stdin.append(" ".join(map(str, x)))
+            for _ in range(q):
+                type = randint(1, 2)
+                if type == 1:
+                    k = randint(1, n)
+                    u = randint(1, 10**9)
+                    stdin.append(f"1 {k} {u}")
+                else:
+                    a = randint(1, n)
+                    b = randint(a, n)
+                    stdin.append(f"2 {a} {b}")
+            proc_ans, sol_ans = runner.run(args.program, args.solution, "\n".join(stdin))
+            assert proc_ans == sol_ans
+    if __name__ == "__main__":
+        main()

test/checker/heavy_light_decomposition.py

-Original file line number
+Diff line change
@@ -0,0 +1,38 @@
+    from test.lib import cli, runner, random
+    from random import randint
+    def main():
+        args = cli.args.parse_args()
+        iter = args.iterations
+        for _ in range(iter):
+            stdin = []
+            n = randint(1, 2 * 10**5)
+            q = randint(1, 2 * 10**5)
+            stdin.append(f"{n} {q}")
+            v = [str(randint(1, 10**9)) for _ in range(n)]
+            stdin.append(" ".join(v))
+            ed = random.rand_tree_edges(n)
+            for a, b in ed:
+                stdin.append(f"{a} {b}")
+            for _ in range(q):
+                type = randint(1, 2)
+                if type == 1:
+                    s = randint(1, n)
+                    x = randint(1, 10**9)
+                    stdin.append(f"1 {s} {x}")
+                else:
+                    a = randint(1, n)
+                    b = randint(1, n)
+                    stdin.append(f"2 {a} {b}")
+            proc_ans, sol_ans = runner.run(args.program, args.solution, "\n".join(stdin))
+            assert proc_ans == sol_ans
+    if __name__ == "__main__":
+        main()

test/checker/lowest_common_ancestor.py

-Original file line number
+Diff line change
@@ -0,0 +1,35 @@
+    from test.lib import cli, runner, random
+    from random import randint
+    import sys
+    import resource
+    sys.setrecursionlimit(10**9)
+    resource.setrlimit(
+        resource.RLIMIT_STACK, (resource.RLIM_INFINITY, resource.RLIM_INFINITY)
+    )
+    def main():
+        args = cli.args.parse_args()
+        iter = args.iterations
+        for _ in range(iter):
+            stdin = []
+            n = randint(1, 2 * 10**5)
+            q = randint(1, 2 * 10**5)
+            stdin.append(f"{n} {q}")
+            par = random.rand_tree_parent_list(n=n)[1:]
+            stdin.append(" ".join(map(str, par)))
+            for _ in range(q):
+                a = randint(1, n)
+                b = randint(1, n)
+                stdin.append(f"{a} {b}")
+            proc_ans, sol_ans = runner.run(args.program, args.solution, "\n".join(stdin))
+            assert proc_ans == sol_ans
+    if __name__ == "__main__":
+        main()

test/checker/matrix.py

-Original file line number
+Diff line change
@@ -0,0 +1,21 @@
+    from test.lib import cli, runner
+    from random import randint
+    def main():
+        args = cli.args.parse_args()
+        iter = args.iterations
+        for _ in range(iter):
+            stdin = []
+            n = randint(3, 10**9)
+            l = randint(1, 75)
+            r = randint(l, 75)
+            stdin.append(f"{n} {l} {r}")
+            proc_ans, sol_ans = runner.run(args.program, args.solution, "\n".join(stdin))
+            assert len(proc_ans) == len(sol_ans)
+    if __name__ == "__main__":
+        main()

test/checker/mo_array.py

-Original file line number
+Diff line change
@@ -0,0 +1,30 @@
+    from test.lib import cli, runner
+    from random import randint
+    def main():
+        args = cli.args.parse_args()
+        iter = args.iterations
+        for _ in range(iter):
+            stdin = []
+            n = randint(1, 2 * 10**5)
+            t = randint(1, 2 * 10**5)
+            stdin.append(f"{n} {t}")
+            a = [randint(1, 10**6) for _ in range(n)]
+            stdin.append(" ".join(map(str, a)))
+            for _ in range(t):
+                a = randint(1, n)
+                b = randint(a, n)
+                stdin.append(f"{a} {b}")
+            proc_ans, sol_ans = runner.run(args.program, args.solution, "\n".join(stdin))
+            if proc_ans != sol_ans:
+                print(proc_ans)
+            assert proc_ans == sol_ans
+    if __name__ == "__main__":
+        main()

test/checker/rolling_hash.py

-Original file line number
+Diff line change
@@ -0,0 +1,22 @@
+    from test.lib import cli, runner
+    from random import randint, choices
+    from string import ascii_lowercase
+    def main():
+        args = cli.args.parse_args()
+        iter = args.iterations
+        for _ in range(iter):
+            stdin = []
+            n = randint(1, 10**5)
+            s = "".join(choices(ascii_lowercase, k=n))
+            stdin.append(s)
+            proc_ans, sol_ans = runner.run(args.program, args.solution, "\n".join(stdin))
+            assert len(proc_ans) == len(sol_ans)
+            assert proc_ans in s and sol_ans in s
+    if __name__ == "__main__":
+        main()

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Add testing suite for the library #7

Uh oh!

Diff view

Diff view

There are no files selected for viewing

Uh oh!