Bump to jtd v0.2.1 (#6)

* Bump to jtd v0.2.1

* Release 0.1.13

Author: ucarion

Cargo.lock

@@ -1,13 +1,13 @@
 [package]
 name = "jtd-fuzz"
 description = "Generates example data from JSON Typedef schemas"
-version = "0.1.12"
+version = "0.1.13"
 license = "MIT"
 authors = ["JSON Typedef Contributors"]
 edition = "2018"
 
 [dependencies]
-jtd = "^0.1.4"
+jtd = "^0.2"
 serde_json = "^1"
 rand = "^0.7"
 chrono = "^0.4"

Cargo.toml

@@ -2,7 +2,7 @@
 
 use rand::seq::IteratorRandom;
 use serde_json::Value;
-use std::collections::HashMap;
+use std::collections::BTreeMap;
 
 // Max length when generating "sequences" of things, such as strings, arrays,
 // and objects.
@@ -100,8 +100,8 @@ fn fuzz_with_root<R: rand::Rng>(root: &jtd::Schema, rng: &mut R, schema: &jtd::S
                 // why it's important these come after the "primitive" cases.
                 5 => {
                     let schema = jtd::Schema {
-                        metadata: HashMap::new(),
-                        definitions: HashMap::new(),
+                        metadata: BTreeMap::new(),
+                        definitions: BTreeMap::new(),
                         form: jtd::Form::Elements(jtd::form::Elements {
                             nullable: false,
                             schema: Default::default(),
@@ -113,8 +113,8 @@ fn fuzz_with_root<R: rand::Rng>(root: &jtd::Schema, rng: &mut R, schema: &jtd::S
 
                 6 => {
                     let schema = jtd::Schema {
-                        metadata: HashMap::new(),
-                        definitions: HashMap::new(),
+                        metadata: BTreeMap::new(),
+                        definitions: BTreeMap::new(),
                         form: jtd::Form::Values(jtd::form::Values {
                             nullable: false,
                             schema: Default::default(),
@@ -216,7 +216,7 @@ fn fuzz_with_root<R: rand::Rng>(root: &jtd::Schema, rng: &mut R, schema: &jtd::S
                 return Value::Null;
             }
 
-            let mut members = HashMap::new();
+            let mut members = BTreeMap::new();
 
             let mut required_keys: Vec<_> = required.keys().cloned().collect();
             required_keys.sort();