Welcome to mirror list, hosted at ThFree Co, Russian Federation.

git.blender.org/blender.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorCampbell Barton <ideasman42@gmail.com>2019-01-08 02:28:20 +0300
committerCampbell Barton <ideasman42@gmail.com>2019-01-08 02:37:43 +0300
commit91a155833e59275089641b63ae9271672ac17713 (patch)
tree8057253d80b84de168b96f45ae5e5063d6e8f0fa /source/blender/blenlib/BLI_voronoi_2d.h
parent3d2ff33c261593d5211456500e8a212fb6a2ce82 (diff)
Cleanup: comments causing bad clang-format output
Diffstat (limited to 'source/blender/blenlib/BLI_voronoi_2d.h')
-rw-r--r--source/blender/blenlib/BLI_voronoi_2d.h18
1 files changed, 12 insertions, 6 deletions
diff --git a/source/blender/blenlib/BLI_voronoi_2d.h b/source/blender/blenlib/BLI_voronoi_2d.h
index 8d1ff2d4c2b..7caba2b0692 100644
--- a/source/blender/blenlib/BLI_voronoi_2d.h
+++ b/source/blender/blenlib/BLI_voronoi_2d.h
@@ -40,18 +40,24 @@ typedef struct VoronoiSite {
typedef struct VoronoiEdge {
struct VoronoiEdge *next, *prev;
- float start[2], end[2]; /* start and end points */
+ /* start and end points */
+ float start[2], end[2];
/* this fields are used during diagram computation only */
- float direction[2]; /* directional vector, from "start", points to "end", normal of |left, right| */
+ /* directional vector, from "start", points to "end", normal of |left, right| */
+ float direction[2];
- float left[2]; /* point on Voronoi place on the left side of edge */
- float right[2]; /* point on Voronoi place on the right side of edge */
+ /* point on Voronoi place on the left side of edge */
+ float left[2];
+ /* point on Voronoi place on the right side of edge */
+ float right[2];
- float f, g; /* directional coeffitients satisfying equation y = f * x + g (edge lies on this line) */
+ /* directional coeffitients satisfying equation y = f * x + g (edge lies on this line) */
+ float f, g;
- /* some edges consist of two parts, so we add the pointer to another part to connect them at the end of an algorithm */
+ /* some edges consist of two parts,
+ * so we add the pointer to another part to connect them at the end of an algorithm */
struct VoronoiEdge *neighbor;
} VoronoiEdge;