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>2022-01-06 05:54:52 +0300
committerCampbell Barton <ideasman42@gmail.com>2022-01-06 05:54:52 +0300
commit499fec6f79a26c9c9d2d61b90bda2e4cec424f81 (patch)
tree828271035f950a504f11a8bdb3454516835d0800 /source/blender/bmesh
parentaa363ec2ae9382c052f024284dcdb77ac495c177 (diff)
Cleanup: spelling in comments
Diffstat (limited to 'source/blender/bmesh')
-rw-r--r--source/blender/bmesh/intern/bmesh_operator_api.h3
-rw-r--r--source/blender/bmesh/intern/bmesh_walkers.c16
2 files changed, 10 insertions, 9 deletions
diff --git a/source/blender/bmesh/intern/bmesh_operator_api.h b/source/blender/bmesh/intern/bmesh_operator_api.h
index c60e8af68e5..de974587311 100644
--- a/source/blender/bmesh/intern/bmesh_operator_api.h
+++ b/source/blender/bmesh/intern/bmesh_operator_api.h
@@ -800,7 +800,8 @@ typedef struct BMOIter {
int cur; // for arrays
GHashIterator giter;
void **val;
- char restrictmask; /* bitwise '&' with BMHeader.htype */
+ /** Bit-wise '&' with #BMHeader.htype */
+ char restrictmask;
} BMOIter;
void *BMO_slot_buffer_get_first(BMOpSlot slot_args[BMO_OP_MAX_SLOTS], const char *slot_name);
diff --git a/source/blender/bmesh/intern/bmesh_walkers.c b/source/blender/bmesh/intern/bmesh_walkers.c
index e1f7430bc53..0e13c4c8128 100644
--- a/source/blender/bmesh/intern/bmesh_walkers.c
+++ b/source/blender/bmesh/intern/bmesh_walkers.c
@@ -33,19 +33,19 @@
/**
* NOTE(@joeedh): Details on design.
*
- * original design: walkers directly emulation recursive functions.
- * functions save their state onto a worklist, and also add new states
- * to implement recursive or looping behavior. generally only one
- * state push per call with a specific state is desired.
+ * Original design: walkers directly emulation recursive functions.
+ * functions save their state onto a #BMWalker.worklist, and also add new states
+ * to implement recursive or looping behavior.
+ * Generally only one state push per call with a specific state is desired.
*
* basic design pattern: the walker step function goes through its
* list of possible choices for recursion, and recurses (by pushing a new state)
- * using the first non-visited one. This choice is the flagged as visited using
- * the ghash. each step may push multiple new states onto the worklist at once.
+ * using the first non-visited one. This choice is the flagged as visited using the #GHash.
+ * Each step may push multiple new states onto the #BMWalker.worklist at once.
*
* - Walkers use tool flags, not header flags.
- * - Walkers now use ghash for storing visited elements,
- * rather than stealing flags. ghash can be rewritten
+ * - Walkers now use #GHash for storing visited elements,
+ * rather than stealing flags. #GHash can be rewritten
* to be faster if necessary, in the far future :) .
* - tools should ALWAYS have necessary error handling
* for if walkers fail.