x eagerly split in three parts, all as equal in length as possible.
Safely avoids range checking thanks to D's builtin slice expressions. Use in divide-and-conquer algorithms such as quicksort and binary search.
See Implementation