mirror of
https://codeberg.org/kaasboteram/zig-iterating.git
synced 2025-12-18 02:53:14 +01:00
Refactor test to not redeclare std.testing namespace
This commit is contained in:
parent
abaade4cdc
commit
2c091d9d22
1 changed files with 14 additions and 18 deletions
32
src/root.zig
32
src/root.zig
|
|
@ -13,15 +13,15 @@ pub fn iter(comptime T: type) type {
|
||||||
}
|
}
|
||||||
|
|
||||||
test fromSliceOwned {
|
test fromSliceOwned {
|
||||||
const testing = @import("std").testing;
|
const expectEqual = std.testing.expectEqual;
|
||||||
|
|
||||||
var it = iter(i32).fromSliceOwned(&.{ 1, 3, 2, 4 });
|
var it = iter(i32).fromSliceOwned(&.{ 1, 3, 2, 4 });
|
||||||
|
|
||||||
try testing.expectEqual(1, it.next());
|
try expectEqual(1, it.next());
|
||||||
try testing.expectEqual(3, it.next());
|
try expectEqual(3, it.next());
|
||||||
try testing.expectEqual(2, it.next());
|
try expectEqual(2, it.next());
|
||||||
try testing.expectEqual(4, it.next());
|
try expectEqual(4, it.next());
|
||||||
try testing.expectEqual(null, it.next());
|
try expectEqual(null, it.next());
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn range(start: T, end: T) Iterator(Range(T)) {
|
pub fn range(start: T, end: T) Iterator(Range(T)) {
|
||||||
|
|
@ -39,19 +39,15 @@ pub fn iter(comptime T: type) type {
|
||||||
pub const empty: Iterator(Empty(T)) = .{ .inner = .{} };
|
pub const empty: Iterator(Empty(T)) = .{ .inner = .{} };
|
||||||
|
|
||||||
test empty {
|
test empty {
|
||||||
const testing = @import("std").testing;
|
|
||||||
|
|
||||||
var it = iter(i32).empty;
|
var it = iter(i32).empty;
|
||||||
|
|
||||||
try testing.expectEqual(null, it.next());
|
try std.testing.expectEqual(null, it.next());
|
||||||
}
|
}
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
test iter {
|
test iter {
|
||||||
const testing = @import("std").testing;
|
const allocator = std.testing.allocator;
|
||||||
|
|
||||||
const allocator = testing.allocator;
|
|
||||||
|
|
||||||
const arith = struct {
|
const arith = struct {
|
||||||
fn is_square(x: i32) bool {
|
fn is_square(x: i32) bool {
|
||||||
|
|
@ -73,7 +69,7 @@ test iter {
|
||||||
|
|
||||||
defer allocator.free(items);
|
defer allocator.free(items);
|
||||||
|
|
||||||
try testing.expectEqualSlices(
|
try std.testing.expectEqualSlices(
|
||||||
i32,
|
i32,
|
||||||
&[_]i32{ -100, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 },
|
&[_]i32{ -100, 1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 },
|
||||||
items,
|
items,
|
||||||
|
|
@ -180,15 +176,15 @@ pub fn Iterator(comptime Inner: type) type {
|
||||||
}
|
}
|
||||||
|
|
||||||
test zip {
|
test zip {
|
||||||
const testing = @import("std").testing;
|
const expectEqualDeep = std.testing.expectEqualDeep;
|
||||||
|
|
||||||
var it = iter(i32).fromSliceOwned(&.{ 1, 2, 3 })
|
var it = iter(i32).fromSliceOwned(&.{ 1, 2, 3 })
|
||||||
.zip(iter(i32).fromSliceOwned(&.{ 4, 5, 6 }));
|
.zip(iter(i32).fromSliceOwned(&.{ 4, 5, 6 }));
|
||||||
|
|
||||||
try testing.expectEqualDeep(.{ 1, 4 }, it.next());
|
try expectEqualDeep(.{ 1, 4 }, it.next());
|
||||||
try testing.expectEqualDeep(.{ 2, 5 }, it.next());
|
try expectEqualDeep(.{ 2, 5 }, it.next());
|
||||||
try testing.expectEqualDeep(.{ 3, 6 }, it.next());
|
try expectEqualDeep(.{ 3, 6 }, it.next());
|
||||||
try testing.expectEqualDeep(null, it.next());
|
try expectEqualDeep(null, it.next());
|
||||||
}
|
}
|
||||||
|
|
||||||
pub fn toOwnedSlice(self: Self, allocator: std.mem.Allocator) ![]const Item {
|
pub fn toOwnedSlice(self: Self, allocator: std.mem.Allocator) ![]const Item {
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue