Cleanup: spelling in comments

This commit is contained in:
Campbell Barton 2022-04-25 16:36:29 +10:00
parent 0efe581a5b
commit 416ef3b6b2
4 changed files with 10 additions and 11 deletions

View File

@ -1240,7 +1240,7 @@ static bool pbvh_bmesh_subdivide_long_edges(EdgeQueueContext *eq_ctx,
EDGE_QUEUE_DISABLE(e);
#endif
/* At the moment edges never get shorter (subdiv will make new edges)
/* At the moment edges never get shorter (subdivision will make new edges)
* unlike collapse where edges can become longer. */
#if 0
if (len_squared_v3v3(v1->co, v2->co) <= eq_ctx->q->limit_len_squared) {

View File

@ -791,8 +791,8 @@ static bool contig_ldata_across_edge(BMesh *bm, BMEdge *e, BMFace *f1, BMFace *f
}
/**
* In array face_component of total totface elements, swap values c1 and c2
* whereever they occur.
* In array face_component of total `totface` elements, swap values c1 and c2
* wherever they occur.
*/
static void swap_face_components(int *face_component, int totface, int c1, int c2)
{
@ -893,9 +893,8 @@ static void math_layer_info_init(BevelParams *bp, BMesh *bm)
MEM_freeN(stack);
MEM_freeN(in_stack);
/* We can usually get more pleasing result if components 0 and 1
* are the topmost and bottommost (in z-coordinate) componenets,
* so adjust component indices to make that so.
*/
* are the topmost and bottom-most (in z-coordinate) components,
* so adjust component indices to make that so. */
if (current_component <= 0) {
return; /* Only one component, so no need to do this. */
}
@ -5541,9 +5540,9 @@ static void bevel_build_rings(BevelParams *bp, BMesh *bm, BevVert *bv, BoundVert
BMVert *bmv4 = mesh_vert(vm, i, j + 1, k)->v;
BMVert *bmvs[4] = {bmv1, bmv2, bmv3, bmv4};
BLI_assert(bmv1 && bmv2 && bmv3 && bmv4);
/* For each created quad, the UVs etc. will be interpolated
/* For each created quad, the UV's etc. will be interpolated
* in potentially a different face for each corner and may need
* to snap to a particular edge before intorpolating.
* to snap to a particular edge before interpolating.
* The fr and se arrays will be filled with the interpolation faces
* and snapping edges for the for corners in the order given
* in the bmvs array.

View File

@ -289,7 +289,7 @@ void DRW_curves_update()
int max_read_px_len = min_ii(width * height, pr_call->vert_len);
DRW_draw_pass_subset(g_tf_pass, pr_call->shgrp, pr_call->shgrp);
/* Readback result to main memory. */
/* Read back result to main memory. */
GPU_framebuffer_read_color(fb, 0, 0, width, height, 4, 0, GPU_DATA_FLOAT, data);
/* Upload back to VBO. */
GPU_vertbuf_use(pr_call->vbo);

View File

@ -674,7 +674,7 @@ static void template_id_liboverride_hierarchy_create(bContext *C,
if (ID_IS_LINKED(object_active)) {
if (object_active->id.lib != id->lib ||
!ID_IS_OVERRIDABLE_LIBRARY_HIERARCHY(object_active)) {
/* The active object is from a different library than the overriden ID, or otherwise
/* The active object is from a different library than the overridden ID, or otherwise
* cannot be used in hierarchy. */
object_active = NULL;
}
@ -693,7 +693,7 @@ static void template_id_liboverride_hierarchy_create(bContext *C,
if (ID_IS_LINKED(collection_active)) {
if (collection_active->id.lib != id->lib ||
!ID_IS_OVERRIDABLE_LIBRARY_HIERARCHY(collection_active)) {
/* The active collection is from a different library than the overriden ID, or otherwise
/* The active collection is from a different library than the overridden ID, or otherwise
* cannot be used in hierarchy. */
collection_active = NULL;
}