I'm looking for feedback on this approach to an immutable string (istring). The idea is to provide a super fast immutable string that can be efficiently passed to lambdas as well as be 100% thread safe.<p>Another bonus is faster hashing. If a string literal is given to istring, then the hash is computed at compile time! Other strings will have their hashes cached for later use. The istring is designed more or less after the python string in this regard.<p>It should also consume less memory than std::string and perform faster in all other areas.
Just as a note, on Java 7, developers opted for not having a single buffer backing multiple strings due to the backing references never been deleted. [1] [2]<p>[1] <a href="http://stackoverflow.com/questions/16123446/java-7-string-substring-complexity" rel="nofollow">http://stackoverflow.com/questions/16123446/java-7-string-su...</a><p>[2] <a href="http://www.reddit.com/r/programming/comments/1qw73v/til_oracle_changed_the_internal_string/" rel="nofollow">http://www.reddit.com/r/programming/comments/1qw73v/til_orac...</a>
Great job. I like it how peole are moving to and developing for C++11 as I think it's a huge step forward in the standard. The one cosmetic complaint I have is that the slicing syntax is not verbose enough for my taste. Also, what hash algo did you use? Asking just out of curiosity. I remember running a benchmark a long ago of different non-cryptographic hashes. The collision resistance was pretty consistent across all of them, but some were really slow and some were really fast, and that could directly affect the performance on hashtables and other structures that rely on hashes.