1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
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
|
const std = @import("std");
const builtin = @import("builtin");
const block_size = 256;
const Block = [block_size]u44;
comptime {
if (@bitSizeOf(u44) != 2 * @bitSizeOf(u21) + 2) {
@compileError("u44 doesn't have expected bit size.");
}
}
const BlockMap = std.HashMap(
Block,
u16,
struct {
pub fn hash(_: @This(), k: Block) u64 {
var hasher = std.hash.Wyhash.init(0);
std.hash.autoHashStrat(&hasher, k, .DeepRecursive);
return hasher.final();
}
pub fn eql(_: @This(), a: Block, b: Block) bool {
return std.mem.eql(u44, &a, &b);
}
},
std.hash_map.default_max_load_percentage,
);
pub fn main() !void {
var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
defer arena.deinit();
const allocator = arena.allocator();
var lower_map = std.AutoHashMap(u21, u21).init(allocator);
defer lower_map.deinit();
var upper_map = std.AutoHashMap(u21, u21).init(allocator);
defer upper_map.deinit();
// Process UnicodeData.txt
var in_reader = std.io.Reader.fixed(@embedFile("UnicodeData.txt"));
while (in_reader.takeDelimiterInclusive('\n')) |line| {
if (line.len == 0) continue;
var field_iter = std.mem.splitScalar(u8, line, ';');
var cp: u21 = undefined;
var i: usize = 0;
while (field_iter.next()) |field| : (i += 1) {
if (field.len == 0) continue;
switch (i) {
0 => cp = try std.fmt.parseInt(u21, field, 16),
12 => {
// Uppercase mapping
try upper_map.put(cp, try std.fmt.parseInt(u21, field, 16));
},
13 => {
// Lowercase mapping
try lower_map.put(cp, try std.fmt.parseInt(u21, field, 16));
},
else => {},
}
}
} else |err| switch (err) {
error.EndOfStream => {},
else => {
return err;
},
}
var blocks_map = BlockMap.init(allocator);
defer blocks_map.deinit();
var stage1 = std.array_list.Managed(u16).init(allocator);
defer stage1.deinit();
var stage2 = std.array_list.Managed(u44).init(allocator);
defer stage2.deinit();
var block: Block = [_]u44{0} ** block_size;
var block_len: u16 = 0;
for (0..0x110000) |i| {
const cp: u21 = @intCast(i);
var case_prop: u44 = 0;
if (lower_map.get(cp)) |lower| {
case_prop |= @as(u44, lower) << 2 | 1;
}
if (upper_map.get(cp)) |upper| {
case_prop |= @as(u44, upper) << (2 + 21) | 2;
}
block[block_len] = case_prop;
block_len += 1;
if (block_len < block_size and cp != 0x10ffff) continue;
const gop = try blocks_map.getOrPut(block);
if (!gop.found_existing) {
gop.value_ptr.* = @intCast(stage2.items.len);
try stage2.appendSlice(&block);
}
try stage1.append(gop.value_ptr.*);
block_len = 0;
}
var args_iter = try std.process.argsWithAllocator(allocator);
defer args_iter.deinit();
_ = args_iter.skip();
const output_path = args_iter.next() orelse @panic("No output file arg!");
var write_buf: [4096]u8 = undefined;
var out_file = try std.fs.cwd().createFile(output_path, .{});
defer out_file.close();
var writer = out_file.writer(&write_buf);
try writer.interface.print(
\\//! This file is auto-generated. Do not edit.
\\
\\pub const s1: [{}]u16 = .{{
, .{stage1.items.len});
for (stage1.items) |entry| try writer.interface.print("{}, ", .{entry});
try writer.interface.print(
\\
\\}};
\\
\\pub const s2: [{}]u44 = .{{
, .{stage2.items.len});
for (stage2.items) |entry| try writer.interface.print("{}, ", .{entry});
try writer.interface.writeAll(
\\};
);
try writer.interface.flush();
}
|
