httpaf
generator
Our great sponsors
httpaf | generator | |
---|---|---|
2 | 5 | |
533 | 4 | |
0.6% | - | |
0.0 | 7.7 | |
4 months ago | 6 months ago | |
OCaml | TypeScript | |
GNU General Public License v3.0 or later | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
httpaf
- Parser Combinators in Haskell
-
The RustyHermit Unikernel: unikernel written in Rust
Thanks for chiming in!
Sadly cohttp is (or was) performing so bad that it is kind of at odds with using it on a unikernel.
This one is quite a bit faster:
generator
-
Ramda: A practical functional library for JavaScript programmers
I find straight forward, dedicated combinators much more readable and practical to use ie. for iterables (context where it makes a lot of sense) [0] example [1], runtime assertions (through refutations, which are much faster than combinators over assertions) [2], parser combinators for smallish grammars [3] etc.
In many cases vanilla/imperative js is more readable and terse, no need to bring functional fanaticism everywhere, just in places where it gives true benefits and in form that can be understood by peers.
Functional code can be beautiful and can also be unreadable/undebugable. Same with imperative code. It's great in js/ts you can pick approach where the problem is expressed more naturally and mix it at will.
[0] https://github.com/preludejs/generator
[1] https://observablehq.com/@mirek/project-euler
- Why Would Anyone Need JavaScript Generator Functions?
-
A pipe operator for JavaScript: introduction and use cases
You can type it, take a look at pipe and pipe1 in [0].
- Parser Combinators in Haskell
-
Loopless Code
Loops are great if your programming languages supports iterables/iterators/generators (also async generators) like in js/ts for example.
Especially generator-to-generator combinators ie. [0] give you terse, transducer expressiveness over computation on finite/infinite streams, arrays, etc. (all iterables). It's easy to compose them, jump into for loops if needed for arbitrary yielding (ie. yielding multiple items sometimes, skipping some, halting etc). `continue`, `break`, nesting, yield, yield from, normal code in for loops is very intuitive and terse creating pleasant, understandable code.
What are some alternatives?
ocaml-cohttp - An OCaml library for HTTP clients and servers using Lwt or Async
angstrom - Parser combinators built for speed and memory efficiency
dream - Tidy, feature-complete Web framework
assert-combinators - Functional assertion combinators.
ocaml-opium-unikernel - Example unikernel using opium + httpaf (using https://github.com/dinosaure/paf-le-chien)
ppipe - pipes values through functions, an alternative to using the proposed pipe operator ( |> ) for ES
notion-sdk-js - Official Notion JavaScript Client
pyparsing - Python library for creating PEG parsers
IxJS - The Interactive Extensions for JavaScript
ling - Erlang on Xen
async-generator - Async generator module.