tiny.preserves.parse

1/// Returns the one value `text` holds, allocated with `alloc`. Code reading hand-written text calls2/// it for a value with comments allowed, sets and dictionaries sorted, and `#:` embedded values3/// read in place. The value owns all its memory, so `text` may be freed at once, and the caller4/// frees the value with `deinit`. On any error the call frees everything it allocated. Whitespace5/// and commas separate values, and a `#` followed by a space or tab starts a comment that runs to6/// the end of the line. An annotation `@a v` is read, checked and dropped, so the call returns `v`.7/// Sets and dictionaries are sorted by the package's value order after they are read. `#:v` becomes8/// an embedded value that owns `v` and compares, hashes, copies and frees through it. A bare token9/// becomes an integer only when `looksLikeInteger` accepts its optional sign and digits. `parse`10/// tries `parseFloat` to produce a double only when `looksLikeFloat` accepts the token. If11/// `parseFloat` fails, `parse` falls through to a symbol. Strings and symbols are checked as UTF-8,12/// the shared escape reader accepts `\'`, and a `\u` escape reads one code unit, so surrogate pairs13/// fail. The call returns a `ParseError` naming the kind of bad input, and14/// `error.NestingLimitExceeded` past 256 levels. Its repeated-item checks compare each element or15/// key with every earlier one, so their cost grows with the square of the count.16pub fn parse(alloc: Allocator, text: []const u8) ParseError!Value {17    var parser = Parser{ .text = text, .pos = 0, .alloc = alloc };18    var value = try parser.readValue(nesting.root);19    errdefer value.deinit(alloc);20    parser.skipWhitespace();21    if (parser.pos < parser.text.len) return ParseError.TrailingContent;22    return value;23}

1pub const parse = text.parse;