Exhaustive pattern matching of sets

danilopedraza / komodo

The Komodo programming language code repository

https://komodo-lang.org/

GNU General Public License v3.0

7 stars 0 forks source link

Exhaustive pattern matching of sets #59

Open danilopedraza opened 3 months ago

danilopedraza commented 3 months ago

When I want to match a set with all of its elements I must check all of the permutations of the set in order to be sure that I don't have a match. This takes time proportional to the factorial of the number of elements, which is not nice. But... I think I will still implement it.