mirror of
https://codeberg.org/ziglang/zig.git
synced 2025-12-06 13:54:21 +00:00
d29871977f
We already have a LICENSE file that covers the Zig Standard Library. We no longer need to remind everyone that the license is MIT in every single file. Previously this was introduced to clarify the situation for a fork of Zig that made Zig's LICENSE file harder to find, and replaced it with their own license that required annual payments to their company. However that fork now appears to be dead. So there is no need to reinforce the copyright notice in every single file.
101 lines
3 KiB
Zig
101 lines
3 KiB
Zig
const std = @import("std.zig");
|
|
const builtin = std.builtin;
|
|
const debug = std.debug;
|
|
const mem = std.mem;
|
|
const testing = std.testing;
|
|
|
|
pub const line_sep = switch (builtin.os.tag) {
|
|
.windows => "\r\n",
|
|
else => "\n",
|
|
};
|
|
|
|
pub fn cmp(a: [*:0]const u8, b: [*:0]const u8) i8 {
|
|
var index: usize = 0;
|
|
while (a[index] == b[index] and a[index] != 0) : (index += 1) {}
|
|
if (a[index] > b[index]) {
|
|
return 1;
|
|
} else if (a[index] < b[index]) {
|
|
return -1;
|
|
} else {
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
test "cstr fns" {
|
|
comptime try testCStrFnsImpl();
|
|
try testCStrFnsImpl();
|
|
}
|
|
|
|
fn testCStrFnsImpl() !void {
|
|
try testing.expect(cmp("aoeu", "aoez") == -1);
|
|
try testing.expect(mem.len("123456789") == 9);
|
|
}
|
|
|
|
/// Returns a mutable, null-terminated slice with the same length as `slice`.
|
|
/// Caller owns the returned memory.
|
|
pub fn addNullByte(allocator: *mem.Allocator, slice: []const u8) ![:0]u8 {
|
|
const result = try allocator.alloc(u8, slice.len + 1);
|
|
mem.copy(u8, result, slice);
|
|
result[slice.len] = 0;
|
|
return result[0..slice.len :0];
|
|
}
|
|
|
|
test "addNullByte" {
|
|
const slice = try addNullByte(std.testing.allocator, "hello"[0..4]);
|
|
defer std.testing.allocator.free(slice);
|
|
try testing.expect(slice.len == 4);
|
|
try testing.expect(slice[4] == 0);
|
|
}
|
|
|
|
pub const NullTerminated2DArray = struct {
|
|
allocator: *mem.Allocator,
|
|
byte_count: usize,
|
|
ptr: ?[*:null]?[*:0]u8,
|
|
|
|
/// Takes N lists of strings, concatenates the lists together, and adds a null terminator
|
|
/// Caller must deinit result
|
|
pub fn fromSlices(allocator: *mem.Allocator, slices: []const []const []const u8) !NullTerminated2DArray {
|
|
var new_len: usize = 1; // 1 for the list null
|
|
var byte_count: usize = 0;
|
|
for (slices) |slice| {
|
|
new_len += slice.len;
|
|
for (slice) |inner| {
|
|
byte_count += inner.len;
|
|
}
|
|
byte_count += slice.len; // for the null terminators of inner
|
|
}
|
|
|
|
const index_size = @sizeOf(usize) * new_len; // size of the ptrs
|
|
byte_count += index_size;
|
|
|
|
const buf = try allocator.alignedAlloc(u8, @alignOf(?*u8), byte_count);
|
|
errdefer allocator.free(buf);
|
|
|
|
var write_index = index_size;
|
|
const index_buf = mem.bytesAsSlice(?[*]u8, buf);
|
|
|
|
var i: usize = 0;
|
|
for (slices) |slice| {
|
|
for (slice) |inner| {
|
|
index_buf[i] = buf.ptr + write_index;
|
|
i += 1;
|
|
mem.copy(u8, buf[write_index..], inner);
|
|
write_index += inner.len;
|
|
buf[write_index] = 0;
|
|
write_index += 1;
|
|
}
|
|
}
|
|
index_buf[i] = null;
|
|
|
|
return NullTerminated2DArray{
|
|
.allocator = allocator,
|
|
.byte_count = byte_count,
|
|
.ptr = @ptrCast(?[*:null]?[*:0]u8, buf.ptr),
|
|
};
|
|
}
|
|
|
|
pub fn deinit(self: *NullTerminated2DArray) void {
|
|
const buf = @ptrCast([*]u8, self.ptr);
|
|
self.allocator.free(buf[0..self.byte_count]);
|
|
}
|
|
};
|