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
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
//! Schema IR — the intermediate representation between the KDL parser and the
//! language emitters.
//!
//! This is the central contract of `club-kdl-codegen`: the parser produces a
//! [`Schema`], and every [`crate::Emitter`] consumes one. Keeping the IR a
//! plain data structure (no behaviour) lets the parser and emitters evolve
//! independently.
//!
//! The IR spans three dialects, all reachable from a single [`Schema`]:
//!
//! - **data dialect** — [`TypeDef`] (`struct` / `enum`) built from [`Field`]
//! and [`Ty`]. Models standalone named *value* types (embedded, no identity).
//! - **entity dialect** — [`Record`] (`record`) and [`Relation`]
//! (`relation`), modelling persisted entities with identity and the graph
//! edges between them. These map to SurrealDB `DEFINE TABLE` statements
//! (`TYPE NORMAL` for records, `TYPE RELATION` for relations). They reuse
//! the data dialect's [`Field`].
//! - **protocol dialect** — [`Protocol`] / [`Channel`] / [`Request`] /
//! [`Event`], modelling KDL channel schemas. Payload definitions reuse the
//! data dialect's [`Field`], so an emitter writes field-rendering logic once
//! and it applies to standalone types, entities, and channel payloads.
//!
//! The distinction between a `struct` and a `record` is **identity**: a
//! `struct` is an embedded value type (no `id`, never becomes a table), while
//! a `record` has an `id` and becomes a first-class table. A field referring
//! to a `struct` / `enum` uses a bare [`Ty::Named`] (embedded); a field
//! referring to a `record` uses [`Ty::Link`] (a stored reference).
//!
//! Legacy constructs (`service` / `method` / `stream` / `send` / `recv`) are
//! intentionally **not** modelled — see CLAUDE.md "Legacy は残さない". The IR
//! describes only the modern channel dialect.
//!
//! See the design memory `mem_1Cb5mWnMTdzXfJVoNGFwup` and `ROADMAP.md`
//! (Phase 1) for the full plan.
// =============================================================================
// Schema root
// =============================================================================
/// A whole KDL schema file: standalone type definitions, entity / relation
/// definitions, plus an optional protocol definition.
// =============================================================================
// Data dialect — standalone named types
// =============================================================================
/// A single named type definition.
/// A field of a [`TypeDef::Struct`], a [`Record`] / [`Relation`], or of a
/// protocol-dialect payload ([`Request`] / [`Event`] / [`Message`]).
/// Value constraints attached to a [`Field`].
///
/// These are language-agnostic validation metadata: a numeric range, a
/// string / array length bound, and a regular-expression pattern. They are
/// propagated to the **Zod** and **SurrealQL** emitters (which produce runtime
/// validators / database `ASSERT`s); the Rust and TypeScript type systems
/// cannot express them, so those emitters drop constraints entirely.
/// A field type.
/// A built-in primitive type.
// =============================================================================
// Entity dialect — records and relations
// =============================================================================
/// An entity definition (`record`) — a persisted type with identity.
///
/// Unlike a [`TypeDef::Struct`] (an embedded value), a `Record` carries an
/// `id` and maps to a SurrealDB `DEFINE TABLE ... TYPE NORMAL` statement.
/// How a [`Record`]'s identifier is generated.
/// A graph edge definition (`relation`) — a typed, directed connection
/// between two [`Record`]s.
///
/// Maps to a SurrealDB `DEFINE TABLE ... TYPE RELATION IN <from> OUT <to>`
/// statement. A relation may carry its own [`Field`]s (a "property edge").
// =============================================================================
// Protocol dialect — channel schemas
// =============================================================================
/// A protocol definition: the top-level grouping of [`Channel`]s.
/// A communication channel — the unit of request/response and event traffic.
/// Which peer initiates (opens) a [`Channel`].
/// How long a [`Channel`] lives.
/// The wire backend a [`Channel`] runs over.
/// A request/response pair within a [`Channel`].
/// A push event within a [`Channel`].
/// A named payload message — the `returns` block of a [`Request`].