BLS: > >> bearophile brings in several times Scala/OCAML like pattern matching. > >> Why not using that for constraints ? > > > > I have no idea how that works, though Bartosz has been looking into it. > > O well, I am pretty sure that bearophile is willing to give you any > information you need :)
Pattern matching is handy and it can be powerful, for example I've seen OCaML code that uses it to implement a AVL search tree in about 15 lines of code. But probably it also adds lot of complexity to a language like D, so there are more important things to add to D2 now (like good concurrency). Bye, bearophile
