Zero time strlen and strnlen? I am reasonably sure it is not me who first thought of this, but today, I figured writing a “zero time” strlen() and strnlen() in modern C++ is actually possible and obvious. Not for pointers though. For arrays of characters that is.
Update 2017-10-19
A “proper” and tested modern C++ code is to be found HERE as the part of dbj++, on GitHub. dbj::strlen() and dbj::strnlen() to take proper care of char, wchar_t, char16_t and char32_t.
Usage? If you need strlen() or strnlen() just use dbj::strlen() or dbj::strnlen(). In case you are passing arrays of characters the execution time is “zero”.
For example:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | /* declaration of string literals made up of four main char types */ char promptA[] = "0123456789"; wchar_t promptW[] = L"0123456789"; char16_t prompt16[] = u"0123456789"; char32_t prompt32[] = U"0123456789"; assert( dbj::strnlen(promptA, BUFSIZ) == 10 ); assert( dbj::strnlen(promptW, BUFSIZ) == 10 ); assert( dbj::strnlen(prompt16, BUFSIZ) == 10 ); assert( dbj::strnlen(prompt32, BUFSIZ) == 10 ); /* dbj::strlen() do exist but are somewhat less spectacular */ |
All of the dbj::strnlen() calls above will take “zero” time to execute. And whatever is the (legal) size of the arrays used the execution time will be still “zero”.
Zero time strlen and strnlen. The initial idea
What are then the real-time savings of using this? Yes, it is quite hard to compute., them real time savings, if your app uses the code below.
It may be hard but it is obvious there must be a time-saving. It depends on the compiler on the OS and on the number of char arrays your application processes.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 | /* Copyright 2017 by dbj@dbj.org Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http ://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. */ #include "stdio.h" #include "stdlib.h" #include <cstring> /* 2017-10-18 DBJ created */ namespace dbj { template<size_t N> inline size_t strnlen(const char(&carr)[N], const size_t & maxlen) { return std::min(N, maxlen) - 1; } template<size_t N> inline size_t strlen(const char(&carr)[N]) { return N - 1; } } // eof dbj |
wchar_t version is trivial so it is a proverbial “exercise for the reader”.
Copy/paste and try. It should work “out of the box”. Coliru version is here.
This little “nugget” shows, perhaps dramatically, the advantages of using modern C++ compilers.
For more modern C++ speculations and more copy paste opportunities, please click HERE .
Enjoy …? No, wait! There is more!
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 | /* Generics */ #include "stdio.h" #include "stdlib.h" /* 2017-10-18 DBJ created */ namespace dbj { template<typename T, size_t N> inline size_t arr_nlen(const T(&carr)[N], const size_t & maxlen) { return std::min(N, maxlen) - 1; } template<typename T, size_t N> inline size_t arr_len(const T(&carr)[N]) { return N - 1; } } // eof dbj |
Obviously, the same concept can be (and already is) extended to an geenric array of T. Above will work for any T, for which the std:::min() will work.
