Hello! Matthew, no, I don't benchmark this library, it should be more sufficient theoretically because it uses binary search rather than linear, and the first one is known to be more efficient. I used the similar technique for writing code for my project mm1. There I firstly used case but then manually made optimization using case and guards and if-then-else. You can see it for different releases for mm1. The manually optimized program being added additional functionality after optimizing were a little more efficient, but it should be mentioned that most time while it is running the espeak and sox being worked, so I think it should be more efficient for such situations.  | | | | | | | | | | | OleksandrZhabenko/mm1 Program that reads Ukrainian text using eSpeak and SoX. - OleksandrZhabenko/mm1 | | | I can try to do benchmarking, but it needs some time in advance. Thank you for your advice! Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 21:26:35 GMT+3, Олександр Жабенко <olexandr576@yahoo.com> написав: Hello! Matthew, no, I don't benchmark this library, it should be more sufficient theoretically because it uses binary search rather than linear, and the first one is known to be more efficient. I used the similar technique for writing code for my project mm1. There I firstly used case but then manually made optimization using case and guards and if-then-else. You can see it for different releases for mm1. The manually optimized program being added additional functionality after optimizing were a little more efficient, but it should be mentioned that most time while it is running the espeak and sox being worked, so I think it should be more efficient for such situations.  | | | | | | | | | | | OleksandrZhabenko/mm1 Program that reads Ukrainian text using eSpeak and SoX. - OleksandrZhabenko/mm1 | | | I can try to do benchmarking, but it needs some time in advance. Thank you for your advice! Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 20:04:32 GMT+2, olexandr543@yahoo.com <olexandr543@yahoo.com> написав: Hello! Matthew, no, I don't benchmark this library, it should be more sufficient theoretically because it uses binary search rather than linear, and the first one is known to be more efficient. I used the similar technique for writing code for my project mm1. There I firstly used case but then manually made optimization using case and guards and if-then-else. You can see it for different releases for mm1. The manually optimized program being added additional functionality after optimizing were a little more efficient, but it should be mentioned that most time while it is running the espeak and sox being worked, so I think it should be more efficient for such situations.  | | | | | | | | | | | OleksandrZhabenko/mm1 Program that reads Ukrainian text using eSpeak and SoX. - OleksandrZhabenko/mm1 | | | I can try to do benchmarking, but it needs some time in advance. Thank you for your advice! Best regards,Oleksandr Zhabenko. субота, 21 вересня 2019 р., 15:46:38 GMT+2, Matthew Pickering <matthewtpickering@gmail.com> написав: Have you benchmarked this library?  I don't see how using a vector can be any faster than using a case. On Sat, 21 Sep 2019, 14:00 olexandr543--- via Haskell, <haskell@haskell.org> wrote: Hello! My library that can help to optimize using 'case ... of ...' construction if there are multiple (more than at least 5) variants.mm2: The library that can be used for optimization of multiple (Ord a) => a -> b transformations Best regards,Oleksandr Zhabenko. _______________________________________________ Haskell mailing list Haskell@haskell.org http://mail.haskell.org/cgi-bin/mailman/listinfo/haskell