From 7d4ffdd51141b28a52641c31db41dcd2dacf01db Mon Sep 17 00:00:00 2001 From: abux Date: Fri, 21 Aug 2026 14:08:23 +0100 Subject: [PATCH] Cleanup some stuff --- build.zig | 123 ++------------------------------------- src/board.zig | 135 +++++++++++++++++++++++++++++++++++++++++++ src/game.zig | 123 --------------------------------------- src/main.zig | 13 +---- src/root.zig | 18 ------ zig-out/bin/_2048zig | Bin 10098808 -> 10140472 bytes 6 files changed, 142 insertions(+), 270 deletions(-) create mode 100644 src/board.zig delete mode 100644 src/game.zig delete mode 100644 src/root.zig diff --git a/build.zig b/build.zig index b91fb7f..fcf6260 100644 --- a/build.zig +++ b/build.zig @@ -1,156 +1,41 @@ const std = @import("std"); -// Although this function looks imperative, it does not perform the build -// directly and instead it mutates the build graph (`b`) that will be then -// executed by an external runner. The functions in `std.Build` implement a DSL -// for defining build steps and express dependencies between them, allowing the -// build runner to parallelize the build automatically (and the cache system to -// know when a step doesn't need to be re-run). pub fn build(b: *std.Build) void { - // Standard target options allow the person running `zig build` to choose - // what target to build for. Here we do not override the defaults, which - // means any target is allowed, and the default is native. Other options - // for restricting supported target set are available. const target = b.standardTargetOptions(.{}); - // Standard optimization options allow the person running `zig build` to select - // between Debug, ReleaseSafe, ReleaseFast, and ReleaseSmall. Here we do not - // set a preferred release mode, allowing the user to decide how to optimize. + const optimize = b.standardOptimizeOption(.{}); - // It's also possible to define more custom flags to toggle optional features - // of this build script using `b.option()`. All defined flags (including - // target and optimize options) will be listed when running `zig build --help` - // in this directory. - // This creates a module, which represents a collection of source files alongside - // some compilation options, such as optimization mode and linked system libraries. - // Zig modules are the preferred way of making Zig code available to consumers. - // addModule defines a module that we intend to make available for importing - // to our consumers. We must give it a name because a Zig package can expose - // multiple modules and consumers will need to be able to specify which - // module they want to access. - const mod = b.addModule("_2048zig", .{ - // The root source file is the "entry point" of this module. Users of - // this module will only be able to access public declarations contained - // in this file, which means that if you have declarations that you - // intend to expose to consumers that were defined in other files part - // of this module, you will have to make sure to re-export them from - // the root file. - .root_source_file = b.path("src/root.zig"), - // Later on we'll use this module as the root module of a test executable - // which requires us to specify a target. - .target = target, - }); - - // Here we define an executable. An executable needs to have a root module - // which needs to expose a `main` function. While we could add a main function - // to the module defined above, it's sometimes preferable to split business - // logic and the CLI into two separate modules. - // - // If your goal is to create a Zig library for others to use, consider if - // it might benefit from also exposing a CLI tool. A parser library for a - // data serialization format could also bundle a CLI syntax checker, for example. - // - // If instead your goal is to create an executable, consider if users might - // be interested in also being able to embed the core functionality of your - // program in their own executable in order to avoid the overhead involved in - // subprocessing your CLI tool. - // - // If neither case applies to you, feel free to delete the declaration you - // don't need and to put everything under a single module. const exe = b.addExecutable(.{ .name = "_2048zig", .root_module = b.createModule(.{ - // b.createModule defines a new module just like b.addModule but, - // unlike b.addModule, it does not expose the module to consumers of - // this package, which is why in this case we don't have to give it a name. .root_source_file = b.path("src/main.zig"), - // Target and optimization levels must be explicitly wired in when - // defining an executable or library (in the root module), and you - // can also hardcode a specific target for an executable or library - // definition if desireable (e.g. firmware for embedded devices). + .target = target, .optimize = optimize, - // List of modules available for import in source files part of the - // root module. - .imports = &.{ - // Here "_2048zig" is the name you will use in your source code to - // import this module (e.g. `@import("_2048zig")`). The name is - // repeated because you are allowed to rename your imports, which - // can be extremely useful in case of collisions (which can happen - // importing modules from different packages). - .{ .name = "_2048zig", .module = mod }, - }, + + .imports = &.{}, }), }); - // This declares intent for the executable to be installed into the - // install prefix when running `zig build` (i.e. when executing the default - // step). By default the install prefix is `zig-out/` but can be overridden - // by passing `--prefix` or `-p`. b.installArtifact(exe); - // This creates a top level step. Top level steps have a name and can be - // invoked by name when running `zig build` (e.g. `zig build run`). - // This will evaluate the `run` step rather than the default step. - // For a top level step to actually do something, it must depend on other - // steps (e.g. a Run step, as we will see in a moment). const run_step = b.step("run", "Run the app"); - // This creates a RunArtifact step in the build graph. A RunArtifact step - // invokes an executable compiled by Zig. Steps will only be executed by the - // runner if invoked directly by the user (in the case of top level steps) - // or if another step depends on it, so it's up to you to define when and - // how this Run step will be executed. In our case we want to run it when - // the user runs `zig build run`, so we create a dependency link. const run_cmd = b.addRunArtifact(exe); run_step.dependOn(&run_cmd.step); - // By making the run step depend on the default step, it will be run from the - // installation directory rather than directly from within the cache directory. run_cmd.step.dependOn(b.getInstallStep()); - // This allows the user to pass arguments to the application in the build - // command itself, like this: `zig build run -- arg1 arg2 etc` if (b.args) |args| { run_cmd.addArgs(args); } - // Creates an executable that will run `test` blocks from the provided module. - // Here `mod` needs to define a target, which is why earlier we made sure to - // set the releative field. - const mod_tests = b.addTest(.{ - .root_module = mod, - }); - - // A run step that will run the test executable. - const run_mod_tests = b.addRunArtifact(mod_tests); - - // Creates an executable that will run `test` blocks from the executable's - // root module. Note that test executables only test one module at a time, - // hence why we have to create two separate ones. const exe_tests = b.addTest(.{ .root_module = exe.root_module, }); - // A run step that will run the second test executable. const run_exe_tests = b.addRunArtifact(exe_tests); - // A top level step for running all tests. dependOn can be called multiple - // times and since the two run steps do not depend on one another, this will - // make the two of them run in parallel. const test_step = b.step("test", "Run tests"); - test_step.dependOn(&run_mod_tests.step); test_step.dependOn(&run_exe_tests.step); - - // Just like flags, top level steps are also listed in the `--help` menu. - // - // The Zig build system is entirely implemented in userland, which means - // that it cannot hook into private compiler APIs. All compilation work - // orchestrated by the build system will result in other Zig compiler - // subcommands being invoked with the right flags defined. You can observe - // these invocations when one fails (or you pass a flag to increase - // verbosity) to validate assumptions and diagnose problems. - // - // Lastly, the Zig build system is relatively simple and self-contained, - // and reading its source code will allow you to master it. } diff --git a/src/board.zig b/src/board.zig new file mode 100644 index 0000000..3c8227c --- /dev/null +++ b/src/board.zig @@ -0,0 +1,135 @@ +const std = @import("std"); +const Self = @This(); + +// +// FIELDS +// + +cells: [4][4]u16 = .{.{0} ** 4} ** 4, + +/// ---------------------------------------------------- +/// ---------------------------------------------------- +fn slideRowLeft(row: *[4]u16) void { + var write: usize = 0; // where the next tile should land + + // Pass 1: copy every non-zero tile to the next free slot. + // `cell` = WHAT we're carrying, `write` = WHERE it lands. + for (row) |cell| { + if (cell != 0) { + row[write] = cell; + write += 1; + } + } + + // Pass 2: everything after the last packed tile becomes 0. + for (write..4) |i| { + row[i] = 0; + } +} + +/// ---------------------------------------------------- +/// Reverses one row in place: [2,0,4,0] becomes [0,4,0,2]. +/// Only visits the first half (i < 2) — otherwise every swap +/// would be undone by a later swap. +/// ---------------------------------------------------- +fn reverse(row: *[4]u16) void { + for (0..2) |i| { + const tmp = row[i]; // remember one cup's contents + row[i] = row[3 - i]; // pour the opposite cup into this one + row[3 - i] = tmp; // pour the remembered contents back + } +} + +/// ---------------------------------------------------- +/// Slides every row to the LEFT, closing up gaps. +/// ---------------------------------------------------- +pub fn slideLeft(self: *Self) void { + // &self.cells = iterate the REAL grid (not a copy), + // |*row| = each row by pointer, so edits stick. + for (&self.cells) |*row| { + slideRowLeft(row); // "hey, slide THIS row" + } +} + +/// ---------------------------------------------------- +/// Slides RIGHT = mirror trick: flip each row, slide left, +/// flip back. What was "toward index 0" becomes "toward index 3". +/// ---------------------------------------------------- +pub fn slideRight(self: *Self) void { + for (&self.cells) |*row| { + reverse(row); + slideRowLeft(row); + reverse(row); + } +} + +/// ---------------------------------------------------- +/// Slides UP: pull each COLUMN out into a temp row, slide it, +/// push it back. In the temp array "left" means "toward row 0", +/// which is exactly UP on the board. +/// ---------------------------------------------------- +pub fn slideUp(self: *Self) void { + for (0..4) |c| { // c = column number + var tmp: [4]u16 = undefined; + + for (0..4) |r| tmp[r] = self.cells[r][c]; // pull column out (top→bottom) + slideRowLeft(&tmp); // slide toward top + for (0..4) |r| self.cells[r][c] = tmp[r]; // push back in + } +} + +/// ---------------------------------------------------- +/// Slides DOWN: same as slideUp, but read/write the column +/// BOTTOM→top using `3 - r`. The flip makes "toward index 0" +/// in the temp array mean DOWN on the board. +/// ---------------------------------------------------- +pub fn slideDown(self: *Self) void { + for (0..4) |c| { // c = column number + var tmp: [4]u16 = undefined; + + for (0..4) |r| tmp[r] = self.cells[3 - r][c]; // pull column out (bottom→top) + slideRowLeft(&tmp); // slide toward index 0... + for (0..4) |r| self.cells[3 - r][c] = tmp[r]; // ...which is the bottom, thanks to the flip + } +} + +/// ---------------------------------------------------- +/// Spawns a new tile (2 or 4) in a random empty cell. +/// ---------------------------------------------------- +pub fn spawn(self: *Self, rand: std.Random) void { + // --- Phase 1: find every empty cell ------------------- + // Roll 0..9 once now; we'll use it at the end to decide + // 2 vs 4 (a 1-in-10 chance of a 4, like the real game). + const n = rand.intRangeAtMost(usize, 0, 9); + + // Fixed-size shelf for cell indexes. The board has at most + // 16 empties, so no dynamic memory is ever needed. + var empties: [16]usize = undefined; + var count: usize = 0; // how many slots of `empties` we filled + + // Walk all 16 cells. Flat index i maps to the grid as: + // row = i / 4, col = i % 4 + for (0..16) |i| { + if (self.cells[i / 4][i % 4] == 0) { + empties[count] = i; // remember WHERE an empty is + count += 1; + } + } + + // Self full → nothing to spawn into, just leave. + if (count == 0) { + return; + } + + // --- Phase 2: pick one empty and fill it -------------- + const pick = rand.uintLessThan(usize, count); // random 0..count-1 + const spot = empties[pick]; // flat index of the chosen cell + + const row = spot / 4; // undo the flat-index trick + const col = spot % 4; + + var value: u16 = 2; // usually spawn a 2... + if (n == 9) value = 4; // ...but our early roll said 9 → lucky 4 + + self.cells[row][col] = value; +} diff --git a/src/game.zig b/src/game.zig deleted file mode 100644 index 64ec762..0000000 --- a/src/game.zig +++ /dev/null @@ -1,123 +0,0 @@ -//! game.zig — the 2048 board and everything it can do. -const std = @import("std"); - -/// The 4x4 playing grid. A cell holds the tile VALUE directly: -/// 0 means "empty", anything else is the number shown on screen. -pub const Board = struct { - cells: [4][4]u16 = .{.{0} ** 4} ** 4, - - /// THE core algorithm: slides ONE row left, closing gaps. - /// (Merging equal tiles will be added here later.) - /// Used by every direction — right/up/down are just disguises. - fn slideRowLeft(row: *[4]u16) void { - var write: usize = 0; // where the next tile should land - - // Pass 1: copy every non-zero tile to the next free slot. - // `cell` = WHAT we're carrying, `write` = WHERE it lands. - for (row) |cell| { - if (cell != 0) { - row[write] = cell; - write += 1; - } - } - - // Pass 2: everything after the last packed tile becomes 0. - for (write..4) |i| { - row[i] = 0; - } - } - - /// Reverses one row in place: [2,0,4,0] becomes [0,4,0,2]. - /// Only visits the first half (i < 2) — otherwise every swap - /// would be undone by a later swap. - fn reverse(row: *[4]u16) void { - for (0..2) |i| { - const tmp = row[i]; // remember one cup's contents - row[i] = row[3 - i]; // pour the opposite cup into this one - row[3 - i] = tmp; // pour the remembered contents back - } - } - - /// Slides every row to the LEFT, closing up gaps. - pub fn slideLeft(self: *Board) void { - // &self.cells = iterate the REAL grid (not a copy), - // |*row| = each row by pointer, so edits stick. - for (&self.cells) |*row| { - slideRowLeft(row); // "hey, slide THIS row" - } - } - - /// Slides RIGHT = mirror trick: flip each row, slide left, - /// flip back. What was "toward index 0" becomes "toward index 3". - pub fn slideRight(self: *Board) void { - for (&self.cells) |*row| { - reverse(row); - slideRowLeft(row); - reverse(row); - } - } - - /// Slides UP: pull each COLUMN out into a temp row, slide it, - /// push it back. In the temp array "left" means "toward row 0", - /// which is exactly UP on the board. - pub fn slideUp(self: *Board) void { - for (0..4) |c| { // c = column number - var tmp: [4]u16 = undefined; - - for (0..4) |r| tmp[r] = self.cells[r][c]; // pull column out (top→bottom) - slideRowLeft(&tmp); // slide toward top - for (0..4) |r| self.cells[r][c] = tmp[r]; // push back in - } - } - - /// Slides DOWN: same as slideUp, but read/write the column - /// BOTTOM→top using `3 - r`. The flip makes "toward index 0" - /// in the temp array mean DOWN on the board. - pub fn slideDown(self: *Board) void { - for (0..4) |c| { // c = column number - var tmp: [4]u16 = undefined; - - for (0..4) |r| tmp[r] = self.cells[3 - r][c]; // pull column out (bottom→top) - slideRowLeft(&tmp); // slide toward index 0... - for (0..4) |r| self.cells[3 - r][c] = tmp[r]; // ...which is the bottom, thanks to the flip - } - } - /// Spawns a new tile (2 or 4) in a random empty cell. - pub fn spawn(self: *Board, rand: std.Random) void { - // --- Phase 1: find every empty cell ------------------- - // Roll 0..9 once now; we'll use it at the end to decide - // 2 vs 4 (a 1-in-10 chance of a 4, like the real game). - const n = rand.intRangeAtMost(usize, 0, 9); - - // Fixed-size shelf for cell indexes. The board has at most - // 16 empties, so no dynamic memory is ever needed. - var empties: [16]usize = undefined; - var count: usize = 0; // how many slots of `empties` we filled - - // Walk all 16 cells. Flat index i maps to the grid as: - // row = i / 4, col = i % 4 - for (0..16) |i| { - if (self.cells[i / 4][i % 4] == 0) { - empties[count] = i; // remember WHERE an empty is - count += 1; - } - } - - // Board full → nothing to spawn into, just leave. - if (count == 0) { - return; - } - - // --- Phase 2: pick one empty and fill it -------------- - const pick = rand.uintLessThan(usize, count); // random 0..count-1 - const spot = empties[pick]; // flat index of the chosen cell - - const row = spot / 4; // undo the flat-index trick - const col = spot % 4; - - var value: u16 = 2; // usually spawn a 2... - if (n == 9) value = 4; // ...but our early roll said 9 → lucky 4 - - self.cells[row][col] = value; - } -}; diff --git a/src/main.zig b/src/main.zig index 2f243a4..ae9279b 100644 --- a/src/main.zig +++ b/src/main.zig @@ -1,10 +1,9 @@ //! main.zig — program entry point: sets up a board and shows it. -const game = @import("game.zig"); +const Board = @import("board.zig"); const std = @import("std"); pub fn main() !void { - // `var` (not const) because the board changes during play. - var board: game.Board = .{}; + var board: Board = .{}; // Random number generator. The seed (42) makes every run // identical for now — handy for debugging, we'll fix it later. @@ -13,21 +12,15 @@ pub fn main() !void { board.spawn(rand); // drop one starting tile onto the board - // --- TEMPORARY test setup --------------------------------- - // Hand-made rows to check the slide functions while we build. - // Once the real game loop exists, this block gets deleted and - // the board starts empty (two spawned tiles, like real 2048). board.cells[0] = .{ 2, 0, 2, 0 }; board.cells[1] = .{ 0, 4, 4, 0 }; board.cells[2] = .{ 2, 2, 2, 2 }; board.cells[3] = .{ 0, 2, 0, 4 }; board.slideUp(); // ← swap in any direction to test it - // Print the grid row by row. `{d:4}` = decimal, 4 chars wide, - // so the columns line up. for (board.cells) |row| { for (row) |cell| { - std.debug.print("{d:4}", .{cell}); + std.debug.print("\x1b[31m{d:4}", .{cell}); } std.debug.print("\n", .{}); } diff --git a/src/root.zig b/src/root.zig deleted file mode 100644 index 5a71250..0000000 --- a/src/root.zig +++ /dev/null @@ -1,18 +0,0 @@ -//! By convention, root.zig is the root source file when making a package. -const std = @import("std"); -const Io = std.Io; - -/// This is a documentation comment to explain the `printAnotherMessage` function below. -/// -/// Accepting an `Io.Writer` instance is a handy way to write reusable code. -pub fn printAnotherMessage(writer: *Io.Writer) Io.Writer.Error!void { - try writer.print("Run `zig build test` to run the tests.\n", .{}); -} - -pub fn add(a: i32, b: i32) i32 { - return a + b; -} - -test "basic add functionality" { - try std.testing.expect(add(3, 7) == 10); -} diff --git a/zig-out/bin/_2048zig b/zig-out/bin/_2048zig index 3c8109bdc389d1abf8d5dc3038452242e59f8d55..dda88d01ac33a660d7f3e8008270a16408b85ed8 100755 GIT binary patch delta 2104845 zcmce}3M%~W=iKk77X4noe}32X%XR7fdS3VajB|2w&dI3$5&SCl zz;EBg`cll%>dl>YdBT;#cvys~Y0MmGHkv953zx~FIEkTZ7IriDLtK2go8eV#+E0_2 zDCdRfVe}iWAoovWSmAA9lnK?b8TE<%KRQxBf32x^yFq`tWmXIt&I=hdeBXnnd{aEO zYmUEd%+Pku1-y06u2n{Hw3UA6s8;R$u9(g(97{Oo7+9sZ*%8yhABeHGodY>%Aa{7f ze>!Gpi^e(rbn8{esMH$UzXf)L++aP_zjLA<*lLRRyJOon$0pJy`!~d9$B5o0-LYbE zNB@VhsR@?eyxWAod0cj4U>!FD%X=B?+g5F&!S3sn==a@DW5rp__CNjC$K9CV8))nc zVfVMya#~z^W{goj`j1Zfn0=L9{cbI#Mf4k&A&>9TSOzt#`9M2;O!MAJ{;xD^i{I`~ zG74@Thyq))ISD-r4JY>aH#Zw?u4*I8yZV1@*0K4z&3q&{?qfGJzGK4H7kKr{{L|ud zT3mT&Yoqg@vBrQM{JZ0==F6)5FUF7R;QNLbye-N-I#cCi{;mlF&9kfgmnV#B5%kJu zSctoXSuVH3zTFAYR{nSHwd~(sU~(tyOX)GD*|@GEt$kZlJ8e#jxpA{w2r+nwNjB{% zY3+p=k}0~hkua2?xddCBFek^f9@b)b+-1~Elg)iQ`rTma*432Oer7Ta(_(guC&$uA zS7ZuviYoPw9FSt3ne3lCpuVC@b7h5?+t`g}H@eMhvLYH~zHIWiLR=-6VRUXGXJ0_g zR{xB(uxU?>mhYc7p#8qd1E<8aT+&7ev*`bMvPf#b@4g`pEhalJ&wn;^+V~Sag{aT9 zi5ut;sZUGK70r7KQIe4^UXd{^Ta@<^qD&@!l#rb%Y(s?@J%7N0qN>W;I%|EdnB>1X zt9x>>O$hreS5aM6O~174L6qn(me_>e_JOwT_3rZ$Ey*Qmv`GUN6qJ`Os_d86-&#+z zRHX^MN7uw;^YiKcO<76ZGt#-|$Lar!rra0l|BM#zQTBlhV^m&^T7XLKrR0Fd3ICmK z7)4#vvKP=cSVj|OO4=yVHuj(I8aV&~J$wPh<@;uUg@jk5LBNVjF?E|C3Kpp|E|PVACT zQjYlYsm4J{()!bL^ZX$pDhldKhg?EW<;kP}WT`psb?THO{+w*mH(L|icckaCzvz60 ziAG9G7d;Kg5^biK^ab4$lVhR_jJjmIWuZ|bvSiFk7e^=-RaLml%3U@2HFZNuDhh@a z7mMa4COST{#ZZdaFnQR7Hu|l(U7Hz`g?C8Sa&7&^4|f}wo!MU$-A~xVd}5C@erIlM z&$?YvY0T;0XW9++@#}lvcZt_Dima%6fyuNE#t0U5p+}F)b}i ztRPUeX<4%P1~T&*{YF)~O-!9gWP->Dl7lDRPPo z5kK{xKE_egmc)F6Mmo*(ipdeO zMDJ=@nJK=!&TKqsDRSRExyI;~Au{OPS)Y|54(Xgt&PeYs-q%T{XNrN_WXupnJ2~k| z%kD2;-YL7<#GzfZSYDj%UYa7CwwYp+olP6PTN?E`rTtH8>>jxuTG04?1X-Elt%DTP zvxGe)6Y1jWkK|s+FRQE*s|cAYzbEn+4ey}a9f`5}!W$B`SaIeDv%g??vhH;xHn%nW-9`ufGQ!%rn);$T>(%lsL8pW?>$T$a1=+Kc-!iOjY5%=uYHiouhm`y&7J&23)%d09E6<5_4mb*m1w*J8Ij$EQnWc0Ef zX7pJgU%}(r#^^`dB_?_b$Tcp8&VN{pN0z29D3NEzO<;Pl?UI*k%9ok`wr^rK^MhlGpv%DtSTEqcTtTGf67Xh|U&+&wF?>x4X8CO!S6 zNAo!^LMV?YT1iwE8`p}n22nS2d#Nbbf`EDu$;ZBgQE$gt+WhO`kB&=;k56dcqGhYr zZTyz;cKy(8rdD);65apbAG+y}sa87Go6Iq>aauDqgr#k}_K6*ml2bZ%>fEJkx9-N& zP5#xqi~qDK$sZUWF*C-+ccrxdvAASClF~ZS6xFZWv~;N7J~sZAOUg|z`YSHU)qhTC z-Ci&D#n}Abc^UfjjjfXW5mU1ccHDsST@8&grv1trsY7y~@tE-(-KxBas^liC5VbaH*B5ZlKeyfoK5!ldtfrm|aUU+c0`I@elD%3S5e*1jumG>>bgnH$>qupM+sHy)|< z@5H{=vRZ3FQC-zMwL{uC%Oj z(a?Eii{!O$-&2>hNYGYPE_KzU`Cq;A3UhITzs>Yc?aIrmmgUp^Lup-pdRBIRVOgEO z>-3Hb3zjyd4{C13V@P2|*~P7kk~IaDMWrQl<*ll0QdLx5QeIzMTIH_0NUm_zRQU%^ zpX1*(z03GQS3_M*lXOWzZC!p@MFrjN{4=>B%U2XtHXX>26;(?MUH(1O2X`qdC@-kV zuPrSrsmre@s9jRqq`yA@vDRG&G!aJMrN)g_eo1Y0%|+u@6!<@#J|Xkp^Ho$dG#SB| zxM_P?L0Mgcf8mS~n!Bc?sC1cs(~Qn>HN~|qmw)GsF80F0{9>0ozp%ztu!NqJCOvCQ z3!1j%vr$`GUfk4G6uA9g%vc=b$}I4Yn>oFAQIljtZNXC4#k<&0wf^lhkC|-#g|j-F z)6)GbW?j|T*!RmUSIok~s)Cy0A#|+CBlDE}SChvX@E~hRRefc#^>eiCbViVmcn?&(b9MIZ5{7FFxKJ^UlniqML$xU z+TFZ5Mvr!;H$RpI@upJ$v`f19M~-c;JO9@!-tSnDqJK5cWYMh)%vS$b3oQQK3#|SV z`4)d*jKy50>CX&`>DKlZwGf=PTIg*Tn7iv zU9297^hz;KPx@CAOcwvg^iN>C#XP}ej4Ih=^`Fcis@o5y#wXw4iI&rHj|8K^1cde^b7g z8XNlxQB=O7wk$n=k*m^G<0&f=!{}6$pI=f^TSo<7tA?yD=uZ=s)XGtI5E@0)RZJZq z8%1?1WRLTzA$u$xNaNS7kUbtFG>T-8xr2;GxzXbUHE0pC$P+Ud3E8`W8>LI~OA5-$ z#ag3T;i{;0)#VqJE)iD_k;NqFmFF_dc{0>4axcGxP8#A{I`oRFs8QD7DxU1BTvS&o zGU(E1bfO}o&vV11plf(#QGtgCE~gJR3{_OXB7Q_;4SH==Mh!E3B+oUyqM*DSbIpXC z?5eGuQCd(*w*&j2(z0h%acNmaS)Eu*?~!PwU6x;2P`SvJDXgP;w6O(6OP0}#vQ``! z?YC4U_sz;q6W=0vNmUK!7T8f;URAWDR@`f+cX0g^JI;BNJa&(}K9I)o-OR%Hg+Hb}_GWaFJLvP3T9KB_zdcx>D%X%M#kh<%+)3 zftli2iFEtW(KdtT=UH40MYOXPx$>uo*)xpF4xV$AZd^t!z58|L(*kO`~NF5 z#iZH)sZ1A7k;I%l7 zEe-vrDot#fuX_3u+-=Q&UgbBrlVWqlqYDhk6h#XSNEgZZ1j#X?m6KxoTdHGYvxU1r zvTk3R5NGaOD7jfdLw=@s-eA2=x5PMebrILcnHLuO-POr4+2V-5sydk_DK8 z4SKN3KaJYOZlj$hrd9i|t4T3GUPD0+nO|!F-HX>5kS?B(kYpBj`O|8XG#c{EQlX#j znwUrjRA3p9p6CW3o$44nv=ImCYEimh{DHb8&rV7g(Mz!=-?$SL zgKnVmvZdo(W#zbdWaQ?giCLt}%PI=T(Y3iw?4=f+Y%AP!7gte8?*^u==Jf2E0=Kw< z8gzQAFRW7O+BKZMluiU2!PANNuHj87E^aJ+X}u71GlID@ZS>x}%?7Dz{!!WD;f->N zdRnNfEK~fX8?B0}V%fTS7k$E2SvN+0KvhBeLu@BebVWhKWliOSQo73Y=*+~9@tL;F z9C2!w(C_S%nAj}SmXReQyXbtFG>zCMe&P|wF0XS}ec!nDCsu`t77X)70mk0fiE$!SjohFETN_u+VOZTzDLk$DV=|k4wQabzPWr~xM z=tHCoG4l`|CpA?Sm(aPPPSjE>pALsQS7mWSiM)7!Nyg}2Em99R4qI0uukx!%)KziM zyZ%Wwh&Ip2we+I9eKGhM^cUYsDyS?KDbE^EF2+AgyQP0(hXEP%0fCQfNkL(4wdfy` z^Uxt6=bvCS%IhSrKg#u5Mpmx4?WmkX%b-sv_DJmH$xgTBh}dJs;0@w)noVl;jVJEM)qMoR_zKY(b)QZ)_7q8Kl znJB8jA@m(0boyzctPsx@SyBgg8lxB#_U;n=rk&`7hzj<+WR$gwV zNOU??+vdAU0cm6#W?ed<6yritMtj>km;65*#d9Rk%N^M3}2uRk+lafw*;xj`i&_Dgx?FD|RE5Q&6p|A|+cG)lyMUr|+k zIh{*iCZbaUz3nL#J-?y-N>ncTdA{QU`mDlBC~dVk_md&%V~b0E2Ibeu8?+m#$%8bA z&c7QeI`xbpk{w0iIYZIM71t6;RU)STMO0QGR*Aiiy9fcQJnh$SL7$$)ZEOi&}= z-;{{`NhS|%kI^a>R8nNH&OwO*+paF(pH~5;{MYiuJ^j z%Ed9mx~k>N`&-y*aZ8R#R94l{Ym&~wIH2>=vhu`XO7I{JBAmyAh}(ym=+2YgbXydLw?JlVNoBw3j*5%Ki7%0>C~%ye-X$y&OS(2HNqm`)c97il?T8J#M} zjFenyJYS{6O~=SiqmNe~Ao=ex=%e`KBRz8JGJ2_v81sKrWQfV6d6ot-WbA)SveU)o zq~#c*)3~OaOJX#Mf6tnoA?A~o9ZG~_Jk2kMFK8$gk55$GAa1=(mJ~FIy33o6Nn$$* znJE#=CK*&B9w#scDHYk14OcE!5|q_mbmE~MkuC0(1vUSi`#gD>^l^EA`tstROMYG^ zolmEelJBhK`qggFq}{%nd~tEUJgLw*W9Ss4RZv_kTLsjjwb5ZRTWyL6%ryy0)A_fU zJ`9n^j;wrQKCGvBaeZx_%jkaZf{WLdmq~AuaOj^t~X+dn0>>4j?^^zhQuaHR~cvjQn8hxT6k|XOoO;(odIIg z1|yb;=uHNA%0*-&Z7aP#s>RZq<&x+gv92gXM0fmW7P=Xr?_BSY9WOeT=-a%UZ1D*t zjNT2@`-*$eD5k~@_cu9yjL&w`GU&U+mq>ez;|d2*8tHT)cK;s}WYAGEn-azZwKV38 zJ#^@nEhYMjsPX8;=$YAK_(RbD3{I=RM%pH?a*zC^DJ>&2OKhXef3_=wzH#`G62`Qp zG})xRvO%w9xr=%oK|^kF`SWPVE$;g=8gi*K!zOu4L3HA@oc%I7k9|rc$0;e7qlVv- zEqB$jGWjvp?zdG--V0a1qgwL9GWK27lJ|ipsU>^OA@1~^%E%AE#(!WEv#V-~^D{&t zq5jE|#18$k((=S>A0k0tnkY;ctv`ZI6N5f7>0^2%wjZ2D-`dS0&qqW_hS>ZK8V%HF z`K!Db$|=MELSuqY|;k*K9a z-JfWbQscY7Xkf=piQTmvo9Om8cS)q{!GynM741{Gl0zmlSHEm-U==g0xc9?>d|8}dkvOP5?v*C-k+ zUEE1c`3Ad$?t?!vQq+=z-JdDzs3EKF&T8x=kJKBo8=G>-B{_{vdAwhfi=ML7mS;|v z6A&KAgO`0uhtYS;auJjhd#Qmn$*Eh8@Y`kxXbS`N|U)LKKiGsTN zN>>@(9OT*k)$5W|^5~L(o4rZWcz^LECv!5>MCzC($vXMw!#>97nM-$GcQ#EH%jDZ* zDKPLNu12KiRh$@l5`_~?G#SZeMb-a z*1t*5(h`w1%~+7UvTmE!Bv~i7^MxxpnUy25reBn#IlrCG$=ozCcg96Yn)AX8-cEXR zUorEdB+c1omP{t+((ZH3YLYCLbI$UQS(lQWOLx6TXJ3?~DQEcI>rzs3=>qb~oQrZa z!hBBBbK<<}qNLo)t2jw-_Gd4+C`ogE zy?~QBbmm-mQIh6-GoN;Q_YQeE!b88Tz+N{FpG`&nX&X~IWM+uJiyAY=;nA^}GRaBl z^dzq+ZcG^mN3fWN>zbTlqrEoI)tGb11LwNM$kAQ5ZAp_HZNT>xGMAZQ%gLor5u4;_ z{q5Xld3#e(cL{y?GPZ0HeS#z&B_}`i5+~iVW3P-fTc#LPZKgND1;w&p265xo&~}cl zHMWLsbnmKd%ovBy={h4rPvz+PCK+1PnR+8b9{?0BZIYoSb)=uw(Z0z`6Kj?=$m%DLNN_x4cP;X7aA!6#W|H?20BSn(DySGSwlSK5j|7rb&wC z`or(on39xEm#8V%HfD^2W%5d6Jb91t@X97Bn#%6s6um=#$kQZ6Q`x;TH6$Z5R~+;< zNzqizuBYdq$$N&hj0}3F#*@`e6^UIv8F_TsqZaM*vWEJ~+J+KWnTT24RMeG;4=xh) zS<}HAn^w?gMZ?zqBkD>>ynd0OG0N99t)Ma1lIU>JXE~YltEEF^jiq&z?__4LZ`z5L zHf*z6c@{nKQEI7`7t57Dyrrq2S@&&iDrnXNw>A~D&`0J_J2mKm5Zpqy{Vu@)b401Xb}x}G!?Xn8+QJC5jk|k zzfShzMP$%DKwJ9#Qqx5&%%SxjBdPX8sa(X!yP67GM9$q!1ubI4Jxv8IBIjPZ*f)N7 zOt+%8T(SIKx>6;_XXIsz$0#kInQo)$GtVpTLuccF@jTGjqJgJ9*w~^`5A8v#u7pGCmUNd$m#u!Et>AF1C1@3?!$u@ zZ$vh|?``%JkKCm!Q=Z@Mrlzs4jAv`Y(~T_}dfYROEgE{_vyCkp`gLj*8mBRNLc7HH zH2Kod#nZ`~v}$s4L%Mh}>31OF6g7?KOP=0hj$lONNm}_FTJ%A5nW#F}n4?zN@x~Ud z;MENL)4x_#@FCPMc4^i?x| z4sP5wxlc7o%K-+SZWP5Ovi{g>O@yp?CB1+$&oF{)#Wqp20dTD-{%jFVX-jem| z^JIBTbmiOsm|ElW_PlqR8hPL4c(L9Up6|0Ml%MgJ8lPOx z`=Du&9HqmDYLpVOj##a%)YvxrN5;K%)ts_S{_?%7$oP^r<6~J#cimNW^kvE6kNx2- z$)4{TWiiS6h$^Y2)(+KLT3ePONZa{JAk=VeL{`cf7GBbEChY8*j>p6$CUb zp&a^Gqg79z=+)7*qra3n`9+Z-GR0aF)LK?ntUf_Z%gpo8b?0?TppFJJ-uq_e(T8{2 zzcD(9t>3DV<~BV%jE{A($6MoFBi`#Q^RH1=trtwlQwq09A(cB zT;pk4ltDL>KN^0Ha1$8Sa%WqkvLQcGpvI-Df$hrq$yjE-{JC+Em^WH3c z`7sHqB`ZHOS}4qK9wX)u%b&SyBIdV<)acSeHVSK(6&S;B`ll(!|Bjl4wH`{!j#|sc zS~=Y+ZkE;6xacQ*wJtenn^s0iqmzTwlcUeaQ6&eu?O#=LwBD^{Pj{8ONPdSb$J(XL zd_&2h{vxGH