diff options
author | Siddhartha Jejurkar <f20180617@goa.bits-pilani.ac.in> | 2021-12-17 16:01:32 +0300 |
---|---|---|
committer | Siddhartha Jejurkar <f20180617@goa.bits-pilani.ac.in> | 2021-12-17 16:01:32 +0300 |
commit | dbc41b30f88b96f7d8c6e995b17f5930eb55cc77 (patch) | |
tree | c6c495328443ea3621e5df2ef483b0e0dd504496 /source/blender/bmesh/operators/bmo_connect_pair.c | |
parent | 99a2af76d10e05a18987be5d554ada197b1ca086 (diff) | |
parent | 7c9e4099854a4fc8eab4db97173c1aacd25f9e08 (diff) |
Merge branch 'master' into soc-2021-uv-edge-select-supportsoc-2021-uv-edge-select-support
Diffstat (limited to 'source/blender/bmesh/operators/bmo_connect_pair.c')
-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 { |