Attempts at speeding up StringTableBuilder

[Rui Ueyama via llvm-commits]

Is there any way to speed up using multiple threads? It seems doable to
split a set of strings into multiple shards, do string merging for each
shard, and then just concatenate the results.

On Mon, Oct 17, 2016 at 9:43 AM, Daniel Berlin via llvm-commits <
llvm-commits at lists.llvm.org> wrote:

>
>
> On Mon, Oct 17, 2016 at 5:23 AM, Rafael Espíndola <
> rafael.espindola at gmail.com> wrote:
>
>> On 17 October 2016 at 00:20, Daniel Berlin <dberlin at dberlin.org> 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.
>>
>
> Yup.
>
> 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
>>
>
>
> _______________________________________________
> llvm-commits mailing list
> llvm-commits at lists.llvm.org
> http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-commits
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20161017/c92447e9/attachment.html>