On Tuesday, 11 March 2014 at 14:04:38 UTC, Steven Schveighoffer wrote: > It would be O(1), work just like it does today. > > -Steve Today it works by allowing arbitrary index and not checking if resulting slice is valid UTF-8. Anything that implies decoding is O(n). What exactly do you have in mind for this?