@LeonineKing1199: sorry, device died mid-conversation yesterday, then forgot about it when recharged. Yes, it might be interesting to report algorithmic complexity at least for the surprising ones like uniq.
@LeonineKing1199 - I have used https://www.npmjs.com/package/plato on a number of node projects, and it is abc simple to introduce if you were considering a PR. Please let me know if you have something better - always keen to learn which NPM modules are best in given field.
Then again, I'm not as bad as the CUDA programmers, hey-oh!
if you think the light weight descriptions / unit tests i provided for "other libraries" section is of sufficient quality i could raise a PR and get that loaded in there.
I would quite like to have a go at the algebraic data types section and how it relates to ramda too, but still slightly fumbling in the dark atm - raised an issue to hear any discussion / get some pointers here.
think i now have a strong enough handle on the basic concepts from a Haskell view point, just trying to relate that back to FL spec - ie. bind, return, pure etc in terms of what has been provided in JS world.
@LeonineKing1199 - which npm packages would you consider for the algorithmic complexity analysis? interested to learn more. It is 3:35 am here in Japan, so likely going to crash any minute - but not from memory leak problems!
@arcseldon I don't know of any, actually. Ramda's documentation does point to the implementations on their github so it would be possible to just go an look and derive it from there. It'd be neat if there was a programmatic way of doing complexity analysis.