diff options
author | Campbell Barton <campbell@blender.org> | 2022-04-11 04:41:00 +0300 |
---|---|---|
committer | Campbell Barton <campbell@blender.org> | 2022-04-11 05:03:09 +0300 |
commit | 5e47056e8d97e414c9dabacea71fac2bdc7d2818 (patch) | |
tree | 110a51be7cfb2f9eff9fd8db093975e29e1a3445 /source/blender/blenlib | |
parent | 1c264ebdc089ea6afef7be4edeb1add4998a1099 (diff) |
Cleanup: malformed C-style comment blocks, spelling
- Missing star prefix.
- Unnecessary indentation.
- Blank line after dot-points
(otherwise doxygen merges with the previous dot-point).
- Use back-slash for doxygen commands.
- Correct spelling.
Diffstat (limited to 'source/blender/blenlib')
-rw-r--r-- | source/blender/blenlib/BLI_delaunay_2d.h | 4 | ||||
-rw-r--r-- | source/blender/blenlib/BLI_fileops.h | 2 | ||||
-rw-r--r-- | source/blender/blenlib/BLI_mesh_intersect.hh | 4 | ||||
-rw-r--r-- | source/blender/blenlib/BLI_string.h | 2 | ||||
-rw-r--r-- | source/blender/blenlib/intern/delaunay_2d.cc | 2 | ||||
-rw-r--r-- | source/blender/blenlib/intern/math_boolean.cc | 30 |
6 files changed, 22 insertions, 22 deletions
diff --git a/source/blender/blenlib/BLI_delaunay_2d.h b/source/blender/blenlib/BLI_delaunay_2d.h index 2d8428e164f..53c2ff1c345 100644 --- a/source/blender/blenlib/BLI_delaunay_2d.h +++ b/source/blender/blenlib/BLI_delaunay_2d.h @@ -5,8 +5,8 @@ /** \file * \ingroup bli * - * This header file contains both a C interface and a C++ interface - * to the 2D Constrained Delaunay Triangulation library routine. + * This header file contains both a C interface and a C++ interface + * to the 2D Constrained Delaunay Triangulation library routine. */ #ifdef __cplusplus diff --git a/source/blender/blenlib/BLI_fileops.h b/source/blender/blenlib/BLI_fileops.h index 04b40904187..3ce2b90e729 100644 --- a/source/blender/blenlib/BLI_fileops.h +++ b/source/blender/blenlib/BLI_fileops.h @@ -270,7 +270,7 @@ struct LinkNode *BLI_file_read_as_lines(const char *file) ATTR_WARN_UNUSED_RESUL void *BLI_file_read_text_as_mem(const char *filepath, size_t pad_bytes, size_t *r_size); /** * Return the text file data with: - + * * - Newlines replaced with '\0'. * - Optionally trim white-space, replacing trailing <space> & <tab> with '\0'. * diff --git a/source/blender/blenlib/BLI_mesh_intersect.hh b/source/blender/blenlib/BLI_mesh_intersect.hh index ba1d9b293c7..22ea83760aa 100644 --- a/source/blender/blenlib/BLI_mesh_intersect.hh +++ b/source/blender/blenlib/BLI_mesh_intersect.hh @@ -5,8 +5,8 @@ /** \file * \ingroup bli * - * Mesh intersection library functions. - * Uses exact arithmetic, so need GMP. + * Mesh intersection library functions. + * Uses exact arithmetic, so need GMP. */ #ifdef WITH_GMP diff --git a/source/blender/blenlib/BLI_string.h b/source/blender/blenlib/BLI_string.h index 7d0884f83dc..45abac33795 100644 --- a/source/blender/blenlib/BLI_string.h +++ b/source/blender/blenlib/BLI_string.h @@ -255,7 +255,7 @@ size_t BLI_str_unescape(char *__restrict dst, const char *__restrict src, size_t * * \param str: Typically this is the first character in a quoted string. * Where the character before `*str` would be `"`. - + * * \return The pointer to the first un-escaped quote. */ const char *BLI_str_escape_find_quote(const char *str) ATTR_NONNULL(); diff --git a/source/blender/blenlib/intern/delaunay_2d.cc b/source/blender/blenlib/intern/delaunay_2d.cc index 804ba5c3c80..ece22bcf82e 100644 --- a/source/blender/blenlib/intern/delaunay_2d.cc +++ b/source/blender/blenlib/intern/delaunay_2d.cc @@ -2807,7 +2807,7 @@ blender::meshintersect::CDT_result<mpq_class> delaunay_2d_calc(const CDT_input<m /* C interface. */ /** - This function uses the double version of #CDT::delaunay_calc. + * This function uses the double version of #CDT::delaunay_calc. * Almost all of the work here is to convert between C++ #Arrays<Vector<int>> * and a C version that linearizes all the elements and uses a "start" * and "len" array to say where the individual vectors start and how diff --git a/source/blender/blenlib/intern/math_boolean.cc b/source/blender/blenlib/intern/math_boolean.cc index 885d2c13b49..132d5dfda65 100644 --- a/source/blender/blenlib/intern/math_boolean.cc +++ b/source/blender/blenlib/intern/math_boolean.cc @@ -1857,23 +1857,23 @@ double incircle(const double *pa, const double *pb, const double *pc, const doub } /** - * inspherefast() Approximate 3D insphere test. Non-robust. - * insphere() Adaptive exact 3D insphere test. Robust. + * inspherefast() Approximate 3D insphere test. Non-robust. + * insphere() Adaptive exact 3D insphere test. Robust. * - * Return a positive value if the point pe lies inside the - * sphere passing through pa, pb, pc, and pd; a negative value - * if it lies outside; and zero if the five points are - * co-spherical. The points pa, pb, pc, and pd must be ordered - * so that they have a positive orientation (as defined by - * orient3d()), or the sign of the result will be reversed. + * Return a positive value if the point pe lies inside the + * sphere passing through pa, pb, pc, and pd; a negative value + * if it lies outside; and zero if the five points are + * co-spherical. The points pa, pb, pc, and pd must be ordered + * so that they have a positive orientation (as defined by + * orient3d()), or the sign of the result will be reversed. * - * The second uses exact arithmetic to ensure a correct answer. The - * result returned is the determinant of a matrix. In insphere() only, - * this determinant is computed adaptively, in the sense that exact - * arithmetic is used only to the degree it is needed to ensure that the - * returned value has the correct sign. Hence, insphere() is usually quite - * fast, but will run more slowly when the input points are co-spherical or - * nearly so. + * The second uses exact arithmetic to ensure a correct answer. The + * result returned is the determinant of a matrix. In insphere() only, + * this determinant is computed adaptively, in the sense that exact + * arithmetic is used only to the degree it is needed to ensure that the + * returned value has the correct sign. Hence, insphere() is usually quite + * fast, but will run more slowly when the input points are co-spherical or + * nearly so. */ double inspherefast( |