diff options
| author | Vexu <git@vexu.eu> | 2020-05-13 19:04:53 +0300 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2020-05-13 19:04:53 +0300 |
| commit | 118db892bea5222a509a9f91abe560b52a5f08eb (patch) | |
| tree | 744b8c8ce8e597b05c5858b1da387cb722dff114 /lib/std | |
| parent | 76681e6b9689c4df78b6451da1aa857dc08a84d2 (diff) | |
| parent | c6420820b0aa5df8db801c9511305b009c8920e9 (diff) | |
| download | zig-118db892bea5222a509a9f91abe560b52a5f08eb.tar.gz zig-118db892bea5222a509a9f91abe560b52a5f08eb.zip | |
Merge pull request #5321 from gpanders/ascii-case-sensitive
Add helper functions and docstrings to ascii.zig
Diffstat (limited to 'lib/std')
| -rw-r--r-- | lib/std/ascii.zig | 23 |
1 files changed, 21 insertions, 2 deletions
diff --git a/lib/std/ascii.zig b/lib/std/ascii.zig index 8bd959b46d..102be18bec 100644 --- a/lib/std/ascii.zig +++ b/lib/std/ascii.zig @@ -227,6 +227,8 @@ test "ascii character classes" { testing.expect(isSpace(' ')); } +/// Allocates a lower case copy of `ascii_string`. +/// Caller owns returned string and must free with `allocator`. pub fn allocLowerString(allocator: *std.mem.Allocator, ascii_string: []const u8) ![]u8 { const result = try allocator.alloc(u8, ascii_string.len); for (result) |*c, i| { @@ -241,6 +243,23 @@ test "allocLowerString" { std.testing.expect(std.mem.eql(u8, "abcdefghijklmnopqrst0234+💩!", result)); } +/// Allocates an upper case copy of `ascii_string`. +/// Caller owns returned string and must free with `allocator`. +pub fn allocUpperString(allocator: *std.mem.Allocator, ascii_string: []const u8) ![]u8 { + const result = try allocator.alloc(u8, ascii_string.len); + for (result) |*c, i| { + c.* = toUpper(ascii_string[i]); + } + return result; +} + +test "allocUpperString" { + const result = try allocUpperString(std.testing.allocator, "aBcDeFgHiJkLmNOPqrst0234+💩!"); + defer std.testing.allocator.free(result); + std.testing.expect(std.mem.eql(u8, "ABCDEFGHIJKLMNOPQRST0234+💩!", result)); +} + +/// Compares strings `a` and `b` case insensitively and returns whether they are equal. pub fn eqlIgnoreCase(a: []const u8, b: []const u8) bool { if (a.len != b.len) return false; for (a) |a_c, i| { @@ -255,7 +274,7 @@ test "eqlIgnoreCase" { std.testing.expect(!eqlIgnoreCase("hElLo!", "helro!")); } -/// Finds `substr` in `container`, starting at `start_index`. +/// Finds `substr` in `container`, ignoring case, starting at `start_index`. /// TODO boyer-moore algorithm pub fn indexOfIgnoreCasePos(container: []const u8, start_index: usize, substr: []const u8) ?usize { if (substr.len > container.len) return null; @@ -268,7 +287,7 @@ pub fn indexOfIgnoreCasePos(container: []const u8, start_index: usize, substr: [ return null; } -/// Finds `substr` in `container`, starting at `start_index`. +/// Finds `substr` in `container`, ignoring case, starting at index 0. pub fn indexOfIgnoreCase(container: []const u8, substr: []const u8) ?usize { return indexOfIgnoreCasePos(container, 0, substr); } |
