diff --git a/benchmark/core/Cabana_LinkedCellPerformance.cpp b/benchmark/core/Cabana_LinkedCellPerformance.cpp index 8ebbd4481..ac8b9f76f 100644 --- a/benchmark/core/Cabana_LinkedCellPerformance.cpp +++ b/benchmark/core/Cabana_LinkedCellPerformance.cpp @@ -112,7 +112,7 @@ void performanceTest( std::ostream& stream, const std::string& test_prefix, double sort_delta[3] = { cutoff, cutoff, cutoff }; double grid_min[3] = { x_min[p], x_min[p], x_min[p] }; double grid_max[3] = { x_max[p], x_max[p], x_max[p] }; - auto linked_cell_list = Cabana::createLinkedCellList( + auto linked_cell_list = Cabana::createLinkedCellList<3>( x, sort_delta, grid_min, grid_max ); // Setup for neighbor iteration. diff --git a/benchmark/core/Cabana_NeighborVerletPerformance.cpp b/benchmark/core/Cabana_NeighborVerletPerformance.cpp index 907fb3b73..58c52701a 100644 --- a/benchmark/core/Cabana_NeighborVerletPerformance.cpp +++ b/benchmark/core/Cabana_NeighborVerletPerformance.cpp @@ -83,7 +83,7 @@ void performanceTest( std::ostream& stream, const std::string& test_prefix, // in cells the size of the smallest cutoff distance. double cutoff = cutoff_ratios.front(); double sort_delta[3] = { cutoff, cutoff, cutoff }; - auto linked_cell_list = Cabana::createLinkedCellList( + auto linked_cell_list = Cabana::createLinkedCellList<3>( x, sort_delta, grid_min, grid_max ); Cabana::permute( linked_cell_list, aosoas[p] ); } diff --git a/example/core_tutorial/08_linked_cell_list/linked_cell_list_example.cpp b/example/core_tutorial/08_linked_cell_list/linked_cell_list_example.cpp index 022a555bb..60dcc5e4d 100644 --- a/example/core_tutorial/08_linked_cell_list/linked_cell_list_example.cpp +++ b/example/core_tutorial/08_linked_cell_list/linked_cell_list_example.cpp @@ -108,8 +108,8 @@ void linkedCellListExample() auto cell_list = Cabana::createLinkedCellList( positions, start, end, grid_delta, grid_min, grid_max ); */ - auto cell_list = Cabana::createLinkedCellList( positions, grid_delta, - grid_min, grid_max ); + auto cell_list = Cabana::createLinkedCellList<3>( positions, grid_delta, + grid_min, grid_max ); /* Now permute the AoSoA (i.e. reorder the data) using the linked cell list.