Dario48/sand
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

init

Browse source
This commit is contained in:
Dario48 2026-04-18 15:52:14 +02:00
commit 00c8591d17
5 changed files with 294 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

2
.gitignore vendored Normal file
View file

@ -0,0 +1,2 @@
zig-out
.zig-cache

52
build.zig Normal file
View file

@ -0,0 +1,52 @@
const std = @import("std");
pub fn build(b: *std.Build) void {
const target = b.standardTargetOptions(.{});
const optimize = b.standardOptimizeOption(.{});
const mod = b.addModule("sand", .{
.root_source_file = b.path("src/root.zig"),
.target = target,
});
const exe = b.addExecutable(.{
.name = "sand",
.root_module = b.createModule(.{
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
.imports = &.{
.{ .name = "sand", .module = mod },
},
}),
});
b.installArtifact(exe);
const run_step = b.step("run", "Run the app");
const run_cmd = b.addRunArtifact(exe);
run_step.dependOn(&run_cmd.step);
run_cmd.step.dependOn(b.getInstallStep());
if (b.args) |args| {
run_cmd.addArgs(args);
}
const mod_tests = b.addTest(.{
.root_module = mod,
});
const run_mod_tests = b.addRunArtifact(mod_tests);
const exe_tests = b.addTest(.{
.root_module = exe.root_module,
});
const run_exe_tests = b.addRunArtifact(exe_tests);
const test_step = b.step("test", "Run tests");
test_step.dependOn(&run_mod_tests.step);
test_step.dependOn(&run_exe_tests.step);
}

81
build.zig.zon Normal file
View file

@ -0,0 +1,81 @@
.{
// This is the default name used by packages depending on this one. For
// example, when a user runs `zig fetch --save <url>`, this field is used
// as the key in the `dependencies` table. Although the user can choose a
// different name, most users will stick with this provided value.
//
// It is redundant to include "zig" in this name because it is already
// within the Zig package namespace.
.name = .sand,
// This is a [Semantic Version](https://semver.org/).
// In a future version of Zig it will be used for package deduplication.
.version = "0.0.0",
// Together with name, this represents a globally unique package
// identifier. This field is generated by the Zig toolchain when the
// package is first created, and then *never changes*. This allows
// unambiguous detection of one package being an updated version of
// another.
//
// When forking a Zig project, this id should be regenerated (delete the
// field and run `zig build`) if the upstream project is still maintained.
// Otherwise, the fork is *hostile*, attempting to take control over the
// original project's identity. Thus it is recommended to leave the comment
// on the following line intact, so that it shows up in code reviews that
// modify the field.
.fingerprint = 0xa07a92116fcc91c3, // Changing this has security and trust implications.
// Tracks the earliest Zig version that the package considers to be a
// supported use case.
.minimum_zig_version = "0.16.0",
// This field is optional.
// Each dependency must either provide a `url` and `hash`, or a `path`.
// `zig build --fetch` can be used to fetch all dependencies of a package, recursively.
// Once all dependencies are fetched, `zig build` no longer requires
// internet connectivity.
.dependencies = .{
// See `zig fetch --save <url>` for a command-line interface for adding dependencies.
//.example = .{
// // When updating this field to a new URL, be sure to delete the corresponding
// // `hash`, otherwise you are communicating that you expect to find the old hash at
// // the new URL. If the contents of a URL change this will result in a hash mismatch
// // which will prevent zig from using it.
// .url = "https://example.com/foo.tar.gz",
//
// // This is computed from the file contents of the directory of files that is
// // obtained after fetching `url` and applying the inclusion rules given by
// // `paths`.
// //
// // This field is the source of truth; packages do not come from a `url`; they
// // come from a `hash`. `url` is just one of many possible mirrors for how to
// // obtain a package matching this `hash`.
// //
// // Uses the [multihash](https://multiformats.io/multihash/) format.
// .hash = "...",
//
// // When this is provided, the package is found in a directory relative to the
// // build root. In this case the package's hash is irrelevant and therefore not
// // computed. This field and `url` are mutually exclusive.
// .path = "foo",
//
// // When this is set to `true`, a package is declared to be lazily
// // fetched. This makes the dependency only get fetched if it is
// // actually used.
// .lazy = false,
//},
},
// Specifies the set of files and directories that are included in this package.
// Only files and directories listed here are included in the `hash` that
// is computed for this package. Only files listed here will remain on disk
// when using the zig package manager. As a rule of thumb, one should list
// files required for compilation plus any license(s).
// Paths are relative to the build root. Use the empty string (`""`) to refer to
// the build root itself.
// A directory listed here means that all files within, recursively, are included.
.paths = .{
"build.zig",
"build.zig.zon",
"src",
// For example...
//"LICENSE",
//"README.md",
},
}

30
src/main.zig Normal file
View file

@ -0,0 +1,30 @@
const std = @import("std");
const Io = std.Io;
const sand = @import("sand");
pub fn main(init: std.process.Init) !void {
var grid: sand.Grid = try .init(4, 4, init.gpa);
var gridCopy: sand.Grid = try .init(4, 4, init.gpa);
defer grid.deinit(init.gpa);
defer gridCopy.deinit(init.gpa);
grid.arr[2][0].alive = true;
grid.arr[2][1].alive = true;
grid.arr[2][2].alive = true;
grid.arr[2][3].alive = true;
grid.arr[0][1].alive = true;
grid.arr[1][1].alive = true;
grid.arr[1][2].alive = true;
std.debug.print("{f}\n", .{grid});
try grid.copy(&gridCopy);
grid.updateAll();
while (!grid.eql(gridCopy)) {
std.debug.print("{f}\n", .{grid});
try grid.copy(&gridCopy);
grid.updateAll();
}
}

129
src/root.zig Normal file
View file

@ -0,0 +1,129 @@
//! The logic of the sand
const std = @import("std");
const Io = std.Io;
pub const state = enum(u1) { Alive, Dead };
pub const leaning = enum(u1) {
Left = 0,
Right = 1,
pub fn opposite(self: leaning) leaning {
return @enumFromInt(@intFromBool(self == .Left));
}
};
pub const cell = struct {
alive: bool,
};
pub const position = packed struct {
x: u16,
y: u16,
};
pub const Grid = struct {
arr: [][]cell,
max: position,
leaning: leaning,
pub fn format(self: @This(), writer: *std.Io.Writer) std.Io.Writer.Error!void {
for (self.arr) |line| {
for (line) |grain| {
try writer.writeAll(if (grain.alive) "" else "");
}
try writer.writeByte('\n');
}
}
pub fn init(x: u16, y: u16, allocator: std.mem.Allocator) std.mem.Allocator.Error!Grid {
const arr: [][]cell = try allocator.alloc([]cell, y);
for (arr) |*line| {
line.* = try allocator.alloc(cell, x);
for (line.*) |*c| {
c.* = .{ .alive = false };
}
}
return .{
.max = position{
.x = x - 1,
.y = y - 1,
},
.arr = arr,
.leaning = .Left,
};
}
pub fn deinit(self: Grid, allocator: std.mem.Allocator) void {
for (self.arr) |line| {
allocator.free(line);
}
allocator.free(self.arr);
}
pub fn updateAll(self: *Grid) void {
for (0..self.arr.len) |y| {
for (0..self.arr[y].len) |x| {
update(.{ .y = @truncate(y), .x = @truncate(x) }, self.*);
}
}
self.leaning = self.leaning.opposite();
}
pub const copyError = error{wrongDimensions};
pub fn copy(self: Grid, dest: *Grid) copyError!void {
if (self.arr.len != dest.arr.len or self.arr[0].len != dest.arr[0].len) return copyError.wrongDimensions;
for (dest.arr, self.arr) |d, s| {
@memcpy(d, s);
}
}
pub fn eql(self: Grid, dest: Grid) bool {
if (!(self.max == dest.max)) return false;
for (self.arr, dest.arr) |ls, ld| {
for (ls, ld) |cs, cd| {
if (cs.alive != cd.alive) return false;
}
}
return true;
}
};
pub fn update(self: position, grid: Grid) void {
if (self.y == grid.max.y) return;
if (!grid.arr[self.y][self.x].alive) return;
const nextline = grid.arr[self.y + 1];
if (@cmpxchgStrong(bool, &nextline[self.x].alive, false, true, .seq_cst, .monotonic)) |_| {
if (self.x == grid.max.x) {
if (@cmpxchgStrong(bool, &nextline[self.x - 1].alive, false, true, .seq_cst, .monotonic)) |_| {} else {
@atomicStore(bool, &grid.arr[self.y][self.x].alive, false, .seq_cst);
}
} else if (self.x == 0) {
if (@cmpxchgStrong(bool, &nextline[self.x + 1].alive, false, true, .seq_cst, .monotonic)) |_| {} else {
@atomicStore(bool, &grid.arr[self.y][self.x].alive, false, .seq_cst);
}
} else {
switch (grid.leaning) {
.Right => {
if (@cmpxchgStrong(bool, &nextline[self.x + 1].alive, false, true, .seq_cst, .monotonic)) |_| {
if (@cmpxchgStrong(bool, &nextline[self.x - 1].alive, false, true, .seq_cst, .monotonic)) |_| {} else {
@atomicStore(bool, &grid.arr[self.y][self.x].alive, false, .seq_cst);
}
} else {
@atomicStore(bool, &grid.arr[self.y][self.x].alive, false, .seq_cst);
}
},
.Left => {
if (@cmpxchgStrong(bool, &nextline[self.x - 1].alive, false, true, .seq_cst, .monotonic)) |_| {
if (@cmpxchgStrong(bool, &nextline[self.x + 1].alive, false, true, .seq_cst, .monotonic)) |_| {} else {
@atomicStore(bool, &grid.arr[self.y][self.x].alive, false, .seq_cst);
}
} else {
@atomicStore(bool, &grid.arr[self.y][self.x].alive, false, .seq_cst);
}
},
}
}
} else {
@atomicStore(bool, &grid.arr[self.y][self.x].alive, false, .seq_cst);
}
}