chore: zig 0.14.0-dev.121+ab4c461b7

README.md

@@ -31,7 +31,7 @@ A small/lightweight statically typed scripting language written in Zig
 
 ## How to build and install
 
-_Latest zig version supported: 0.13.0-dev.347+30a35a897_
+_Latest zig version supported: 0.14.0-dev.121+ab4c461b7_
 
 ### Requirements
 - Since this is built with Zig, you should be able to build buzz on a wide variety of architectures even though this has only been tested on x86/M1.

build.zig

@@ -98,7 +98,7 @@ fn getBuzzPrefix(b: *Build) ![]const u8 {
 pub fn build(b: *Build) !void {
     // Check minimum zig version
     const current_zig = builtin.zig_version;
-    const min_zig = std.SemanticVersion.parse("0.13.0-dev.347+30a35a897") catch return;
+    const min_zig = std.SemanticVersion.parse("0.14.0-dev.121+ab4c461b7") catch return;
     if (current_zig.order(min_zig).compare(.lt)) {
         @panic(b.fmt("Your Zig version v{} does not meet the minimum build requirement of v{}", .{ current_zig, min_zig }));
     }

src/Token.zig

@@ -57,7 +57,7 @@ pub fn getLines(self: Self, allocator: mem.Allocator, before: usize, after: usiz
     const before_index = if (self.line > 0) self.line - @min(before, self.line) else self.line;
     const after_index = if (self.line > 0) self.line + after else self.line;
 
-    var it = std.mem.split(u8, self.source, "\n");
+    var it = std.mem.splitScalar(u8, self.source, '\n');
     var current: usize = 0;
     while (it.next()) |line| : (current += 1) {
         if (current >= before_index and current <= after_index) {

src/memory.zig

@@ -186,7 +186,7 @@ pub const GarbageCollector = struct {
     next_gc: usize = if (builtin.mode == .Debug) 1024 else 1024 * BuildOptions.initial_gc,
     next_full_gc: usize = if (builtin.mode == .Debug) 1024 else 1024 * BuildOptions.initial_gc,
     last_gc: ?Mode = null,
-    objects: std.TailQueue(*Obj) = .{},
+    objects: std.DoublyLinkedList(*Obj) = .{},
     gray_stack: std.ArrayList(*Obj),
     active_vms: std.AutoHashMap(*VM, void),
     // Obj being collected, useful to avoid setting object instance dirty while running its collector method
@@ -403,7 +403,7 @@ pub const GarbageCollector = struct {
     }
 
     fn addObject(self: *Self, obj: *Obj) !void {
-        const new_node = try self.allocator.create(std.TailQueue(*Obj).Node);
+        const new_node = try self.allocator.create(std.DoublyLinkedList(*Obj).Node);
         new_node.* = .{
             .data = obj,
         };
@@ -937,7 +937,7 @@ pub const GarbageCollector = struct {
         const swept: usize = self.bytes_allocated;
 
         var obj_count: usize = 0;
-        var obj_node: ?*std.TailQueue(*Obj).Node = self.objects.first;
+        var obj_node: ?*std.DoublyLinkedList(*Obj).Node = self.objects.first;
         var count: usize = 0;
         while (obj_node) |node| : (count += 1) {
             if (node.data.is_marked) {

src/obj.zig

@@ -60,7 +60,7 @@ pub const Obj = struct {
     is_marked: bool = false,
     // True when old obj and was modified
     is_dirty: bool = false,
-    node: ?*std.TailQueue(*Obj).Node = null,
+    node: ?*std.DoublyLinkedList(*Obj).Node = null,
 
     pub inline fn cast(obj: *Obj, comptime T: type, obj_type: ObjType) ?*T {
         if (obj.obj_type != obj_type) {

src/vm.zig

@@ -1459,7 +1459,6 @@ pub const VM = struct {
             switch (err) {
                 Error.RuntimeError => return,
                 else => {
-                    std.debug.print("{}\n", .{err});
                     self.panic("Out of memory");
                     unreachable;
                 },