fixup: LCL example/benchmarks

ECP-copa · Oct 14, 2024 · a78ac22 · a78ac22
1 parent a762117
commit a78ac22
Show file tree

Hide file tree

Showing 4 changed files with 5 additions and 5 deletions.
diff --git 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<3>(
+            auto linked_cell_list = Cabana::createLinkedCellList(
                 x, sort_delta, grid_min, grid_max );
 
             // Setup for neighbor iteration.

diff --git a/benchmark/core/Cabana_NeighborArborXPerformance.cpp b/benchmark/core/Cabana_NeighborArborXPerformance.cpp
@@ -78,7 +78,7 @@ void performanceTest( std::ostream& stream, const std::string& test_prefix,
             double cutoff = cutoff_ratios.front();
             double sort_delta[3] = { cutoff, cutoff, cutoff };
             auto x = Cabana::slice<0>( aosoas[p], "position" );
-            auto linked_cell_list = Cabana::createLinkedCellList<memory_space>(
+            auto linked_cell_list = Cabana::createLinkedCellList(
                 x, sort_delta, grid_min, grid_max );
             Cabana::permute( linked_cell_list, aosoas[p] );
         }

diff --git a/benchmark/core/Cabana_NeighborVerletPerformance.cpp b/benchmark/core/Cabana_NeighborVerletPerformance.cpp
@@ -85,7 +85,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<3>(
+            auto linked_cell_list = Cabana::createLinkedCellList(
                 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
@@ -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<3>( positions, grid_delta,
-                                                      grid_min, grid_max );
+    auto cell_list = Cabana::createLinkedCellList( positions, grid_delta,
+                                                   grid_min, grid_max );
 
     /*
       Now permute the AoSoA (i.e. reorder the data) using the linked cell list.