Skip to content

Commit

Permalink
Apply suggestions
Browse files Browse the repository at this point in the history
  • Loading branch information
acdaigneault committed Aug 8, 2024
1 parent dc17ca9 commit b6a32dc
Show file tree
Hide file tree
Showing 3 changed files with 11 additions and 10 deletions.
10 changes: 6 additions & 4 deletions include/dem/find_cell_neighbors.h
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand All @@ -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
Expand Down
8 changes: 4 additions & 4 deletions include/dem/particle_particle_broad_search.h
Original file line number Diff line number Diff line change
Expand Up @@ -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
Expand Down Expand Up @@ -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
Expand Down
3 changes: 1 addition & 2 deletions source/dem/find_cell_neighbors.cc
Original file line number Diff line number Diff line change
Expand Up @@ -2,8 +2,6 @@

using namespace DEM;

// This function finds the neighbor list (without repetition) of all the active
// cells in the triangulation
template <int dim>
void
find_cell_neighbors(
Expand Down Expand Up @@ -307,6 +305,7 @@ find_full_cell_neighbors(
}
}
}

template <int dim>
void
get_periodic_neighbor_list(
Expand Down

0 comments on commit b6a32dc

Please sign in to comment.