Zig 0.17.0-dev (Split by item)

Shortcut keys
?
Show these tips
S
Focus search field
Esc
Clear focus & close tips
U
Jump to source code
↑
Move up in search results
↓
Move down in search results
↵
Go to active search result
This is an example of documentation generated by ZigDoc, an alternative to Zig's built-in Auto Doc feature. See also examples in other modes/formats. The project being documented here (as the example) is the Zig standard library. Public Function

initEnum

Public Function
std.static_string_map.StaticStringMapWithEql.initEnum
pub inline fn initEnum() Self

File

static_string_map.zig:106
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
        pub inline fn initEnum() Self {
            comptime {
                var self: Self = .{};

                const field_names = @typeInfo(V).@"enum".field_names;
                if (field_names.len == 0) return self;

                // Since the KVs are sorted, a linearly-growing bound will never
                // be sufficient for extreme cases. So we grow proportional to
                // N*log2(N).
                @setEvalBranchQuota(10 * field_names.len * std.math.log2_int_ceil(usize, field_names.len));

                var sorted_keys: [field_names.len][]const u8 = field_names[0..field_names.len].*;
                var sorted_vals: [field_names.len]V = undefined;
                for (&sorted_vals, @typeInfo(V).@"enum".field_values) |*x, i| x.* = @fromBackingInt(@intCast(i));

                for (field_names) |field_name| {
                    self.min_len = @min(self.min_len, field_name.len);
                    self.max_len = @max(self.max_len, field_name.len);
                }

                mem.sortUnstableContext(0, sorted_keys.len, SortContext{
                    .keys = &sorted_keys,
                    .vals = &sorted_vals,
                });

                const final_keys = sorted_keys;
                const final_vals = sorted_vals;
                self.kvs = &.{
                    .keys = &final_keys,
                    .values = &final_vals,
                    .len = @intCast(field_names.len),
                };

                var len_indexes: [self.max_len + 1]u32 = undefined;
                self.initLenIndexes(&len_indexes);
                const final_len_indexes = len_indexes;
                self.len_indexes = &final_len_indexes;
                self.len_indexes_len = @intCast(len_indexes.len);
                return self;
            }
        }