Cleanup: spelling, repeated words
This commit is contained in:
@@ -73,7 +73,7 @@ ccl_device void enqueue_ray_index_local(
|
||||
int queue_number, /* Queue in which to enqueue ray index. */
|
||||
char enqueue_flag, /* True for threads whose ray index has to be enqueued. */
|
||||
int queuesize, /* queue size. */
|
||||
ccl_local_param unsigned int *local_queue_atomics, /* To to local queue atomics. */
|
||||
ccl_local_param unsigned int *local_queue_atomics, /* To do local queue atomics. */
|
||||
ccl_global int *Queue_data, /* Queues. */
|
||||
ccl_global int *Queue_index) /* To do global queue atomics. */
|
||||
{
|
||||
|
||||
@@ -79,7 +79,7 @@ class Light : public Node {
|
||||
|
||||
void tag_update(Scene *scene);
|
||||
|
||||
/* Check whether the light has contribution the the scene. */
|
||||
/* Check whether the light has contribution the scene. */
|
||||
bool has_contribution(Scene *scene);
|
||||
};
|
||||
|
||||
|
||||
@@ -37,7 +37,7 @@ class GHOST_EventButton : public GHOST_Event {
|
||||
* \param time The time this event was generated.
|
||||
* \param type The type of this event.
|
||||
* \param window: The window of this event.
|
||||
* \param button: The state of the buttons were at at the time of the event.
|
||||
* \param button: The state of the buttons were at the time of the event.
|
||||
*/
|
||||
GHOST_EventButton(GHOST_TUns64 time,
|
||||
GHOST_TEventType type,
|
||||
|
||||
@@ -36,8 +36,8 @@ class GHOST_EventCursor : public GHOST_Event {
|
||||
* Constructor.
|
||||
* \param msec The time this event was generated.
|
||||
* \param type The type of this event.
|
||||
* \param x The x-coordinate of the location the cursor was at at the time of the event.
|
||||
* \param y The y-coordinate of the location the cursor was at at the time of the event.
|
||||
* \param x The x-coordinate of the location the cursor was at the time of the event.
|
||||
* \param y The y-coordinate of the location the cursor was at the time of the event.
|
||||
*/
|
||||
GHOST_EventCursor(GHOST_TUns64 msec,
|
||||
GHOST_TEventType type,
|
||||
|
||||
@@ -69,8 +69,8 @@ class GHOST_EventDragnDrop : public GHOST_Event {
|
||||
* \param type The type of this event.
|
||||
* \param dataType The type of the drop candidate object
|
||||
* \param window The window where the event occurred
|
||||
* \param x The x-coordinate of the location the cursor was at at the time of the event.
|
||||
* \param y The y-coordinate of the location the cursor was at at the time of the event.
|
||||
* \param x The x-coordinate of the location the cursor was at the time of the event.
|
||||
* \param y The y-coordinate of the location the cursor was at the time of the event.
|
||||
* \param data The "content" dropped in the window
|
||||
*/
|
||||
GHOST_EventDragnDrop(GHOST_TUns64 time,
|
||||
|
||||
@@ -83,7 +83,7 @@ struct FrameAccessor {
|
||||
//
|
||||
// Result is supposed to be a single channel image.
|
||||
//
|
||||
// If region is NULL, it it assumed to be full-frame.
|
||||
// If region is NULL, it assumed to be full-frame.
|
||||
virtual Key GetMaskForTrack(int clip,
|
||||
int frame,
|
||||
int track,
|
||||
|
||||
@@ -30,14 +30,14 @@ extern "C" {
|
||||
#endif
|
||||
|
||||
/**
|
||||
* Counts how many bytes is requered for for future utf-8 string using utf-16
|
||||
* Counts how many bytes is required for future utf-8 string using utf-16
|
||||
* \param string16: pointer to working utf-16 string
|
||||
* \return How many bytes must be allocated includeng NULL.
|
||||
*/
|
||||
size_t count_utf_8_from_16(const wchar_t *string16);
|
||||
|
||||
/**
|
||||
* Counts how many wchar_t (two byte) is requered for for future utf-16 string using utf-8
|
||||
* Counts how many wchar_t (two byte) is required for future utf-16 string using utf-8
|
||||
* \param string8: pointer to working utf-8 string
|
||||
* \return How many bytes must be allocated includeng NULL.
|
||||
*/
|
||||
|
||||
@@ -37,7 +37,7 @@
|
||||
#define BLENDER_VERSION_CHAR
|
||||
/** alpha/beta/rc/release, docs use this. */
|
||||
#define BLENDER_VERSION_CYCLE alpha
|
||||
/** Optionally set to 1,2,... for example to to get alpha1 or rc2. */
|
||||
/** Optionally set to 1,2,... for example to get alpha1 or rc2. */
|
||||
#define BLENDER_VERSION_CYCLE_NUMBER
|
||||
|
||||
/** Defined in from blender.c */
|
||||
|
||||
@@ -199,9 +199,11 @@ CurveProfilePoint *BKE_curveprofile_insert(CurveProfile *profile, float x, float
|
||||
return new_pt;
|
||||
}
|
||||
|
||||
/** Sets the handle type of the selected control points.
|
||||
* \param type_*: Either HD_VECT or HD_AUTO. Handle types for the first and second handles.
|
||||
* \note: Requires curveprofile_update call after. */
|
||||
/**
|
||||
* Sets the handle type of the selected control points.
|
||||
* \param type_1, type_2: Either HD_VECT or HD_AUTO. Handle types for the first and second handles.
|
||||
* \note: Requires curveprofile_update call after.
|
||||
*/
|
||||
void BKE_curveprofile_selected_handle_set(CurveProfile *profile, int type_1, int type_2)
|
||||
{
|
||||
for (int i = 0; i < profile->path_len; i++) {
|
||||
|
||||
@@ -510,8 +510,8 @@ bGPDstroke *BKE_gpencil_add_stroke_existing_style(
|
||||
bGPDframe *gpf, bGPDstroke *existing, int mat_idx, int totpoints, short thickness)
|
||||
{
|
||||
bGPDstroke *gps = BKE_gpencil_add_stroke(gpf, mat_idx, totpoints, thickness);
|
||||
/* Copy runtime color data so that strokes added in the modifier has the style.
|
||||
* There are depsgrapgh reference pointers inside,
|
||||
/* Copy run-time color data so that strokes added in the modifier has the style.
|
||||
* There are depsgraph reference pointers inside,
|
||||
* change the copy function if interfere with future drawing implementation. */
|
||||
memcpy(&gps->runtime, &existing->runtime, sizeof(bGPDstroke_Runtime));
|
||||
return gps;
|
||||
|
||||
@@ -2965,7 +2965,7 @@ void psys_cache_paths(ParticleSimulationData *sim, float cfra, const bool use_re
|
||||
/*--get the first data points--*/
|
||||
init_particle_interpolation(sim->ob, sim->psys, pa, &pind);
|
||||
|
||||
/* hairmat is needed for for non-hair particle too so we get proper rotations */
|
||||
/* 'hairmat' is needed for non-hair particle too so we get proper rotations. */
|
||||
psys_mat_hair_to_global(sim->ob, psmd->mesh_final, psys->part->from, pa, hairmat);
|
||||
copy_v3_v3(rotmat[0], hairmat[2]);
|
||||
copy_v3_v3(rotmat[1], hairmat[1]);
|
||||
|
||||
@@ -193,8 +193,7 @@ void BKE_subdiv_deform_coarse_vertices(struct Subdiv *subdiv,
|
||||
{
|
||||
BKE_subdiv_stats_begin(&subdiv->stats, SUBDIV_STATS_SUBDIV_TO_MESH);
|
||||
/* Make sure evaluator is up to date with possible new topology, and that
|
||||
* is is refined for the new positions of coarse vertices.
|
||||
*/
|
||||
* is refined for the new positions of coarse vertices. */
|
||||
if (!BKE_subdiv_eval_update_from_mesh(subdiv, coarse_mesh, vertex_cos)) {
|
||||
/* This could happen in two situations:
|
||||
* - OpenSubdiv is disabled.
|
||||
|
||||
@@ -1164,8 +1164,7 @@ Mesh *BKE_subdiv_to_mesh(Subdiv *subdiv,
|
||||
{
|
||||
BKE_subdiv_stats_begin(&subdiv->stats, SUBDIV_STATS_SUBDIV_TO_MESH);
|
||||
/* Make sure evaluator is up to date with possible new topology, and that
|
||||
* is is refined for the new positions of coarse vertices.
|
||||
*/
|
||||
* it is refined for the new positions of coarse vertices. */
|
||||
if (!BKE_subdiv_eval_update_from_mesh(subdiv, coarse_mesh, NULL)) {
|
||||
/* This could happen in two situations:
|
||||
* - OpenSubdiv is disabled.
|
||||
|
||||
@@ -3070,7 +3070,7 @@ bool isect_ray_ray_epsilon_v3(const float ray_origin_a[3],
|
||||
cross_v3_v3v3(n, ray_direction_b, ray_direction_a);
|
||||
const float nlen = len_squared_v3(n);
|
||||
|
||||
/* `nlen` is the the square of the area formed by the two vectors. */
|
||||
/* `nlen` is the square of the area formed by the two vectors. */
|
||||
if (UNLIKELY(nlen < epsilon)) {
|
||||
/* The lines are parallel. */
|
||||
return false;
|
||||
|
||||
@@ -1135,7 +1135,7 @@ static void update_voronoi_node_coloring(bNodeTree *ntree)
|
||||
}
|
||||
|
||||
/* Previously, the output euclidean distance was actually the squared
|
||||
* euclidean distance. To fix this, we square the the output distance
|
||||
* euclidean distance. To fix this, we square the output distance
|
||||
* socket if the distance metric is set to SHD_VORONOI_EUCLIDEAN.
|
||||
*/
|
||||
static void update_voronoi_node_square_distance(bNodeTree *ntree)
|
||||
|
||||
@@ -203,7 +203,7 @@ finally:
|
||||
static GSet *bm_edgering_pair_calc(BMesh *bm, ListBase *eloops_rim)
|
||||
{
|
||||
/**
|
||||
* Method for for finding pairs:
|
||||
* Method for finding pairs:
|
||||
*
|
||||
* - first create (vert -> eloop) mapping.
|
||||
* - loop over all eloops.
|
||||
|
||||
@@ -4290,7 +4290,7 @@ static VMesh *adj_vmesh(BevelParams *bp, BevVert *bv)
|
||||
|
||||
/* To place the center vertex:
|
||||
* 'negative_fullest' is the reflection of the original vertex across the boundverts' center.
|
||||
* 'fullness' is the fraction of the way from the boundvert's centroid to to the original vertex
|
||||
* 'fullness' is the fraction of the way from the boundvert's centroid to the original vertex
|
||||
* (if positive) or to negative_fullest (if negative). */
|
||||
copy_v3_v3(original_vertex, bv->v->co);
|
||||
sub_v3_v3v3(negative_fullest, boundverts_center, original_vertex);
|
||||
@@ -4795,9 +4795,9 @@ static VMesh *square_out_adj_vmesh(BevelParams *bp, BevVert *bv)
|
||||
if (odd) {
|
||||
ang = 0.5f * angle_v3v3v3(bndv->nv.co, co1, bndv->next->nv.co);
|
||||
if (ang > BEVEL_SMALL_ANG) {
|
||||
/* finalfrac is length along arms of isoceles triangle with top angle 2*ang
|
||||
/* finalfrac is length along arms of isosceles triangle with top angle 2*ang
|
||||
* such that the base of the triangle is 1.
|
||||
* This is used in interpolation along centerline in odd case.
|
||||
* This is used in interpolation along center-line in odd case.
|
||||
* To avoid too big a drop from bv, cap finalfrac a 0.8 arbitrarily */
|
||||
finalfrac = 0.5f / sinf(ang);
|
||||
if (finalfrac > 0.8f) {
|
||||
@@ -5506,7 +5506,7 @@ static void build_vmesh(BevelParams *bp, BMesh *bm, BevVert *bv)
|
||||
bndv = vm->boundstart;
|
||||
do {
|
||||
i = bndv->index;
|
||||
/* bndv's last vert along the boundary arc is the the first of the next BoundVert's arc. */
|
||||
/* bndv's last vert along the boundary arc is the first of the next BoundVert's arc. */
|
||||
copy_mesh_vert(vm, i, 0, ns, bndv->next->index, 0, 0);
|
||||
|
||||
/* Fix the profile orientations if it's not a miter profile. */
|
||||
@@ -6906,7 +6906,7 @@ static void find_even_superellipse_chords(int n, float r, double *xvals, double
|
||||
}
|
||||
|
||||
/** Find the profile's "fullness," which is the fraction of the space it takes up way from the
|
||||
* boundvert's centroid to to the original vertex for a non-custom profile, or in the case of a
|
||||
* boundvert's centroid to the original vertex for a non-custom profile, or in the case of a
|
||||
* custom profile, the average "height" of the profile points along its centerline. */
|
||||
static float find_profile_fullness(BevelParams *bp)
|
||||
{
|
||||
|
||||
@@ -290,7 +290,7 @@ ID *Depsgraph::get_cow_id(const ID *id_orig) const
|
||||
* already a copy-on-write version or have a corresponding copy-on-write
|
||||
* version.
|
||||
*
|
||||
* We try to enforce that in debug builds, for for release we play a bit
|
||||
* We try to enforce that in debug builds, for release we play a bit
|
||||
* safer game here. */
|
||||
if ((id_orig->tag & LIB_TAG_COPIED_ON_WRITE) == 0) {
|
||||
/* TODO(sergey): This is nice sanity check to have, but it fails
|
||||
|
||||
@@ -837,7 +837,7 @@ int foreach_libblock_validate_callback(void *user_data,
|
||||
if (*id_p != NULL) {
|
||||
if (!check_datablock_expanded(*id_p)) {
|
||||
data->is_valid = false;
|
||||
/* TODO(sergey): Store which is is not valid? */
|
||||
/* TODO(sergey): Store which is not valid? */
|
||||
}
|
||||
}
|
||||
return IDWALK_RET_NOP;
|
||||
|
||||
@@ -2917,7 +2917,7 @@ bool EDBM_select_interior_faces(BMEditMesh *em)
|
||||
SWAP(int, i_a, i_b);
|
||||
}
|
||||
|
||||
/* Merge the the groups. */
|
||||
/* Merge the groups. */
|
||||
LISTBASE_FOREACH (LinkData *, n, &fgroup_listbase[i_b]) {
|
||||
BMFace *f_iter = n->data;
|
||||
BM_elem_index_set(f_iter, i_a);
|
||||
|
||||
@@ -2735,7 +2735,7 @@ void OBJECT_OT_duplicate(wmOperatorType *ot)
|
||||
/* -------------------------------------------------------------------- */
|
||||
/** \name Add Named Object Operator
|
||||
*
|
||||
* Use for for drag & drop.
|
||||
* Use for drag & drop.
|
||||
* \{ */
|
||||
|
||||
static int add_named_exec(bContext *C, wmOperator *op)
|
||||
|
||||
@@ -4263,8 +4263,7 @@ static int match_region_with_redraws(int spacetype,
|
||||
break;
|
||||
case SPACE_ACTION:
|
||||
/* if only 1 window or 3d windows, we do timeline too
|
||||
* NOTE: Now we do do action editor in all these cases, since timeline is here
|
||||
*/
|
||||
* NOTE: Now we do action editor in all these cases, since timeline is here. */
|
||||
if ((redraws & (TIME_ALL_ANIM_WIN | TIME_REGION | TIME_ALL_3D_WIN)) || from_anim_edit) {
|
||||
return 1;
|
||||
}
|
||||
|
||||
@@ -146,7 +146,7 @@ typedef struct FlyInfo {
|
||||
struct Depsgraph *depsgraph;
|
||||
Scene *scene;
|
||||
|
||||
/** Needed for for updating that isn't triggered by input. */
|
||||
/** Needed for updating that isn't triggered by input. */
|
||||
wmTimer *timer;
|
||||
|
||||
short state;
|
||||
|
||||
@@ -191,7 +191,7 @@ typedef struct WalkInfo {
|
||||
struct Depsgraph *depsgraph;
|
||||
Scene *scene;
|
||||
|
||||
/** Needed for for updating that isn't triggered by input. */
|
||||
/** Needed for updating that isn't triggered by input. */
|
||||
wmTimer *timer;
|
||||
|
||||
short state;
|
||||
|
||||
@@ -1677,7 +1677,7 @@ void initTransInfo(bContext *C, TransInfo *t, wmOperator *op, const wmEvent *eve
|
||||
((prop = RNA_struct_find_property(op->ptr, "orient_matrix")) &&
|
||||
RNA_property_is_set(op->ptr, prop)) &&
|
||||
((t->flag & T_MODAL) ||
|
||||
/* When using redo, don't use the the custom constraint matrix
|
||||
/* When using redo, don't use the custom constraint matrix
|
||||
* if the user selects a different orientation. */
|
||||
(RNA_enum_get(op->ptr, "orient_type") == RNA_enum_get(op->ptr, "orient_matrix_type")))) {
|
||||
RNA_property_float_get_array(op->ptr, prop, &t->spacemtx[0][0]);
|
||||
|
||||
@@ -75,7 +75,7 @@ typedef struct GPUVertAttr {
|
||||
|
||||
BLI_STATIC_ASSERT(GPU_VERT_ATTR_NAMES_BUF_LEN <= 256,
|
||||
"We use uchar as index inside the name buffer "
|
||||
"so GPU_VERT_ATTR_NAMES_BUF_LEN needs to be be "
|
||||
"so GPU_VERT_ATTR_NAMES_BUF_LEN needs to be "
|
||||
"smaller than GPUVertFormat->name_offset and "
|
||||
"GPUVertAttr->names maximum value");
|
||||
|
||||
|
||||
@@ -609,7 +609,7 @@ enum {
|
||||
#define BA_TEMP_TAG (1 << 5)
|
||||
|
||||
/**
|
||||
* Even if this is is tagged for transform, this flag means it's being locked in place.
|
||||
* Even if this is tagged for transform, this flag means it's being locked in place.
|
||||
* Use for #SCE_XFORM_SKIP_CHILDREN.
|
||||
*/
|
||||
#define BA_TRANSFORM_LOCKED_IN_PLACE (1 << 7)
|
||||
|
||||
@@ -530,7 +530,7 @@ enum {
|
||||
*
|
||||
* This difference can be important because previous settings may be used,
|
||||
* even with #PROP_SKIP_SAVE the repeat last operator will use the previous settings.
|
||||
* Unlike #OP_IS_REPEAT the selection (and context generally) may be be different each time.
|
||||
* Unlike #OP_IS_REPEAT the selection (and context generally) may be different each time.
|
||||
* See T60777 for an example of when this is needed.
|
||||
*/
|
||||
OP_IS_REPEAT_LAST = (1 << 1),
|
||||
|
||||
@@ -2684,7 +2684,7 @@ static void rna_def_tool_settings(BlenderRNA *brna)
|
||||
PropertyRNA *prop;
|
||||
|
||||
/* the construction of this enum is quite special - everything is stored as bitflags,
|
||||
* with 1st position only for for on/off (and exposed as boolean), while others are mutually
|
||||
* with 1st position only for on/off (and exposed as boolean), while others are mutually
|
||||
* exclusive options but which will only have any effect when autokey is enabled
|
||||
*/
|
||||
static const EnumPropertyItem auto_key_items[] = {
|
||||
|
||||
@@ -271,7 +271,7 @@ static void node_reroute_inherit_type_recursive(bNodeTree *ntree, bNode *node, i
|
||||
const char *type_idname = nodeStaticSocketType(type, PROP_NONE);
|
||||
|
||||
/* XXX it would be a little bit more efficient to restrict actual updates
|
||||
* to rerout nodes connected to an updated node, but there's no reliable flag
|
||||
* to reroute nodes connected to an updated node, but there's no reliable flag
|
||||
* to indicate updated nodes (node->update is not set on linking).
|
||||
*/
|
||||
|
||||
|
||||
Reference in New Issue
Block a user