Very silly Elixir application to asynchronously count all prime numbers in a given number range.
I had previously implemented something similar in plain old C and wanted to see how it would look like in majestic Elixir - here's the result!
If available in Hex, the package can be installed
by adding primefinder to your list of dependencies in mix.exs:
def deps do
[
{:primefinder, "~> 0.1.0"}
]
endDocumentation can be generated with ExDoc and published on HexDocs. Once published, the docs can be found at https://hexdocs.pm/primefinder.