mirrors/zig
1
0
Fork 0
mirror of https://codeberg.org/ziglang/zig.git synced 2025-12-06 05:44:20 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1

Merge 7712d03491 into 9082b004b6

Browse source
This commit is contained in:
Андрей Краевский 2025-11-23 22:57:18 +00:00 • committed by GitHub
commit c3825fcb35
No known key found for this signature in database
GPG key ID: B5690EEEBB952194
1 changed files with 42 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

44
lib/std/mem.zig
View file

@ -4097,7 +4097,9 @@ pub fn replaceScalar(comptime T: type, slice: []T, match: T, replacement: T) voi
}
}
/// Collapse consecutive duplicate elements into one entry.
/// Collapse all consecutive occurrences of `elem` into one entry.
///
/// See also `collapseRepeatsAll`
pub fn collapseRepeatsLen(comptime T: type, slice: []T, elem: T) usize {
if (slice.len == 0) return 0;
var write_idx: usize = 1;
@ -4111,7 +4113,9 @@ pub fn collapseRepeatsLen(comptime T: type, slice: []T, elem: T) usize {
return write_idx;
}
/// Collapse consecutive duplicate elements into one entry.
/// Collapse all consecutive occurrences of `elem` into one entry.
///
/// See also `collapseRepeatsAll`
pub fn collapseRepeats(comptime T: type, slice: []T, elem: T) []T {
return slice[0..collapseRepeatsLen(T, slice, elem)];
}
@ -4135,6 +4139,42 @@ test collapseRepeats {
try testCollapseRepeats("//a///a////", '/', "/a/a/");
}
/// Collapse consecutive duplicates into one entry.
///
/// See also `collapseRepeats`
pub fn collapseRepeatsAll(comptime T: type, slice: []T) []T {
if (slice.len == 0) return slice;
var write_index: usize = 1;
for (slice[0 .. slice.len - 1], slice[1..]) |elem, next| {
if (elem != next) {
slice[write_index] = next;
write_index += 1;
}
}
return slice[0..write_index];
}
test collapseRepeatsAll {
try std.testing.expectEqualSlices(u8, &.{}, collapseRepeatsAll(u8, &.{}));
{
var array: [1]u8 = .{0};
try std.testing.expectEqualSlices(u8, &.{0}, collapseRepeatsAll(u8, &array));
}
{
var array: [2]u8 = .{ 0, 0 };
try std.testing.expectEqualSlices(u8, &.{0}, collapseRepeatsAll(u8, &array));
}
{
var array: [2]u8 = .{ 0, 1 };
try std.testing.expectEqualSlices(u8, &.{ 0, 1 }, collapseRepeatsAll(u8, &array));
}
{
var array: [10]u8 = .{ 1, 0, 1, 1, 10, 10, 10, 0, 0, 0 };
try std.testing.expectEqualSlices(u8, &.{ 1, 0, 1, 10, 0 }, collapseRepeatsAll(u8, &array));
}
}
/// Calculate the size needed in an output buffer to perform a replacement.
/// The needle must not be empty.
pub fn replacementSize(comptime T: type, input: []const T, needle: []const T, replacement: []const T) usize {