PQuickStringLess implements an ordering of strings, that is more efficient than usual lexicographical order. More...
PQuickStringLess implements an ordering of strings, that is more efficient than usual lexicographical order.
It can be used in cases when no specific order is required, e.g. only simple key lookup is needed. Current implementation first compares lengths of strings, and will compare string data only when lengths are the same.
Definition at line 5013 of file ncbistr.hpp.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4