smallstring | SmallVec-backed stack string optimisation | Performance Testing library

Here's what I'm working on (playground):

I used this import definition in OSX32 successfully:

I have an exercise where I should implement the strstr function from the standard library. The implementation of strstr seems to work, however, while it points to 'B', from "Foo Bar Baz", it returns "Bar Baz". How could I change the returned subscript so that it only returns the first occurrence of "B" of "Bar" in "Foo Bar Baz"?

From the manual:

If needle is an empty string, haystack is returned; if needle occurs nowhere in haystack, NULL is returned; otherwise a pointer to the first character of the first occurrence of needle is returned.

Recently, i wrote some code for filtering bad words in a string. And a tons of words are going to be filtered. My code works but the performance is not really well as expected.

Below code is only the demo:

Method 1:

I have a simple LLVM pass that renames every function defined within the current translation unit (i.e: the source file in question, after all preprocessing steps have taken place - see here). My pass is as follows:

input is a string: HeLloWorlD for an example, The output should be: DlHelLoorW

The capital letters will hold their spots and only rotate in those spots between each other, same goes for small letters

the first letter is H and the next capital letter is L, in the rotation the letter H will take the L's spot and L will take the W's spot and so on, same thing for small letters

Way I did it, split the string into two strings, capital and small strings and filled the empty spots with 0 so smallString = 0e0lo0orl0 and capitalString = H0L00W000D then comes the function that should rotate them. I want to rotate between spots where there is only letters, so smallString becomes smallString = 0l0el0oor0 and capitalString = D0H00L000W, but my function will just rotate all of the characters