I'm wondering if the actual problem is in your partitioning function - it looks to me like you're hitting some cases where the input list is not being partitioned roughly evenly but just into two lists of size 1 and n-1, so that the required stack size becomes O(n) instead of O(log n). I've encountered similar issues implementing spatial tree types and the best solution was always to rework the partitioning logic so it was guaranteed to always split exactly in half.
-- You received this message because you are subscribed to the Google Groups "Elm Discuss" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
