blender
/
blender
136
405
Fork 586
Code Issues 6.2k Pull Requests 756 Projects 19 Wiki Activity

Cleanup: repeated words in comments

This commit is contained in:
Campbell Barton 2022-08-12 12:38:54 +10:00
parent 266a125b11
commit 996cb4008d
19 changed files with 22 additions and 24 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
intern/cycles/kernel/integrator/mnee.h
View File

@ -392,7 +392,7 @@ ccl_device_forceinline bool mnee_compute_constraint_derivatives(
/* Invert (block) constraint derivative matrix and solve linear system so we can map dh back to dx:
* dh / dx = A
* dx = inverse(A) x dh
* to use for specular specular manifold walk
* to use for specular manifold walk
* (See for example http://faculty.washington.edu/finlayso/ebook/algebraic/advanced/LUtri.htm
* for block tridiagonal matrix based linear system solve) */
ccl_device_forceinline bool mnee_solve_matrix_h_to_x(int vertex_count,

5
intern/cycles/scene/image_oiio.cpp
View File

@ -184,9 +184,8 @@ bool OIIOImageLoader::load_pixels(const ImageMetaData &metadata,
ImageSpec config = ImageSpec();
/* Load without automatic OIIO alpha conversion, we do it ourselves. OIIO
* will associate alpha in the the 8bit buffer for PNGs, which leads to too
* much precision loss when we load it as half float to do a colorspace
* transform. */
* will associate alpha in the 8bit buffer for PNGs, which leads to too
* much precision loss when we load it as half float to do a color-space transform. */
config.attribute("oiio:UnassociatedAlpha", 1);
if (!in->open(filepath.string(), spec, config)) {

2
source/blender/blenkernel/BKE_curves.hh
View File

@ -97,7 +97,7 @@ class CurvesGeometryRuntime {
mutable Span<float3> evaluated_positions_span;
/**
* Cache of lengths along each evaluated curve for for each evaluated point. If a curve is
* Cache of lengths along each evaluated curve for each evaluated point. If a curve is
* cyclic, it needs one more length value to correspond to the last segment, so in order to
* make slicing this array for a curve fast, an extra float is stored for every curve.
*/

2
source/blender/blenkernel/BKE_geometry_set.hh
View File

@ -505,7 +505,7 @@ class CurveComponentLegacy : public GeometryComponent {
/**
* A geometry component that stores a group of curves, corresponding the #Curves data-block type
* and the #CurvesGeometry type. Attributes are are stored on the control point domain and the
* and the #CurvesGeometry type. Attributes are stored on the control point domain and the
* curve domain.
*/
class CurveComponent : public GeometryComponent {

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

@ -853,7 +853,7 @@ struct Mesh *BKE_mesh_merge_verts(struct Mesh *mesh,
int merge_mode);
/**
* Account for custom-data such as UV's becoming detached because of of imprecision
* Account for custom-data such as UV's becoming detached because of imprecision
* in custom-data interpolation.
* Without running this operation subdivision surface can cause UV's to be disconnected,
* see: T81065.

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

@ -1190,7 +1190,7 @@ static CurvesGeometry copy_with_removed_points(const CurvesGeometry &curves,
},
[&]() {
/* Copy over curve attributes.
* In some cases points are just dissolved, so the the number of
* In some cases points are just dissolved, so the number of
* curves will be the same. That could be optimized in the future. */
for (bke::AttributeTransferData &attribute : curve_attributes) {
if (new_curves.curves_num() == curves.curves_num()) {

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

@ -1480,7 +1480,7 @@ void BKE_displist_make_curveTypes(Depsgraph *depsgraph,
* - The dependency graph has handling of edit mode pointers (see #update_edit_mode_pointers)
* but it doesn't seem to work in this case.
*
* Since the the plan is to replace this legacy curve object with the curves data-block
* Since the plan is to replace this legacy curve object with the curves data-block
* (see T95355), this somewhat hacky inefficient solution is relatively temporary.
*/
Curve &cow_curve = *reinterpret_cast<Curve *>(

4
source/blender/blenkernel/intern/lib_query.c
View File

@ -696,8 +696,8 @@ static void lib_query_unused_ids_tag_recurse(Main *bmain,
bool has_valid_from_users = false;
/* Preemptively consider this ID as unused. That way if there is a loop of dependency leading
* back to it, it won't create a fake 'valid user' detection.
* NOTE: This can only only be done for a subset of IDs, some types are never 'indirectly
* unused', same for IDs with a fake user. */
* NOTE: This can only be done for a subset of IDs, some types are never 'indirectly unused',
* same for IDs with a fake user. */
if ((id->flag & LIB_FAKEUSER) == 0 && !ELEM(GS(id->name), ID_SCE, ID_WM, ID_SCR, ID_WS, ID_LI)) {
id->tag |= tag;
}

2
source/blender/blenlib/BLI_cpp_type.hh
View File

@ -20,7 +20,7 @@
* cost of longer compile time, a larger binary and the complexity that comes from using
* templates).
* - If the code is not performance sensitive, it usually makes sense to use #CPPType instead.
* - Sometimes a combination can make sense. Optimized code can be be generated at compile-time for
* - Sometimes a combination can make sense. Optimized code can be generated at compile-time for
* some types, while there is a fallback code path using #CPPType for all other types.
* #CPPType::to_static_type allows dispatching between both versions based on the type.
*

2
source/blender/blenlib/intern/mesh_boolean.cc
View File

@ -1675,7 +1675,7 @@ static Edge find_good_sorting_edge(const Vert *testp,
* The algorithm is similar to the one for find_ambient_cell, except that
* instead of an arbitrary point known to be outside the whole mesh, we
* have a particular point (v) and we just want to determine the patches
* that that point is between in sorting-around-an-edge order.
* that point is between in sorting-around-an-edge order.
*/
static int find_containing_cell(const Vert *v,
int t,

2
source/blender/compositor/realtime_compositor/COM_simple_operation.hh
View File

@ -48,7 +48,7 @@ class SimpleOperation : public Operation {
/* Populate the result of the operation, this essentially calls the super populate_result method
* with the output identifier of the operation and sets the initial reference count of the result
* to 1, since the result of an operation operation is guaranteed to have a single user. */
* to 1, since the result of an operation is guaranteed to have a single user. */
void populate_result(Result result);
/* Declare the descriptor of the input of the operation to be the given descriptor, this

2
source/blender/editors/mesh/editmesh_knife.c
View File

@ -4300,7 +4300,7 @@ static void knifetool_finish_single_pre(KnifeTool_OpData *kcd, Object *ob)
}
/**
* A post version is needed to to delay recalculating tessellation after making cuts.
* A post version is needed to delay recalculating tessellation after making cuts.
* Without this, knife-project can't use the BVH tree to select geometry after a cut, see: T98349.
*/
static void knifetool_finish_single_post(KnifeTool_OpData *UNUSED(kcd), Object *ob)

2
source/blender/editors/space_outliner/outliner_draw.cc
View File

@ -2855,7 +2855,7 @@ TreeElementIcon tree_element_get_icon(TreeStoreElem *tselem, TreeElement *te)
}
/**
* \return Return true if the element has an icon that was drawn, false if it doesn't have an icon.
* \return true if the element has an icon that was drawn, false if it doesn't have an icon.
*/
static bool tselem_draw_icon(uiBlock *block,
int xmax,

2
source/blender/geometry/intern/resample_curves.cc
View File

@ -154,7 +154,7 @@ static void gather_point_attributes_to_interpolate(const CurveComponent &src_com
retrieve_attribute_spans(
ids, src_component, dst_component, result.src, result.dst, result.dst_attributes);
/* Attributes that aren't interpolated like Bezier handles still have to be be copied
/* Attributes that aren't interpolated like Bezier handles still have to be copied
* to the result when there are any unselected curves of the corresponding type. */
retrieve_attribute_spans(ids_no_interpolation,
src_component,

5
source/blender/io/usd/intern/usd_reader_mesh.cc
View File

@ -82,9 +82,8 @@ static pxr::UsdShadeMaterial compute_bound_material(const pxr::UsdPrim &prim)
return mtl;
}
/* Returns an existing Blender material that corresponds to the USD
* material with with the given path. Returns null if no such material
* exists. */
/* Returns an existing Blender material that corresponds to the USD material with the given path.
* Returns null if no such material exists. */
static Material *find_existing_material(
const pxr::SdfPath &usd_mat_path,
const USDImportParams &params,

2
source/blender/makesdna/DNA_modifier_types.h
View File

@ -2217,7 +2217,7 @@ typedef struct SurfaceDeformModifierData {
SDefVert *verts;
void *_pad1;
float falloff;
/* Number of of vertices on the deformed mesh upon the bind process. */
/* Number of vertices on the deformed mesh upon the bind process. */
unsigned int mesh_verts_num;
/* Number of vertices in the `verts` array of this modifier. */
unsigned int bind_verts_num;

2
source/blender/nodes/composite/nodes/node_composite_channel_matte.cc
View File

@ -143,7 +143,7 @@ class ChannelMatteShaderNode : public ShaderNode {
/* Get the indices of the channels used to compute the limit value. We always assume the limit
* algorithm is Max, if it is a single limit channel, store it in both limit channels, because
* the maximum of two identical values is is the same value. */
* the maximum of two identical values is the same value. */
void get_limit_channels(float limit_channels[2])
{
if (get_node_chroma()->algorithm == CMP_NODE_CHANNEL_MATTE_LIMIT_ALGORITHM_MAX) {

2
source/blender/nodes/composite/nodes/node_composite_lensdist.cc
View File

@ -179,7 +179,7 @@ class LensDistortionOperation : public NodeOperation {
return float3(red_distortion, green_distortion, blue_distortion) * DISTORTION_SCALE;
}
/* The distortion model model will distort the image in such a way that the result will no longer
/* The distortion model will distort the image in such a way that the result will no longer
* fit the domain of the original image, so we scale the image to account for that. If get_is_fit
* is false, then the scaling factor will be such that the furthest pixels horizontally and
* vertically are at the boundary of the image. Otherwise, if get_is_fit is true, the scaling

2
source/blender/windowmanager/gizmo/intern/wm_gizmo_map.c
View File

@ -674,7 +674,7 @@ static wmGizmo *gizmo_find_intersected_3d(bContext *C,
* This way we always use the first hit. */
if (has_3d) {
/* The depth buffer is needed for for gizmos to obscure each other. */
/* The depth buffer is needed for gizmos to obscure each other. */
GPUViewport *viewport = WM_draw_region_get_viewport(CTX_wm_region(C));
/* When switching between modes and the mouse pointer is over a gizmo, the highlight test is