Attempts at speeding up StringTableBuilder

Daniel Berlin via llvm-commits llvm-commits at
Mon Oct 17 09:43:41 PDT 2016

On Mon, Oct 17, 2016 at 5:23 AM, Rafael EspĂ­ndola <
rafael.espindola at> wrote:

> On 17 October 2016 at 00:20, Daniel Berlin <dberlin at> wrote:
> >
> >
> Yes, that is my impression. With CachedHash the hash computation cost
> is small and there are few collisions. One way to look at it is that
> the hash table became almost a counting sort.


The usual faster datastructure are those that don't require the hash
computation or hash lookup for misses.

(IE the infinite variations of ternary search tries, crit-bit trees, etc)

> Cheers,
> Rafael
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <>

More information about the llvm-commits mailing list