diff --git a/include/dem/find_cell_neighbors.h b/include/dem/find_cell_neighbors.h index adf9c41ab4..225f5042ce 100644 --- a/include/dem/find_cell_neighbors.h +++ b/include/dem/find_cell_neighbors.h @@ -29,8 +29,9 @@ using namespace dealii; * @brief Finds the neighbor list (without repetition) of all the active * cells in the triangulation. It gets the vertices of the cells to get lists * of the neighbor for each cells. There is some check to prevent repetition - * of a cell in a list (up to 4 vertices can have the same cell in common in - * 3D). 2 types of container are used for cell neighbors : local-local cells + * of a cell in a list (up to 8 vertices can have the same cell in common in + * 3D). + * 2 types of container are used for cell neighbors : local-local cells * and local-ghost cells. * * @param triangulation Triangulation to access the information of the cells @@ -55,8 +56,9 @@ find_cell_neighbors( * active cells in the triangulation. It gets the coinciding vertices of the * cells at the periodic boundary 0 to get lists of the periodic neighbor * cells on the periodic boundary 1 for each cells. There is some check to - * prevent repetition of a cell in a list (up to 4 vertices can have the - * same cell in common in 3D). Also, 3 types of container are used for + * prevent repetition of a cell in a list (up to 8 vertices can have the + * same cell in common in 3D). + * 3 types of container are used for * periodic mapping of cell neighbors : local-local cells, local-ghost cells * and ghost-local cells. The last container is necessary since the mapping * are only from periodic boundary 0 to periodic boundary 1 and the diff --git a/include/dem/particle_particle_broad_search.h b/include/dem/particle_particle_broad_search.h index 90a1ac83aa..fb380311d1 100644 --- a/include/dem/particle_particle_broad_search.h +++ b/include/dem/particle_particle_broad_search.h @@ -52,8 +52,8 @@ find_particle_particle_contact_pairs( * @brief Finds a vector of pairs (particle_particle_candidates) which shows the * candidate particle-particle collision pairs. These collision pairs will be * used in the fine search to investigate if they are in contact or not. - * This version of the function is used when adaptive sparse contacts regards - * mobility is enable. + * This version of the function is used when adaptive sparse contacts is + * enabled. * * @param particle_handler The particle handler of particles in the broad * search @@ -91,8 +91,8 @@ find_particle_particle_periodic_contact_pairs( * @brief Finds a vector of pairs (particle_particle_candidates) which contains the * candidate particle-particle collision pairs. These collision pairs will be * used in the fine search to investigate if they are in contact or not. - * This version of the function is used when adaptive sparse contacts regards - * mobility is enable. + * This version of the function is used when adaptive sparse contacts is + * enabled. * * @param particle_handler The particle handler of particles in the broad * search diff --git a/source/dem/find_cell_neighbors.cc b/source/dem/find_cell_neighbors.cc index c2286038e2..0fcff7656c 100644 --- a/source/dem/find_cell_neighbors.cc +++ b/source/dem/find_cell_neighbors.cc @@ -2,8 +2,6 @@ using namespace DEM; -// This function finds the neighbor list (without repetition) of all the active -// cells in the triangulation template void find_cell_neighbors( @@ -307,6 +305,7 @@ find_full_cell_neighbors( } } } + template void get_periodic_neighbor_list(