diff options
author | Campbell Barton <ideasman42@gmail.com> | 2019-01-08 02:28:20 +0300 |
---|---|---|
committer | Campbell Barton <ideasman42@gmail.com> | 2019-01-08 02:37:43 +0300 |
commit | 91a155833e59275089641b63ae9271672ac17713 (patch) | |
tree | 8057253d80b84de168b96f45ae5e5063d6e8f0fa /source/blender/blenlib | |
parent | 3d2ff33c261593d5211456500e8a212fb6a2ce82 (diff) |
Cleanup: comments causing bad clang-format output
Diffstat (limited to 'source/blender/blenlib')
-rw-r--r-- | source/blender/blenlib/BLI_kdopbvh.h | 36 | ||||
-rw-r--r-- | source/blender/blenlib/BLI_voronoi_2d.h | 18 |
2 files changed, 37 insertions, 17 deletions
diff --git a/source/blender/blenlib/BLI_kdopbvh.h b/source/blender/blenlib/BLI_kdopbvh.h index e4203a01b17..d83de68169e 100644 --- a/source/blender/blenlib/BLI_kdopbvh.h +++ b/source/blender/blenlib/BLI_kdopbvh.h @@ -61,27 +61,41 @@ typedef struct BVHTreeOverlap { } BVHTreeOverlap; typedef struct BVHTreeNearest { - int index; /* the index of the nearest found (untouched if none is found within a dist radius from the given coordinates) */ - float co[3]; /* nearest coordinates (untouched it none is found within a dist radius from the given coordinates) */ - float no[3]; /* normal at nearest coordinates (untouched it none is found within a dist radius from the given coordinates) */ - float dist_sq; /* squared distance to search around */ + /** The index of the nearest found + * (untouched if none is found within a dist radius from the given coordinates) */ + int index; + /** Nearest coordinates + * (untouched it none is found within a dist radius from the given coordinates). */ + float co[3]; + /** Normal at nearest coordinates + * (untouched it none is found within a dist radius from the given coordinates). */ + float no[3]; + /** squared distance to search around */ + float dist_sq; int flags; } BVHTreeNearest; typedef struct BVHTreeRay { - float origin[3]; /* ray origin */ - float direction[3]; /* ray direction */ - float radius; /* radius around ray */ + /** ray origin */ + float origin[3]; + /** ray direction */ + float direction[3]; + /** radius around ray */ + float radius; #ifdef USE_KDOPBVH_WATERTIGHT struct IsectRayPrecalc *isect_precalc; #endif } BVHTreeRay; typedef struct BVHTreeRayHit { - int index; /* index of the tree node (untouched if no hit is found) */ - float co[3]; /* coordinates of the hit point */ - float no[3]; /* normal on hit point */ - float dist; /* distance to the hit point */ + /** Index of the tree node (untouched if no hit is found). */ + int index; + /** Coordinates of the hit point. */ + float co[3]; + /** Normal on hit point. */ + float no[3]; + /** Distance to the hit point. */ + float dist; } BVHTreeRayHit; enum { 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; |