add benchmarks

bench/benchmark.nim

@@ -1,6 +1,6 @@
 import std/[times, strutils, strformat, stats]
 import std/json except `%*`
-import jsonpak, jsonpak/[extra, patch, parser, jsonptr, mapper, builder]
+import jsonpak, jsonpak/[extra, patch, parser, jsonptr, mapper, builder, sorted]
 
 const
  JsonData = readFile("test.json")
@@ -73,6 +73,13 @@ proc main() =
  bench "move", tree:
  move(t, JsonPtr"/records/500/city", JsonPtr"/records/0/location")
 
+ bench "sort", newEmptyTree().SortedJsonTree:
+ t = sorted(tree)
+
+ tree = sorted(tree).JsonTree
+ bench "hash", tree:
+ discard hash(t.SortedJsonTree)
+
  # Benchmarks for std/json module
  bench "stdlib - extract", JsonNode():
  t = stdTree.copy()
@@ -83,6 +90,9 @@ proc main() =
  bench "stdlib - toString", stdTree:
  discard $t
 
+ bench "stdlib - hash", stdTree:
+ discard hash(t)
+
  bench "stdlib - fromJson", stdTree:
  discard t["records"][500].to(UserRecord)
 

src/jsonpak/private/rawops_sorted.nim

@@ -1,4 +1,5 @@
 import bitabs, jsonnode, jsontree, rawops, std/[importutils, algorithm, sequtils, hashes]
+export rawExtract
 
 proc rawSorted*(tree: JsonTree, n: NodePos): JsonTree =
  privateAccess(JsonTree)

src/jsonpak/sorted.nim

@@ -13,7 +13,12 @@ proc `==`*(a, b: SortedJsonTree): bool {.inline.} =
  privateAccess(JsonTree)
  if JsonTree(a).nodes.len != JsonTree(b).nodes.len:
  return false
- rawTest(JsonTree(a), JsonTree(b), rootNodeId)
+ result = rawTest(JsonTree(a), JsonTree(b), rootNodeId)
+
+proc copy*(tree: SortedJsonTree): SortedJsonTree =
+ ## Returns a fresh copy of `tree`.
+ result = JsonTree().SortedJsonTree
+ rawExtract(JsonTree(result), JsonTree(tree), rootNodeId)
 
 proc deduplicate*(tree: var SortedJsonTree) =
  ## Deduplicates keys in `tree` recursively. If duplicate keys are found,