You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
265 lines
8.5 KiB
265 lines
8.5 KiB
// File: build.zig
|
|
// Created Time: 2023-01-07
|
|
// Author: sjinzh (sjinzh@gmail.com)
|
|
|
|
const std = @import("std");
|
|
|
|
// Zig Version: 0.11.0-dev.3379+629f0d23b
|
|
// Build Command: zig build
|
|
pub fn build(b: *std.Build) void {
|
|
const target = b.standardTargetOptions(.{});
|
|
const optimize = b.standardOptimizeOption(.{});
|
|
|
|
const group_name_path = .{
|
|
// Source File: "chapter_computational_complexity/time_complexity.zig"
|
|
// Run Command: zig build run_time_complexity
|
|
.{
|
|
.name = "time_complexity",
|
|
.path = "chapter_computational_complexity/time_complexity.zig"
|
|
},
|
|
|
|
// Source File: "chapter_computational_complexity/worst_best_time_complexity.zig"
|
|
// Run Command: zig build run_worst_best_time_complexity
|
|
.{
|
|
.name = "worst_best_time_complexity",
|
|
.path = "chapter_computational_complexity/worst_best_time_complexity.zig"
|
|
},
|
|
|
|
// Source File: "chapter_computational_complexity/space_complexity.zig"
|
|
// Run Command: zig build run_space_complexity
|
|
.{
|
|
.name = "space_complexity",
|
|
.path = "chapter_computational_complexity/space_complexity.zig"
|
|
},
|
|
|
|
// Source File: "chapter_array_and_linkedlist/array.zig"
|
|
// Run Command: zig build run_array
|
|
.{
|
|
.name = "array",
|
|
.path = "chapter_array_and_linkedlist/array.zig"
|
|
},
|
|
|
|
// Source File: "chapter_array_and_linkedlist/linked_list.zig"
|
|
// Run Command: zig build run_linked_list
|
|
.{
|
|
.name = "linked_list",
|
|
.path = "chapter_array_and_linkedlist/linked_list.zig"
|
|
},
|
|
|
|
// Source File: "chapter_array_and_linkedlist/list.zig"
|
|
// Run Command: zig build run_list
|
|
.{
|
|
.name = "list",
|
|
.path = "chapter_array_and_linkedlist/list.zig"
|
|
},
|
|
|
|
// Source File: "chapter_array_and_linkedlist/my_list.zig"
|
|
// Run Command: zig build run_my_list
|
|
.{
|
|
.name = "my_list",
|
|
.path = "chapter_array_and_linkedlist/my_list.zig"
|
|
},
|
|
|
|
// Source File: "chapter_stack_and_queue/stack.zig"
|
|
// Run Command: zig build run_stack
|
|
.{
|
|
.name = "stack",
|
|
.path = "chapter_stack_and_queue/stack.zig"
|
|
},
|
|
|
|
// Source File: "chapter_stack_and_queue/linkedlist_stack.zig"
|
|
// Run Command: zig build run_linkedlist_stack
|
|
.{
|
|
.name = "linkedlist_stack",
|
|
.path = "chapter_stack_and_queue/linkedlist_stack.zig"
|
|
},
|
|
|
|
// Source File: "chapter_stack_and_queue/array_stack.zig"
|
|
// Run Command: zig build run_array_stack
|
|
.{
|
|
.name = "array_stack",
|
|
.path = "chapter_stack_and_queue/array_stack.zig"
|
|
},
|
|
|
|
// Source File: "chapter_stack_and_queue/queue.zig"
|
|
// Run Command: zig build run_queue
|
|
.{
|
|
.name = "queue",
|
|
.path = "chapter_stack_and_queue/queue.zig"
|
|
},
|
|
|
|
// Source File: "chapter_stack_and_queue/array_queue.zig"
|
|
// Run Command: zig build run_array_queue
|
|
.{
|
|
.name = "array_queue",
|
|
.path = "chapter_stack_and_queue/array_queue.zig"
|
|
},
|
|
|
|
// Source File: "chapter_stack_and_queue/linkedlist_queue.zig"
|
|
// Run Command: zig build run_linkedlist_queue
|
|
.{
|
|
.name = "linkedlist_queue",
|
|
.path = "chapter_stack_and_queue/linkedlist_queue.zig"
|
|
},
|
|
|
|
// Source File: "chapter_stack_and_queue/deque.zig"
|
|
// Run Command: zig build run_deque
|
|
.{
|
|
.name = "deque",
|
|
.path = "chapter_stack_and_queue/deque.zig"
|
|
},
|
|
|
|
// Source File: "chapter_stack_and_queue/linkedlist_deque.zig"
|
|
// Run Command: zig build run_linkedlist_deque
|
|
.{
|
|
.name = "linkedlist_deque",
|
|
.path = "chapter_stack_and_queue/linkedlist_deque.zig"
|
|
},
|
|
|
|
// Source File: "chapter_hashing/hash_map.zig"
|
|
// Run Command: zig build run_hash_map
|
|
.{
|
|
.name = "hash_map",
|
|
.path = "chapter_hashing/hash_map.zig"
|
|
},
|
|
|
|
// Source File: "chapter_hashing/array_hash_map.zig"
|
|
// Run Command: zig build run_array_hash_map
|
|
.{
|
|
.name = "array_hash_map",
|
|
.path = "chapter_hashing/array_hash_map.zig"
|
|
},
|
|
|
|
// Source File: "chapter_tree/binary_tree.zig"
|
|
// Run Command: zig build run_binary_tree
|
|
.{
|
|
.name = "binary_tree",
|
|
.path = "chapter_tree/binary_tree.zig"
|
|
},
|
|
|
|
// Source File: "chapter_tree/binary_tree_bfs.zig"
|
|
// Run Command: zig build run_binary_tree_bfs
|
|
.{
|
|
.name = "binary_tree_bfs",
|
|
.path = "chapter_tree/binary_tree_bfs.zig"
|
|
},
|
|
|
|
// Source File: "chapter_tree/binary_tree_dfs.zig"
|
|
// Run Command: zig build run_binary_tree_dfs
|
|
.{
|
|
.name = "binary_tree_dfs",
|
|
.path = "chapter_tree/binary_tree_dfs.zig"
|
|
},
|
|
|
|
// Source File: "chapter_tree/binary_search_tree.zig"
|
|
// Run Command: zig build run_binary_search_tree
|
|
.{
|
|
.name = "binary_search_tree",
|
|
.path = "chapter_tree/binary_search_tree.zig"
|
|
},
|
|
|
|
// Source File: "chapter_tree/avl_tree.zig"
|
|
// Run Command: zig build run_avl_tree
|
|
.{
|
|
.name = "avl_tree",
|
|
.path = "chapter_tree/avl_tree.zig"
|
|
},
|
|
|
|
// Source File: "chapter_heap/heap.zig"
|
|
// Run Command: zig build run_heap
|
|
.{
|
|
.name = "heap",
|
|
.path = "chapter_heap/heap.zig"
|
|
},
|
|
|
|
// Source File: "chapter_heap/my_heap.zig"
|
|
// Run Command: zig build run_my_heap
|
|
.{
|
|
.name = "my_heap",
|
|
.path = "chapter_heap/my_heap.zig"
|
|
},
|
|
|
|
// Source File: "chapter_searching/linear_search.zig"
|
|
// Run Command: zig build run_linear_search
|
|
.{
|
|
.name = "linear_search",
|
|
.path = "chapter_searching/linear_search.zig"
|
|
},
|
|
|
|
// Source File: "chapter_searching/binary_search.zig"
|
|
// Run Command: zig build run_binary_search
|
|
.{
|
|
.name = "binary_search",
|
|
.path = "chapter_searching/binary_search.zig"
|
|
},
|
|
|
|
// Source File: "chapter_searching/hashing_search.zig"
|
|
// Run Command: zig build run_hashing_search
|
|
.{
|
|
.name = "hashing_search",
|
|
.path = "chapter_searching/hashing_search.zig"
|
|
},
|
|
|
|
// Source File: "chapter_searching/two_sum.zig"
|
|
// Run Command: zig build run_two_sum
|
|
.{
|
|
.name = "two_sum",
|
|
.path = "chapter_searching/two_sum.zig"
|
|
},
|
|
|
|
// Source File: "chapter_sorting/bubble_sort.zig"
|
|
// Run Command: zig build run_bubble_sort
|
|
.{
|
|
.name = "bubble_sort",
|
|
.path = "chapter_sorting/bubble_sort.zig"
|
|
},
|
|
|
|
// Source File: "chapter_sorting/insertion_sort.zig"
|
|
// Run Command: zig build run_insertion_sort
|
|
.{
|
|
.name = "insertion_sort",
|
|
.path = "chapter_sorting/insertion_sort.zig"
|
|
},
|
|
|
|
// Source File: "chapter_sorting/quick_sort.zig"
|
|
// Run Command: zig build run_quick_sort
|
|
.{
|
|
.name = "quick_sort",
|
|
.path = "chapter_sorting/quick_sort.zig"
|
|
},
|
|
|
|
// Source File: "chapter_sorting/merge_sort.zig"
|
|
// Run Command: zig build run_merge_sort
|
|
.{
|
|
.name = "merge_sort",
|
|
.path = "chapter_sorting/merge_sort.zig"
|
|
},
|
|
|
|
// Source File: "chapter_sorting/radix_sort.zig"
|
|
// Run Command: zig build run_radix_sort
|
|
.{
|
|
.name = "radix_sort",
|
|
.path = "chapter_sorting/radix_sort.zig"
|
|
},
|
|
|
|
};
|
|
|
|
inline for (group_name_path) |name_path| {
|
|
const exe = b.addExecutable(.{
|
|
.name = name_path.name,
|
|
.root_source_file = .{ .path = name_path.path },
|
|
.target = target,
|
|
.optimize = optimize,
|
|
});
|
|
exe.addModule("include", b.addModule("", .{
|
|
.source_file = .{ .path = "include/include.zig" },
|
|
}));
|
|
b.installArtifact(exe);
|
|
const run_cmd = b.addRunArtifact(exe);
|
|
run_cmd.step.dependOn(b.getInstallStep());
|
|
if (b.args) |args| run_cmd.addArgs(args);
|
|
const run_step = b.step("run_" ++ name_path.name, "Run the app");
|
|
run_step.dependOn(&run_cmd.step);
|
|
}
|
|
}
|