On 05/12/15 21:37, "Development on behalf of Marc Mutz" <[email protected] on behalf of [email protected]> wrote:
>On Saturday 05 December 2015 20:20:27 Sean Harmer wrote: >> I was >> just wondering if we could get it down to the theoretical ideal of a >> single integer comparison mapped into the finite set of strings in use. >> Seems not, without some non-neglible effort. > >man 1 gperf ? Just as a side note: While perf ensures there’s no collisions between valid keys in the hash table, you still end up doing one string comparison in the end to ensure that your input string matches the key. Cheers, Lars _______________________________________________ Development mailing list [email protected] http://lists.qt-project.org/mailman/listinfo/development
