blender
/
blender
136
404
Fork 586
Code Issues 6.2k Pull Requests 754 Projects 19 Wiki Activity

UI: Comments Misspellings of Vertex/Vertices 

Correct misspellings in code comments of "vertex" and "vertices".

See D13932 for more details.

Differential Revision: https://developer.blender.org/D13932

Reviewed by Harley Acheson
This commit is contained in:
Nikhil Shringarpurey 2022-03-02 10:05:15 -08:00 committed by Harley Acheson
parent ca0b728529
commit 721b705499
16 changed files with 22 additions and 22 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
source/blender/blenkernel/BKE_particle.h
View File

@ -226,7 +226,7 @@ typedef struct ParticleCollision {
} ParticleCollision;
typedef struct ParticleDrawData {
float *vdata, *vd; /* vertice data */
float *vdata, *vd; /* vertex data */
float *ndata, *nd; /* normal data */
float *cdata, *cd; /* color data */
float *vedata, *ved; /* velocity data */

2
source/blender/blenkernel/intern/cloth.c
View File

@ -1825,7 +1825,7 @@ static bool cloth_build_springs(ClothModifierData *clmd, Mesh *mesh)
else {
/* bending springs for hair strands
* The current algorithm only goes through the edges in order of the mesh edges list
* and makes springs between the outer vert of edges sharing a vertice. This works just
* and makes springs between the outer vert of edges sharing a vertex. This works just
* fine for hair, but not for user generated string meshes. This could/should be later
* extended to work with non-ordered edges so that it can be used for general "rope
* dynamics" without the need for the vertices or edges to be ordered through the length

2
source/blender/blenkernel/intern/curve.cc
View File

@ -4843,7 +4843,7 @@ bool BKE_nurb_type_convert(Nurb *nu,
while (a--) {
if ((type == CU_POLY && bezt->h1 == HD_VECT && bezt->h2 == HD_VECT) ||
(use_handles == false)) {
/* vector handle becomes 1 poly vertice */
/* vector handle becomes one poly vertex */
copy_v3_v3(bp->vec, bezt->vec[1]);
bp->vec[3] = 1.0;
bp->f1 = bezt->f2;

2
source/blender/blenkernel/intern/gpencil_geom.cc
View File

@ -2340,7 +2340,7 @@ static int gpencil_walk_edge(GHash *v_table,
gped_init = &gp_edges[edge];
idx++;
/* Avoid to follow already visited vertice. */
/* Avoid following already visited vertices. */
if (reverse) {
if (BLI_ghash_haskey(v_table, POINTER_FROM_INT(gped->v1))) {
edge = -1;

2
source/blender/blenlib/intern/bitmap_draw_2d.c
View File

@ -208,7 +208,7 @@ void BLI_bitmap_draw_2d_tri_v2i(
void (*callback)(int x, int x_end, int y, void *),
void *user_data)
{
/* At first sort the three vertices by y-coordinate ascending so p1 is the top-most vertice */
/* At first sort the three vertices by y-coordinate ascending so p1 is the top-most vertex */
ORDER_VARS3_BY(const int *, p1, p2, p3, [1]);
BLI_assert(p1[1] <= p2[1] && p2[1] <= p3[1]);

2
source/blender/blenloader/intern/versioning_250.c
View File

@ -1723,7 +1723,7 @@ void blo_do_versions_250(FileData *fd, Library *lib, Main *bmain)
brush->crease_pinch_factor = 0.5f;
}
/* will sculpt no vertexes */
/* will sculpt no vertices */
if (brush->plane_trim == 0) {
brush->plane_trim = 0.5f;
}

4
source/blender/bmesh/intern/bmesh_delete.c
View File

@ -173,7 +173,7 @@ void BMO_mesh_delete_oflag_context(BMesh *bm, const short oflag, const int type)
bmo_remove_tagged_faces(bm, oflag);
/* delete marked edge */
bmo_remove_tagged_edges(bm, oflag);
/* remove loose vertice */
/* remove loose vertices */
bmo_remove_tagged_verts(bm, oflag);
break;
@ -335,7 +335,7 @@ void BM_mesh_delete_hflag_context(BMesh *bm, const char hflag, const int type)
bm_remove_tagged_faces(bm, hflag);
/* delete marked edge */
bm_remove_tagged_edges(bm, hflag);
/* remove loose vertice */
/* remove loose vertices */
bm_remove_tagged_verts(bm, hflag);
break;

2
source/blender/bmesh/operators/bmo_smooth_laplacian.c
View File

@ -135,7 +135,7 @@ static LaplacianSystem *init_laplacian_system(int a_numEdges, int a_numLoops, in
}
/**
* Compute weight between vertice v_i and all your neighbors
* Compute weight between vertex v_i and all your neighbors
* weight between v_i and v_neighbor
* <pre>
* Wij = cot(alpha) + cot(beta) / (4.0 * total area of all faces * sum all weight)

2
source/blender/editors/gpencil/gpencil_armature.c
View File

@ -453,7 +453,7 @@ static void gpencil_object_vgroup_calc_from_armature(const bContext *C,
if (mode == GP_ARMATURE_AUTO) {
/* Traverse the bone list, trying to fill vertex groups
* with the corresponding vertice weights for which the
* with the corresponding vertex weights for which the
* bone is closest.
*/
gpencil_add_verts_to_dgroups(C, ob, ob_arm, ratio, decay);

4
source/blender/editors/gpencil/gpencil_paint.c
View File

@ -3325,7 +3325,7 @@ static void gpencil_brush_angle_segment(tGPsdata *p, tGPspoint *pt_prev, tGPspoi
CLAMP(pt->pressure, GPENCIL_ALPHA_OPACITY_THRESH, 1.0f);
}
/* Add arc points between two mouse events using the previous segment to determine the vertice of
/* Add arc points between two mouse events using the previous segment to determine the vertex of
* the arc.
* /+ CTL
* / |
@ -3335,7 +3335,7 @@ static void gpencil_brush_angle_segment(tGPsdata *p, tGPspoint *pt_prev, tGPspoi
* /
* + PtA - 1
* /
* CTL is the vertice of the triangle created between PtA and PtB */
* CTL is the vertex of the triangle created between PtA and PtB */
static void gpencil_add_arc_points(tGPsdata *p, const float mval[2], int segments)
{
bGPdata *gpd = p->gpd;

2
source/blender/editors/physics/physics_intern.h
View File

@ -58,7 +58,7 @@ void PE_create_particle_edit(struct Depsgraph *depsgraph,
*/
void recalc_lengths(struct PTCacheEdit *edit);
/**
* Calculate a tree for finding nearest emitter's vertice.
* Calculate a tree for finding nearest emitter's vertices.
*/
void recalc_emitter_field(struct Depsgraph *depsgraph,
struct Object *ob,

4
source/blender/makesrna/intern/rna_brush.c
View File

@ -2705,7 +2705,7 @@ static void rna_def_brush(BlenderRNA *brna)
RNA_def_property_float_default(prop, 0);
RNA_def_property_range(prop, 0.0f, 1.0f);
RNA_def_property_ui_text(
prop, "Normal Weight", "How much grab will pull vertexes out of surface during a grab");
prop, "Normal Weight", "How much grab will pull vertices out of surface during a grab");
RNA_def_property_update(prop, 0, "rna_Brush_update");
prop = RNA_def_property(srna, "elastic_deform_volume_preservation", PROP_FLOAT, PROP_NONE);
@ -3181,7 +3181,7 @@ static void rna_def_brush(BlenderRNA *brna)
prop = RNA_def_property(srna, "use_frontface", PROP_BOOLEAN, PROP_NONE);
RNA_def_property_boolean_sdna(prop, NULL, "flag", BRUSH_FRONTFACE);
RNA_def_property_ui_text(
prop, "Use Front-Face", "Brush only affects vertexes that face the viewer");
prop, "Use Front-Face", "Brush only affects vertices that face the viewer");
RNA_def_property_update(prop, 0, "rna_Brush_update");
prop = RNA_def_property(srna, "use_frontface_falloff", PROP_BOOLEAN, PROP_NONE);

4
source/blender/modifiers/intern/MOD_explode.c
View File

@ -928,7 +928,7 @@ static Mesh *explodeMesh(ExplodeModifierData *emd,
ctime = BKE_scene_ctime_get(scene);
/* hash table for vertice <-> particle relations */
/* hash table for vertex <-> particle relations */
vertpahash = BLI_edgehash_new(__func__);
for (i = 0; i < totface; i++) {
@ -966,7 +966,7 @@ static Mesh *explodeMesh(ExplodeModifierData *emd,
}
}
/* make new vertice indexes & count total vertices after duplication */
/* make new vertex indexes & count total vertices after duplication */
ehi = BLI_edgehashIterator_new(vertpahash);
for (; !BLI_edgehashIterator_isDone(ehi); BLI_edgehashIterator_step(ehi)) {
BLI_edgehashIterator_setValue(ehi, POINTER_FROM_INT(totdup));

6
source/blender/modifiers/intern/MOD_laplaciansmooth.c
View File

@ -48,8 +48,8 @@ struct BLaplacianSystem {
int numLoops; /* Number of edges. */
int numPolys; /* Number of faces. */
int numVerts; /* Number of verts. */
short *numNeFa; /* Number of neighbors faces around vertice. */
short *numNeEd; /* Number of neighbors Edges around vertice. */
short *numNeFa; /* Number of neighbors faces around vertex. */
short *numNeEd; /* Number of neighbors Edges around vertex. */
bool *zerola; /* Is zero area or length. */
/* Pointers to data. */
@ -283,7 +283,7 @@ static void fill_laplacian_matrix(LaplacianSystem *sys)
for (; l_next != l_term; l_prev = l_curr, l_curr = l_next, l_next++) {
const uint l_curr_index = l_curr - sys->mloop;
/* Is ring if number of faces == number of edges around vertice. */
/* Is ring if number of faces == number of edges around vertex. */
if (sys->numNeEd[l_curr->v] == sys->numNeFa[l_curr->v] && sys->zerola[l_curr->v] == false) {
EIG_linear_solver_matrix_add(sys->context,
l_curr->v,

2
source/blender/modifiers/intern/MOD_weightvgmix.c
View File

@ -219,7 +219,7 @@ static Mesh *modifyMesh(ModifierData *md, const ModifierEvalContext *ctx, Mesh *
/*
* Note that we only invert the weight values within provided vgroups, the selection based on
* which vertice is affected because it belongs or not to a group remains unchanged.
* which vertex is affected because it belongs or not to a group remains unchanged.
* In other words, vertices not belonging to a group won't be affected, even though their
* inverted 'virtual' weight would be 1.0f.
*/

2
source/blender/simulation/intern/SIM_mass_spring.cpp
View File

@ -788,7 +788,7 @@ static void cloth_calc_force(
}
}
/* returns vertexes' motion state */
/* returns vertices' motion state */
BLI_INLINE void cloth_get_grid_location(Implicit_Data *data,
float cell_scale,
const float cell_offset[3],