Cleanup: spelling in comments, comment blocks

This commit is contained in:
Campbell Barton 2022-09-15 10:03:46 +10:00
parent 5cd08e373b
commit 4bbb043bc5
9 changed files with 21 additions and 20 deletions

View File

@ -37,7 +37,7 @@ struct CurveSegment {
/**
* Reference to a point on a piecewise curve (spline).
*
* Tracks indices of the neighbouring control/evaluated point pair associated with the segment
* Tracks indices of the neighboring control/evaluated point pair associated with the segment
* in which the point resides. Referenced point within the segment is defined by a
* normalized parameter in the range [0, 1].
*/
@ -75,7 +75,7 @@ class IndexRangeCyclic {
int64_t start_ = 0;
int64_t end_ = 0;
/* Index for the start and end of the entire iterable range which contains the iterated range
* (e.g. the point range for an indiviudal spline/curve within the entire Curves point domain).
* (e.g. the point range for an individual spline/curve within the entire Curves point domain).
*/
int64_t range_start_ = 0;
int64_t range_end_ = 0;

View File

@ -10,14 +10,14 @@
namespace blender::array_utils {
/**
* Fill the destination span by copying masked values from the src array. Threaded based on
* grainsize.
* Fill the destination span by copying masked values from the `src` array. Threaded based on
* grain-size.
*/
void copy(const GVArray &src, IndexMask selection, GMutableSpan dst, int64_t grain_size = 4096);
/**
* Fill the destination span by copying values from the src array. Threaded based on
* grainsize.
* Fill the destination span by copying values from the `src` array. Threaded based on
* grain-size.
*/
template<typename T>
inline void copy(const Span<T> src,

View File

@ -17,7 +17,7 @@ namespace blender::realtime_compositor {
using namespace nodes::derived_node_tree_types;
/**
Get the origin socket of the given node input. If the input is not linked, the socket itself is
* Get the origin socket of the given node input. If the input is not linked, the socket itself is
* returned. If the input is linked, the socket that is linked to it is returned, which could
* either be an input or an output. An input socket is returned when the given input is connected
* to an unlinked input of a group input node.

View File

@ -377,9 +377,9 @@ void Instance::update_passes(RenderEngine *engine, Scene *scene, ViewLayer *view
}
}
/* NOTE: Name channels lowercase rgba so that compression rules check in OpenEXR DWA code uses
* loseless compression. Reportedly this naming is the only one which works good from the
* interoperability point of view. Using xyzw naming is not portable. */
/* NOTE: Name channels lowercase `rgba` so that compression rules check in OpenEXR DWA code uses
* lossless compression. Reportedly this naming is the only one which works good from the
* interoperability point of view. Using `xyzw` naming is not portable. */
auto register_cryptomatte_passes = [&](eViewLayerCryptomatteFlags cryptomatte_layer,
eViewLayerEEVEEPassType eevee_pass) {
if (view_layer->cryptomatte_flag & cryptomatte_layer) {

View File

@ -497,7 +497,7 @@ void SCULPT_vertex_face_set_set(SculptSession *ss, PBVHVertRef vertex, int face_
for (int j = 0; j < ss->pmap[vertex.i].count; j++) {
const int poly_index = vert_map->indices[j];
if (ss->hide_poly && ss->hide_poly[poly_index]) {
/* Skip hidden faces conntected to the vertex. */
/* Skip hidden faces connected to the vertex. */
continue;
}
ss->face_sets[poly_index] = face_set;

View File

@ -81,8 +81,8 @@ static bke::curves::IndexRangeCyclic get_range_between_endpoints(
* constant for all curve segments and evaluated curve points are uniformly spaced between the
* segment endpoints in relation to the curve parameter.
*
* \param lengths: Accumulated lenght for the evaluated curve.
* \param sample_length: Distance along the curve to determine the CurvePoint for.
* \param lengths: Accumulated length for the evaluated curve.
* \param sample_length: Distance along the curve to determine the #CurvePoint for.
* \param cyclic: If curve is cyclic.
* \param resolution: Curve resolution (number of evaluated points per segment).
* \param num_curve_points: Total number of control points in the curve.
@ -185,7 +185,7 @@ Array<bke::curves::CurvePoint, 12> lookup_curve_points(const bke::CurvesGeometry
const VArray<int> resolution = curves.resolution();
const VArray<int8_t> curve_types = curves.curve_types();
/* Compute curve lenghts! */
/* Compute curve lengths! */
curves.ensure_evaluated_lengths();
curves.ensure_evaluated_offsets();
@ -294,7 +294,7 @@ static void determine_copyable_curve_types(const bke::CurvesGeometry &src_curves
}
/**
* Determine if a curve is treated as an evaluated curve. Curves which inheretly do not support
* Determine if a curve is treated as an evaluated curve. Curves which inherently do not support
* trimming are discretized (e.g. NURBS).
*/
static bool copy_as_evaluated_curve(const int8_t src_type, const int8_t dst_type)

View File

@ -201,8 +201,9 @@ id<MTLRenderCommandEncoder> MTLContext::ensure_begin_render_pass()
/* Ensure command buffer workload submissions are optimal --
* Though do not split a batch mid-IMM recording. */
/* TODO(Metal): Add IMM Check once MTLImmediate has been implemented. */
if (this->main_command_buffer.do_break_submission()/*&&
!((MTLImmediate *)(this->imm))->imm_is_recording()*/) {
if (this->main_command_buffer.do_break_submission()
// && !((MTLImmediate *)(this->imm))->imm_is_recording()
) {
this->flush();
}

View File

@ -35,8 +35,8 @@ typedef enum eViewLayerEEVEEPassType {
EEVEE_RENDER_PASS_BLOOM = (1 << 14),
EEVEE_RENDER_PASS_AOV = (1 << 15),
/*
* TODO(jbakker): Clean up confliting bits after EEVEE has been removed.
* EEVEE_RENDER_PASS_CRYPTOMATTE is for EEVEE, EEVEE_RENDER_PASS_CRYTPOMATTE_* are for
* TODO(@jbakker): Clean up conflicting bits after EEVEE has been removed.
* #EEVEE_RENDER_PASS_CRYPTOMATTE is for EEVEE, `EEVEE_RENDER_PASS_CRYTPOMATTE_*` are for
* EEVEE-Next.
*/
EEVEE_RENDER_PASS_CRYPTOMATTE = (1 << 16),

View File

@ -787,7 +787,7 @@ bool SIM_hair_volume_solve_divergence(HairGrid *grid,
vert->density, target_density, target_strength);
/* B vector contains the finite difference approximation of the velocity divergence.
* NOTE: according to the discretized Navier-Stokes equation the rhs vector
* NOTE: according to the discretized Navier-Stokes equation the RHS vector
* and resulting pressure gradient should be multiplied by the (inverse) density;
* however, this is already included in the weighting of hair velocities on the grid!
*/