Adam Helinski

Results 178 comments of Adam Helinski

That looks really (really!) neat! I've been meaning to ultimately do something like that but didn't have the time nor the practical need, so it is really awesome that you...

I guess the implementation could simply reify reading and writing, not needing all that positioning stuff since those are unreliable on streams (most don't have that, some only provide an...

Latest commit on main has fixed this (not yet released) if you fancy giving it a go. I rewrote the tests using `test.check` so hopefully there won't be anymore edge...

It is a valid use case. I thought about it quite a few times. The "problem" is that BinF is polymorphic. Well, this is a feature. While most projects will...

Hi, A `ctx` is functionnally pure, it's just Clojure data structures and functions, so using `fun-mode` can help with state management. Indeed, writing Quil examples would be too time consuming...

Thanks! (feel free to share if there is something online :) )

It is clearer but the downside is that is implies checking all children even when `:gen/freq` is not used, as opposed to checking just one property on the "parent". In...

If `-collection-schema` was checking for `fn?` akin to `-simple-schema`, it would also allow for defining something like: ```clojure [:sorted-set {:by sorting-fn} :int] ``` (I might misunderstand the internals, I didn't...

The idea of having a composite key is to be more programmatic when creating schema. The kind of problems I am currently working on might be too abstract compared to...

Yes, I don't really know where to start. One clue is that is absolutely about generating a recursive item. If you replace `[:or ::vector]` with `[:or ::int]]` in my example,...