• Quentin Khan's avatar
    FAdaptiveSequential: Make direct computation work with existing kernels · 364eb9a8
    Quentin Khan authored
    For a given leaf A, the existing symmetric kernels expect to receive the list of
    adjacent B leaves sorted by offset index.
    
    The offset index is computed by `compute_box_offset_index`. For direct
    computation, it ranges from 0 to 3^dim.
    
    A node's U list is not sorted. It is first looped over to compute the indices
    and stored in a sorted std::multimap. The map is then looped over to create the
    adequate arrays (managed through std::vector objects) to give to the kernel P2P
    call.
    364eb9a8
Name
Last commit
Last update
Addons Loading commit data...
Build Loading commit data...
CMakeModules Loading commit data...
Data Loading commit data...
Doc Loading commit data...
Examples Loading commit data...
Src Loading commit data...
Tests Loading commit data...
UTests Loading commit data...
Utils Loading commit data...
.gitignore Loading commit data...
CMakeLists.txt Loading commit data...
Licence.txt Loading commit data...
NEWS.txt Loading commit data...
README.txt Loading commit data...
ScalFMMConfig.cmake.in Loading commit data...
TODO.txt Loading commit data...
Validation.txt Loading commit data...
paraviewscript.py Loading commit data...