jimzah/zig
1
0
Fork 0
mirror of https://github.com/ziglang/zig.git synced 2024-11-26 23:22:44 +00:00
Code Issues Actions 1 Packages Projects Releases Wiki Activity

EnumMap: fix init

Browse Source
This commit is contained in:
Jacob Young 2024-05-26 12:33:42 -04:00 committed by Andrew Kelley
parent 2d4b264527
commit 6e469bc44d
1 changed files with 14 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
lib/std/enums.zig
View File

@ -452,7 +452,7 @@ pub fn EnumMap(comptime E: type, comptime V: type) type {
values: [Indexer.count]Value = undefined,
/// Initializes the map using a sparse struct of optionals
pub fn init(init_values: EnumFieldStruct(E, ?Value, null)) Self {
pub fn init(init_values: EnumFieldStruct(E, ?Value, @as(?Value, null))) Self {
@setEvalBranchQuota(2 * @typeInfo(E).Enum.fields.len);
var result: Self = .{};
if (@typeInfo(E).Enum.is_exhaustive) {
@ -652,6 +652,19 @@ pub fn EnumMap(comptime E: type, comptime V: type) type {
};
}
test EnumMap {
const Ball = enum { red, green, blue };
const some = EnumMap(Ball, u8).init(.{
.green = 0xff,
.blue = 0x80,
});
try testing.expectEqual(2, some.count());
try testing.expectEqual(null, some.get(.red));
try testing.expectEqual(0xff, some.get(.green));
try testing.expectEqual(0x80, some.get(.blue));
}
/// A multiset of enum elements up to a count of usize. Backed
/// by an EnumArray. This type does no dynamic allocation and can
/// be copied by value.