Manacher's algorithm for computing palindrome substrings in linear time. pal[2*i] = odd length of palindrome centred at text[i]. pal[2*i+1] = even length of palindrome centred at text[i+0.5]. # Panics Panics if text is empty.
(text: &[impl Eq])
source not stored for this graph (policy: none)