Tilmann comments

Results 80 comments of


                                            Tilmann

relocate in multimap causes heap-use-after-free issue

@polasek Thanks! I will have a look.

relocate in multimap causes heap-use-after-free issue

I still can't reproduce the issue using your test or mine on my machine with `$ CC=clang-19 bazel test //test:phtree_test_issue_153 --features=asan`. ``` $ clang-19 --version Ubuntu clang version 19.1.1 (1ubuntu1~24.04.2)...

relocate in multimap causes heap-use-after-free issue

@polasek Weirdly enough, today I could finally see the asan errors. I used the commands from command history, so this hasn't changed. The only thing that changed was a BIOS...

flat_array_map appears to be too slow when querying

This may be related to TZCNT/CTZ not being compiled to a CPU instruction, see #103.

flat_array_map appears to be too slow when querying

-> Probably not CTZ, but somehow lower_bound seems quite expensive, even when done with TZCNT which should be just one cycle with `-mbmi2`. is it maybe the waste of memory...

Look at B+tree

`rebalance()` was fixed in #114.

Look at B+tree

copy/move was fixed in https://github.com/tzaeschke/phtree-cpp/pull/119.

Do we need further guidance if multiple paths over the same 4-tuple are used?

> [...] The main problem I see is the possible collision. Path 1 and 2 share the same 4 tuple, client abandons 1 and at the same time server abandons...

Is it possible for PHTree to convert a k-dim point into a value without building the tree

Sorry, I don't understand what you mean? For storing 1-dimensional values I would use hashmaps or an ordered list....? You can use PH-tree to store 1-dimensional points (=scalars) but there...

Is it possible for PHTree to convert a k-dim point into a value without building the tree

Well, the PH-tree is an index structure, I don't think it (or any other index structure) can produce values. What you can do is use z-curves / Morton order to...