Finds the first occurrence of a set of compile-time known code units in a string. While the algorithm is O(n) in relation to the count of given code units, the overhead when using it on short strings weights more for only 1 or 2 code units.
Same as the overload for strings, but with only a char*, making it faster as it cannot do a boundary check.
Splits a string in two around one or more compile-time known code units.
Similar to the overload for strings, this function works a little faster as it lacks boundary checks. It assumes that one of the characters in match is actually contained in the string.
Concatenates a series of strings.
Fast, non-allocating string functions.