Cleanup, Entry parser protocol, worker caches and fast inferring

[ikitommi]

• Cached protocol for effective caching of schema results
  • -form, -validator, -explainer, -parser, -unparser
• BREAKING: EntrySchema replaces MapSchema
  • new -entry-parser method needs to be implemented
• BREAKING: -parse-entries is removed, use -entry-parser instead
• EntryParser, supporting lazy parsing
• 30x faster inferring with mp/provider
• BREAKING: malli.provider/schema is moved into extender API: malli.provider/-schema

(def schema
  (m/schema
   [:map
    [:x boolean?]
    [:y {:optional true} int?]
    [:z [:map
         [:x boolean?]
         [:y {:optional true} int?]]]]))

;; 1.5µs -> 11ns (130x)
(p/bench
 (m/validator schema)

;; 1.7µs -> 64ns (25x)
(p/bench
 (m/validate schema {:x true, :z {:x true}}))

  ;; 3.4µs -> 2.9µs (15%)
  (p/bench (m/schema ?schema))

  ;; 240ns (14x)
  (p/bench (m/schema ?schema {::m/lazy-entries true}))

alternative impl

• store the cache into meta. more transparent, much slower - also, would introduce a hard-to-find performance trap as many conversion tools create schemas using internal functions, which do not initialize the cache. having a expicit protocol for Cache keeps the implementor in control of things, still yielding leverage (and perf) compared to fullu manual caching (using delays)

Schema Inferring

;; 3.6ms -> 2.2ms (1.7x)
(p/bench (mp/provide [1 2 3]))

;; 2.5ms -> 82µs (30x)
(let [provider (mp/provider)]
  (p/bench (provider [1 2 3])))