Compare commits

...

156 Commits

Author SHA1 Message Date
Emery Hemingway e158b5271f Replace Nimble with an SBOM 2024-06-01 12:16:26 +03:00
Emery Hemingway c7dc205537 pegs: refer to npeg syntax in the documentation 2024-05-25 10:23:33 +03:00
Emery Hemingway ed065fcc2d sugar: preserve most Nim atomics with % 2024-05-23 15:58:40 +03:00
Emery Hemingway 13fe49e791 Add default.nix 2024-05-22 22:53:45 +03:00
Emery Hemingway 1fee875909 decoding: parse single-byte boolean streams 2024-05-22 20:50:48 +03:00
Emery Hemingway cd6812ae07 encoding: sort dictionaries by encoded keys 2024-05-22 19:49:07 +03:00
Emery Hemingway 4ebca473df schemaparse: definition annotations come after line comments 2024-05-22 19:17:06 +03:00
Emery Hemingway 9d328b3d0c schemaparse: do not capture annotations 2024-05-22 19:16:47 +03:00
Emery Hemingway 921acb6b21 schemaparse: ignore line comments in dictionaries 2024-05-22 18:44:16 +03:00
Emery Hemingway ea6c8118e8 schemaparse: fix parsing of annotated named record fields 2024-05-22 18:32:56 +03:00
Emery Hemingway f65e206864 Fix set inclusion 2024-05-06 13:28:33 +02:00
Emery Hemingway c40d2c6443 Decode from non-seekable streams 2024-05-06 13:28:21 +02:00
Emery Hemingway 3b9c164737 Add P-Expressions reader 2024-04-26 13:17:09 +02:00
Emery Hemingway ca0cebcefd PEG: add '(', ')' to delimeters 2024-04-26 13:06:57 +02:00
Emery Hemingway 8f42f97e13 Simplify PEG 2024-04-26 11:18:38 +02:00
Emery Hemingway fd498c6457 Add a sugar module 2024-04-22 13:22:01 +02:00
Emery Hemingway a83ca8b31c Cleanup examples 2024-04-22 13:21:41 +02:00
Emery Hemingway ea698bedcc Add integer converter 2024-04-22 11:24:35 +02:00
Emery Hemingway 8d48ae60e9 Make compatible with nimNoLibc 2024-04-22 11:07:52 +02:00
Emery Hemingway 9ae435a83c Add text parsing to BufferedDecoder 2024-03-12 12:26:13 +00:00
Emery Hemingway 375cc992fd Remove gcsafe annotations 2024-03-12 12:25:52 +00:00
Emery Hemingway 2825bceecf preserves_schema_nim: collect imports of simple compounds 2024-02-08 14:24:01 +00:00
Emery Hemingway 9134fecb36 Replace #! notation with #: 2024-02-08 14:24:01 +00:00
Emery Hemingway c0a8a1a76c Merge doubles into floats 2024-02-08 14:23:47 +00:00
Emery Hemingway 5e1e97e4df toPreserves: unpack preservesTupleTail on records 2024-01-18 22:24:08 +02:00
Emery Hemingway ba0857c32b BufferedDecoder: return Option[Value] from decode 2024-01-16 21:01:25 +02:00
Emery Hemingway aa5c7f4683 preserves_schema_nim: embedded literals are not literals 2024-01-14 12:26:39 +02:00
Emery Hemingway a01ba8c96d preserves_schema_nim: remove dead code 2024-01-08 12:50:13 +02:00
Emery Hemingway 8b2407b1a2 preserves_schema_nim: attach embed pragmas inside Or objects 2024-01-08 12:37:03 +02:00
Emery Hemingway d2017228fb Embed values for types with {.preservesEmbedded.} 2024-01-08 12:37:03 +02:00
Emery Hemingway 79ea25d1be Make mapEmbeds more general 2024-01-08 12:36:29 +02:00
Emery Hemingway 7b17f935ea Tweak to and fromPresrves for EmbeddedRef 2024-01-08 12:36:29 +02:00
Emery Hemingway 416af8ff5f preserves_schema_nim: represent embeds with EmbeddedRef
Use EmbeddedRef for embbeded values, unless a schema does not name
an embedded type.
2024-01-08 12:36:29 +02:00
Emery Hemingway 74da21f3d5 preserves_schema_nim: do not create types for simple fields 2024-01-08 12:36:29 +02:00
Emery Hemingway abcdfa01cd preserves_schema_nim: remove dead code 2024-01-08 12:36:29 +02:00
Emery Hemingway 93590f2c07 Condense contract and expand to mapEmbeds 2024-01-08 12:36:29 +02:00
Emery Hemingway 0acd369262 Option support in toPreserves and fromPreserves 2024-01-08 12:36:29 +02:00
Emery Hemingway 501d6cc012 preserves_schema_nim: merged And patterns with optionals 2024-01-08 12:36:29 +02:00
Emery Hemingway a52e84dd70 Step by varargs[Value, toPreserves] 2024-01-08 12:36:29 +02:00
Emery Hemingway a83c9ad3a4 $: do not write #! twice 2024-01-08 12:36:29 +02:00
Emery Hemingway b67e6f089b preserves_schema_nim: always mark embedded fields 2024-01-08 12:36:29 +02:00
Emery Hemingway 25d42f9498 Add toRecord sugar 2024-01-08 12:36:29 +02:00
Emery Hemingway 97ab7ce070 preserves_schema_nim: better recursive type detection 2024-01-08 12:36:29 +02:00
Emery Hemingway c01e587e5b preserves_schema_nim: use Table for And types 2024-01-08 12:36:29 +02:00
Emery Hemingway 43498a4b94 preserves_schema_nim: rearrange some internal parameters 2024-01-08 12:36:29 +02:00
Emery Hemingway a5cc0a431d preserves_schema_nim: remove type parameterization 2024-01-08 12:36:29 +02:00
Emery Hemingway 10fc78172e Add `&` operator 2024-01-08 12:36:29 +02:00
Emery Hemingway 867d25afee Remodel Preserves[E] into Value
Using a parameterized Preserve[E] type is too much hassle. Replace
with a Value type with an embedded field of "ref RootObj".
2024-01-08 12:36:29 +02:00
Emery Hemingway 85cef2e1d2 Generate dot files only with Tup 2024-01-01 17:32:53 +02:00
Emery Hemingway c2bce1404a Add Atom type
Type for holding constant Preserves values create at compile-time.
This is a prerequisite for making embedded values "ref RootObj".
It is also requesite for making Value a ref object.
2024-01-01 17:32:52 +02:00
Emery Hemingway 441bd253b0 Schema: convert Ref alternates to NamedPatterns 2024-01-01 17:32:52 +02:00
Emery Hemingway 3606ce5459 Schema: parse the embeddedType 2024-01-01 17:32:52 +02:00
Emery Hemingway b165c64475 Parse more schema 2024-01-01 17:32:52 +02:00
Emery Hemingway 18f8f8e6b2 Schema: parse annotations on patterns, parse line comments 2024-01-01 17:32:52 +02:00
Emery Hemingway d146b213b4 Add Value alias to Preserve[void] 2024-01-01 17:32:52 +02:00
Emery Hemingway 60938612c5 Rename schemac compiler to preserves-schemac 2024-01-01 17:32:52 +02:00
Emery Hemingway b7224d7a4a Reorder PEG 2024-01-01 17:32:52 +02:00
Emery Hemingway f28c1a4c83 Validate strings as UTF-8 during parsing 2024-01-01 17:32:52 +02:00
Emery Hemingway 12bc024992 Cleanup text encoding 2024-01-01 17:32:52 +02:00
Emery Hemingway d1e3b00134 Allow leading zeros when parsing numbers 2024-01-01 17:32:52 +02:00
Emery Hemingway d3a236bb92 UTF-16 surrogate pair parsing 2024-01-01 17:32:52 +02:00
Emery Hemingway 8a70cd0987 Fix float parsing 2024-01-01 17:32:52 +02:00
Emery Hemingway e43371da87 Adjust UTF-16 parsing 2024-01-01 17:32:52 +02:00
Emery Hemingway 44f98163d9 Unify string and symbol escaping 2024-01-01 17:32:52 +02:00
Emery Hemingway 32ed35adce Unescape symbols during parse 2024-01-01 17:32:52 +02:00
Emery Hemingway c622d39c3f Parse require delimiters after bools, numbers, symbols 2024-01-01 17:32:52 +02:00
Emery Hemingway c9c231914b Looser symbol parsing 2024-01-01 17:32:52 +02:00
Emery Hemingway 10ceb9ec88 Allow float suffix of 'f' or 'F' 2024-01-01 17:32:52 +02:00
Emery Hemingway cf5efb7d86 Make NaN equal NaN 2024-01-01 17:32:52 +02:00
Emery Hemingway 75916ea0dd Convert awkard floats to hex 2024-01-01 17:32:52 +02:00
Emery Hemingway a2024f4111 Parsing: accept '+' prefix on numbers 2024-01-01 17:32:52 +02:00
Emery Hemingway d75191b480 Cleanup build system 2024-01-01 17:32:52 +02:00
Emery Hemingway cedf25d1c3 Split pkSignedInteger into pkRegister and pkBigInt 2024-01-01 17:32:50 +02:00
Emery Hemingway 37043a03bf Test against upstream samples 2023-12-25 10:08:10 +02:00
Emery Hemingway 558a1a862a PEG: tweak commas and symbols 2023-12-25 10:08:10 +02:00
Emery Hemingway dbe9f3566f Add raw floats and doubles to parser 2023-12-25 10:08:10 +02:00
Emery Hemingway 82631b1a01 Stop running nim doc 2023-12-25 10:08:10 +02:00
Emery Hemingway adadcc181a Move some of preserves implementation to preserves/private 2023-12-25 10:08:03 +02:00
Emery Hemingway 126365d164 Remove superfluous PEG whitspace rules 2023-12-24 21:24:02 +02:00
Emery Hemingway 5267b7dc13 Generate graphs for PEGs 2023-12-24 21:24:02 +02:00
Emery Hemingway c1eb0a513a schemac: Bundle is now a ref obj 2023-12-24 21:24:02 +02:00
Emery Hemingway 40f20a3ca8 schema: extract And clauses 2023-12-24 21:24:02 +02:00
Emery Hemingway 218ca7a669 schemaparse: parse them commas 2023-12-24 21:24:02 +02:00
Emery Hemingway c83b78aef7 Replace comment marker ; with # 2023-12-24 21:24:02 +02:00
Emery Hemingway 27a5ace1ea Fix decoding of annotations 2023-12-24 21:12:30 +02:00
Emery Hemingway 4faeb766dc Update build metadata 2023-11-30 10:41:21 +02:00
Emery Hemingway 7187a45f9c Hash nil embedded pointers 2023-11-02 13:33:52 +00:00
Emery Hemingway 0c4ef8269f Add pop for dictionaries 2023-11-02 13:33:47 +00:00
Emery Hemingway ca5d44ed32 Step with mulitple indexes 2023-10-28 00:24:27 +01:00
Emery Hemingway 6e0834316f Fix code-gen for embedded literals 2023-10-26 15:32:35 +01:00
Emery Hemingway 71acd4c951 Regenerate schema 2023-10-26 15:29:28 +01:00
Emery Hemingway edece399be Support standard Preserves text encoding as well as JSON 2023-10-21 18:40:14 +01:00
Emery Hemingway 8362a09ec0 Make text rendering JSON compatible 2023-10-20 19:57:09 +01:00
Emery Hemingway a2dc5becc0 Update binary encoding to Preserves-0.990 2023-10-19 18:14:14 +01:00
Emery Hemingway d98dfa2644 Add lockfile 2023-10-19 18:14:14 +01:00
Emery Hemingway c915accf7d Zero length byte sequences are fine 2023-09-14 10:30:19 +02:00
Emery Hemingway 53981fd70a Fix post-return compilation warning 2023-09-13 09:38:11 +02:00
Emery Hemingway ab3bd12c11 Remove bad varint check 2023-09-13 09:38:06 +02:00
Emery Hemingway 15390dd48e Suppport preservesTupleTail pragma within objects 2023-09-12 11:35:09 +02:00
Emery Hemingway 8b3b182ce7 Do not raise ValueError at early end of binary stream 2023-08-25 19:28:48 +01:00
Emery Hemingway 52faec6e43 Fix varint encoding and decoding 2023-08-25 19:28:48 +01:00
Emery Hemingway 5e2cd329f6 Make apply gcsafe 2023-08-17 14:39:39 +01:00
Emery Hemingway 57f9984007 preserves_schema_nim: add acyclic pragmas 2023-08-16 08:33:11 +01:00
Emery Hemingway ec77872467 Port preserves_schema_nim to Nim-2.0.0 2023-08-16 08:33:11 +01:00
Emery Hemingway b563de9ac4 Remove threads and gcsafe where parsing is used 2023-08-16 08:33:11 +01:00
Emery Hemingway 65cd9fa3e9 Build system adjustments 2023-08-04 12:03:19 +01:00
Emery Hemingway e65dc2271f Preserve JSON object keys as symbols 2023-08-01 11:09:29 +01:00
Emery Hemingway 5fa72cd25b Be more consistent about sorting dictionary keys 2023-07-23 08:27:28 +01:00
Emery Hemingway 335dcd2987 Tweak type walking in private/macros 2023-07-23 08:26:35 +01:00
Emery Hemingway 6008b0ba25 Tidy imports 2023-07-20 23:17:41 +01:00
Emery Hemingway e6868fabd2 Do not convert string to string 2023-07-20 20:20:36 +01:00
Emery Hemingway 81d04290a5 Use new delete(…) 2023-07-20 19:54:01 +01:00
Emery Hemingway 47e7851beb Never convert Preserves symbols to Nim strings! 2023-07-20 18:26:29 +01:00
Emery Hemingway 9fa6685071 Add escaping to $ operator for Symbol 2023-06-12 21:01:26 +01:00
Emery Hemingway 10d20600bf Escape zero-length Symbols 2023-06-11 21:35:28 +01:00
Emery Hemingway acdfd3c560 Permit fromPreserve for subsets of dictionaries 2023-06-11 21:35:28 +01:00
Emery Hemingway c087294b23 schema: sort dictionary fields by key
Size of the value is a compelling alternative but cannot be
inferred at code generation time.
2023-06-11 21:35:28 +01:00
Emery Hemingway fa5441bd01 Cannonicalize values at toPreserve 2023-06-11 21:35:28 +01:00
Emery Hemingway a7a90097a8 Add sort and cannonicalize 2023-06-11 21:33:41 +01:00
Emery Hemingway 117aa19ef3 Better build system 2023-06-07 18:11:06 +01:00
Emery Hemingway 96879da08c schema: do not deref atomic types 2023-06-07 11:59:50 +01:00
Emery Hemingway 0e3824fc5d schema: import std/sets when neccessary 2023-06-07 11:00:24 +01:00
Emery Hemingway 0f697349cc Add isInteger and isString procs for testing against values 2023-05-30 13:11:33 +01:00
Emery Hemingway c500e99b95 Fix some decoder defects 2023-05-20 13:53:21 +01:00
Emery Hemingway 03876850e5 schema: use Preserve[E] for records without literal labels 2023-05-17 09:12:08 +01:00
Emery Hemingway b3f40347e8 Regenerate schema module 2023-05-16 23:06:52 +01:00
Emery Hemingway ebaa927b55 Add Direnv metadata 2023-05-16 22:53:59 +01:00
Emery Hemingway 7718227662 Add step proc for symbols 2023-05-14 22:57:12 +01:00
Emery Hemingway eeef9860cf schema: don't override $ proc for Preserves[E] types 2023-05-14 22:55:27 +01:00
Emery Hemingway b7406cd6f7 Add preserves/datehooks for handling dates and times 2023-05-12 09:38:01 +01:00
Emery Hemingway b9d8275624 schema: emit "tuple[]" for literal object fields 2023-05-04 10:55:09 +01:00
Emery Hemingway cd2dde6d71 preserves_schema_nim: use field0,1,..N for anonymous fields 2023-05-03 16:03:43 +01:00
Emery Hemingway 67b470078c Revert "preserves_schema_nim: declare literal fields as void"
This reverts commit 30c330cecf.
2023-04-30 09:57:45 +01:00
Emery Hemingway 305edff213 Make toPreserve warning more explicit 2023-04-28 23:59:47 +01:00
Emery Hemingway 30c330cecf preserves_schema_nim: declare literal fields as void 2023-04-28 23:58:48 +01:00
Emery Hemingway 335d1b61cc Move jsonhooks check to runnableExamples 2023-04-10 17:51:14 -05:00
Emery Hemingway a74b28cc6f Add note on syndicate-nim to README 2023-04-05 20:05:42 -05:00
Emery Hemingway b7e1f2c8c7 Manage Nimble packages with Tup 2023-04-03 17:04:57 -05:00
Emery Hemingway 30dbed4aa9 Allow for an unlimited DecodeBuffer size 2023-04-03 17:04:12 -05:00
Emery Hemingway ea7225e3b5 Add toDictionary procedure 2023-04-03 17:03:56 -05:00
Emery Hemingway 1a0cb2be5c Cleanup preserves_schema_nim 2023-04-01 12:33:28 -05:00
Emery Hemingway 466a8d3af4 Add initSequenceOfCap proc 2023-03-29 17:33:39 -05:00
Emery Hemingway 71b6d4c017 Rework the initX[E]() procs to initX(E = void) 2023-03-29 17:32:54 -05:00
Emery Hemingway 5d3f7b94a3 Add isRecord(…) with arity descriminator 2023-03-29 16:47:54 -05:00
Emery Hemingway 786342c39b Cannot print a void value 2023-03-29 16:47:47 -05:00
Emery Hemingway b38b85a8f1 Catch IOError at Preserves decoder 2023-03-22 11:21:46 -05:00
Emery Hemingway 8ff65486ff preserves_schema_nim: use "E" as a default emebedding ident 2023-03-01 20:58:17 -06:00
Emery Hemingway 6b965c5c0e Only catch ValueError during decode 2023-03-01 20:58:17 -06:00
Emery Hemingway dab8f11b9b Serialize dummy text for embeds 2023-03-01 20:58:17 -06:00
Emery Hemingway 075627709f preserves_schema_nim: recursively search dicts for embedding 2023-03-01 20:58:17 -06:00
Emery Hemingway a130079162 preserves_schema_nim: code formatting 2023-03-01 12:50:33 -06:00
Emery Hemingway 3a6dfc0349 preserves_schema_nim: be more careful about type parameters 2023-03-01 12:49:21 -06:00
Emery Hemingway 10682883a4 preserves_schema_nim: detect schema self references
Do not add a schema module as an import to itself when a
definition refers to a type with a qualified module name that is
the same as the schema the definition occurs in.
2023-03-01 12:49:21 -06:00
Emery Hemingway 70655a959b preserves_schema_nim: emit Perserve type for And composites 2023-03-01 12:49:18 -06:00
Emery Hemingway 66a653a775 Fix expand of embedded Preserves 2022-12-13 22:05:05 -06:00
Emery Hemingway adec7fd7ad Rewrite tupfiles 2022-12-11 19:21:17 -06:00
45 changed files with 3069 additions and 1903 deletions

14
.gitignore vendored
View File

@ -1,9 +1,5 @@
tests/test_integers
tests/test_parser
tests/test_rfc8259
tests/test_schemas
preserves_encode
preserves_decode
preserves_from_json
preserves_to_json
preserves_schema_nim
/nim.cfg
*.dot
*.html
*.run
*.svg

0
.gitmodules vendored
View File

View File

@ -2,6 +2,8 @@
Nim implementation of the [Preserves data language](https://preserves.dev/).
If you don't know why you need Preserves, see the [Syndicate library](https://git.syndicate-lang.org/ehmry/syndicate-nim).
## Library
To parse or produce Preserves one should write a [schema](https://preserves.dev/preserves-schema.html) and generate a Nim module using the [preserves_schema_nim](./src/preserves/preserves_schema_nim.nim) utility. This module will contain Nim types corresponding to schema definitions. The `toPreserve` and`fromPreserve` routines will convert Nim types to and from Preserves. The `decodePreserves`, `parsePreserves`, `encode`, and `$` routines will convert `Preserve` objects to and from binary and textual encoding.

2
Tupfile Normal file
View File

@ -0,0 +1,2 @@
include_rules
: sbom.json |> !sbom-to-nix |> | ./<lock>

View File

@ -1 +1,2 @@
.gitignore
include depends.tup
NIM_GROUPS += $(TUP_CWD)/<lock>

26
default.nix Normal file
View File

@ -0,0 +1,26 @@
{
pkgs ? import <nixpkgs> { },
}:
let
inherit (pkgs) lib buildNimPackage nim;
in
buildNimPackage {
pname = "preserves-nim";
version = "unstable";
lockFile = ./lock.json;
src = if lib.inNixShell then null else lib.cleanSource ./.;
nimFlags = [ "--path:${nim.passthru.nim}/nim" ];
# Path to the compiler/ast library.
postInstall = ''
pushd $out/bin
for link in preserves_decode preserves_from_json preserves_to_json;
do ln -s preserves_encode $link
done
mv preserves_schemac preserves-schemac
popd
'';
}

2
depends.tup Normal file
View File

@ -0,0 +1,2 @@
NIM_FLAGS += --path:$(TUP_CWD)/../nim
NIM_FLAGS += --path:$(TUP_CWD)/../npeg/src

28
lock.json Normal file
View File

@ -0,0 +1,28 @@
{
"depends": [
{
"method": "fetchzip",
"packages": [
"bigints"
],
"path": "/nix/store/jvrm392g8adfsgf36prgwkbyd7vh5jsw-source",
"ref": "20231006",
"rev": "86ea14d31eea9275e1408ca34e6bfe9c99989a96",
"sha256": "15pcpmnk1bnw3k8769rjzcpg00nahyrypwbxs88jnwr4aczp99j4",
"srcDir": "src",
"url": "https://github.com/ehmry/nim-bigints/archive/86ea14d31eea9275e1408ca34e6bfe9c99989a96.tar.gz"
},
{
"method": "fetchzip",
"packages": [
"npeg"
],
"path": "/nix/store/ffkxmjmigfs7zhhiiqm0iw2c34smyciy-source",
"ref": "1.2.1",
"rev": "26d62fdc40feb84c6533956dc11d5ee9ea9b6c09",
"sha256": "0xpzifjkfp49w76qmaylan8q181bs45anmp46l4bwr3lkrr7bpwh",
"srcDir": "src",
"url": "https://github.com/zevv/npeg/archive/26d62fdc40feb84c6533956dc11d5ee9ea9b6c09.tar.gz"
}
]
}

View File

@ -1,14 +1,61 @@
# Package
# Emulate Nimble from CycloneDX data at sbom.json.
version = "20221208"
author = "Emery Hemingway"
description = "data model and serialization format"
license = "Unlicense"
srcDir = "src"
import std/json
bin = @["preserves/preserves_schema_nim", "preserves/private/preserves_encode", "preserves/schemac"]
proc lookupComponent(sbom: JsonNode; bomRef: string): JsonNode =
for c in sbom{"components"}.getElems.items:
if c{"bom-ref"}.getStr == bomRef:
return c
result = newJNull()
let
sbom = "sbom.json".readFile.parseJson
comp = sbom{"metadata", "component"}
bomRef = comp{"bom-ref"}.getStr
# Dependencies
version = comp{"version"}.getStr
author = comp{"authors"}[0]{"name"}.getStr
description = comp{"description"}.getStr
license = comp{"licenses"}[0]{"license", "id"}.getStr
requires "nim >= 1.4.8", "compiler >= 1.4.8", "npeg"
for prop in comp{"properties"}.getElems.items:
let (key, val) = (prop{"name"}.getStr, prop{"value"}.getStr)
case key
of "nim:skipDirs:":
add(skipDirs, val)
of "nim:skipFiles:":
add(skipFiles, val)
of "nim:skipExt":
add(skipExt, val)
of "nim:installDirs":
add(installDirs, val)
of "nim:installFiles":
add(installFiles, val)
of "nim:installExt":
add(installExt, val)
of "nim:binDir":
add(binDir, val)
of "nim:srcDir":
add(srcDir, val)
of "nim:backend":
add(backend, val)
else:
if key.startsWith "nim:bin:":
namedBin[key[8..key.high]] = val
for depend in sbom{"dependencies"}.items:
if depend{"ref"}.getStr == bomRef:
for depRef in depend{"dependsOn"}.items:
let dep = sbom.lookupComponent(depRef.getStr)
var spec = dep{"name"}.getStr
for extRef in dep{"externalReferences"}.elems:
if extRef{"type"}.getStr == "vcs":
spec = extRef{"url"}.getStr
break
let ver = dep{"version"}.getStr
if ver != "":
if ver.allCharsInSet {'0'..'9', '.'}: spec.add " == "
else: spec.add '#'
spec.add ver
requires spec
break

162
sbom.json Normal file
View File

@ -0,0 +1,162 @@
{
"bomFormat": "CycloneDX",
"specVersion": "1.6",
"metadata": {
"component": {
"type": "application",
"bom-ref": "pkg:nim/preserves",
"name": "preserves",
"description": "data model and serialization format",
"version": "20240523",
"authors": [
{
"name": "Emery Hemingway"
}
],
"licenses": [
{
"license": {
"id": "Unlicense"
}
}
],
"properties": [
{
"name": "nim:skipExt",
"value": "nim"
},
{
"name": "nim:bin:preserves/private/preserves_encode",
"value": "preserves/private/preserves_encode"
},
{
"name": "nim:bin:preserves/preserves_schema_nim",
"value": "preserves/preserves_schema_nim"
},
{
"name": "nim:bin:preserves/preserves_schemac",
"value": "preserves/preserves_schemac"
},
{
"name": "nim:srcDir",
"value": "src"
},
{
"name": "nim:backend",
"value": "c"
}
]
}
},
"components": [
{
"type": "library",
"bom-ref": "pkg:nim/npeg",
"name": "npeg",
"version": "1.2.2",
"externalReferences": [
{
"url": "https://github.com/zevv/npeg/archive/ec0cc6e64ea4c62d2aa382b176a4838474238f8d.tar.gz",
"type": "source-distribution"
},
{
"url": "https://github.com/zevv/npeg.git",
"type": "vcs"
}
],
"properties": [
{
"name": "nix:fod:method",
"value": "fetchzip"
},
{
"name": "nix:fod:path",
"value": "/nix/store/xpn694ibgipj8xak3j4bky6b3k0vp7hh-source"
},
{
"name": "nix:fod:rev",
"value": "ec0cc6e64ea4c62d2aa382b176a4838474238f8d"
},
{
"name": "nix:fod:sha256",
"value": "1fi9ls3xl20bmv1ikillxywl96i9al6zmmxrbffx448gbrxs86kg"
},
{
"name": "nix:fod:url",
"value": "https://github.com/zevv/npeg/archive/ec0cc6e64ea4c62d2aa382b176a4838474238f8d.tar.gz"
},
{
"name": "nix:fod:ref",
"value": "1.2.2"
},
{
"name": "nix:fod:srcDir",
"value": "src"
}
]
},
{
"type": "library",
"bom-ref": "pkg:nim/bigints",
"name": "bigints",
"version": "20231006",
"externalReferences": [
{
"url": "https://github.com/ehmry/nim-bigints/archive/86ea14d31eea9275e1408ca34e6bfe9c99989a96.tar.gz",
"type": "source-distribution"
},
{
"url": "https://github.com/ehmry/nim-bigints.git",
"type": "vcs"
}
],
"properties": [
{
"name": "nix:fod:method",
"value": "fetchzip"
},
{
"name": "nix:fod:path",
"value": "/nix/store/jvrm392g8adfsgf36prgwkbyd7vh5jsw-source"
},
{
"name": "nix:fod:rev",
"value": "86ea14d31eea9275e1408ca34e6bfe9c99989a96"
},
{
"name": "nix:fod:sha256",
"value": "15pcpmnk1bnw3k8769rjzcpg00nahyrypwbxs88jnwr4aczp99j4"
},
{
"name": "nix:fod:url",
"value": "https://github.com/ehmry/nim-bigints/archive/86ea14d31eea9275e1408ca34e6bfe9c99989a96.tar.gz"
},
{
"name": "nix:fod:ref",
"value": "20231006"
},
{
"name": "nix:fod:srcDir",
"value": "src"
}
]
}
],
"dependencies": [
{
"ref": "pkg:nim/preserves",
"dependsOn": [
"pkg:nim/npeg",
"pkg:nim/bigints"
]
},
{
"ref": "pkg:nim/npeg",
"dependsOn": []
},
{
"ref": "pkg:nim/bigints",
"dependsOn": []
}
]
}

View File

@ -41,7 +41,7 @@ SimplePattern =
; special builtins: bool, float, double, int, string, bytes, symbol
/ <atom @atomKind AtomKind>
; matches an embedded value in the input: #!p
; matches an embedded value in the input: #:p
/ <embedded @interface SimplePattern>
; =symbol, <<lit> any>, or plain non-symbol atom

View File

@ -1,2 +1,2 @@
include_rules
: preserves.nim |> !nim_run |>
: preserves.nim |> !nim_check |>

File diff suppressed because it is too large Load Diff

View File

@ -1,3 +1,10 @@
include_rules
NIM_PATH += --path:$(TUP_CWD)/..
: foreach *.nim |> !nim_run |>
NIM_FLAGS += --path:$(TUP_CWD)/..
NIM_FLAGS_preserves_schemac += -d:npegDotDir="../.."
: foreach preserves_schema_nim.nim schemaparse.nim |> !nim_bin |> $(BIN_DIR)/%B | $(BIN_DIR)/<%B>
DOT_FILES = ../../Atom.dot ../../Document.dot ../../Schema.dot
: preserves_schemac.nim |> !nim_bin |> $(BIN_DIR)/preserves-schemac | $(DOT_FILES) $(BIN_DIR)/<preserves-schemac>
: foreach $(DOT_FILES) |> dot -Tsvg -LO %f > %o |> ../../%B-Grammer-Graph.svg
: foreach *hooks.nim |> !nim_run |>

View File

@ -0,0 +1,44 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/times
import ../preserves
const
label = "rfc3339"
fullDateFormat = "yyyy-MM-dd"
partialTimeFormat = "HH:mm:ss"
fullTimeFormat = "HH:mm:sszzz"
dateTimeFormat = "yyyy-MM-dd'T'HH:mm:sszzz"
proc toPreservesHook*(dt: DateTime): Value =
initRecord("rfc3339", toPreserves($dt))
proc fromPreservesHook*(dt: var DateTime; pr: Value): bool =
result = pr.isRecord(label, 1) and pr.record[0].isString
if result:
try:
let
s = pr.record[0].string
n = len(s)
if n == len(fullDateFormat):
dt = parse(s, fullDateFormat)
elif n == len(partialTimeFormat):
dt = parse(s, partialTimeFormat)
elif len(partialTimeFormat) < n and n <= len(fullTimeFormat):
dt = parse(s, fullTimeFormat)
elif len(fullTimeFormat) < n:
dt = parse(s, dateTimeFormat)
else:
result = false
except ValueError:
result = false
runnableExamples:
import std/[times, unittest]
import preserves
var a, b: DateTime
a = now()
var pr = a.toPreservesHook()
check b.fromPreservesHook(pr)
check $a == $b

View File

@ -0,0 +1,92 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import
npeg,
../preserves, ./pegs
type
Frame = tuple[value: Value, pos: int]
Stack = seq[Frame]
proc shrink(stack: var Stack; n: int) = stack.setLen(stack.len - n)
template pushStack(v: Value) = stack.add((v, capture[0].si))
template collectEntries(result: var seq[Value]; stack: var Stack) =
for frame in stack.mitems:
if frame.pos > capture[0].si:
result.add frame.value.move
stack.shrink result.len
proc parseExpressions*(text: string): seq[Value] =
let parser = peg("Document", stack: Stack):
ws <- *{ ' ', '\t', '\r', '\n' }
Document <- *Expr * ws * !1
Annotation <-
('@' * SimpleExpr) |
('#' * {'\x20', '\x09', '\x21'} * @{'\r','\n'})
Trailer <- *(ws * Annotation)
Expr <- ws * (Punct | SimpleExpr) * Trailer
Punct <- {',', ';'} | +':':
pushStack initRecord("p", toSymbol $0)
SimpleExpr <-
Atom |
Compound |
Embedded |
Annotated
Embedded <- "#:" * SimpleExpr:
pushstack stack.pop.value.embed
Annotated <- Annotation * SimpleExpr
Compound <- Sequence | Record | Block | Group | Set
Sequence <- '[' * *Expr * ws * ']':
var pr = Value(kind: pkSequence)
collectEntries(pr.sequence, stack)
pushStack pr
Record <- '<' * *Expr * ws * '>':
var pr = Value(kind: pkRecord)
collectEntries(pr.record, stack)
pr.record.add toSymbol"r"
pushStack pr
Block <- '{' * *Expr * ws * '}':
var pr = Value(kind: pkRecord)
collectEntries(pr.record, stack)
pr.record.add toSymbol"b"
pushStack pr
Group <- '(' * *Expr * ws * ')':
var pr = Value(kind: pkRecord)
collectEntries(pr.record, stack)
pr.record.add toSymbol"g"
pushStack pr
Set <- "#{" * *Expr * ws * '}':
var pr = Value(kind: pkRecord)
collectEntries(pr.record, stack)
pr.record.add toSymbol"s"
pushStack pr
Atom <- Preserves.Atom:
pushStack parsePreserves($0)
var stack: Stack
let match = parser.match(text, stack)
if not match.ok:
raise newException(ValueError, "failed to parse Preserves Expressions:\n" & text[match.matchMax..text.high])
result.setLen stack.len
for i, _ in result:
result[i] = move stack[i].value

View File

@ -1,47 +1,52 @@
# SPDX-FileCopyrightText: 2021 ☭ Emery Hemingway
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[json, tables]
import ../preserves
proc toPreserveHook*(js: JsonNode; E: typedesc): Preserve[E] =
proc toPreservesHook*(js: JsonNode): Value =
case js.kind
of JString:
result = Preserve[E](kind: pkString, string: js.str)
result = js.str.toPreserves()
of JInt:
result = Preserve[E](kind: pkSignedInteger, int: js.num)
result = js.num.toPreserves()
of JFloat:
result = Preserve[E](kind: pkDouble, double: js.fnum)
result = js.fnum.toPreserves()
of JBool:
result = case js.bval
of false: toSymbol("false", E)
of true: toSymbol("true", E)
of false: toSymbol("false")
of true: toSymbol("true")
of JNull:
result = toSymbol("null", E)
result = toSymbol("null")
of JObject:
result = Preserve[E](kind: pkDictionary)
result = Value(kind: pkDictionary)
for key, val in js.fields.pairs:
result[Preserve[E](kind: pkString, string: key)] = toPreserveHook(val, E)
result[Value(kind: pkSymbol, symbol: Symbol key)] = toPreservesHook(val)
of JArray:
result = Preserve[E](kind: pkSequence,
sequence: newSeq[Preserve[E]](js.elems.len))
result = Value(kind: pkSequence,
sequence: newSeq[Value](js.elems.len))
for i, e in js.elems:
result.sequence[i] = toPreserveHook(e, E)
result.sequence[i] = toPreservesHook(e)
proc fromPreserveHook*[E](js: var JsonNode; prs: Preserve[E]): bool =
case prs.kind:
proc fromPreservesHook*(js: var JsonNode; pr: Value): bool =
runnableExamples:
import std/json
var js = JsonNode()
var pr = js.toPreservesHook()
assert js.fromPreservesHook(pr)
fromJsonHook(pr, js)
js = toJsonHook(pr)
case pr.kind:
of pkBoolean:
js = newJBool(prs.bool)
js = newJBool(pr.bool)
of pkFloat:
js = newJFloat(prs.float)
of pkDouble:
js = newJFloat(prs.double)
of pkSignedInteger:
js = newJInt(prs.int)
js = newJFloat(pr.float)
of pkRegister:
js = newJInt(pr.register)
of pkString:
js = newJString(prs.string)
js = newJString(pr.string)
of pkSymbol:
case prs.symbol.string
case pr.symbol.string
of "false":
js = newJBool(false)
of "true":
@ -52,39 +57,38 @@ proc fromPreserveHook*[E](js: var JsonNode; prs: Preserve[E]): bool =
return false
of pkSequence:
js = newJArray()
js.elems.setLen(prs.sequence.len)
for i, val in prs.sequence:
if not fromPreserve(js.elems[i], val):
js.elems.setLen(pr.sequence.len)
for i, val in pr.sequence:
if not js.elems[i].fromPreservesHook(val):
return false
of pkSet:
js = newJArray()
js.elems.setLen(prs.set.len)
js.elems.setLen(pr.set.len)
var i: int
for val in prs.set:
if not fromPreserve(js.elems[i], val):
for val in pr.set:
if not js.elems[i].fromPreservesHook(val):
return false
inc i
of pkDictionary:
js = newJObject()
for (key, val) in prs.dict.items:
if key.kind != pkString:
for (key, val) in pr.dict.items:
case key.kind
of pkSymbol:
var jsVal: JsonNode
if not jsVal.fromPreservesHook(val): return false
js[string key.symbol] = jsVal
of pkString:
var jsVal: JsonNode
if not jsVal.fromPreservesHook(val): return false
js[key.string] = jsVal
else:
return false
var jsVal: JsonNode
if not fromPreserve(jsVal, val): return false
js[key.string] = jsVal
else: return false
true
proc toJsonHook*[E](pr: Preserve[E]): JsonNode =
if not fromPreserveHook(result, pr):
proc toJsonHook*(pr: Value): JsonNode =
if not result.fromPreservesHook(pr):
raise newException(ValueError, "cannot convert Preserves value to JSON")
proc fromJsonHook*[E](pr: var Preserve[E]; js: JsonNode) =
pr = toPreserveHook(js, E)
when isMainModule:
var js = JsonNode()
var pr = js.toPreserveHook(void)
assert fromPreserveHook(js, pr)
fromJsonHook(pr, js)
js = toJsonHook(pr)
proc fromJsonHook*(pr: var Value; js: JsonNode) =
pr = toPreservesHook(js)

View File

@ -1,7 +1,8 @@
# SPDX-FileCopyrightText: 2021 ☭ Emery Hemingway
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
## NPEG rules for Preserves.
## For an explanation of the syntax see https://github.com/zevv/npeg/blob/master/README.md#syntax.
import npeg, npeg/lib/utf8
@ -9,68 +10,73 @@ when defined(nimHasUsed): {.used.}
grammar "Preserves":
ws <- *{ ' ', '\t', '\r', '\n' }
commas <- *(ws * ',') * ws
delimiter <- {
' ', '\t', '\r', '\n',
'<', '>', '[', ']', '{', '}', '(', ')',
'#', ':', '"', '|', '@', ';', ','
} | !1
Document <- Value * ws * !1
Value <-
(ws * (Record | Collection | Atom | Embedded | Compact)) |
(ws * Annotation) |
(ws * ';' * @'\n' * Value)
Atom <- Boolean | Double | DoubleRaw | SignedInteger | String | ByteString | Symbol
Collection <- Sequence | Dictionary | Set
Atom <- Boolean | Float | Double | SignedInteger | String | ByteString | Symbol
Value <- ws * (
Record | Collection | Atom | Embedded | Compact |
Annotation |
('#' * @'\n' * Value) )
Record <- '<' * Value * *Value * ws * '>'
Record <- '<' * +Value * ws * '>'
Sequence <- '[' * ws * *(Value * ws) * ']'
Sequence <- '[' * *(commas * Value) * commas * ']'
Dictionary <- '{' * ws * *(Value * ws * ':' * ws * Value * ws) * '}'
Dictionary <- '{' * *(commas * Value * ws * ':' * Value) * commas * '}'
Set <- "#{" * ws * *(Value * ws) * '}'
Set <- "#{" * *(commas * Value) * commas * '}'
Boolean <- "#f" | "#t"
Boolean <- '#' * {'f', 't'} * &delimiter
Float <- >flt * 'f'
Double <- flt
SignedInteger <- int
nat <- '0' | (Digit-'0') * *Digit
int <- ?'-' * nat
nat <- +Digit
int <- ?('-'|'+') * nat
frac <- '.' * +Digit
exp <- 'e' * ?('-'|'+') * +Digit
flt <- int * ((frac * exp) | frac | exp)
char <- unescaped | '|' | (escape * (escaped | '"' | ('u' * Xdigit[4])))
String <- '"' * >(*char) * '"'
Double <- >flt * &delimiter
ByteString <- charByteString | hexByteString | b64ByteString
charByteString <- "#\"" * >(*binchar) * '"'
hexByteString <- "#x\"" * ws * >(*(Xdigit[2] * ws)) * '"'
b64ByteString <- "#[" * ws * >(*(base64char * ws)) * ']'
binchar <- binunescaped | (escape * (escaped | '"' | ('x' * Xdigit[2])))
binunescaped <- {' '..'!', '#'..'[', ']'..'~'}
base64char <- {'A'..'Z', 'a'..'z', '0'..'9', '+', '/', '-', '_', '='}
Symbol <- >(symstart * *symcont) | ('|' * >(*symchar) * '|')
symstart <- Alpha | sympunct | symustart
symcont <- Alpha | sympunct | symustart | symucont | Digit | '-'
sympunct <- {'~', '!', '$', '%', '^', '&', '*', '?', '_', '=', '+', '/', '.'}
symchar <- unescaped | '"' | (escape * (escaped | '|' | ('u' * Xdigit)))
symustart <- utf8.any - {0..127}
symucont <- utf8.any - {0..127}
# TODO: exclude some unicode ranges
Embedded <- "#!" * Value
Annotation <- '@' * Value * Value
Compact <- "#=" * ws * ByteString
SignedInteger <- int * &delimiter
unescaped <- utf8.any - { '\x00'..'\x19', '"', '\\', '|' }
unicodeEscaped <- 'u' * Xdigit[4]
escaped <- {'\\', '/', 'b', 'f', 'n', 'r', 't'}
escape <- '\\'
ws <- *(' ' | '\t' | '\r' | '\n' | ',')
char <- unescaped | '|' | (escape * (escaped | '"' | unicodeEscaped))
String <- '"' * >(*char) * '"'
binunescaped <- {' '..'!', '#'..'[', ']'..'~'}
binchar <- binunescaped | (escape * (escaped | '"' | ('x' * Xdigit[2])))
ByteString <- charByteString | hexByteString | b64ByteString
charByteString <- "#\"" * >(*binchar) * '"'
hexByteString <- "#x\"" * >(*(ws * Xdigit[2])) * ws * '"'
base64char <- {'A'..'Z', 'a'..'z', '0'..'9', '+', '/', '-', '_', '='}
b64ByteString <- "#[" * >(*(ws * base64char)) * ws * ']'
symchar <- (utf8.any - {'\\', '|'}) | (escape * (escaped | unicodeEscaped)) | "\\|"
QuotedSymbol <- '|' * >(*symchar) * '|'
sympunct <- {'~', '!', '$', '%', '^', '&', '*', '?', '_', '=', '+', '-', '/', '.'}
symuchar <- utf8.any - { 0..127 }
SymbolOrNumber <- >(+(Alpha | Digit | sympunct | symuchar))
Symbol <- QuotedSymbol | (SymbolOrNumber * &delimiter)
Embedded <- "#:" * Value
Annotation <- '@' * Value * Value
Compact <- "#=" * ws * ByteString
DoubleRaw <- "#xd\"" * >((ws * Xdigit[2])[8]) * ws * '"'

File diff suppressed because it is too large Load Diff

View File

@ -0,0 +1,58 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[hashes, os, parseopt, streams, strutils, tables]
import ../preserves, ./schema, ./schemaparse
when isMainModule:
let outStream = newFileStream(stdout)
var
inputPath = ""
noBundle = false
for kind, key, arg in getopt():
case kind
of cmdEnd: discard
of cmdArgument:
if inputPath != "":
quit "only a single path may specified"
inputPath = key
of cmdLongOption:
if arg != "":
quit("flag does not take an argument: " & key & " " & arg)
case key
of "no-bundle": noBundle = true
else: quit(key & "flag not recognized")
else: quit(key & "flag not recognized")
if inputPath == "":
quit "input file(s) not specified"
if noBundle:
if not fileExists inputPath:
quit(inputPath & " does not exist or is not a file")
var schema = parsePreservesSchema(readFile(inputPath))
write(outStream, schema.toPreserves)
else:
var bundle: Bundle
if not dirExists inputPath:
quit "not a directory of schemas: " & inputPath
else:
for filePath in walkDirRec(inputPath, relative = true):
var (dirPath, fileName, fileExt) = splitFile(filePath)
if fileExt == ".prs":
var
scm = parsePreservesSchema(readFile(inputPath / filePath))
path: ModulePath
for e in split(dirPath, '/'):
if e != "": add(path, Symbol e)
add(path, Symbol fileName)
bundle.modules[path] = scm
if bundle.modules.len == 0:
quit "no schemas parsed"
else:
write(outStream, bundle.toPreserves)
close(outStream)

View File

@ -1,2 +1,9 @@
include_rules
: preserves_encode.nim |> !nim |>
GROUP = $(BIN_DIR)/<preserves_encode>
: preserves_encode.nim |> !nim |> $(BIN_DIR)/preserves_encode | $(GROUP) {bin}
!link = |> ^o symlink %o^ ln -s preserves_encode %o |> | $(GROUP)
: {bin} |> !link |> $(BIN_DIR)/preserves_decode
: {bin} |> !link |> $(BIN_DIR)/preserves_from_json
: {bin} |> !link |> $(BIN_DIR)/preserves_from_xml
: {bin} |> !link |> $(BIN_DIR)/preserves_to_json
: {bin} |> !link |> $(BIN_DIR)/preserves_to_xml

View File

@ -0,0 +1,79 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[assertions, endians, options, streams, strutils]
import bigints
import ./decoding, ./parsing, ./values
type BufferedDecoder* = object
## Type for buffering binary Preserves before decoding.
stream: StringStream
appendPosition, decodePosition, maxSize: int
proc newBufferedDecoder*(maxSize = 4096): BufferedDecoder =
## Create a new `newBufferedDecoder`.
runnableExamples:
var
buf = newBufferedDecoder()
bin = encode(parsePreserves("<foobar>"))
buf.feed(bin[0..2])
buf.feed(bin[3..bin.high])
var (success, pr) = decode(buf)
assert success
assert $pr == "<foobar>"
BufferedDecoder(
stream: newStringStream(newStringOfCap(maxSize)),
maxSize: maxSize,
)
proc feed*(dec: var BufferedDecoder; buf: pointer; len: int) =
assert len > 0
if dec.maxSize > 0 and dec.maxSize < (dec.appendPosition + len):
raise newException(IOError, "BufferedDecoder at maximum buffer size")
dec.stream.setPosition(dec.appendPosition)
dec.stream.writeData(buf, len)
inc(dec.appendPosition, len)
assert dec.appendPosition == dec.stream.getPosition()
proc feed*[T: byte|char](dec: var BufferedDecoder; data: openarray[T]) =
if data.len > 0:
dec.feed(addr data[0], data.len)
proc feed*[T: byte|char](dec: var BufferedDecoder; data: openarray[T]; slice: Slice[int]) =
let n = slice.b + 1 - slice.a
if n > 0:
dec.feed(addr data[slice.a], n)
proc decode*(dec: var BufferedDecoder): Option[Value] =
## Decode from `dec`. If decoding fails the internal position of the
## decoder does not advance.
if dec.appendPosition > 0:
assert(dec.decodePosition < dec.appendPosition)
dec.stream.setPosition(dec.decodePosition)
try:
result = dec.stream.decodePreserves.some
dec.decodePosition = dec.stream.getPosition()
if dec.decodePosition == dec.appendPosition:
dec.stream.setPosition(0)
dec.stream.data.setLen(0)
dec.appendPosition = 0
dec.decodePosition = 0
except IOError:
discard
proc parse*(dec: var BufferedDecoder): Option[Value] =
## Parse from `dec`. If parsing fails the internal position of the
## decoder does not advance.
if dec.appendPosition > 0:
assert(dec.decodePosition < dec.appendPosition)
dec.stream.setPosition(dec.decodePosition)
try:
result = dec.stream.readAll.parsePreserves.some
dec.decodePosition = dec.stream.getPosition()
if dec.decodePosition == dec.appendPosition:
dec.stream.setPosition(0)
dec.stream.data.setLen(0)
dec.appendPosition = 0
dec.decodePosition = 0
except IOError, ValueError:
discard

View File

@ -0,0 +1,144 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[endians, options, streams, strutils]
import bigints
import ./values
proc readVarint(s: Stream): uint =
var
shift = 0
c = uint s.readUint8
while (c and 0x80) == 0x80:
result = result or ((c and 0x7f) shl shift)
inc(shift, 7)
c = uint s.readUint8
result = result or (c shl shift)
proc decodePreserves*(s: Stream): Value {.gcsafe.}
proc decodePreserves(s: Stream; tag: uint8): Value =
## Decode a Preserves value from a binary-encoded stream.
const endMarker = 0x84
case tag
of 0x80: return Value(kind: pkBoolean, bool: false)
of 0x81: return Value(kind: pkBoolean, bool: true)
else: discard
if s.atEnd:
raise newException(IOError, "End of Preserves stream")
case tag
of 0x85:
discard decodePreserves(s)
result = decodePreserves(s)
of 0x86:
result = decodePreserves(s)
result.embedded = true
of 0x87:
result = Value(kind: pkFloat)
var N: int
let n = int s.readUint8()
case n
of 4:
var
buf: uint32
float: float32
N = s.readData(addr buf, sizeof(buf))
bigEndian32(addr float, addr buf)
result.float = BiggestFloat float
of 8:
var buf: uint64
N = s.readData(addr buf, sizeof(buf))
bigEndian64(addr result.float, addr buf)
else:
raise newException(IOError, "unhandled IEEE754 value of " & $n & " bytes")
if N != n: raise newException(IOError, "short read")
of 0xb0:
var n = int s.readVarint()
if n <= sizeof(int):
result = Value(kind: pkRegister)
if n > 0:
var
buf: array[sizeof(int), byte]
off = buf.len - n
if s.readData(addr buf[off], n) != n:
raise newException(IOError, "short read")
if off > 0:
var fill: uint8 = if (buf[off] and 0x80) == 0x80'u8: 0xff else: 0x00'u8
for i in 0..<off: buf[i] = fill
when buf.len == 4:
bigEndian32(addr result.register, addr buf[0])
elif buf.len == 8:
bigEndian64(addr result.register, addr buf[0])
else: {.error: "int size " & $buf.len & " not supported here".}
else:
result = Value(kind: pkBigInt)
var buf = newSeq[byte](n)
if s.readData(addr buf[0], buf.len) != n:
raise newException(IOError, "short read")
if (buf[0] and 0x80) == 0x80:
for i, b in buf: buf[i] = not b
result.bigint.fromBytes(buf, bigEndian)
result.bigint = -(result.bigint.succ)
else:
result.bigint.fromBytes(buf, bigEndian)
of 0xb1:
result = Value(kind: pkString, string: newString(s.readVarint()))
if result.string.len > 0:
if s.readData(addr result.string[0], result.string.len) != result.string.len:
raise newException(IOError, "short read")
of 0xb2:
var data = newSeq[byte](s.readVarint())
if data.len > 0:
let n = s.readData(addr data[0], data.len)
if n != data.len:
raise newException(IOError, "short read")
result = Value(kind: pkByteString, bytes: data)
of 0xb3:
var data = newString(s.readVarint())
if data.len > 0:
let n = s.readData(addr data[0], data.len)
if n != data.len:
raise newException(IOError, "short read")
result = Value(kind: pkSymbol, symbol: Symbol data)
of 0xb4:
result = Value(kind: pkRecord)
var label = decodePreserves(s)
var tag = s.readUint8()
while tag != endMarker:
result.record.add decodePreserves(s, tag)
tag = s.readUint8()
result.record.add(move label)
of 0xb5:
result = Value(kind: pkSequence)
var tag = s.readUint8()
while tag != endMarker:
result.sequence.add decodePreserves(s, tag)
tag = s.readUint8()
of 0xb6:
result = Value(kind: pkSet)
var tag = s.readUint8()
while tag != endMarker:
incl(result, decodePreserves(s, tag))
tag = s.readUint8()
of 0xb7:
result = Value(kind: pkDictionary)
var tag = s.readUint8()
while tag != endMarker:
result[decodePreserves(s, tag)] = decodePreserves(s)
tag = s.readUint8()
of endMarker:
raise newException(ValueError, "invalid Preserves stream")
else:
raise newException(ValueError, "invalid Preserves tag byte 0x" & tag.toHex(2))
proc decodePreserves*(s: Stream): Value {.gcsafe.} =
## Decode a Preserves value from a binary-encoded stream.
s.decodePreserves s.readUint8()
proc decodePreserves*(s: string): Value =
## Decode a string of binary-encoded Preserves.
decodePreserves(s.newStringStream)
proc decodePreserves*(s: seq[byte]): Value =
## Decode a byte-string of binary-encoded Preserves.
decodePreserves(cast[string](s))

View File

@ -0,0 +1,124 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[algorithm, assertions, endians, streams]
import bigints
import ./values
proc writeVarint(s: Stream; n: Natural) =
var n = n
while n > 0x7f:
s.write(uint8 n or 0x80)
n = n shr 7
s.write(uint8 n and 0x7f)
proc write*(str: Stream; pr: Value) =
## Write the binary-encoding of a Preserves value to a stream.
if pr.embedded: str.write(0x86'u8)
case pr.kind:
of pkBoolean:
case pr.bool
of false: str.write(0x80'u8)
of true: str.write(0x81'u8)
of pkFloat:
str.write("\x87\x08")
when system.cpuEndian == bigEndian:
str.write(pr.double)
else:
var be: float64
swapEndian64(be.addr, pr.float.unsafeAddr)
str.write(be)
of pkRegister:
if pr.register == 0: str.write("\xb0\x00")
else:
const bufLen = sizeof(int)
var buf: array[bufLen, byte]
when bufLen == 4: bigEndian32(addr buf[0], addr pr.register)
elif bufLen == 8: bigEndian64(addr buf[0], addr pr.register)
else: {.error: "int size " & $bufLen & " not supported here".}
if buf[0] != 0x00 and buf[0] != 0xff:
str.write(cast[string](buf)) # dumbass hex conversion
else:
var start = 0
while start < buf.high and buf[0] == buf[succ start]: inc start
if start < buf.high and (buf[succ start] and 0x80) == (buf[0] and 0x80): inc start
str.write('\xb0')
str.write(uint8(bufLen - start))
str.write(cast[string](buf[start..<bufLen]))
of pkBigInt:
if pr.bigint.isZero: str.write("\xb0\x00")
elif pr.bigint.isNegative:
var buf = pr.bigint.succ.toBytes(bigEndian)
for i, b in buf: buf[i] = not b
str.write('\xb0')
if (buf[0] and 0x80) != 0x80:
str.writeVarint(buf.len.succ)
str.write('\xff')
else:
str.writeVarint(buf.len)
str.write(cast[string](buf))
else:
var buf = pr.bigint.toBytes(bigEndian)
str.write('\xb0')
if (buf[0] and 0x80) != 0:
str.writeVarint(buf.len.succ)
str.write('\x00')
else:
str.writeVarint(buf.len)
str.write(cast[string](buf))
of pkString:
str.write(0xb1'u8)
str.writeVarint(pr.string.len)
str.write(pr.string)
of pkByteString:
str.write(0xb2'u8)
str.writeVarint(pr.bytes.len)
str.write(cast[string](pr.bytes))
of pkSymbol:
str.write(0xb3'u8)
str.writeVarint(pr.symbol.len)
str.write(string pr.symbol)
of pkRecord:
assert(pr.record.len > 0)
str.write(0xb4'u8)
str.write(pr.record[pr.record.high])
for i in 0..<pr.record.high:
str.write(pr.record[i])
str.write(0x84'u8)
of pkSequence:
str.write(0xb5'u8)
for e in pr.sequence:
str.write(e)
str.write(0x84'u8)
of pkSet:
str.write(0xb6'u8)
for val in pr.set.items:
str.write(val)
str.write(0x84'u8)
of pkDictionary:
var
keyIndices = newSeqOfCap[(string, int)](pr.dict.len)
keyBuffer = newStringStream()
for i in 0..pr.dict.high:
keyBuffer.write(pr.dict[i][0])
keyIndices.add((keyBuffer.data.move, i))
keyBuffer.setPosition(0)
# add each encoded key and its index to the seq
sort(keyIndices) do (a, b: (string, int)) -> int:
cmp(a[0], b[0])
# sort the seq by encoded keys
str.write(0xb7'u8)
for (keyBytes, i) in keyIndices:
str.write(keyBytes)
str.write(pr.dict[i][1])
# encode the values in sorted key order
str.write(0x84'u8)
of pkEmbedded:
# str.write(0x86'u8)
raise newException(ValueError, "cannot encode an embedded object")
proc encode*(pr: Value): seq[byte] =
## Return the binary-encoding of a Preserves value.
let s = newStringStream()
s.write pr
result = cast[seq[byte]](move s.data)

View File

@ -7,7 +7,7 @@
# distribution, for details about the copyright.
#
import std/macros
import std/[assertions, macros]
const
nnkPragmaCallKinds = {nnkExprColonExpr, nnkCall, nnkCallStrLit}
@ -30,16 +30,16 @@ proc extractTypeImpl(n: NimNode): NimNode =
proc customPragmaNode(n: NimNode): NimNode =
expectKind(n, {nnkSym, nnkDotExpr, nnkBracketExpr, nnkTypeOfExpr, nnkType, nnkCheckedFieldExpr})
let
var
typ = n.getTypeInst()
if typ.kind == nnkBracketExpr and typ.len > 1 and typ[1].kind == nnkProcTy:
return typ[1][1]
elif typ.typeKind == ntyTypeDesc:
let impl = getImpl(
if kind(typ[1]) == nnkBracketExpr: typ[1][0]
else: typ[1]
)
typ = typ[1]
while kind(typ) == nnkBracketExpr:
typ = typ[0]
let impl = getImpl(typ)
if impl.kind == nnkNilLit:
return impl
elif impl[0].kind == nnkPragmaExpr:

View File

@ -1,16 +1,15 @@
# SPDX-FileCopyrightText: 2021 ☭ Emery Hemingway
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
# this module is included in ../../preserves.nim
import std/[parseutils, unicode]
import std/[assertions, base64, options, parseutils, strutils, unicode]
from std/sequtils import insert
from std/strutils import Whitespace, parseFloat, parseHexStr, parseInt, tokenize
import npeg
import bigints, npeg
import ../pegs
import ./decoding, ./values
type
Value = Preserve[void]
Frame = tuple[value: Value, pos: int]
Stack = seq[Frame]
@ -38,11 +37,30 @@ template unescape*(buf: var string; capture: string) =
of 't': add(buf, char 0x09)
of '"': add(buf, char 0x22)
of 'u':
var r: int32
var short: uint16
inc(i)
discard parseHex(capture, r, i, 4)
discard parseHex(capture, short, i, 4)
inc(i, 3)
add(buf, Rune r)
if (short shr 15) == 0:
add(buf, Rune(short).toUtf8)
elif (short shr 10) == 0b110110:
if i+6 >= capture.len:
raise newException(ValueError, "Invalid UTF-16 surrogate pair")
var rune = uint32(short shl 10) + 0x10000
validate(capture[i+1] == '\\')
validate(capture[i+2] == 'u')
inc(i, 3)
discard parseHex(capture, short, i, 4)
if (short shr 10) != 0b110111:
raise newException(ValueError, "Invalid UTF-16 surrogate pair")
inc(i, 3)
rune = rune or (short and 0b1111111111)
#add(buf, Rune(rune).toUTF8)
let j = buf.len
buf.setLen(buf.len+4)
rune.Rune.fastToUTF8Copy(buf, j, false)
else:
raise newException(ValueError, "Invalid UTF-16 escape sequence " & capture)
else:
validate(false)
else:
@ -75,11 +93,17 @@ template unescape(buf: var seq[byte]; capture: string) =
add(buf, byte capture[i])
inc(i)
proc parsePreserves*(text: string): Preserve[void] {.gcsafe.} =
## Parse a text-encoded Preserves `string` to a `Preserve` value.
runnableExamples:
assert parsePreserves"[ 1 2 3 ]" == [ 1, 2, 3 ].toPreserve
const pegParser = peg("Document", stack: Stack):
proc pushHexNibble[T](result: var T; c: char) =
var n = case c
of '0'..'9': T(ord(c) - ord('0'))
of 'a'..'f': T(ord(c) - ord('a') + 10)
of 'A'..'F': T(ord(c) - ord('A') + 10)
else: return
result = (result shl 4) or n
proc parsePreserves*(text: string): Value =
## Parse a text-encoded Preserves `string` to a Preserves `Value`.
let pegParser = peg("Document", stack: Stack):
# Override rules from pegs.nim
Document <- Preserves.Document
@ -131,20 +155,28 @@ proc parsePreserves*(text: string): Preserve[void] {.gcsafe.} =
of "#t": pushStack Value(kind: pkBoolean, bool: true)
else: discard
Preserves.Float <- Preserves.Float:
Preserves.Double <- Preserves.Double:
pushStack Value(kind: pkFloat, float: parseFloat($1))
Preserves.Double <- Preserves.Double:
pushStack Value(kind: pkDouble)
let i = stack.high
discard parseBiggestFloat($0, stack[i].value.double)
Preserves.DoubleRaw <- Preserves.DoubleRaw:
var reg: uint64
for c in $1: pushHexNibble(reg, c)
pushStack Value(kind: pkFloat, float: cast[float64](reg))
Preserves.SignedInteger <- Preserves.SignedInteger:
pushStack Value(kind: pkSignedInteger, int: parseInt($0))
var
big = initBigInt($0)
small = toInt[int](big)
if small.isSome:
pushStack Value(kind: pkRegister, register: small.get)
else:
pushStack Value(kind: pkBigInt, bigint: big)
Preserves.String <- Preserves.String:
var v = Value(kind: pkString, string: newStringOfCap(len($1)))
unescape(v.string, $1)
if validateUtf8(v.string) != -1:
raise newException(ValueError, "Preserves text contains an invalid UTF-8 sequence")
pushStack v
Preserves.charByteString <- Preserves.charByteString:
@ -159,7 +191,9 @@ proc parsePreserves*(text: string): Preserve[void] {.gcsafe.} =
pushStack Value(kind: pkByteString, bytes: cast[seq[byte]](base64.decode(joinWhitespace($1))))
Preserves.Symbol <- Preserves.Symbol:
pushStack Value(kind: pkSymbol, symbol: Symbol $1)
var buf = newStringOfCap(len($1))
unescape(buf, $1)
pushStack Value(kind: pkSymbol, symbol: Symbol buf)
Preserves.Embedded <- Preserves.Embedded:
var v = stack.pop.value
@ -172,7 +206,7 @@ proc parsePreserves*(text: string): Preserve[void] {.gcsafe.} =
pushStack val
Preserves.Compact <- Preserves.Compact:
pushStack decodePreserves(stack.pop.value.bytes, void)
pushStack decodePreserves(stack.pop.value.bytes)
var stack: Stack
let match = pegParser.match(text, stack)
@ -181,7 +215,57 @@ proc parsePreserves*(text: string): Preserve[void] {.gcsafe.} =
assert(stack.len == 1)
stack.pop.value
proc parsePreserves*(text: string; E: typedesc): Preserve[E] {.gcsafe.} =
## Parse a text-encoded Preserves `string` to a `Preserve[E]` value for embedded type `E`.
when E is void: parsePreserves(text)
else: mapEmbeds(parsePreserves(text), E)
proc parsePreservesAtom*(text: string): Atom =
## Parse a text-encoded Preserves `string` to a Preserves `Atom`.
let pegParser = peg("Atom", a: Atom):
# Override rules from pegs.nim
Atom <- ?"#:" * Preserves.Atom
Preserves.Boolean <- Preserves.Boolean:
case $0
of "#f": a = Atom(kind: pkBoolean)
of "#t": a = Atom(kind: pkBoolean, bool: true)
else: discard
Preserves.Float <- Preserves.Float:
a = Atom(kind: pkFloat)
validate(parseBiggestFloat($0, a.float) == len($0))
Preserves.FloatRaw <- Preserves.FloatRaw:
var reg: uint64
for c in $1: pushHexNibble(reg, c)
a = Atom(kind: pkFloat, float: cast[float64](reg))
Preserves.SignedInteger <- Preserves.SignedInteger:
var
big = initBigInt($0)
small = toInt[int](big)
if small.isSome:
a = Atom(kind: pkRegister, register: small.get)
else:
a = Atom(kind: pkBigInt, bigint: big)
Preserves.String <- Preserves.String:
a = Atom(kind: pkString, string: newStringOfCap(len($1)))
unescape(a.string, $1)
if validateUtf8(a.string) != -1:
raise newException(ValueError, "Preserves text contains an invalid UTF-8 sequence")
Preserves.charByteString <- Preserves.charByteString:
a = Atom(kind: pkByteString, bytes: newSeqOfCap[byte](len($1)))
unescape(a.bytes, $1)
Preserves.hexByteString <- Preserves.hexByteString:
a = Atom(kind: pkByteString, bytes: cast[seq[byte]](parseHexStr(joinWhitespace($1))))
Preserves.b64ByteString <- Preserves.b64ByteString:
a = Atom(kind: pkByteString, bytes: cast[seq[byte]](base64.decode(joinWhitespace($1))))
Preserves.Symbol <- Preserves.Symbol:
var buf = newStringOfCap(len($1))
unescape(buf, $1)
a = Atom(kind: pkSymbol, symbol: Symbol buf)
if not pegParser.match(text, result).ok:
raise newException(ValueError, "failed to parse Preserves atom: " & text)

View File

@ -19,17 +19,17 @@ when isMainModule:
of "preserves_from_json":
let
js = stdin.newFileStream.parseJson
pr = js.toPreserve
pr = js.toPreserves
stdout.newFileStream.write(pr)
of "preserves_from_xml":
let
xn = stdin.newFileStream.parseXml
pr = xn.toPreserveHook(void)
pr = xn.toPreservesHook()
stdout.newFileStream.write(pr)
of "preserves_to_json":
let
pr = stdin.readAll.decodePreserves
js = preserveTo(pr, JsonNode)
js = preservesTo(pr, JsonNode)
if js.isSome:
stdout.writeLine(get js)
else:
@ -37,7 +37,7 @@ when isMainModule:
of "preserves_to_xml":
let pr = stdin.readAll.decodePreserves
var xn: XmlNode
if fromPreserve(xn, pr):
if fromPreserves(xn, pr):
stdout.writeLine(xn)
else:
quit("Preserves not convertable to XML")

View File

@ -0,0 +1,168 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[assertions, base64, endians, sequtils, streams, strutils]
when not defined(nimNoLibc):
import std/math
import bigints
import ./values
const hexAlphabet = "0123456789abcdef"
type TextMode* = enum textPreserves, textJson
template writeEscaped(stream: Stream; text: string; delim: char) =
const escaped = { '"', '\\', '\b', '\f', '\n', '\r', '\t' }
var
i: int
c: char
while i < text.len:
c = text[i]
case c
of delim:
write(stream, '\\')
write(stream, delim)
of '\\': write(stream, "\\\\")
of '\b': write(stream, "\\b")
of '\f': write(stream, "\\f")
of '\n': write(stream, "\\n")
of '\r': write(stream, "\\r")
of '\t': write(stream, "\\t")
of { '\x00'..'\x1f', '\x7f' } - escaped:
# do not use \x__ notation because
# it is a subset of \u____.
write(stream, "\\u00")
write(stream, c.uint8.toHex(2))
else: write(stream, c)
inc i
proc writeSymbol(stream: Stream; sym: string) =
if sym.len > 0 and sym[0] in {'A'..'z'} and not sym.anyIt(char(it) in { '\x00'..'\x19', '"', '\\', '|' }):
write(stream, sym)
else:
write(stream, '|')
writeEscaped(stream, sym, '|')
write(stream, '|')
proc writeFloatBytes(stream: Stream; f: float) =
var buf: array[8, byte]
bigEndian64(addr buf[0], addr f)
write(stream, "#xd\"")
for b in buf:
write(stream, hexAlphabet[b shr 4])
write(stream, hexAlphabet[b and 0xf])
write(stream, '"')
proc writeText*(stream: Stream; pr: Value; mode = textPreserves) =
## Encode Preserves to a `Stream` as text.
if pr.embedded: write(stream, "#:")
case pr.kind:
of pkBoolean:
case pr.bool
of false: write(stream, "#f")
of true: write(stream, "#t")
of pkFloat:
when defined(nimNoLibc):
writeFloatBytes(stream, pr.float)
# IEE754-to-decimal is non-trivial
else:
if pr.float.classify in {fcNormal, fcZero, fcNegZero}:
write(stream, $pr.float)
else:
writeFloatBytes(stream, pr.float)
of pkRegister:
write(stream, $pr.register)
of pkBigInt:
write(stream, $pr.bigint)
of pkString:
write(stream, '"')
writeEscaped(stream, pr.string, '"')
write(stream, '"')
of pkByteString:
if pr.bytes.allIt(char(it) in {' '..'!', '#'..'~'}):
write(stream, "#\"")
write(stream, cast[string](pr.bytes))
write(stream, '"')
else:
if pr.bytes.len > 64:
write(stream, "#[") #]#
write(stream, base64.encode(pr.bytes))
write(stream, ']')
else:
write(stream, "#x\"")
for b in pr.bytes:
write(stream, hexAlphabet[b.int shr 4])
write(stream, hexAlphabet[b.int and 0xf])
write(stream, '"')
of pkSymbol:
writeSymbol(stream, pr.symbol.string)
of pkRecord:
assert(pr.record.len > 0)
write(stream, '<')
writeText(stream, pr.record[pr.record.high], mode)
for i in 0..<pr.record.high:
write(stream, ' ')
writeText(stream, pr.record[i], mode)
write(stream, '>')
of pkSequence:
write(stream, '[')
var insertSeperator: bool
case mode
of textPreserves:
for val in pr.sequence:
if insertSeperator: write(stream, ' ')
else: insertSeperator = true
writeText(stream, val, mode)
of textJson:
for val in pr.sequence:
if insertSeperator: write(stream, ',')
else: insertSeperator = true
writeText(stream, val, mode)
write(stream, ']')
of pkSet:
write(stream, "#{")
var insertSeperator: bool
for val in pr.set.items:
if insertSeperator: write(stream, ' ')
else: insertSeperator = true
writeText(stream, val, mode)
write(stream, '}')
of pkDictionary:
write(stream, '{')
var insertSeperator: bool
case mode
of textPreserves:
for (key, value) in pr.dict.items:
if insertSeperator: write(stream, ' ')
else: insertSeperator = true
writeText(stream, key, mode)
write(stream, ": ")
writeText(stream, value, mode)
of textJson:
for (key, value) in pr.dict.items:
if insertSeperator: write(stream, ',')
else: insertSeperator = true
writeText(stream, key, mode)
write(stream, ':')
writeText(stream, value, mode)
write(stream, '}')
of pkEmbedded:
if not pr.embedded: write(stream, "#:")
if pr.embeddedRef.isNil:
write(stream, "<null>")
else:
when compiles($pr.embed):
write(stream, $pr.embed)
else:
write(stream, "")
proc `$`*(sym: Symbol): string =
var stream = newStringStream()
writeSymbol(stream, sym.string)
result = move stream.data
proc `$`*(pr: Value): string =
## Generate the textual representation of ``pr``.
var stream = newStringStream()
writeText(stream, pr, textPreserves)
result = move stream.data

View File

@ -0,0 +1,266 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[algorithm, hashes, options, sets, sequtils, tables]
import bigints
type
PreserveKind* = enum
pkBoolean, pkFloat, pkRegister, pkBigInt, pkString, pkByteString, pkSymbol,
pkRecord, pkSequence, pkSet, pkDictionary, pkEmbedded
const
atomKinds* = {pkBoolean, pkFloat, pkRegister, pkBigInt, pkString, pkByteString, pkSymbol}
compoundKinds* = {pkRecord, pkSequence, pkSet, pkDictionary}
type Symbol* = distinct string
proc `<`*(x, y: Symbol): bool {.borrow.}
proc `==`*(x, y: Symbol): bool {.borrow.}
proc hash*(s: Symbol): Hash {.borrow.}
proc len*(s: Symbol): int {.borrow.}
type
Atom* = object
## Atomic Preserves value.
## Useful when a `const Value` is required.
case kind*: PreserveKind
of pkBoolean:
bool*: bool
of pkFloat:
float*: float
of pkRegister:
register*: int
of pkBigInt:
bigint*: BigInt
of pkString:
string*: string
of pkByteString:
bytes*: seq[byte]
of pkSymbol:
symbol*: Symbol
else:
discard
Value* = object
case kind*: PreserveKind
of pkBoolean:
bool*: bool
of pkFloat:
float*: float
of pkRegister:
register*: int
of pkBigInt:
bigint*: BigInt
of pkString:
string*: string
of pkByteString:
bytes*: seq[byte]
of pkSymbol:
symbol*: Symbol
of pkRecord:
record*: seq[Value] # label is last
of pkSequence:
sequence*: seq[Value]
of pkSet:
set*: seq[Value]
# TODO: HashSet
of pkDictionary:
dict*: seq[DictEntry]
# TODO: Tables
of pkEmbedded:
embeddedRef*: EmbeddedRef
embedded*: bool
## Flag to mark embedded Preserves value
DictEntry* = tuple[key: Value, val: Value]
EmbeddedRef* = ref RootObj
EmbeddedObj* = RootObj
## Object refs embedded in Preserves `Value`s must inherit from `EmbeddedObj`.
## At the moment this is just an alias to `RootObj` but this may change in the future.
func `==`*(x, y: Value): bool =
## Check `x` and `y` for equivalence.
if x.kind == y.kind and x.embedded == y.embedded:
case x.kind
of pkBoolean:
result = x.bool == y.bool
of pkFloat:
result = cast[uint64](x.float) == cast[uint64](y.float)
of pkRegister:
result = x.register == y.register
of pkBigInt:
result = x.bigint == y.bigint
of pkString:
result = x.string == y.string
of pkByteString:
result = x.bytes == y.bytes
of pkSymbol:
result = x.symbol == y.symbol
of pkRecord:
result = x.record.len == y.record.len
for i in 0..x.record.high:
if not result: break
result = result and (x.record[i] == y.record[i])
of pkSequence:
for i, val in x.sequence:
if y.sequence[i] != val: return false
result = true
of pkSet:
result = x.set.len == y.set.len
for i in 0..x.set.high:
if not result: break
result = result and (x.set[i] == y.set[i])
of pkDictionary:
result = x.dict.len == y.dict.len
for i in 0..x.dict.high:
if not result: break
result = result and
(x.dict[i].key == y.dict[i].key) and
(x.dict[i].val == y.dict[i].val)
of pkEmbedded:
result = x.embeddedRef == y.embeddedRef
proc `<`(x, y: string | seq[byte]): bool =
for i in 0 .. min(x.high, y.high):
if x[i] < y[i]: return true
if x[i] != y[i]: return false
x.len < y.len
proc `<`*(x, y: Value): bool =
## Preserves have a total order over values. Check if `x` is ordered before `y`.
if x.embedded != y.embedded:
result = y.embedded
elif x.kind != y.kind:
result = x.kind < y.kind
else:
case x.kind
of pkBoolean:
result = (not x.bool) and y.bool
of pkFloat:
result = x.float < y.float
of pkRegister:
result = x.register < y.register
of pkBigInt:
result = x.bigint < y.bigint
of pkString:
result = x.string < y.string
of pkByteString:
result = x.bytes < y.bytes
of pkSymbol:
result = x.symbol < y.symbol
of pkRecord:
if x.record[x.record.high] < y.record[y.record.high]: return true
for i in 0..<min(x.record.high, y.record.high):
if x.record[i] < y.record[i]: return true
if x.record[i] == y.record[i]: return false
result = x.record.len < y.record.len
of pkSequence:
for i in 0..min(x.sequence.high, y.sequence.high):
if x.sequence[i] < y.sequence[i]: return true
if x.sequence[i] != y.sequence[i]: return false
result = x.sequence.len < y.sequence.len
of pkSet:
for i in 0..min(x.set.high, y.set.high):
if x.set[i] < y.set[i]: return true
if x.set[i] != y.set[i]: return false
result = x.set.len < y.set.len
of pkDictionary:
for i in 0..min(x.dict.high, y.dict.high):
if x.dict[i].key < y.dict[i].key: return true
if x.dict[i].key == y.dict[i].key:
if x.dict[i].val < y.dict[i].val: return true
if x.dict[i].val != y.dict[i].val: return false
result = x.dict.len < y.dict.len
of pkEmbedded:
result = x.embeddedRef < y.embeddedRef
func cmp*(x, y: Value): int =
## Compare by Preserves total ordering.
if x == y: 0
elif x < y: -1
else: 1
proc sort*(pr: var Value) = sort(pr.sequence, cmp)
## Sort a Preserves array by total ordering.
proc hash*(pr: Value): Hash =
## Produce a `Hash` of `pr` for use with a `HashSet` or `Table`.
var h = hash(pr.kind.int) !& hash(pr.embedded)
case pr.kind
of pkBoolean:
h = h !& hash(pr.bool)
of pkFloat:
h = h !& hash(pr.float)
of pkRegister:
h = h !& hash(pr.register)
of pkBigInt:
h = h !& hash(pr.bigint)
of pkString:
h = h !& hash(pr.string)
of pkByteString:
h = h !& hash(pr.bytes)
of pkSymbol:
h = h !& hash(string pr.symbol)
of pkRecord:
for val in pr.record:
h = h !& hash(val)
of pkSequence:
for val in pr.sequence:
h = h !& hash(val)
of pkSet:
for val in pr.set.items:
h = h !& hash(val)
of pkDictionary:
for (key, val) in pr.dict.items:
h = h !& hash(key) !& hash(val)
of pkEmbedded:
h = h !& hash(cast[uint](addr pr.embeddedRef[]))
!$h
proc `[]`*(pr: Value; i: int): Value =
## Select an indexed value from ``pr``.
## Only valid for records and sequences.
case pr.kind
of pkRecord: pr.record[i]
of pkSequence: pr.sequence[i]
else:
raise newException(ValueError, "Preserves value is not indexable")
proc `[]=`*(pr: var Value; i: Natural; val: Value) =
## Assign an indexed value into ``pr``.
## Only valid for records and sequences.
case pr.kind
of pkRecord: pr.record[i] = val
of pkSequence: pr.sequence[i] = val
else:
raise newException(ValueError, "Preserves value is not indexable")
proc `[]=`*(pr: var Value; key, val: Value) =
## Insert `val` by `key` in the Preserves dictionary `pr`.
for i in 0..pr.dict.high:
if key < pr.dict[i].key:
insert(pr.dict, [(key, val, )], i)
return
elif key == pr.dict[i].key:
pr.dict[i].val = val
return
pr.dict.add((key, val, ))
proc incl*(pr: var Value; key: Value) =
## Include `key` in the Preserves set `pr`.
# TODO: binary search
for i in 0..pr.set.high:
if key < pr.set[i]:
insert(pr.set, [key], i)
return
elif key == pr.set[i]:
return
pr.set.add(key)
proc excl*(pr: var Value; key: Value) =
## Exclude `key` from the Preserves set `pr`.
for i in 0..pr.set.high:
if pr.set[i] == key:
delete(pr.set, i..i)
break

View File

@ -1,5 +1,7 @@
import ../preserves, std/tables
import
std/tables,
../preserves
type
Ref* {.preservesRecord: "ref".} = object
@ -12,21 +14,21 @@ type
CompoundPatternKind* {.pure.} = enum
`rec`, `tuple`, `tuplePrefix`, `dict`
CompoundPatternRec* {.preservesRecord: "rec".} = ref object
CompoundPatternRec* {.preservesRecord: "rec".} = object
`label`*: NamedPattern
`fields`*: NamedPattern
CompoundPatternTuple* {.preservesRecord: "tuple".} = ref object
CompoundPatternTuple* {.preservesRecord: "tuple".} = object
`patterns`*: seq[NamedPattern]
CompoundPatternTuplePrefix* {.preservesRecord: "tuplePrefix".} = ref object
CompoundPatternTuplePrefix* {.preservesRecord: "tuplePrefix".} = object
`fixed`*: seq[NamedPattern]
`variable`*: NamedSimplePattern
CompoundPatternDict* {.preservesRecord: "dict".} = ref object
CompoundPatternDict* {.preservesRecord: "dict".} = object
`entries`*: DictionaryEntries
`CompoundPattern`* {.preservesOr.} = ref object
`CompoundPattern`* {.acyclic, preservesOr.} = ref object
case orKind*: CompoundPatternKind
of CompoundPatternKind.`rec`:
`rec`*: CompoundPatternRec
@ -54,13 +56,12 @@ type
`AtomKind`* {.preservesOr, pure.} = enum
`Boolean`, `Float`, `Double`, `SignedInteger`, `String`, `ByteString`,
`Symbol`
`Boolean`, `Double`, `SignedInteger`, `String`, `ByteString`, `Symbol`
Definitions* = Table[Symbol, Definition]
DictionaryEntries* = Table[Preserve[void], NamedSimplePattern]
DictionaryEntries* = Table[Value, NamedSimplePattern]
NamedPatternKind* {.pure.} = enum
`named`, `anonymous`
`NamedPattern`* {.preservesOr.} = ref object
`NamedPattern`* {.acyclic, preservesOr.} = ref object
case orKind*: NamedPatternKind
of NamedPatternKind.`named`:
`named`*: Binding
@ -74,23 +75,23 @@ type
SimplePatternAtom* {.preservesRecord: "atom".} = object
`atomKind`*: AtomKind
SimplePatternEmbedded* {.preservesRecord: "embedded".} = ref object
SimplePatternEmbedded* {.preservesRecord: "embedded".} = object
`interface`*: SimplePattern
SimplePatternLit* {.preservesRecord: "lit".} = object
`value`*: Preserve[void]
`value`*: Value
SimplePatternSeqof* {.preservesRecord: "seqof".} = ref object
SimplePatternSeqof* {.preservesRecord: "seqof".} = object
`pattern`*: SimplePattern
SimplePatternSetof* {.preservesRecord: "setof".} = ref object
SimplePatternSetof* {.preservesRecord: "setof".} = object
`pattern`*: SimplePattern
SimplePatternDictof* {.preservesRecord: "dictof".} = ref object
SimplePatternDictof* {.preservesRecord: "dictof".} = object
`key`*: SimplePattern
`value`*: SimplePattern
`SimplePattern`* {.preservesOr.} = ref object
`SimplePattern`* {.acyclic, preservesOr.} = ref object
case orKind*: SimplePatternKind
of SimplePatternKind.`any`:
`any`* {.preservesLiteral: "any".}: bool
@ -119,7 +120,7 @@ type
NamedSimplePatternKind* {.pure.} = enum
`named`, `anonymous`
`NamedSimplePattern`* {.preservesOr.} = ref object
`NamedSimplePattern`* {.preservesOr.} = object
case orKind*: NamedSimplePatternKind
of NamedSimplePatternKind.`named`:
`named`*: Binding
@ -130,23 +131,23 @@ type
DefinitionKind* {.pure.} = enum
`or`, `and`, `Pattern`
DefinitionOrData* {.preservesTuple.} = ref object
DefinitionOrField0* {.preservesTuple.} = object
`pattern0`*: NamedAlternative
`pattern1`*: NamedAlternative
`patternN`* {.preservesTupleTail.}: seq[NamedAlternative]
DefinitionOr* {.preservesRecord: "or".} = ref object
`data`*: DefinitionOrData
DefinitionOr* {.preservesRecord: "or".} = object
`field0`*: DefinitionOrField0
DefinitionAndData* {.preservesTuple.} = ref object
DefinitionAndField0* {.preservesTuple.} = object
`pattern0`*: NamedPattern
`pattern1`*: NamedPattern
`patternN`* {.preservesTupleTail.}: seq[NamedPattern]
DefinitionAnd* {.preservesRecord: "and".} = ref object
`data`*: DefinitionAndData
DefinitionAnd* {.preservesRecord: "and".} = object
`field0`*: DefinitionAndField0
`Definition`* {.preservesOr.} = ref object
`Definition`* {.preservesOr.} = object
case orKind*: DefinitionKind
of DefinitionKind.`or`:
`or`*: DefinitionOr
@ -158,21 +159,21 @@ type
`pattern`*: Pattern
NamedAlternative* {.preservesTuple.} = ref object
NamedAlternative* {.preservesTuple.} = object
`variantLabel`*: string
`pattern`*: Pattern
SchemaData* {.preservesDictionary.} = object
`version`* {.preservesLiteral: "1".}: bool
`embeddedType`*: EmbeddedTypeName
SchemaField0* {.preservesDictionary.} = object
`definitions`*: Definitions
`embeddedType`*: EmbeddedTypeName
`version`* {.preservesLiteral: "1".}: tuple[]
Schema* {.preservesRecord: "schema".} = object
`data`*: SchemaData
`field0`*: SchemaField0
PatternKind* {.pure.} = enum
`SimplePattern`, `CompoundPattern`
`Pattern`* {.preservesOr.} = ref object
`Pattern`* {.acyclic, preservesOr.} = ref object
case orKind*: PatternKind
of PatternKind.`SimplePattern`:
`simplepattern`*: SimplePattern
@ -181,7 +182,7 @@ type
`compoundpattern`*: CompoundPattern
Binding* {.preservesRecord: "named".} = ref object
Binding* {.preservesRecord: "named".} = object
`name`*: Symbol
`pattern`*: SimplePattern
@ -197,7 +198,7 @@ proc `$`*(x: Ref | ModulePath | Bundle | CompoundPattern | Modules |
Schema |
Pattern |
Binding): string =
`$`(toPreserve(x))
`$`(toPreserves(x))
proc encode*(x: Ref | ModulePath | Bundle | CompoundPattern | Modules |
EmbeddedTypeName |
@ -211,4 +212,4 @@ proc encode*(x: Ref | ModulePath | Bundle | CompoundPattern | Modules |
Schema |
Pattern |
Binding): seq[byte] =
encode(toPreserve(x))
encode(toPreserves(x))

View File

@ -1,47 +0,0 @@
# SPDX-FileCopyrightText: 2022 ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[hashes, options, os, parseopt, streams, strutils, tables]
import ../preserves, ./schema, ./schemaparse
when isMainModule:
let outStream = newFileStream(stdout)
for kind, key, inputPath in getopt():
case kind
of cmdEnd: discard
of cmdArgument:
quit "arguments must be prefixed by --schema: or --bundle:"
of cmdLongOption:
if inputPath == "":
quit "long command line options require a path argument"
case key
of "schema":
var schema = parsePreservesSchema(readFile(inputPath))
write(outStream, schema.toPreserve)
of "bundle":
var bundle: Bundle
if not dirExists inputPath:
quit "not a directory of schemas: " & inputPath
else:
for filePath in walkDirRec(inputPath, relative = true):
var (dirPath, fileName, fileExt) = splitFile(filePath)
if fileExt == ".prs":
var
scm = parsePreservesSchema(readFile(inputPath / filePath))
path: ModulePath
for e in split(dirPath, '/'):
add(path, Symbol e)
add(path, Symbol fileName)
bundle.modules[path] = scm
if bundle.modules.len == 0:
quit "no schemas parsed"
else:
write(outStream, bundle.toPreserve)
else: quit("unhandled option " & key)
else: quit("unhandled option " & key)
close(outStream)

View File

@ -1,4 +1,4 @@
# SPDX-FileCopyrightText: 2021 ☭ Emery Hemingway
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[strutils, tables]
@ -9,10 +9,9 @@ import npeg
import ../preserves, ./schema, ./pegs
type
Value = Preserve[void]
Stack = seq[tuple[node: Value, pos: int]]
ParseState = object
schema: SchemaData
schema: SchemaField0
stack: Stack
directory: string
@ -57,20 +56,25 @@ template pushStack(n: Value) =
assert(p.stack.len > 0, capture[0].s)
proc toSymbolLit(s: string): Value =
initRecord[void](toSymbol"lit", toSymbol s)
initRecord(toSymbol"lit", toSymbol s)
proc match(text: string; p: var ParseState) {.gcsafe.}
proc match(text: string; p: var ParseState)
const parser = peg("Schema", p: ParseState):
Schema <- ?Annotation * S * +(Clause * S) * !1
Schema <- S * +Clause * !1
Clause <- (Version | EmbeddedTypeName | Include | Definition) * S * '.'
Clause <- (Version | EmbeddedTypeName | Include | Definition | +LineComment) * S * '.' * S
Version <- "version" * S * >(*Digit):
if parseInt($1) != 1: fail()
EmbeddedTypeName <- "embeddedType" * S * >("#f" | Ref)
EmbeddedTypeName <- "embeddedType" * S * ("#f" | Ref):
if capture.len == 1:
var r = popStack()
p.schema.embeddedType =
EmbeddedTypeName(orKind: EmbeddedTypeNameKind.Ref)
validate p.schema.embeddedType.`ref`.fromPreserves(r)
Include <- "include" * S * '"' * >(+Preserves.char) * '"':
var path: string
@ -82,19 +86,20 @@ const parser = peg("Schema", p: ParseState):
match(readFile path, state)
p.schema = move state.schema
Definition <- >id * S * '=' * S * (OrPattern | AndPattern | Pattern):
Definition <- *LineComment * ?Annotation * id * '=' * S * (OrPattern | AndPattern | Pattern):
if p.schema.definitions.hasKey(Symbol $1):
raise newException(ValueError, "duplicate definition of " & $1)
raise newException(ValueError, "duplicate definition of " & $0)
var
node = popStack()
def: Definition
if not fromPreserve(def, node):
raise newException(ValueError, $1 & ": " & $node)
if not def.fromPreserves(node):
raise newException(ValueError, "failed to convert " & $1 & " to a Definition: " & $node)
p.schema.definitions[Symbol $1] = def
p.stack.setLen(0)
OrPattern <- ?('/' * S) * AltPattern * +(S * '/' * S * AltPattern):
var node = initRecord(toSymbol("or"), toPreserve takeStackAt())
OrDelim <- *LineComment * '/' * S * *LineComment
OrPattern <- ?OrDelim * AltPattern * +(S * OrDelim * AltPattern):
var node = initRecord(toSymbol("or"), takeStackAt().toPreserves)
pushStack node
AltPattern <-
@ -103,26 +108,26 @@ const parser = peg("Schema", p: ParseState):
AltRef |
AltLiteralPattern
AltNamed <- '@' * >id * S * Pattern:
var n = toPreserve @[toPreserve $1] & takeStackAt()
AltNamed <- atId * ?Annotation * Pattern:
var n = toPreserves(@[toPreserves $1] & takeStackAt())
pushStack n
AltRecord <- '<' * >id * *(S * NamedPattern) * '>':
var n = toPreserve @[
toPreserve $1,
AltRecord <- '<' * id * *NamedPattern * '>':
var n = toPreserves @[
toPreserves $1,
initRecord(
toSymbol"rec",
toSymbolLit $1,
initRecord(toSymbol"tuple", toPreserve takeStackAt()))]
initRecord(toSymbol"tuple", toPreserves takeStackAt()))]
pushStack n
AltRef <- Ref:
var n = toPreserve @[toPreserve $0] & takeStackAt()
var r = popStack()
var n = toPreserves @[r[1].symbol.string.toPreserves, r]
pushStack n
AltLiteralPattern <-
>Preserves.Boolean |
>Preserves.Float |
>Preserves.Double |
>Preserves.SignedInteger |
>Preserves.String |
@ -131,16 +136,18 @@ const parser = peg("Schema", p: ParseState):
of "#f": "false"
of "#t": "true"
else: $1
var n = toPreserve @[
toPreserve id,
var n = toPreserves @[
toPreserves id,
initRecord(toSymbol"lit", parsePreserves $1)]
pushStack n
AndPattern <- ?('&' * S) * NamedPattern * +(S * '&' * S * NamedPattern)
AndPattern <- ?'&' * S * NamedPattern * +('&' * S * NamedPattern):
var node = initRecord(toSymbol("and"), toPreserves takeStackAt())
pushStack node
Pattern <- SimplePattern | CompoundPattern
SimplePattern <-
SimplePattern <- (
AnyPattern |
AtomKindPattern |
EmbeddedPattern |
@ -148,19 +155,16 @@ const parser = peg("Schema", p: ParseState):
SequenceOfPattern |
SetOfPattern |
DictOfPattern |
Ref
Ref ) * S
AnyPattern <- "any":
pushStack toSymbol"any"
AtomKindPattern <- Boolean | Float | Double | SignedInteger | String | ByteString | Symbol
AtomKindPattern <- Boolean | Double | SignedInteger | String | ByteString | Symbol
Boolean <- "bool":
pushStack initRecord(toSymbol"atom", toSymbol"Boolean")
Float <- "float":
pushStack initRecord(toSymbol"atom", toSymbol"Float")
Double <- "double":
pushStack initRecord(toSymbol"atom", toSymbol"Double")
@ -176,24 +180,24 @@ const parser = peg("Schema", p: ParseState):
Symbol <- "symbol":
pushStack initRecord(toSymbol"atom", toSymbol"Symbol")
EmbeddedPattern <- "#!" * SimplePattern:
EmbeddedPattern <- "#:" * SimplePattern:
var n = initRecord(toSymbol"embedded", popStack())
pushStack n
LiteralPattern <- ('=' * >symbol) | ("<<lit>" * >Preserves.Value * ">") | >nonSymbolAtom:
pushStack initRecord(toSymbol"lit", parsePreserves($1))
SequenceOfPattern <- '[' * S * SimplePattern * S * "..." * S * ']':
SequenceOfPattern <- '[' * S * SimplePattern * "..." * S * ']':
var n = initRecord(toSymbol"seqof", popStack())
pushStack n
SetOfPattern <- "#{" * S * SimplePattern * S * '}':
SetOfPattern <- "#{" * S * SimplePattern * '}':
var n = initRecord(toSymbol"setof", popStack())
pushStack n
DictOfPattern <-
'{' *
S * SimplePattern * S * ':' * S * SimplePattern * S * "...:..." * S *
'{' * S *
?Annotation * SimplePattern * ':' * S * SimplePattern * "...:..." * S *
'}':
var
val = popStack()
@ -202,72 +206,79 @@ const parser = peg("Schema", p: ParseState):
pushStack n
Ref <- >(Alpha * *Alnum) * *('.' * >(*Alnum)):
var path = initSequence[void]()
var path = initSequence()
for i in 1..<capture.len: path.sequence.add(toSymbol capture[i].s)
var name = pop(path.sequence)
var n = initRecord(toSymbol"ref", path, name)
pushStack n
CompoundPattern <-
CompoundPattern <- (
RecordPattern |
VariableRecordPattern |
TuplePattern |
VariableTuplePattern |
DictionaryPattern
DictionaryPattern ) * S
RecordPattern <-
("<<rec>" * S * NamedPattern * *(S * NamedPattern) * '>') |
("<<rec>" * S * NamedPattern * *NamedPattern * '>') |
('<' * >Value * *(S * NamedPattern) * '>'):
if capture.len == 2:
var n = initRecord(toSymbol"rec",
toSymbolLit $1,
initRecord(toSymbol"tuple", toPreserve takeStackAfter()))
initRecord(toSymbol"tuple", toPreserves takeStackAfter()))
pushStack n
else:
var n = initRecord(toSymbol"rec", takeStackAfter())
pushStack n
TuplePattern <-
'[' * S * *(NamedPattern * S) * ']':
var n = initRecord(toSymbol"tuple", toPreserve takeStackAfter())
pushStack n
VariableTuplePattern <-
'[' * S * *(NamedPattern * S) * ?(Pattern * S) * "..." * S * ']':
VariableRecordPattern <- '<' * >Value * S * *(NamedPattern) * "..." * S * '>':
var fields = takeStackAfter()
var tail = fields.pop
tail[1] = initRecord(toSymbol"seqof", tail[1])
var node = initRecord(toSymbol"tuplePrefix", toPreserve fields, tail)
var n = initRecord(
toSymbol"rec",
toSymbolLit $1,
initRecord(toSymbol"tuplePrefix", toPreserves fields, tail))
pushStack n
TuplePattern <-
'[' * S * *NamedPattern * ']':
var n = initRecord(toSymbol"tuple", toPreserves takeStackAfter())
pushStack n
VariableTuplePattern <-
'[' * S * *NamedPattern * ?Pattern * "..." * S * ']':
var fields = takeStackAfter()
var tail = fields.pop
tail[1] = initRecord(toSymbol"seqof", tail[1])
var node = initRecord(toSymbol"tuplePrefix", toPreserves fields, tail)
pushStack node
DictionaryPattern <- '{' * S * *(>Value * S * ':' * S * NamedSimplePattern * S) * '}':
var dict = initDictionary[void]()
DictionaryPattern <- '{' * S * *(*LineComment * >Value * S * ':' * S * NamedSimplePattern * ?',' * S) * '}':
var dict = initDictionary()
for i in countDown(pred capture.len, 1):
let key = toSymbol capture[i].s
dict[key] = initRecord("named", key, popStack())
var n = initRecord(toSymbol"dict", dict)
pushStack n
NamedPattern <- ('@' * >id * S * SimplePattern) | Pattern:
if capture.len == 2:
NamedPattern <- ((atId * ?Annotation * SimplePattern) | Pattern):
if capture.len > 1:
var n = initRecord(toSymbol"named", toSymbol $1, popStack())
pushStack n
NamedSimplePattern <- ('@' * >id * S * SimplePattern) | SimplePattern:
if capture.len == 2:
NamedSimplePattern <- ((atId * ?Annotation * SimplePattern) | SimplePattern):
if capture.len > 1:
var n = initRecord(toSymbol"named", toSymbol $1, popStack())
pushStack n
id <- Alpha * *Alnum
Comment <- ';' * @'\n'
S <- *(Space | Comment)
id <- >(Alpha * *Alnum) * S
atId <- ?Annotation * '@' * id
symbol <- Preserves.Symbol
nonSymbolAtom <-
Preserves.Boolean |
Preserves.Float |
Preserves.Double |
Preserves.SignedInteger |
Preserves.String |
@ -276,7 +287,12 @@ const parser = peg("Schema", p: ParseState):
Value <- Preserves.Value:
discard
Annotation <- '@' * Value
Annotation <- '@' * (Preserves.String | Preserves.Record) * S:
discard
S <- *{ ' ', '\t', '\r', '\n' }
LineComment <- '#' * @'\n' * S
proc match(text: string; p: var ParseState) =
let match = parser.match(text, p)
@ -289,9 +305,9 @@ proc parsePreservesSchema*(text: string; directory = getCurrentDir()): Schema =
## Schemas in binary encoding should instead be parsed as Preserves
## and converted to `Schema` with `fromPreserve` or `preserveTo`.
assert directory != ""
var p = ParseState(schema: SchemaData(), directory: directory)
var p = ParseState(schema: SchemaField0(), directory: directory)
match(text, p)
Schema(data: p.schema)
Schema(field0: p.schema)
when isMainModule:
import std/streams
@ -299,5 +315,5 @@ when isMainModule:
if txt != "":
let
scm = parsePreservesSchema(txt)
pr = toPreserve scm
stdout.newFileStream.writeText pr
pr = toPreserves scm
stdout.newFileStream.writeText(pr, textPreserves)

View File

@ -1,154 +0,0 @@
# SPDX-FileCopyrightText: ☭ 2021 Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[sequtils, tables]
import spryvm/spryvm
import ../preserves
type
PreservesNode* = ref object of Value
preserve: Preserve[void]
EmbeddedNode* = ref object of PreservesNode
ByteStringNode* = ref object of StringVal
RecordNode* = ref object of Blok
SetNode = ref object of PreservesNode
method eval*(self: PreservesNode; spry: Interpreter): Node =
self
method `$`*(self: PreservesNode): string =
$self.preserve
method typeName*(self: PreservesNode): string =
"preserves-value"
method typeName*(self: EmbeddedNode): string =
"preserves-embedded-value"
method typeName*(self: ByteStringNode): string =
"preserves-bytestring"
method typeName*(self: RecordNode): string =
"preserves-record"
method typeName*(self: SetNode): string =
"preserves-set"
proc toSpry(pr: Preserve[void], spry: Interpreter): Node =
if pr.embedded:
result = EmbeddedNode(preserve: pr)
# TODO: need to be able to manipulate these
else:
case pr.kind
of pkBoolean:
result = boolVal(pr.bool, spry)
of pkFloat:
result = newValue(pr.float)
of pkDouble:
result = newValue(pr.double)
of pkSignedInteger:
result = newValue(int pr.int)
of pkString:
result = newValue(pr.string)
of pkByteString:
result = ByteStringNode(value: cast[string](pr.bytes))
of pkSymbol:
result =
if pr.symbol == Symbol"null": newNilVal()
else: newLitWord(spry, string pr.symbol)
of pkRecord:
var comp = RecordNode()
proc f(pr: Preserve[void]): Node = toSpry(pr, spry)
comp.nodes = map(pr.record, f)
result = comp
of pkSequence:
var blk = newBlok()
for e in pr.sequence: blk.add toSpry(e, spry)
result = blk
of pkSet:
result = SetNode(preserve: pr)
of pkDictionary:
var map = newMap()
for (key, val) in pr.dict.items:
map[toSpry(key, spry)] = toSpry(val, spry)
result = map
of pkEmbedded:
result = EmbeddedNode(preserve: pr)
proc toPreserveHook*(node: Node; E: typedesc): Preserve[E] =
if node of PreservesNode:
result = PreservesNode(node).preserve
elif node of RecordNode:
result = Preserve[E](kind: pkRecord)
var comp = RecordNode(node)
proc f(child: Node): Preserve[void] = toPreserve(child, void)
result.record = map(comp.nodes, f)
elif node of ByteStringNode:
result = toPreserve(cast[seq[byte]](ByteStringNode(node).value), E)
elif node of Blok:
var blk = Blok(node)
result = initSequence[E](blk.nodes.len)
for i, child in blk.nodes: result.sequence[i] = toPreserve(child, E)
elif node of Map:
result = initDictionary[E]()
for key, val in Map(node).bindings:
result[toPreserve(key, E)] = toPreserve(val, E)
elif node of StringVal:
result = toPreserve(StringVal(node).value, E)
elif node of LitWord:
result = toSymbol(LitWord(node).word, E)
elif node of IntVal:
result = toPreserve(IntVal(node).value, E)
elif node of FloatVal:
result = toPreserve(FloatVal(node).value, E)
elif node of BoolVal:
result = toPreserve(BoolVal(node).value, E)
else: # node of NilVal:
result = toSymbol("null", E)
when isMainModule:
var
node: Node
pr = toPreserveHook(node, void)
proc addPreserves*(spry: Interpreter) =
nimFunc("parsePreserves"):
let node = evalArg(spry)
if node of StringVal:
let str = StringVal(node).value
result = PreservesNode(preserve: parsePreserves(str))
nimFunc("decodePreserves"):
let node = evalArg(spry)
if node of StringVal:
let str = StringVal(node).value
result = PreservesNode(preserve: decodePreserves(cast[seq[byte]](str)))
nimMeth("encodePreserves"):
let node = evalArgInfix(spry)
if node of PreservesNode:
var bin = encode PreservesNode(node).preserve
result = newValue(cast[string](bin))
nimFunc("fromPreserves"):
let node = evalArg(spry)
if node of PreservesNode:
let pr = PreservesNode(node).preserve
return toSpry(pr, spry)
nimMeth("toPreserves"):
let node = evalArgInfix(spry)
PreservesNode(preserve: node.toPreserve)
nimMeth("arity"):
let node = evalArgInfix(spry)
if node of RecordNode:
return newValue(pred SeqComposite(node).nodes.len)
nimMeth("label"):
let node = evalArgInfix(spry)
if node of RecordNode:
let rec = RecordNode(node)
return rec.nodes[rec.nodes.high]

View File

@ -1,2 +0,0 @@
multimethods:on
nilseqs:on

7
src/preserves/sugar.nim Normal file
View File

@ -0,0 +1,7 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import ../preserves, ./private/macros
proc `%`*(v: bool|SomeFloat|SomeInteger|string|seq[byte]|Symbol): Value {.inline.} = v.toPreserves
# Preserve an atomic Nim value.

View File

@ -1,36 +1,36 @@
# SPDX-FileCopyrightText: 2021 ☭ Emery Hemingway
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[parseutils, strtabs, tables, xmltree]
import std/[parseutils, strtabs, xmltree]
import ../preserves
proc toPreserveFromString*(s: string; E: typedesc): Preserve[E] =
proc toPreservesFromString*(s: string): Value =
# This is a bad and slow thing to do, but that is XML.
case s
of "false", "no", "off":
result = toPreserve(false, E)
result = toPreserves(false)
of "true", "yes", "on":
result = toPreserve(true, E)
result = toPreserves(true)
else:
var
n: BiggestInt
f: BiggestFloat
f: float
if parseBiggestInt(s, n) == s.len:
result = toPreserve(n, E)
result = toPreserves(n)
elif parseHex(s, n) == s.len:
result = toPreserve(n, E)
result = toPreserves(n)
elif parseFloat(s, f) == s.len:
result = toPreserve(f, E)
result = toPreserves(f)
else:
result = toPreserve(s, E)
result = toPreserves(s)
proc toPreserveHook*(xn: XmlNode; E: typedesc): Preserve[E] =
proc toPreservesHook*(xn: XmlNode): Value =
if xn.kind == xnElement:
result = Preserve[E](kind: pkRecord)
result = Value(kind: pkRecord)
if not xn.attrs.isNil:
var attrs = initDictionary[E]()
var attrs = initDictionary()
for xk, xv in xn.attrs.pairs:
attrs[toSymbol(xk, E)] = toPreserveFromString(xv, E)
attrs[toSymbol(xk)] = toPreservesFromString(xv)
result.record.add(attrs)
var isText = xn.len > 0
# escaped text is broken up and must be concatenated
@ -39,20 +39,20 @@ proc toPreserveHook*(xn: XmlNode; E: typedesc): Preserve[E] =
isText = false
break
if isText:
result.record.add(toPreserve(xn.innerText, E))
result.record.add(toPreserves(xn.innerText))
else:
for child in xn.items:
case child.kind
of xnElement:
result.record.add(toPreserveHook(child, E))
result.record.add(toPreservesHook(child))
of xnText, xnVerbatimText, xnCData, xnEntity:
result.record.add(toPreserve(text(child), E))
result.record.add(toPreserves(text(child)))
of xnComment:
discard
result.record.add(toSymbol(xn.tag, E))
result.record.add(toSymbol(xn.tag))
# record labels are stored after the fields
proc toUnquotedString[E](pr: Preserve[E]): string {.inline.} =
proc toUnquotedString(pr: Value): string {.inline.} =
case pr.kind
of pkString:
pr.string
@ -60,7 +60,7 @@ proc toUnquotedString[E](pr: Preserve[E]): string {.inline.} =
if pr.bool: "true" else: "false"
else: $pr
proc fromPreserveHook*[E](xn: var XmlNode; pr: Preserve[E]): bool =
proc fromPreservesHook*(xn: var XmlNode; pr: Value): bool =
if pr.kind == pkRecord and pr.label.kind == pkSymbol:
xn = newElement($pr.label)
var i: int
@ -74,7 +74,7 @@ proc fromPreserveHook*[E](xn: var XmlNode; pr: Preserve[E]): bool =
xn.add newText(e.string)
else:
var child: XmlNode
result = fromPreserveHook(child, e)
result = fromPreservesHook(child, e)
if not result: return
xn.add child
inc i
@ -82,5 +82,5 @@ proc fromPreserveHook*[E](xn: var XmlNode; pr: Preserve[E]): bool =
when isMainModule:
var xn = newElement("foobar")
var pr = xn.toPreserveHook(void)
assert fromPreserveHook(xn, pr)
var pr = xn.toPreservesHook()
assert fromPreservesHook(xn, pr)

View File

@ -1,2 +1,7 @@
include_rules
: foreach test_*.nim | ../../<preserves> |> !nim_run |>
NIM_FLAGS_test_samples += -d:upstreamTestfile="$(TUP_CWD)/../../preserves/tests/samples.pr"
: foreach t*.nim |> !nim_run |> | ../<test>
: $(BIN_DIR)/<preserves-schemac> \
|> $(BIN_DIR)/preserves-schemac --no-bundle ../../preserves/doc/demo.prs | xxd > %o \
|> demo.xxd

View File

@ -1 +1 @@
switch("path", "$projectDir/../src")
switch("path", "$projectDir/../src")

View File

@ -0,0 +1,22 @@
# SPDX-FileCopyrightText: 2021 ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[options, unittest]
import preserves
suite "BufferedDecoder":
test "half-string":
var
buf = newBufferedDecoder()
pr = Value(kind: pkByteString, bytes: newSeq[byte](23))
for i, _ in pr.bytes:
pr.bytes[i] = byte(i)
let bin = encode(pr)
for i in 0..32:
checkpoint $i
let j = (i+2) and 0xf
feed(buf, bin[0..<j])
feed(buf, bin[j..bin.high])
var v = decode(buf)
check v.isSome

View File

@ -4,41 +4,51 @@
import std/[options, tables, unittest, xmlparser, xmltree]
import preserves, preserves/xmlhooks
type
Route {.preservesRecord: "route".} = object
`transports`*: seq[Value]
`pathSteps`* {.preservesTupleTail.}: seq[Value]
suite "conversions":
test "dictionary":
type Bar = tuple
s: string
type Foobar {.preservesDictionary.} = object
a, b: int
a: int
b: seq[int]
c {.preservesEmbedded.}: Bar
d: Option[bool]
e: Option[bool]
let
c = Foobar(a: 1, b: 2, c: ("ku", ))
b = toPreserve(c)
a = preserveTo(b, Foobar)
check($b == """{a: 1 b: 2 c: #!["ku"]}""")
check(a.isSome and (get(a) == c))
c = Foobar(a: 1, b: @[2], c: ("ku", ), e: some(true))
b = toPreserves(c)
a = preservesTo(b, Foobar)
check($b == """{a: 1 b: [2] c: #:["ku"] e: #t}""")
check(a.isSome)
if a.isSome: check(get(a) == c)
check(b.kind == pkDictionary)
test "records":
type Bar {.preservesRecord: "bar".} = object
s: string
type Foobar {.preservesRecord: "foo".} = object
a, b: int
a: int
b: seq[int]
c: Bar
let
tup = Foobar(a: 1, b: 2, c: Bar(s: "ku", ))
prs = toPreserve(tup)
tup = Foobar(a: 1, b: @[2], c: Bar(s: "ku", ))
prs = toPreserves(tup)
check(prs.kind == pkRecord)
check($prs == """<foo 1 2 <bar "ku">>""")
check(preserveTo(prs, Foobar) == some(tup))
check($prs == """<foo 1 [2] <bar "ku">>""")
check(preservesTo(prs, Foobar) == some(tup))
test "tables":
var a: Table[int, string]
for i, s in ["a", "b", "c"]: a[i] = s
let b = toPreserve(a)
let b = toPreserves(a)
check($b == """{0: "a" 1: "b" 2: "c"}""")
var c: Table[int, string]
check(fromPreserve(c, b))
check(fromPreserves(c, b))
check(a == c)
test "XML":
@ -56,12 +66,39 @@ suite "conversions":
<rect x="1" y="1" width="998" height="298" fill="none" stroke="blue" stroke-width="2"/>
</svg>
"""
var pr = toPreserve(b, void)
var pr = toPreserves(b)
checkpoint $pr
check fromPreserve(a, pr)
check fromPreserves(a, pr)
test "preservesTupleTail":
let pr = parsePreserves """<route [<tcp "localhost" 1024>] <ref {oid: "syndicate" sig: #x"69ca300c1dbfa08fba692102dd82311a"}>>"""
var route: Route
check route.fromPreserves(pr)
test "ebedded":
type
Foo {.preservesRecord: "foo".} = object
n: int
bar {.preservesEmbedded.}: Bar
Bar = ref object of RootObj
x: int
Baz = ref object of RootObj
x: int
let a = initRecord("foo", 9.toPreserves, embed Bar(x: 768))
checkpoint $a
check a.preservesTo(Foo).isSome
let b = initRecord("foo", 2.toPreserves, embed Baz(x: 999))
checkpoint $b
check not b.preservesTo(Foo).isSome
suite "toPreserve":
template check(p: Preserve; s: string) =
template check(p: Value; s: string) =
test s: check($p == s)
check false.toPreserve, "#f"
check [0, 1, 2, 3].toPreserve, "[0 1 2 3]"
check false.toPreserves, "#f"
check [0, 1, 2, 3].toPreserves, "[0 1 2 3]"
test "toRecord":
let r = toRecord(Symbol"foo", "üks", "kaks", "kolm", {4..7})
check $r == """<foo "üks" "kaks" "kolm" #{4 5 6 7}>"""

83
tests/test_p_exprs.nim Normal file
View File

@ -0,0 +1,83 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import
std/unittest,
preserves, preserves/expressions
template testExpr(name, code, cntrl: string) {.dirty.} =
test name:
checkpoint code
let
pr = parsePreserves cntrl
exprs = parseExpressions code
checkpoint $(exprs.toPreserves)
check exprs.len == 1
let px = exprs[0]
check px == pr
suite "expression":
testExpr "date", """
<date 1821 (lookup-month "February") 3>
""", """
<r date 1821 <g lookup-month "February"> 3>
"""
testExpr "r", "<>", "<r>"
testExpr "begin",
"""(begin (println! (+ 1 2)) (+ 3 4))""",
"""<g begin <g println! <g + 1 2>> <g + 3 4>>"""
testExpr "g",
"""()""", """<g>"""
testExpr "groups",
"""[() () ()]""", """[<g>, <g>, <g>]"""
testExpr "loop", """
{
setUp();
# Now enter the loop
loop: {
greet("World");
}
tearDown();
}
""", """
<b
setUp <g> <p |;|>
# Now enter the loop
loop <p |:|> <b
greet <g "World"> <p |;|>
>
tearDown <g> <p |;|>
>
"""
testExpr "+", """
[1 + 2.0, print "Hello", predicate: #t, foo, #:remote, bar]
""", """
[1 + 2.0 <p |,|> print "Hello" <p |,|> predicate <p |:|> #t <p |,|>
foo <p |,|> #:remote <p |,|> bar]
"""
testExpr "set",
"""#{1 2 3}""", """<s 1 2 3>"""
testExpr "group-set",
"""#{(read) (read) (read)}""",
"""<s <g read> <g read> <g read>>"""
testExpr "block", """
{
optional name: string,
address: Address,
}
""", """
<b
optional name <p |:|> string <p |,|>
address <p |:|> Address <p |,|>
>
"""

View File

@ -6,19 +6,18 @@ import preserves
const examples = [
("""<capture <discard>>""", "\xB4\xB3\x07capture\xB4\xB3\x07discard\x84\x84"),
("""[1 2 3 4]""", "\xB5\x91\x92\x93\x94\x84"),
("""[-2 -1 0 1]""", "\xB5\x9E\x9F\x90\x91\x84"),
("""[1 2 3 4]""", "\xB5\xB0\x01\x01\xB0\x01\x02\xB0\x01\x03\xB0\x01\x04\x84"),
("""[-2 -1 0 1]""", "\xB5\xB0\x01\xFE\xB0\x01\xFF\xB0\x00\xB0\x01\x01\x84"),
(""""hello"""", "\xB1\x05hello"),
("""" \"hello\" """", "\xB1\x09 \"hello\" "),
("""["a" b #"c" [] #{} #t #f]""", "\xB5\xB1\x01a\xB3\x01b\xB2\x01c\xB5\x84\xB6\x84\x81\x80\x84"),
("""-257""", "\xA1\xFE\xFF"),
("""-1""", "\x9F"),
("""0""", "\x90"),
("""1""", "\x91"),
("""255""", "\xA1\x00\xFF"),
("""1.0f""", "\x82\x3F\x80\x00\x00"),
("""1.0""", "\x83\x3F\xF0\x00\x00\x00\x00\x00\x00"),
("""-1.202e300""", "\x83\xFE\x3C\xB7\xB7\x59\xBF\x04\x26"),
("""-257""", "\xB0\x02\xFE\xFF"),
("""-1""", "\xB0\x01\xFF"),
("""0""", "\xB0\x00"),
("""1""", "\xB0\x01\x01"),
("""255""", "\xB0\x02\x00\xFF"),
("""1.0""", "\x87\x08\x3F\xF0\x00\x00\x00\x00\x00\x00"),
("""-1.202e300""", "\x87\x08\xFE\x3C\xB7\xB7\x59\xBF\x04\x26"),
("""#=#x"B4B30763617074757265B4B307646973636172648484"""", "\xB4\xB3\x07capture\xB4\xB3\x07discard\x84\x84"),
("""#f""", "\x80")
]
@ -27,15 +26,17 @@ suite "parse":
for (txt, bin) in examples:
test txt:
checkpoint(txt)
let test = parsePreserves(txt, int)
let test = parsePreserves(txt)
checkpoint($test)
block:
let
a = test
b = decodePreserves(bin, int)
b = decodePreserves(bin)
check(a == b)
block:
let
a = encode test
b = bin
check(cast[string](a).toHex == b.toHex)
if test.isAtomic:
discard parsePreservesAtom(txt)

View File

@ -57,7 +57,7 @@ for i, jsText in testVectors:
checkpoint(jsText)
let
control = parseJson jsText
x = control.toPreserve
x = control.toPreserves
checkpoint($x)
var stream = newStringStream()
stream.write(x)

108
tests/test_samples.nim Normal file
View File

@ -0,0 +1,108 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/unittest
import preserves
const upstreamTestfile {.strdefine.} = ""
proc strip(pr: Value): Value = pr
proc encodeBinary(pr: Value): Value =
result = encode(pr).toPreserves
checkpoint("encoded binary: " & $result)
proc looseEncodeBinary(pr: Value): Value =
result = encode(pr).toPreserves
checkpoint("loose encoded binary: " & $result)
proc annotatedBinary(pr: Value): Value =
result = encode(pr).toPreserves
checkpoint("annotated binary: " & $result)
proc decodeBinary(pr: Value): Value =
result = decodePreserves(pr.bytes)
proc encodeText(pr: Value): Value =
result = ($pr).toPreserves
checkpoint("encoded text: " & result.string)
proc decodeText(pr: Value): Value =
result = parsePreserves(pr.string)
checkpoint("decoded text " & $pr)
if upstreamTestfile != "":
let samples = readFile(upstreamTestfile).parsePreserves()
assert samples.isRecord("TestCases")
var binary, annotatedValue, stripped, text, bytes: Value
for n in { 1..8, 20..22, 30..32 }:
suite $n:
for name, testcase in samples[0]:
assert testcase.isRecord
assert testcase.label.isSymbol
var testMatched: bool
case testcase.label.symbol.string
of "Test":
testMatched = (n in { 1..8 })
if testMatched:
binary = testcase[0]
annotatedValue = testcase[1]
stripped = strip(annotatedValue)
of "NondeterministicTest":
testMatched = (n in { 1..7 })
if testMatched:
binary = testcase[0]
annotatedValue = testcase[1]
stripped = strip(annotatedValue)
of "ParseError":
testMatched = (n in { 20 })
if testMatched: text = testcase[0]
of "ParseShort":
testMatched = (n in { 21 })
if testMatched: text = testcase[0]
of "ParseEOF":
testMatched = (n in { 22 })
if testMatched: text = testcase[0]
of "DecodeError":
testMatched = (n in { 30 })
if testMatched: bytes = testcase[0]
of "DecodeShort":
testMatched = (n in { 31 })
if testMatched: bytes = testcase[0]
of "DecodeEOF":
testMatched = (n in { 32 })
if testMatched: bytes = testcase[0]
else:
assert false
if testMatched:
test $name:
checkpoint $testcase
case n
of 1: check decodeBinary(encodeBinary(annotatedValue)) == stripped
of 2: check strip(decodeBinary(binary)) == stripped
of 3:
# check decodeBinary(binary) == annotatedValue
discard
of 4:
# check decodeBinary(annotatedBinary(annotatedValue)) == annotatedValue
discard
of 5: check decodeText(encodeText(stripped)) == stripped
of 6: check decodeText(encodeText(annotatedValue)) == annotatedValue
of 7:
# check annotatedBinary(annotatedValue) == binary
discard
of 8:
# check looseEncodeBinary(annotatedValue) == binary
discard
of 20, 21, 22:
# TODO: be specific about which error is raised
expect ValueError, IOError:
discard decodeText(text)
of 30, 31, 32:
expect ValueError, IOError:
discard decodeBinary(bytes)
else:
assert false

16
tests/test_step.nim Normal file
View File

@ -0,0 +1,16 @@
# SPDX-FileCopyrightText: ☭ Emery Hemingway
# SPDX-License-Identifier: Unlicense
import std/[options, sequtils, unittest]
import preserves
suite "step":
var data = parsePreserves """
<foo "bar" [ 0.0 {a: #f, "b": #t } ] >
"""
var o = some data
for i in [1.toPreserves, 1.toPreserves, "b".toPreserves]:
test $i:
o = step(get o, i)
check o.isSome