dx-serializer 0.1.0

A token-efficient serialization format for LLM context windows with high-performance binary encoding
Documentation
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
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
//! Zero-copy tokenizer for DX Machine format
//!
//! Uses SIMD-accelerated scanning via memchr for maximum performance.
//! Operates directly on byte slices without allocations.

use crate::error::{DxError, Result};
use crate::utf8::validate_string_input;
use memchr::memchr;

/// Token types in DX format
#[derive(Debug, Clone, Copy, PartialEq)]
pub enum Token<'a> {
    /// End of input
    Eof,
    /// Newline
    Newline,
    /// Colon (:)
    Colon,
    /// Equals (=) - Schema definition
    Equals,
    /// Caret (^) - Prefix inheritance
    Caret,
    /// Pipe (|) - Array delimiter
    Pipe,
    /// Greater than (>) - Stream operator
    Stream,
    /// Underscore (_) - Ditto
    Ditto,
    /// Tilde (~) - Null
    Null,
    /// Plus (+) - True
    True,
    /// Minus (-) - False
    False,
    /// Bang (!) - Implicit true flag
    Bang,
    /// Question (?) - Implicit null
    Void,
    /// Dollar ($) - Alias definition
    Dollar,
    /// At (@) - Anchor reference
    At,
    /// Percent (%) - Type hint
    Percent,
    /// Dot (.) - Path separator
    Dot,
    /// Identifier/String
    Ident(&'a [u8]),
    /// Integer
    Int(i64),
    /// Float
    Float(f64),
}

/// Zero-copy tokenizer
pub struct Tokenizer<'a> {
    pub(crate) input: &'a [u8],
    pos: usize,
}

impl<'a> Tokenizer<'a> {
    /// Create new tokenizer from bytes
    pub fn new(input: &'a [u8]) -> Self {
        Self { input, pos: 0 }
    }

    /// Get current position
    pub fn pos(&self) -> usize {
        self.pos
    }

    /// Reset to a saved position
    pub fn reset_to(&mut self, pos: usize) {
        self.pos = pos;
    }

    /// Check if at end
    pub fn is_eof(&self) -> bool {
        self.pos >= self.input.len()
    }

    /// Peek current byte without advancing
    pub fn peek(&self) -> Option<u8> {
        self.input.get(self.pos).copied()
    }

    /// Peek n bytes ahead
    pub fn peek_n(&self, n: usize) -> Option<u8> {
        self.input.get(self.pos + n).copied()
    }

    /// Advance by n bytes
    pub fn advance(&mut self, n: usize) {
        self.pos = (self.pos + n).min(self.input.len());
    }

    /// Skip whitespace (space and tab only, not newlines)
    pub fn skip_whitespace(&mut self) {
        while let Some(b) = self.peek() {
            if b == b' ' || b == b'\t' {
                self.pos += 1;
            } else {
                break;
            }
        }
    }

    /// Skip to end of line (for comments)
    pub fn skip_line(&mut self) {
        while let Some(b) = self.peek() {
            self.pos += 1;
            if b == b'\n' {
                break;
            }
        }
    }

    /// Read until delimiter using SIMD search
    pub fn read_until(&mut self, delim: u8) -> &'a [u8] {
        let start = self.pos;
        let remaining = &self.input[self.pos..];

        match memchr(delim, remaining) {
            Some(offset) => {
                self.pos += offset;
                &self.input[start..self.pos]
            }
            None => {
                self.pos = self.input.len();
                &self.input[start..]
            }
        }
    }

    /// Read until any of the delimiters
    pub fn read_until_any(&mut self, delims: &[u8]) -> &'a [u8] {
        let start = self.pos;
        while let Some(b) = self.peek() {
            if delims.contains(&b) {
                break;
            }
            self.pos += 1;
        }
        &self.input[start..self.pos]
    }

    /// Read identifier (alphanumeric + underscore)
    pub fn read_ident(&mut self) -> &'a [u8] {
        let start = self.pos;
        while let Some(b) = self.peek() {
            if b.is_ascii_alphanumeric() || b == b'_' || b == b'.' || b == b'-' {
                self.pos += 1;
            } else {
                break;
            }
        }
        &self.input[start..self.pos]
    }

    /// Read number (int or float)
    pub fn read_number(&mut self) -> Result<Token<'a>> {
        let start = self.pos;
        let mut has_dot = false;
        let mut has_exp = false;

        // Handle negative sign
        if self.peek() == Some(b'-') {
            self.pos += 1;
        }

        // Read digits, dots, and exponents
        while let Some(b) = self.peek() {
            match b {
                b'0'..=b'9' => self.pos += 1,
                b'.' if !has_dot && !has_exp => {
                    has_dot = true;
                    self.pos += 1;
                }
                b'e' | b'E' if !has_exp => {
                    has_exp = true;
                    self.pos += 1;
                    // Handle optional +/- after exponent
                    if matches!(self.peek(), Some(b'+') | Some(b'-')) {
                        self.pos += 1;
                    }
                }
                _ => break,
            }
        }

        let num_bytes = &self.input[start..self.pos];
        let num_str = std::str::from_utf8(num_bytes)
            .map_err(|_| DxError::InvalidNumber("Invalid UTF-8 in number".to_string()))?;

        if has_dot || has_exp {
            let val = num_str
                .parse::<f64>()
                .map_err(|_| DxError::InvalidNumber(num_str.to_string()))?;
            Ok(Token::Float(val))
        } else {
            let val = num_str
                .parse::<i64>()
                .map_err(|_| DxError::InvalidNumber(num_str.to_string()))?;
            Ok(Token::Int(val))
        }
    }

    /// Read string value using vacuum parsing
    /// Reads until the next expected type based on schema
    pub fn read_string_vacuum(&mut self, next_is_number: bool) -> &'a [u8] {
        let start = self.pos;

        if next_is_number {
            // Read until we hit a number or delimiter
            while let Some(b) = self.peek() {
                if b.is_ascii_digit() || b == b'-' || b == b'|' || b == b'\n' {
                    break;
                }
                self.pos += 1;
            }
        } else {
            // Read until delimiter or boolean marker
            // Stop at + or - (boolean markers) when preceded by whitespace
            while let Some(b) = self.peek() {
                if b == b'|' || b == b'\n' || b == b'#' {
                    break;
                }
                // Check for boolean markers preceded by whitespace
                // Only stop if we've read at least one character and the previous char is whitespace
                if (b == b'+' || b == b'-') && self.pos > start {
                    let prev = self.input[self.pos - 1];
                    if prev.is_ascii_whitespace() {
                        break;
                    }
                }
                self.pos += 1;
            }
        }

        // Trim trailing whitespace
        let mut end = self.pos;
        while end > start && self.input[end - 1].is_ascii_whitespace() {
            end -= 1;
        }

        &self.input[start..end]
    }

    /// Read string value with UTF-8 validation
    /// Returns an error if the string contains invalid UTF-8
    pub fn read_string_validated(&mut self, next_is_number: bool) -> Result<&'a str> {
        let start = self.pos;
        let bytes = self.read_string_vacuum(next_is_number);
        validate_string_input(bytes, start)
    }

    /// Read identifier with UTF-8 validation
    pub fn read_ident_validated(&mut self) -> Result<&'a str> {
        let start = self.pos;
        let bytes = self.read_ident();
        validate_string_input(bytes, start)
    }

    /// Get next token
    pub fn next_token(&mut self) -> Result<Token<'a>> {
        self.skip_whitespace();

        let b = match self.peek() {
            Some(b) => b,
            None => return Ok(Token::Eof),
        };

        // Check for single-char tokens
        let token = match b {
            b'\n' | b'\r' => {
                self.pos += 1;
                if b == b'\r' && self.peek() == Some(b'\n') {
                    self.pos += 1;
                }
                return Ok(Token::Newline);
            }
            b'#' => {
                self.skip_line();
                return self.next_token(); // Skip comment and get next
            }
            b':' => {
                self.pos += 1;
                Token::Colon
            }
            b'=' => {
                self.pos += 1;
                Token::Equals
            }
            b'^' => {
                self.pos += 1;
                Token::Caret
            }
            b'|' => {
                self.pos += 1;
                Token::Pipe
            }
            b'>' => {
                self.pos += 1;
                Token::Stream
            }
            b'_' => {
                self.pos += 1;
                Token::Ditto
            }
            b'~' => {
                self.pos += 1;
                Token::Null
            }
            b'+' => {
                self.pos += 1;
                Token::True
            }
            b'-' if !matches!(self.peek_n(1), Some(b'0'..=b'9')) => {
                self.pos += 1;
                Token::False
            }
            b'!' => {
                self.pos += 1;
                Token::Bang
            }
            b'?' => {
                self.pos += 1;
                Token::Void
            }
            b'$' => {
                self.pos += 1;
                Token::Dollar
            }
            b'@' => {
                self.pos += 1;
                Token::At
            }
            b'%' => {
                self.pos += 1;
                Token::Percent
            }
            b'.' => {
                self.pos += 1;
                Token::Dot
            }
            b'0'..=b'9' | b'-' => {
                return self.read_number();
            }
            _ => {
                let ident = self.read_ident();
                Token::Ident(ident)
            }
        };

        Ok(token)
    }

    /// Peek next token without consuming
    pub fn peek_token(&self) -> Result<Token<'a>> {
        let mut temp = Self {
            input: self.input,
            pos: self.pos,
        };
        temp.next_token()
    }
}

#[cfg(test)]
mod tests {
    use super::*;

    #[test]
    fn test_tokenizer_basic() {
        let input = b"id:123 name:Test active:+ score:9.5";
        let mut tok = Tokenizer::new(input);

        assert_eq!(tok.next_token().unwrap(), Token::Ident(b"id"));
        assert_eq!(tok.next_token().unwrap(), Token::Colon);
        assert_eq!(tok.next_token().unwrap(), Token::Int(123));
        assert_eq!(tok.next_token().unwrap(), Token::Ident(b"name"));
        assert_eq!(tok.next_token().unwrap(), Token::Colon);
    }

    #[test]
    fn test_special_tokens() {
        let input = b"_ ~ + - ^ | > = $ @ % !";
        let mut tok = Tokenizer::new(input);

        assert_eq!(tok.next_token().unwrap(), Token::Ditto);
        assert_eq!(tok.next_token().unwrap(), Token::Null);
        assert_eq!(tok.next_token().unwrap(), Token::True);
        assert_eq!(tok.next_token().unwrap(), Token::False);
        assert_eq!(tok.next_token().unwrap(), Token::Caret);
        assert_eq!(tok.next_token().unwrap(), Token::Pipe);
        assert_eq!(tok.next_token().unwrap(), Token::Stream);
        assert_eq!(tok.next_token().unwrap(), Token::Equals);
    }

    #[test]
    #[allow(clippy::approx_constant)] // Using 3.14 intentionally for test data
    fn test_numbers() {
        let input = b"123 -456 3.14 -2.5 1e10";
        let mut tok = Tokenizer::new(input);

        assert_eq!(tok.next_token().unwrap(), Token::Int(123));
        assert_eq!(tok.next_token().unwrap(), Token::Int(-456));
        assert_eq!(tok.next_token().unwrap(), Token::Float(3.14));
        assert_eq!(tok.next_token().unwrap(), Token::Float(-2.5));
    }
}