On 2019-07-16 18:11, Matthew Woehlke wrote:
[...]
The basic
algorithm (iterate through 'haystack' looking for 'needle') is common
regardless of the string types. The points that differ (e.g. only
starting the search at code points, computing lengths) use overloaded
helper functions which can be inline (e.g. q_next_codepoint for some
types will just be operator++) and optimized.
Please square me that with this comment from qstring.cpp:
// we're going to read a[0..15] and b[0..15] (32 bytes)
Thanks,
Marc
_______________________________________________
Development mailing list
[email protected]
https://lists.qt-project.org/listinfo/development