flash-gordon on master
Suppress keyword argument warni… Merge pull request #75 from koi… (compare)
Datadefinition is static therefore most (maybe all?) code pathes which depend on those definitions could be pre-compiled avoiding tedious (hash) iterations.
Hash.strict_constructorcould benefit from those "solutions" too
Type::Hash.*_constructorbecause we know the attributes upfront
I'm curious to know what do you think of another feature (that promises to be more challenging). I have a tree of nodes (represented as a hash). Each node has some validation constraints, and a "children" key which is an array of descendants.
Currently, I am validating each node separately and traversing the tree via a recursive function, but do you think it would be fitting if one could define a recursive validation right from the schema? Or perhaps it is too awkward?