Displaying 2 results from an estimated 2 matches for "hashf2".
Did you mean:
hash2
2014 Jan 22
2
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
...hash numbers. In another words we can try to represent function as a chain of hash codes:
> F0: hashF0-0, hashF0-1, hashF0-2, ...
> F1: hashF1-0, hashF1-1, ...
>
> In this case you can create kind of hash-tree. Consider we have F0, F1 and F2.
>
> Imagine, hashF0-0 == hashF1-0 == hashF2-0, hashF0-1 == hashF1-1:
>
> Then we can build the next tree (requires fixed-width fonts):
>
> [hashF0-0]
> / \
> [hashF0-1] [hashF2-1]
> / \ \
> [hashF0-2] [hashF1-2] [hashF2-2]
>
> In this case as you...
2014 Jan 21
3
[LLVMdev] MergeFunctions: reduce complexity to O(log(N))
Hi Stepan,
This looks interesting! Some high-level comments:
- Please post the patch untarred next time. Also, I'm not sure if it's typical
to provide supporting documents in .doc format; while many of us probably
have access to Word, a more portable and email-friendly format (like text,
markdown or rst) is probably better.
- Have you profiled this? What's the speedup? I