archive/blender-archive
Archived
1
1
Fork 0
Code Pull Requests Packages Activity

Cleanup: spelling

Browse Source
This commit is contained in:
Campbell Barton
2019-07-07 15:38:41 +10:00
parent a3e2076bc4
commit cd6b49f995
43 changed files with 80 additions and 79 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
intern/cycles/bvh/bvh_embree.cpp
View File

@@ -23,7 +23,7 @@
* usage.
*
* Since Embree allows object to be either curves or triangles but not both, Cycles object IDs are
* maapped to Embree IDs by multiplying by two and adding one for curves.
* mapped to Embree IDs by multiplying by two and adding one for curves.
*
* This implementation shares RTCDevices between Cycles instances. Eventually each instance should
* get a separate RTCDevice to correctly keep track of memory usage.

2
intern/cycles/device/device_task.h
View File

@@ -34,7 +34,7 @@ class Tile;
class DenoiseParams {
public:
/* Pixel radius for neighbouring pixels to take into account. */
/* Pixel radius for neighboring pixels to take into account. */
int radius;
/* Controls neighbor pixel weighting for the denoising filter. */
float strength;

2
intern/cycles/device/opencl/opencl.h
View File

@@ -359,7 +359,7 @@ class OpenCLDevice : public Device {
~OpenCLSplitPrograms();
/* Load the kernels and put the created kernels in the given
* `programs` paramter. */
* `programs` parameter. */
void load_kernels(vector<OpenCLProgram *> &programs,
const DeviceRequestedFeatures &requested_features,
bool is_preview = false);

4
intern/cycles/kernel/kernel_camera.h
View File

@@ -128,7 +128,7 @@ ccl_device void camera_sample_perspective(KernelGlobals *kg,
#ifdef __RAY_DIFFERENTIALS__
/* Ray differentials, computed from scratch using the raster coordinates
* because we don't want to be affected by depth of field. We compute
* ray origin and direction for the center and two neighbouring pixels
* ray origin and direction for the center and two neighboring pixels
* and simply take their differences. */
float3 Pnostereo = transform_point(&cameratoworld, make_float3(0.0f, 0.0f, 0.0f));
@@ -303,7 +303,7 @@ ccl_device_inline void camera_sample_panorama(ccl_constant KernelCamera *cam,
#ifdef __RAY_DIFFERENTIALS__
/* Ray differentials, computed from scratch using the raster coordinates
* because we don't want to be affected by depth of field. We compute
* ray origin and direction for the center and two neighbouring pixels
* ray origin and direction for the center and two neighboring pixels
* and simply take their differences. */
float3 Pcenter = Pcamera;
float3 Dcenter = panorama_to_direction(cam, Pcenter.x, Pcenter.y);

2
intern/cycles/kernel/kernel_shader.h
View File

@@ -687,7 +687,7 @@ ccl_device_inline const ShaderClosure *shader_bsdf_pick(ShaderData *sd, float *r
sampled = i;
/* Rescale to reuse for direction sample, to better
* preserve stratifaction. */
* preserve stratification. */
*randu = (r - partial_sum) / sc->sample_weight;
break;
}

2
intern/cycles/kernel/kernel_shadow.h
View File

@@ -427,7 +427,7 @@ ccl_device_inline bool shadow_blocked(KernelGlobals *kg,
}
const uint max_hits = transparent_max_bounce - state->transparent_bounce - 1;
# ifdef __KERNEL_GPU__
/* On GPU we do trickey with tracing opaque ray first, this avoids speed
/* On GPU we do tricky with tracing opaque ray first, this avoids speed
* regressions in some files.
*
* TODO(sergey): Check why using record-all behavior causes slowdown in such

4
intern/cycles/kernel/kernel_volume.h
View File

@@ -111,8 +111,8 @@ ccl_device bool volume_stack_is_heterogeneous(KernelGlobals *kg, ccl_addr_space
}
else if (shader_flag & SD_NEED_ATTRIBUTES) {
/* We want to render world or objects without any volume grids
* as homogenous, but can only verify this at runtime since other
* heterogenous volume objects may be using the same shader. */
* as homogeneous, but can only verify this at run-time since other
* heterogeneous volume objects may be using the same shader. */
int object = stack[i].object;
if (object != OBJECT_NONE) {
int object_flag = kernel_tex_fetch(__object_flag, object);

2
intern/cycles/kernel/split/kernel_next_iteration_setup.h
View File

@@ -109,7 +109,7 @@ ccl_device void kernel_next_iteration_setup(KernelGlobals *kg,
if (ccl_global_id(0) == 0 && ccl_global_id(1) == 0) {
/* If we are here, then it means that scene-intersect kernel
* has already been executed atleast once. From the next time,
* has already been executed at least once. From the next time,
* scene-intersect kernel may operate on queues to fetch ray index
*/
*kernel_split_params.use_queues_flag = 1;

16
intern/cycles/render/mesh_volume.cpp
View File

@@ -135,18 +135,18 @@ static const int CUBE_SIZE = 8;
*
* The way the algorithm works is as follows:
*
* - the coordinates of active voxels from a dense volume (or 3d image) are
* gathered inside an auxialliary volume.
* - each set of coordinates of an CUBE_SIZE cube are mapped to the same
* coordinate of the auxilliary volume.
* - quads are created between active and non-active voxels in the auxialliary
* volume to generate a tight mesh around the volume.
* - The coordinates of active voxels from a dense volume (or 3d image) are
* gathered inside an auxiliary volume.
* - Each set of coordinates of an CUBE_SIZE cube are mapped to the same
* coordinate of the auxiliary volume.
* - Quads are created between active and non-active voxels in the auxiliary
* volume to generate a tight mesh around the volume.
*/
class VolumeMeshBuilder {
/* Auxilliary volume that is used to check if a node already added. */
/* Auxiliary volume that is used to check if a node already added. */
vector<char> grid;
/* The resolution of the auxilliary volume, set to be equal to 1/CUBE_SIZE
/* The resolution of the auxiliary volume, set to be equal to 1/CUBE_SIZE
* of the original volume on each axis. */
int3 res;

2
intern/cycles/util/util_math_matrix.h
View File

@@ -236,7 +236,7 @@ ccl_device_inline void math_trimatrix_vec3_solve(ccl_global float *A,
}
}
/* Perform the Jacobi Eigenvalue Methon on matrix A.
/* Perform the Jacobi Eigenvalue Method on matrix A.
* A is assumed to be a symmetrical matrix, therefore only the lower-triangular part is ever
* accessed. The algorithm overwrites the contents of A.
*

2
intern/ghost/intern/GHOST_WindowCocoa.mm
View File

@@ -731,7 +731,7 @@ void GHOST_WindowCocoa::setNativePixelSize(void)
* \note Fullscreen switch is not actual fullscreen with display capture.
* As this capture removes all OS X window manager features.
*
* Instead, the menu bar and the dock are hidden, and the window is made borderless and enlarged.
* Instead, the menu bar and the dock are hidden, and the window is made border-less and enlarged.
* Thus, process switch, exposé, spaces, ... still work in fullscreen mode
*/
GHOST_TSuccess GHOST_WindowCocoa::setState(GHOST_TWindowState state)

23
source/blender/blenkernel/BKE_gpencil_modifier.h
View File

@@ -52,10 +52,10 @@ struct bGPDstroke;
((((_md)->mode & eGpencilModifierMode_Editmode) == 0) && (_is_edit))
typedef enum {
/* Should not be used, only for None modifier type */
/** Should not be used, only for None modifier type. */
eGpencilModifierTypeType_None,
/* grease pencil modifiers */
/** Grease pencil modifiers. */
eGpencilModifierTypeType_Gpencil,
} GpencilModifierTypeType;
@@ -63,25 +63,26 @@ typedef enum {
eGpencilModifierTypeFlag_SupportsMapping = (1 << 0),
eGpencilModifierTypeFlag_SupportsEditmode = (1 << 1),
/* For modifiers that support editmode this determines if the
* modifier should be enabled by default in editmode. This should
/**
* For modifiers that support edit-mode this determines if the
* modifier should be enabled by default in edit-mode. This should
* only be used by modifiers that are relatively speedy and
* also generally used in editmode, otherwise let the user enable
* it by hand.
* also generally used in edit-mode, otherwise let the user enable it by hand.
*/
eGpencilModifierTypeFlag_EnableInEditmode = (1 << 2),
/* For modifiers that require original data and so cannot
* be placed after any non-deformative modifier.
/**
* For modifiers that require original data and so cannot
* be placed after any non-deform modifier.
*/
eGpencilModifierTypeFlag_RequiresOriginalData = (1 << 3),
/* max one per type */
/** Max one per type. */
eGpencilModifierTypeFlag_Single = (1 << 4),
/* can't be added manually by user */
/** Can't be added manually by user. */
eGpencilModifierTypeFlag_NoUserAdd = (1 << 5),
/* can't be applied */
/** Can't be applied. */
eGpencilModifierTypeFlag_NoApply = (1 << 6),
} GpencilModifierTypeFlag;

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

@@ -231,7 +231,7 @@ void BKE_main_lib_objects_recalc_all(struct Main *bmain);
void BKE_main_id_repair_duplicate_names_listbase(struct ListBase *lb);
#define MAX_ID_FULL_NAME (64 + 64 + 3 + 1) /* 64 is MAX_ID_NAME - 2 */
#define MAX_ID_FULL_NAME_UI (MAX_ID_FULL_NAME + 3) /* Adds 'keycode' two letters at begining. */
#define MAX_ID_FULL_NAME_UI (MAX_ID_FULL_NAME + 3) /* Adds 'keycode' two letters at beginning. */
void BKE_id_full_name_get(char name[MAX_ID_FULL_NAME], const struct ID *id);
void BKE_id_full_name_ui_prefix_get(char name[MAX_ID_FULL_NAME_UI], const struct ID *id);

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

@@ -251,7 +251,7 @@ static float _final_mass(Object *ob, BodyPoint *bp)
/*
* for each target object/face the axis aligned bounding box (AABB) is stored
* faces parallel to global axes
* so only simple "value" in [min, max] ckecks are used
* so only simple "value" in [min, max] checks are used
* float operations still
*/

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

@@ -366,7 +366,7 @@ void BLI_heap_remove(Heap *heap, HeapNode *node)
/**
* Can be used to avoid #BLI_heap_remove, #BLI_heap_insert calls,
* balancing the tree still has a performance cost,
* but is often much less than remove/insert, difference is most noticable with large heaps.
* but is often much less than remove/insert, difference is most noticeable with large heaps.
*/
void BLI_heap_node_value_update(Heap *heap, HeapNode *node, float value)
{

4
source/blender/blenlib/intern/path_util.c
View File

@@ -1037,7 +1037,7 @@ bool BLI_path_abs(char *path, const char *basepath)
* in this case, there is no use in trying C:/ since it
* will never exist on a unix os.
*
* Add a / prefix and lowercase the driveletter, remove the :
* Add a '/' prefix and lowercase the drive-letter, remove the ':'.
* C:\foo.JPG -> /c/foo.JPG */
if (isalpha(tmp[0]) && tmp[1] == ':' && (tmp[2] == '\\' || tmp[2] == '/')) {
@@ -1552,7 +1552,7 @@ bool BLI_path_extension_glob_validate(char *ext_fnmatch)
only_wildcards = true;
}
/* Only one group in the pattern, so even if its only made of wildcard(s),
* it is assumed vaid. */
* it is assumed valid. */
return false;
}

4
source/blender/blenlib/intern/storage.c
View File

@@ -15,12 +15,12 @@
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
* Reorganised mar-01 nzc
* Some really low-level file thingies.
*/
/** \file
* \ingroup bli
*
* Some really low-level file operations.
*/
#include <sys/types.h>

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

@@ -9504,7 +9504,7 @@ static void lib_link_all(FileData *fd, Main *main)
* re-read all library data-blocks.
* Unfortunately, that means that we do not clear Collections' parents lists, which then get
* improperly extended in some cases by lib_link_scene() and lib_link_collection() calls above
* (when ome local collection is parent of linked ones).
* (when one local collection is parent of linked ones).
* I do not really see a way to address that issue, besides brute force call below which
* invalidates and re-creates all parenting relationships between collections. Yet another
* example of why it is such a bad idea to keep that kind of double-linked relationships info

2
source/blender/bmesh/intern/bmesh_mesh_conv.c
View File

@@ -984,7 +984,7 @@ void BM_mesh_bm_to_me(Main *bmain, BMesh *bm, Mesh *me, const struct BMeshToMesh
/**
* A version of #BM_mesh_bm_to_me intended for getting the mesh
* to pass to the modifier stack for evaluation,
* instad of mode switching (where we make sure all data is kept
* instead of mode switching (where we make sure all data is kept
* and do expensive lookups to maintain shape keys).
*
* Key differences:

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

@@ -186,7 +186,7 @@ static void bm_loop_customdata_merge(BMesh *bm,
BM_ELEM_CD_GET_VOID_P(l_a_outer, offset),
BM_ELEM_CD_GET_VOID_P(l_b_outer, offset)) == true)
/* epsilon for comparing UV's is too big, gives noticable problems */
/* Epsilon for comparing UV's is too big, gives noticeable problems. */
# if 0
&&
/* check if the data ends up diverged */

2
source/blender/bmesh/tools/bmesh_intersect.c
View File

@@ -896,7 +896,7 @@ static int isect_bvhtree_point_v3(BVHTree *tree, const float **looptris, const f
float dir[3] = {1.0f, 0.0f, 0.0f};
/* Need to initialize hit even tho it's not used.
* This is to make it so kdotree believes we didn't intersect anything and
* This is to make it so kd-tree believes we didn't intersect anything and
* keeps calling the intersect callback.
*/
hit.index = -1;

17
source/blender/collada/BCAnimationSampler.cpp
View File

@@ -334,15 +334,16 @@ bool BCAnimationSampler::get_object_samples(BCMatrixSampleMap &samples, Object *
#if 0
/**
* Add sampled values to FCurve
* If no FCurve exists, create a temporary FCurve;
* Note: The temporary FCurve will later be removed when the
* BCAnimationSampler is removed (by its destructor)
* Add sampled values to #FCurve
* If no #FCurve exists, create a temporary #FCurve;
* \note The temporary #FCurve will later be removed when the
* #BCAnimationSampler is removed (by its destructor).
*
* curve: The curve to whioch the data is added
* matrices: The set of matrix values from where the data is taken
* animation_type BC_ANIMATION_EXPORT_SAMPLES: Use all matrix data
* animation_type BC_ANIMATION_EXPORT_KEYS: Only take data from matrices for keyframes
* \param curve: The curve to which the data is added.
* \param matrices: The set of matrix values from where the data is taken.
* \param animation_type:
* - #BC_ANIMATION_EXPORT_SAMPLES: Use all matrix data.
* - #BC_ANIMATION_EXPORT_KEYS: Only take data from matrices for keyframes.
*/
void BCAnimationSampler::add_value_set(BCAnimationCurve &curve,
BCFrameSampleMap &samples,

4
source/blender/depsgraph/intern/builder/deg_builder_nodes.cc
View File

@@ -595,7 +595,7 @@ void DepsgraphNodeBuilder::build_object(int base_index,
}
/* Object data. */
build_object_data(object, is_visible);
/* Paramaters, used by both drivers/animation and also to inform dependency
/* Parameters, used by both drivers/animation and also to inform dependency
* from object's data. */
build_parameters(&object->id);
/* Build animation data,
@@ -759,7 +759,7 @@ void DepsgraphNodeBuilder::build_object_transform(Object *object)
NodeType::TRANSFORM,
OperationCode::TRANSFORM_EVAL,
function_bind(BKE_object_eval_uber_transform, _1, ob_cow));
/* Operation to take of rigid body simulation. soft bodies and other firends
/* Operation to take of rigid body simulation. soft bodies and other friends
* in the context of point cache invalidation. */
add_operation_node(&object->id, NodeType::TRANSFORM, OperationCode::TRANSFORM_SIMULATION_INIT);
/* Object transform is done. */

2
source/blender/depsgraph/intern/depsgraph_query.cc
View File

@@ -289,7 +289,7 @@ bool DEG_is_original_id(ID *id)
* Localization is usually happening from evaluated data-block, or will have some special pointer
* magic which will make them to act as evaluated.
*
* NOTE: We conder ID evaluated if ANY of those flags is set. We do NOT require ALL of them. */
* NOTE: We consider ID evaluated if ANY of those flags is set. We do NOT require ALL of them. */
if (id->tag &
(LIB_TAG_COPIED_ON_WRITE | LIB_TAG_COPIED_ON_WRITE_EVAL_RESULT | LIB_TAG_LOCALIZED)) {
return false;

2
source/blender/draw/intern/draw_cache.c
View File

@@ -3016,7 +3016,7 @@ GPUBatch *DRW_cache_bone_dof_sphere_get(void)
pz = z;
}
}
/* TODO alloc right count from the begining. */
/* TODO allocate right count from the beginning. */
GPU_vertbuf_data_resize(vbo, v);
SHC.drw_bone_dof_sphere = GPU_batch_create_ex(GPU_PRIM_TRIS, vbo, NULL, GPU_BATCH_OWNS_VBO);

3
source/blender/editors/animation/anim_channels_edit.c
View File

@@ -1711,8 +1711,7 @@ static void update_dependencies_on_delete(bAnimListElem *ale)
AnimData *adt = BKE_animdata_from_id(id);
/* TODO(sergey): Technically, if the animation element is being deleted
* from a driver we don't have to tag action. This is something we can check
* for in the future. For now just do most reliable tag whic hwas always
* happening. */
* for in the future. For now just do most reliable tag which was always happening. */
if (adt != NULL) {
DEG_id_tag_update(id, ID_RECALC_ANIMATION);
if (adt->action != NULL) {

2
source/blender/editors/animation/anim_filter.c
View File

@@ -2231,7 +2231,7 @@ static size_t animdata_filter_ds_textures(
}
}
/* Firstly check that we actuallly have some textures,
/* Firstly check that we actually have some textures,
* by gathering all textures in a temp list. */
for (a = 0; a < MAX_MTEX; a++) {
Tex *tex = (mtex[a]) ? mtex[a]->tex : NULL;

4
source/blender/editors/animation/anim_motion_paths.c
View File

@@ -322,8 +322,8 @@ void animviz_calc_motionpaths(Depsgraph *depsgraph,
/* reset original environment */
/* NOTE: We don't always need to reevaluate the main scene, as the depsgraph
* may be a temporary one that works on a subset of the data. We always have
* to resoture the current frame though. */
* may be a temporary one that works on a subset of the data.
* We always have to restore the current frame though. */
CFRA = cfra;
if (!current_frame_only && restore) {
motionpaths_calc_update_scene(bmain, depsgraph);

2
source/blender/editors/animation/keyframing.c
View File

@@ -532,7 +532,7 @@ int insert_vert_fcurve(
* introduced discontinuities in how the param worked. */
beztr.back = 1.70158f;
/* "elastic" easing - values here were hand-optimised for a default duration of
/* "elastic" easing - values here were hand-optimized for a default duration of
* ~10 frames (typical mograph motion length) */
beztr.amplitude = 0.8f;
beztr.period = 4.1f;

2
source/blender/editors/armature/pose_slide.c
View File

@@ -584,7 +584,7 @@ static void pose_slide_apply_quat(tPoseSlideOp *pso, tPChanFCurveLink *pfl)
/* perform blending */
if (pso->mode == POSESLIDE_BREAKDOWN) {
/* Just perform the interpol between quat_prev and
/* Just perform the interpolation between quat_prev and
* quat_next using pso->percentage as a guide. */
interp_qt_qtqt(quat_final, quat_prev, quat_next, pso->percentage);
}

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

@@ -883,7 +883,7 @@ static void gpencil_add_move_points(bGPDframe *gpf, bGPDstroke *gps)
}
gps->flag |= GP_STROKE_RECALC_GEOMETRY;
/* if first point, add new point at the begining */
/* If first point, add new point at the beginning. */
if (do_first) {
copy_move_point(gps, temp_points, temp_dverts, 0, 0, true);
/* deselect old */

2
source/blender/editors/interface/interface_align.c
View File

@@ -251,7 +251,7 @@ static void block_align_proximity_compute(ButAlign *butal, ButAlign *butal_other
}
}
/* We assume two buttons can only share one side at most - for until
* we have sperical UI... */
* we have spherical UI. */
return;
}
}

2
source/blender/editors/object/object_transform.c
View File

@@ -1494,7 +1494,7 @@ void OBJECT_OT_origin_set(wmOperatorType *ot)
/* -------------------------------------------------------------------- */
/** \name Transform Axis Target
*
* Note this is an experemental operator to point lights/cameras at objects.
* Note this is an experimental operator to point lights/cameras at objects.
* We may re-work how this behaves based on user feedback.
* - campbell.
* \{ */

8
source/blender/editors/space_file/file_ops.c
View File

@@ -1736,7 +1736,7 @@ static int file_smoothscroll_invoke(bContext *C, wmOperator *UNUSED(op), const w
((numfiles % items_block_size) != 0 ? items_block_size : 0)) -
(numfiles_layout / 2);
/* Actual (physical) scrolling info, in pixels, used to detect whether we are fully at the
* begining/end of the view. */
* beginning/end of the view. */
/* Note that there is a weird glitch, that sometimes tot rctf is smaller than cur rctf...
* that is why we still need to keep the min/max_middle_offset checks too. :( */
const float min_tot_scroll = is_horizontal ? ar->v2d.tot.xmin : -ar->v2d.tot.ymax;
@@ -1747,16 +1747,16 @@ static int file_smoothscroll_invoke(bContext *C, wmOperator *UNUSED(op), const w
/* Check if we have reached our final scroll position. */
/* Filelist has to be ready, otherwise it makes no sense to stop scrolling yet. */
const bool is_ready = filelist_is_ready(sfile->files);
/* Edited item must be in the 'middle' of shown area (kind of approximative).
/* Edited item must be in the 'middle' of shown area (kind of approximated).
* Note that we have to do the check in 'block space', not in 'item space' here. */
const bool is_centered = (abs(middle_offset / items_block_size -
sfile->scroll_offset / items_block_size) == 0);
/* OR edited item must be towards the begining, and we are scrolled fully to the start. */
/* OR edited item must be towards the beginning, and we are scrolled fully to the start. */
const bool is_full_start = ((sfile->scroll_offset < min_middle_offset) &&
(min_curr_scroll - min_tot_scroll < 1.0f) &&
(middle_offset - min_middle_offset < items_block_size));
/* OR edited item must be towards the end, and we are scrolled fully to the end.
* This one is crucial (unlike the one for the begining), because without it we won't scroll
* This one is crucial (unlike the one for the beginning), because without it we won't scroll
* fully to the end, and last column or row wil end up only partially drawn. */
const bool is_full_end = ((sfile->scroll_offset > max_middle_offset) &&
(max_tot_scroll - max_curr_scroll < 1.0f) &&

2
source/blender/editors/space_outliner/outliner_tree.c
View File

@@ -1545,7 +1545,7 @@ static void outliner_make_object_parent_hierarchy_collections(SpaceOutliner *soo
if (!found) {
/* We add the child in the tree even if it is not in the collection.
* We deliberately clear its subtree though, to make it less proeminent. */
* We deliberately clear its sub-tree though, to make it less prominent. */
TreeElement *child_ob_tree_element = outliner_add_element(
soops, &parent_ob_tree_element->subtree, child, parent_ob_tree_element, 0, 0);
outliner_free_tree(&child_ob_tree_element->subtree);

2
source/blender/editors/space_view3d/view3d_gizmo_preselect_type.c
View File

@@ -21,7 +21,7 @@
*
* Use for tools to hover over data before activation.
*
* \note This is a slight mis-use of gizmo's, since clicking performs no action.
* \note This is a slight misuse of gizmo's, since clicking performs no action.
*/
#include "MEM_guardedalloc.h"

6
source/blender/editors/util/select_buffer_utils.c
View File

@@ -44,7 +44,7 @@
/** \name Select Bitmap from ID's
*
* Given a buffer of select ID's, fill in a booleans (true/false) per index.
* #BLI_bitmap is used for memory effeciency.
* #BLI_bitmap is used for memory efficiency.
*
* \{ */
@@ -215,7 +215,7 @@ uint ED_select_buffer_sample_point(const int center[2])
/**
* Find the selection id closest to \a center.
* \param dist[in,out]: Use to initalize the distance,
* \param dist[in,out]: Use to initialize the distance,
* when found, this value is set to the distance of the selection thats returned.
*/
uint ED_select_buffer_find_nearest_to_point(const int center[2],
@@ -223,7 +223,7 @@ uint ED_select_buffer_find_nearest_to_point(const int center[2],
const uint id_max,
uint *dist)
{
/* Smart function to sample a rect spiralling outside, nice for selection ID. */
/* Smart function to sample a rect spiraling outside, nice for selection ID. */
/* Create region around center (typically the mouse cursor).
* This must be square and have an odd width,

2
source/blender/freestyle/intern/scene_graph/IndexedFaceSet.cpp
View File

@@ -16,7 +16,7 @@
/** \file
* \ingroup freestyle
* \brief A Set of indexed faces to represent a surfacic object
* \brief A Set of indexed faces to represent a surface object
*/
#include "IndexedFaceSet.h"

2
source/blender/freestyle/intern/scene_graph/IndexedFaceSet.h
View File

@@ -168,7 +168,7 @@ class IndexedFaceSet : public Rep {
}
/*! Desctructor
* desallocates all the ressources
* desallocates all the resources
*/
virtual ~IndexedFaceSet();

2
source/blender/freestyle/intern/winged_edge/WXEdge.h
View File

@@ -449,7 +449,7 @@ class WXFaceLayer {
unsigned int GetSmoothEdgeIndex() const;
/*! retrieves the edges of the triangle for which the signs are different (a null value is not
* considered) for the dotp values at each edge extrimity
* considered) for the dotp values at each edge extremity
*/
void RetrieveCuspEdgesIndices(vector<int> &oCuspEdges);

2
source/blender/gpu/intern/gpu_framebuffer.c
View File

@@ -837,7 +837,7 @@ static GPUFrameBuffer *gpu_offscreen_fb_get(GPUOffScreen *ofs)
/* List is full, this should never happen or
* it might just slow things down if it happens
* regulary. In this case we just empty the list
* regularly. In this case we just empty the list
* and start over. This is most likely never going
* to happen under normal usage. */
BLI_assert(0);

2
source/blender/gpu/intern/gpu_matrix.c
View File

@@ -5,7 +5,7 @@
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the ipmlied warranty of
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*

2
source/blender/windowmanager/intern/wm_utils.c
View File

@@ -17,7 +17,7 @@
/** \file
* \ingroup wm
*
* Generic helper utilies that aren't assosiated with a particular area.
* Generic helper utilities that aren't associated with a particular area.
*/
#include "WM_types.h"