add a algebra simplification rules for range pattern match compiler about rescript-compiler HOT 4 CLOSED

------------------ Original ------------------ From: Justin Baum <[email protected]> Date: Wed,Jul 24,2019 0:08 AM To: BuckleScript/bucklescript <[email protected]> Cc: Hongbo Zhang <[email protected]>, Author <[email protected]> Subject: Re: [BuckleScript/bucklescript] add a algebra simplification rules for range pattern match compiler (#59) Gentle bump The main issues we're running into involve the compilation of match statements such a, let f x = match x with | x when (x > 3) && (x <= 11) -> 2 | x when (x > 11) && (x <= 17) -> 5 | x when (x > 17) && (x <= 23) -> 11 | x when (x > 23) || (x < 145) -> 3 | _x -> 7 This gets compiled to function f(x) { if (x > 3 && x <= 11) { return 2; } else if (x > 11 && x <= 17) { return 5; } else if (x > 17 && x <= 23) { return 11; } else if (x > 23 || x < 145) { return 3; } else { return 7; } } We have a use case with hundreds of thousands of cases(unicode tables). We tried hash tables, and an array but we run into memory issues. And a standard match statement lead to long run times. Currently we use a b tree search to speed up our affected program. — You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub, or mute the thread.