diff options
author | Campbell Barton <ideasman42@gmail.com> | 2021-12-14 07:49:31 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2021-12-14 08:17:10 +0300 |
commit | c097c7b855d4b01950494dc369e9def59486b0fd (patch) | |
tree | d6a9c5a7108e97b0c38f5ba6cb4ded2a2e45ba2e /source/blender/bmesh/operators | |
parent | c1f5d8d023c6fdef67efbc6ce2af49e384c9bd98 (diff) |
Cleanup: correct unbalanced doxygen groups
Also add groups in some files.
Diffstat (limited to 'source/blender/bmesh/operators')
-rw-r--r-- | source/blender/bmesh/operators/bmo_connect_pair.c | 11 |
1 files changed, 5 insertions, 6 deletions
diff --git a/source/blender/bmesh/operators/bmo_connect_pair.c b/source/blender/bmesh/operators/bmo_connect_pair.c index 660633e8a0f..29fd8d9094b 100644 --- a/source/blender/bmesh/operators/bmo_connect_pair.c +++ b/source/blender/bmesh/operators/bmo_connect_pair.c @@ -120,19 +120,18 @@ typedef struct PathLinkState { float co_prev[3]; } PathLinkState; -/** - * \name Min Dist Dir Util +/* -------------------------------------------------------------------- */ +/** \name Min Dist Dir Util * * Simply getting the closest intersecting vert/edge is _not_ good enough. see T43792 * we need to get the closest in both directions since the absolute closest may be a dead-end. * * Logic is simple: * - * - first intersection, store the direction. - * - successive intersections will update the first distance if its aligned with the first hit. + * - First intersection, store the direction. + * - Successive intersections will update the first distance if its aligned with the first hit. * otherwise update the opposite distance. - * - caller stores best outcome in both directions. - * + * - Caller stores best outcome in both directions. * \{ */ typedef struct MinDistDir { |