corium-query 0.1.5

Corium query implementation
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
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
//! Minimal EDN reader/printer for the query boundary.
//!
//! The engine carries this small self-contained reader covering the subset
//! used by queries, transaction forms, and the conformance corpus:
//! collections, keywords, symbols, strings, numbers, booleans, `nil`, sets,
//! comments, `#_` discards, and tagged elements. Text arriving through a
//! cljrs boundary is read by `cljrs-reader` instead and bridged onto this
//! representation (`corium_cljrs::convert::read_edn`, M5), keeping one EDN
//! implementation at the boundary while the engine core stays dependency-free.

use std::fmt;

use corium_core::{Keyword, TotalF64};
use thiserror::Error;

/// An EDN value with total ordering (maps/sets are normalized sorted).
#[derive(Clone, Debug, Eq, PartialEq, Ord, PartialOrd)]
pub enum Edn {
    /// `nil`.
    Nil,
    /// Boolean.
    Bool(bool),
    /// Integer.
    Long(i64),
    /// Floating point (total order).
    Double(TotalF64),
    /// String.
    Str(String),
    /// Keyword.
    Keyword(Keyword),
    /// Symbol, printed verbatim.
    Symbol(String),
    /// List `( … )`.
    List(Vec<Edn>),
    /// Vector `[ … ]`.
    Vector(Vec<Edn>),
    /// Map `{ … }` as sorted key/value pairs.
    Map(Vec<(Edn, Edn)>),
    /// Set `#{ … }` as sorted, deduplicated elements.
    Set(Vec<Edn>),
    /// Tagged element `#tag value`.
    Tagged(String, Box<Edn>),
}

impl Edn {
    /// Builds a symbol.
    #[must_use]
    pub fn symbol(text: &str) -> Self {
        Self::Symbol(text.to_owned())
    }

    /// Builds a keyword from `"ns/name"` or `"name"` text (no leading colon).
    #[must_use]
    pub fn keyword(text: &str) -> Self {
        Self::Keyword(Keyword::parse(text))
    }

    /// Returns the symbol text if this is a symbol.
    #[must_use]
    pub fn as_symbol(&self) -> Option<&str> {
        match self {
            Self::Symbol(s) => Some(s),
            _ => None,
        }
    }

    /// Returns the keyword if this is a keyword.
    #[must_use]
    pub const fn as_keyword(&self) -> Option<&Keyword> {
        match self {
            Self::Keyword(k) => Some(k),
            _ => None,
        }
    }

    /// Returns the elements if this is a list or vector.
    #[must_use]
    pub fn as_seq(&self) -> Option<&[Edn]> {
        match self {
            Self::List(items) | Self::Vector(items) => Some(items),
            _ => None,
        }
    }

    /// Looks up a map value by key.
    #[must_use]
    pub fn get(&self, key: &Self) -> Option<&Self> {
        match self {
            Self::Map(pairs) => pairs.iter().find(|(k, _)| k == key).map(|(_, v)| v),
            _ => None,
        }
    }
}

/// EDN read failure.
#[derive(Debug, Error, Eq, PartialEq)]
#[error("EDN parse error at offset {offset}: {message}")]
pub struct EdnError {
    /// Byte offset of the failure.
    pub offset: usize,
    /// Failure description.
    pub message: String,
}

/// Parses exactly one EDN form from `input` (trailing whitespace allowed).
///
/// # Errors
/// Returns [`EdnError`] on malformed input or trailing data.
pub fn read_one(input: &str) -> Result<Edn, EdnError> {
    let mut reader = Reader::new(input);
    let form = reader.read_form()?;
    reader.skip_ws();
    if reader.peek().is_some() {
        return Err(reader.error("trailing data after form"));
    }
    Ok(form)
}

/// Parses every top-level EDN form in `input`.
///
/// # Errors
/// Returns [`EdnError`] on malformed input.
pub fn read_all(input: &str) -> Result<Vec<Edn>, EdnError> {
    let mut reader = Reader::new(input);
    let mut forms = Vec::new();
    loop {
        reader.skip_ws();
        if reader.peek().is_none() {
            return Ok(forms);
        }
        forms.push(reader.read_form()?);
    }
}

struct Reader<'a> {
    bytes: &'a [u8],
    pos: usize,
}

const DELIMITERS: &[u8] = b"()[]{}\"; \t\r\n,";

impl<'a> Reader<'a> {
    fn new(input: &'a str) -> Self {
        Self {
            bytes: input.as_bytes(),
            pos: 0,
        }
    }

    fn error(&self, message: &str) -> EdnError {
        EdnError {
            offset: self.pos,
            message: message.to_owned(),
        }
    }

    fn peek(&self) -> Option<u8> {
        self.bytes.get(self.pos).copied()
    }

    fn bump(&mut self) -> Option<u8> {
        let b = self.peek()?;
        self.pos += 1;
        Some(b)
    }

    fn skip_ws(&mut self) {
        while let Some(b) = self.peek() {
            match b {
                b' ' | b'\t' | b'\r' | b'\n' | b',' => {
                    self.pos += 1;
                }
                b';' => {
                    while self.peek().is_some_and(|b| b != b'\n') {
                        self.pos += 1;
                    }
                }
                _ => return,
            }
        }
    }

    fn read_form(&mut self) -> Result<Edn, EdnError> {
        self.skip_ws();
        match self.peek().ok_or_else(|| self.error("unexpected end"))? {
            b'(' => {
                self.pos += 1;
                Ok(Edn::List(self.read_until(b')')?))
            }
            b'[' => {
                self.pos += 1;
                Ok(Edn::Vector(self.read_until(b']')?))
            }
            b'{' => {
                self.pos += 1;
                let items = self.read_until(b'}')?;
                if items.len() % 2 != 0 {
                    return Err(self.error("map requires an even number of forms"));
                }
                let mut pairs: Vec<(Edn, Edn)> = Vec::new();
                let mut iter = items.into_iter();
                while let (Some(k), Some(v)) = (iter.next(), iter.next()) {
                    pairs.push((k, v));
                }
                pairs.sort_by(|left, right| left.0.cmp(&right.0));
                Ok(Edn::Map(pairs))
            }
            b'"' => self.read_string(),
            b'#' => self.read_dispatch(),
            _ => self.read_atom(),
        }
    }

    fn read_until(&mut self, close: u8) -> Result<Vec<Edn>, EdnError> {
        let mut items = Vec::new();
        loop {
            self.skip_ws();
            match self.peek() {
                None => return Err(self.error("unterminated collection")),
                Some(b) if b == close => {
                    self.pos += 1;
                    return Ok(items);
                }
                Some(_) => items.push(self.read_form()?),
            }
        }
    }

    fn read_dispatch(&mut self) -> Result<Edn, EdnError> {
        self.pos += 1;
        match self.peek() {
            Some(b'{') => {
                self.pos += 1;
                let mut items = self.read_until(b'}')?;
                items.sort();
                items.dedup();
                Ok(Edn::Set(items))
            }
            Some(b'_') => {
                self.pos += 1;
                let _discarded = self.read_form()?;
                self.read_form()
            }
            _ => {
                let tag = self.read_token()?;
                if tag.is_empty() {
                    return Err(self.error("empty dispatch tag"));
                }
                let value = self.read_form()?;
                Ok(Edn::Tagged(tag, Box::new(value)))
            }
        }
    }

    fn read_string(&mut self) -> Result<Edn, EdnError> {
        self.pos += 1;
        let mut out = String::new();
        loop {
            match self
                .bump()
                .ok_or_else(|| self.error("unterminated string"))?
            {
                b'"' => return Ok(Edn::Str(out)),
                b'\\' => {
                    let escape = self
                        .bump()
                        .ok_or_else(|| self.error("unterminated escape"))?;
                    out.push(match escape {
                        b'n' => '\n',
                        b't' => '\t',
                        b'r' => '\r',
                        b'"' => '"',
                        b'\\' => '\\',
                        _ => return Err(self.error("unknown string escape")),
                    });
                }
                b => {
                    // Re-decode multi-byte UTF-8 starting at this byte.
                    let start = self.pos - 1;
                    let mut end = self.pos;
                    while end < self.bytes.len() && (self.bytes[end] & 0xC0) == 0x80 {
                        end += 1;
                    }
                    if b < 0x80 {
                        out.push(char::from(b));
                    } else {
                        let text = std::str::from_utf8(&self.bytes[start..end])
                            .map_err(|_| self.error("invalid UTF-8"))?;
                        out.push_str(text);
                        self.pos = end;
                    }
                }
            }
        }
    }

    fn read_token(&mut self) -> Result<String, EdnError> {
        let start = self.pos;
        while self.peek().is_some_and(|b| !DELIMITERS.contains(&b)) {
            self.pos += 1;
        }
        std::str::from_utf8(&self.bytes[start..self.pos])
            .map(str::to_owned)
            .map_err(|_| self.error("invalid UTF-8 token"))
    }

    fn read_atom(&mut self) -> Result<Edn, EdnError> {
        let token = self.read_token()?;
        if token.is_empty() {
            return Err(self.error("unexpected character"));
        }
        if let Some(name) = token.strip_prefix(':') {
            if name.is_empty() {
                return Err(self.error("empty keyword"));
            }
            return Ok(Edn::keyword(name));
        }
        match token.as_str() {
            "nil" => return Ok(Edn::Nil),
            "true" => return Ok(Edn::Bool(true)),
            "false" => return Ok(Edn::Bool(false)),
            _ => {}
        }
        let numeric_start = token.starts_with(|c: char| c.is_ascii_digit())
            || (token.len() > 1
                && (token.starts_with('-') || token.starts_with('+'))
                && token[1..].starts_with(|c: char| c.is_ascii_digit()));
        if numeric_start {
            if token.contains('.') || token.contains('e') || token.contains('E') {
                return token
                    .parse::<f64>()
                    .map(|v| Edn::Double(TotalF64(v)))
                    .map_err(|_| self.error("malformed float"));
            }
            return token
                .parse::<i64>()
                .map(Edn::Long)
                .map_err(|_| self.error("malformed integer"));
        }
        Ok(Edn::Symbol(token))
    }
}

impl fmt::Display for Edn {
    fn fmt(&self, f: &mut fmt::Formatter<'_>) -> fmt::Result {
        fn write_seq(f: &mut fmt::Formatter<'_>, items: &[Edn]) -> fmt::Result {
            for (i, item) in items.iter().enumerate() {
                if i > 0 {
                    write!(f, " ")?;
                }
                write!(f, "{item}")?;
            }
            Ok(())
        }
        match self {
            Self::Nil => write!(f, "nil"),
            Self::Bool(v) => write!(f, "{v}"),
            Self::Long(v) => write!(f, "{v}"),
            Self::Double(v) => write!(f, "{:?}", v.0),
            Self::Str(v) => write!(f, "{v:?}"),
            Self::Keyword(v) => write!(f, "{v}"),
            Self::Symbol(v) => write!(f, "{v}"),
            Self::List(items) => {
                write!(f, "(")?;
                write_seq(f, items)?;
                write!(f, ")")
            }
            Self::Vector(items) => {
                write!(f, "[")?;
                write_seq(f, items)?;
                write!(f, "]")
            }
            Self::Set(items) => {
                write!(f, "#{{")?;
                write_seq(f, items)?;
                write!(f, "}}")
            }
            Self::Map(pairs) => {
                write!(f, "{{")?;
                for (i, (k, v)) in pairs.iter().enumerate() {
                    if i > 0 {
                        write!(f, ", ")?;
                    }
                    write!(f, "{k} {v}")?;
                }
                write!(f, "}}")
            }
            Self::Tagged(tag, value) => write!(f, "#{tag} {value}"),
        }
    }
}

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

    #[test]
    fn reads_query_shapes() {
        let form = read_one(
            "{:find [?e (count ?x)] ; comment\n :where [[?e :person/name \"A\"] [(< ?x 3)]]}",
        )
        .expect("parse");
        assert!(form.get(&Edn::keyword("find")).is_some());
        assert!(form.to_string().contains(":person/name"));
    }

    #[test]
    fn reads_sets_tags_and_discards() {
        assert_eq!(
            read_one("#{3 1 2 1}").expect("set"),
            Edn::Set(vec![Edn::Long(1), Edn::Long(2), Edn::Long(3)])
        );
        assert_eq!(
            read_one("#tempid \"a\"").expect("tag"),
            Edn::Tagged("tempid".into(), Box::new(Edn::Str("a".into())))
        );
        assert_eq!(
            read_one("[#_ 1 2]").expect("discard"),
            Edn::Vector(vec![Edn::Long(2)])
        );
    }

    #[test]
    fn reads_numbers_and_negative_symbols() {
        assert_eq!(read_one("-42").expect("int"), Edn::Long(-42));
        assert_eq!(read_one("1.5").expect("float"), Edn::Double(TotalF64(1.5)));
        assert_eq!(read_one("-").expect("minus"), Edn::symbol("-"));
        assert_eq!(read_one("?e").expect("var"), Edn::symbol("?e"));
    }
}