import std.algorithm : equal, map;
string s = "abracadabra";
auto saInfo = s.suffixArray;
assert(equal(saInfo.sa.map!(i => s[i..$]), [
"",
"a",
"abra",
"abracadabra",
"acadabra",
"adabra",
"bra",
"bracadabra",
"cadabra",
"dabra",
"ra",
"racadabra",
]));
return SA!T. each character must be inside [T(0), T(B)).