Skip to content
Success

Changes

Summary

  1. Skip computing permutation in special case when sorting distributed results (details)
  2. Rename sortResults -> sortResultsByKey and allow modifying keys (details)
Commit 3ef91ae31abb8ef06bcf24e7adedf7108dd2885a by Andrey Prokopenko
Skip computing permutation in special case when sorting distributed results

If we only have one view to sort, we can do it in a single sweep using
sort_by_key instead of first computing permutation and then applying it.
The file was modified src/details/ArborX_DetailsDistributedTreeUtils.hpp (diff)
Commit 902d1c83e30a473384099601e9d80bd02dde0c67 by Andrey Prokopenko
Rename sortResults -> sortResultsByKey and allow modifying keys
The file was modified src/details/ArborX_DetailsDistributedTreeSpatial.hpp (diff)
The file was modified test/tstDetailsDistributedTreeImpl.cpp (diff)
The file was modified src/details/ArborX_DetailsDistributedTreeNearest.hpp (diff)
The file was modified src/details/ArborX_DetailsDistributedTreeUtils.hpp (diff)