core.match VS fib

IIRC luc maranget's paper was also a basis to clojure/script core.match

ps: checked https://github.com/clojure/core.match/wiki/References

If you take a look a this library which is an "official" library you will find three snippets of code for adding the dependency to your project and some with a very strange syntax.

I think Clojure has benefited from matching being kept out of the built-in stdlib. https://github.com/clojure/core.match is a plug-in and as a result we've had lots of cool data traversal/matching DSLs come around and evolved user communities with time such as Meander and Datascript not to mention the parsing applications of the schema systems (spec & malli).

Why not just use core.match? https://github.com/clojure/core.match

I've typically found rust to be about 100x faster than Python for the projects I've ported. This is consistent with https://github.com/drujensen/fib.

Here is a similar benchmark but includes compile times. https://github.com/drujensen/fib

How? Do you mean how do I know it's slow? Because it takes longer to run.

Write a typical computation such as Fibonacci in Java and Erlang/Elixir and compare. Fortunately someone has already done this.

Elixir is 3x slower than C and 2x slower than Java for this single thread example.

https://github.com/drujensen/fib

Apparently this upsets people for me to point this out. However, I did not say that Elixir was slow in general or a bad choice. It's an excellent choice for problems which suit parallelization or which require reliable, consistent performance.

Since the parent poster had commented that adding this multi-module dispatch would not be performant, I merely pointed out that the single thread peformance was already slow (as in, why worry too much about the performance cost of the multi dispatch suggestion).

Is there some advantage over repos that also show the results ?