Cleanup: spelling
This commit is contained in:
@@ -101,7 +101,7 @@ typedef struct UndoType {
|
||||
* None of these callbacks manage list add/removal.
|
||||
*
|
||||
* Note that 'step_encode_init' is optional,
|
||||
* some undo types need to perform operatons before undo push finishes.
|
||||
* some undo types need to perform operations before undo push finishes.
|
||||
*/
|
||||
void (*step_encode_init)(struct bContext *C, UndoStep *us);
|
||||
|
||||
@@ -122,7 +122,7 @@ typedef struct UndoType {
|
||||
int step_size;
|
||||
} UndoType;
|
||||
|
||||
/* expose since we need to perform operations on spesific undo types (rarely). */
|
||||
/* Expose since we need to perform operations on specific undo types (rarely). */
|
||||
extern const UndoType *BKE_UNDOSYS_TYPE_IMAGE;
|
||||
extern const UndoType *BKE_UNDOSYS_TYPE_MEMFILE;
|
||||
extern const UndoType *BKE_UNDOSYS_TYPE_PAINTCURVE;
|
||||
|
||||
@@ -965,8 +965,8 @@ void BKE_maskrasterize_handle_init(MaskRasterHandle *mr_handle,
|
||||
}
|
||||
|
||||
/* --- inefficient self-intersect case --- */
|
||||
/* if self intersections are found, its too trickty to attempt to map vertices
|
||||
* so just realloc and add entirely new vertices - the result of the self-intersect check
|
||||
/* if self intersections are found, its too tricky to attempt to map vertices
|
||||
* so just realloc and add entirely new vertices - the result of the self-intersect check.
|
||||
*/
|
||||
if ((masklay->flag & MASK_LAYERFLAG_FILL_OVERLAP) &&
|
||||
(is_isect = BLI_scanfill_calc_self_isect(
|
||||
|
||||
@@ -607,7 +607,7 @@ static void docube(PROCESS *process, CUBE *cube)
|
||||
}
|
||||
}
|
||||
|
||||
/* Using faces[] table, adds neighbouring cube if surface intersects face in this direction. */
|
||||
/* Using faces[] table, adds neighboring cube if surface intersects face in this direction. */
|
||||
if (MB_BIT(faces[index], 0)) {
|
||||
add_cube(process, cube->i - 1, cube->j, cube->k);
|
||||
}
|
||||
|
||||
@@ -2455,7 +2455,7 @@ static void ntree_interface_identifier(bNodeTree *ntree,
|
||||
char *description)
|
||||
{
|
||||
/* There is a possibility that different node tree names get mapped to the same identifier
|
||||
* after sanitization (e.g. "SomeGroup_A", "SomeGroup.A" both get sanitized to "SomeGroup_A").
|
||||
* after sanitation (e.g. "SomeGroup_A", "SomeGroup.A" both get sanitized to "SomeGroup_A").
|
||||
* On top of the sanitized id string add a number suffix if necessary to avoid duplicates.
|
||||
*/
|
||||
identifier[0] = '\0';
|
||||
|
||||
@@ -672,14 +672,14 @@ static void average_marker_positions(StabContext *ctx, int framenr, float r_ref_
|
||||
}
|
||||
else {
|
||||
/* No usable tracking data on any track on this frame.
|
||||
* Use data from neighbouring frames to extrapolate...
|
||||
* Use data from neighboring frames to extrapolate...
|
||||
*/
|
||||
int next_lower = MINAFRAME;
|
||||
int next_higher = MAXFRAME;
|
||||
use_values_from_fcurves(ctx, true);
|
||||
for (track = tracking->tracks.first; track; track = track->next) {
|
||||
/* Note: we deliberately do not care if this track
|
||||
* is already initialized for stabilisation */
|
||||
* is already initialized for stabilization. */
|
||||
if (track->flag & TRACK_USE_2D_STAB) {
|
||||
int startpoint = search_closest_marker_index(track, framenr);
|
||||
retrieve_next_higher_usable_frame(ctx, track, startpoint, framenr, &next_higher);
|
||||
|
||||
@@ -50,7 +50,7 @@
|
||||
/** Make sure all ID's created at the point we add an undo step that uses ID's. */
|
||||
#define WITH_GLOBAL_UNDO_ENSURE_UPDATED
|
||||
|
||||
/** Make sure we don't apply edits ontop of a newer memfile state, see: T56163.
|
||||
/** Make sure we don't apply edits on top of a newer memfile state, see: T56163.
|
||||
* \note Keep an eye on this, could solve differently. */
|
||||
#define WITH_GLOBAL_UNDO_CORRECT_ORDER
|
||||
|
||||
@@ -120,7 +120,7 @@ static const UndoType *BKE_undosys_type_from_context(bContext *C)
|
||||
/* -------------------------------------------------------------------- */
|
||||
/** \name Internal Callback Wrappers
|
||||
*
|
||||
* #UndoRefID is simply a way to avoid inlining name copy and lookups,
|
||||
* #UndoRefID is simply a way to avoid in-lining name copy and lookups,
|
||||
* since it's easy to forget a single case when done inline (crashing in some cases).
|
||||
*
|
||||
* \{ */
|
||||
@@ -550,7 +550,7 @@ bool BKE_undosys_step_push_with_type(UndoStack *ustack,
|
||||
BLI_strncpy(us->name, name, sizeof(us->name));
|
||||
}
|
||||
us->type = ut;
|
||||
/* initialized, not added yet. */
|
||||
/* Initialized, not added yet. */
|
||||
|
||||
if (!undosys_step_encode(C, G_MAIN, ustack, us)) {
|
||||
MEM_freeN(us);
|
||||
|
||||
@@ -186,7 +186,7 @@ class DepsgraphRelationBuilder : public DepsgraphBuilder {
|
||||
const char *description,
|
||||
int flags = 0);
|
||||
|
||||
/* Adds relation from proper transformation opertation to the modifier.
|
||||
/* Adds relation from proper transformation operation to the modifier.
|
||||
* Takes care of checking for possible physics solvers modifying position
|
||||
* of this object. */
|
||||
void add_modifier_to_transform_relation(const DepsNodeHandle *handle, const char *description);
|
||||
|
||||
@@ -85,7 +85,7 @@ class RNANodeQuery {
|
||||
/* Indexed by an ID, returns RNANodeQueryIDData associated with that ID. */
|
||||
GHash *id_data_map_;
|
||||
|
||||
/* Construct identifier of the node which correspods given configuration
|
||||
/* Construct identifier of the node which corresponds given configuration
|
||||
* of RNA property. */
|
||||
RNANodeIdentifier construct_node_identifier(const PointerRNA *ptr,
|
||||
const PropertyRNA *prop,
|
||||
|
||||
@@ -95,7 +95,7 @@ enum class NodeType {
|
||||
/* Audio-related evaluation. */
|
||||
AUDIO,
|
||||
ARMATURE,
|
||||
/* Un-interestying datablock, which is a part of dependency graph, but does
|
||||
/* Un-interesting data-block, which is a part of dependency graph, but does
|
||||
* not have very distinctive update procedure. */
|
||||
GENERIC_DATABLOCK,
|
||||
|
||||
|
||||
@@ -1876,7 +1876,7 @@ static void WIDGETGROUP_gizmo_invoke_prepare(const bContext *C,
|
||||
|
||||
GizmoGroup *ggd = gzgroup->customdata;
|
||||
|
||||
/* Support gizmo spesific orientation. */
|
||||
/* Support gizmo specific orientation. */
|
||||
if (gz != ggd->gizmos[MAN_AXIS_ROT_T]) {
|
||||
Scene *scene = CTX_data_scene(C);
|
||||
wmGizmoOpElem *gzop = WM_gizmo_operator_get(gz, 0);
|
||||
|
||||
@@ -320,7 +320,7 @@ typedef struct wmGizmoType {
|
||||
wmGizmoFnDrawSelect draw_select;
|
||||
|
||||
/** Determine if the mouse intersects with the gizmo.
|
||||
* The calculation should be done in the callback itself, -1 for no seleciton. */
|
||||
* The calculation should be done in the callback itself, -1 for no selection. */
|
||||
wmGizmoFnTestSelect test_select;
|
||||
|
||||
/** Handler used by the gizmo. Usually handles interaction tied to a gizmo type. */
|
||||
|
||||
@@ -1239,7 +1239,7 @@ void wm_gizmos_keymap(wmKeyConfig *keyconf)
|
||||
/** \} */ /* wmGizmoMapType */
|
||||
|
||||
/* -------------------------------------------------------------------- */
|
||||
/** \name Updates for Dynamic Type Registraion
|
||||
/** \name Updates for Dynamic Type Registration
|
||||
*
|
||||
* \{ */
|
||||
|
||||
|
||||
@@ -98,7 +98,7 @@
|
||||
* Without tools using press events which would prevent click/drag events getting to the gizmos.
|
||||
*
|
||||
* This is not a fool proof solution since since it's possible the gizmo operators would pass
|
||||
* through thse events when called, see: T65479.
|
||||
* through these events when called, see: T65479.
|
||||
*/
|
||||
#define USE_GIZMO_MOUSE_PRIORITY_HACK
|
||||
|
||||
|
||||
@@ -166,7 +166,7 @@ void WM_init_state_start_with_console_set(bool value)
|
||||
/**
|
||||
* Since we cannot know in advance if we will require the draw manager
|
||||
* context when starting blender in background mode (specially true with
|
||||
* scripts) we deferre the ghost initialization the most as possible
|
||||
* scripts) we defer the ghost initialization the most as possible
|
||||
* so that it does not break anything that can run in headless mode (as in
|
||||
* without display server attached).
|
||||
*/
|
||||
|
||||
Reference in New Issue
Block a user