Hacker News new | ask | show | jobs
by kian 1047 days ago
This is why I prefer a self-optimizing collections library. Many of these inefficient passes can be internally re-wired when combining 'objects' which represent the functions and their rules of composition.

Inline 'debug' pipeline functions are helpful for the second problem you mentioned.

1 comments

Can you recommend such library?

I had fun with Ramda but I experienced some perf hits when doing big pipe/map/reduces on large data structures

https://rubygems.org/gems/raskell does it in ruby. A similar technique would work in JavaScript, but I don't know of any other libraries that have attempted it yet.