Cleanup: spelling in comments
This commit is contained in:
@@ -55,7 +55,7 @@ enum {
|
||||
*/
|
||||
ID_REMAP_STORE_NEVER_NULL_USAGE = 1 << 2,
|
||||
/**
|
||||
* This tells the callback func to force setting IDs
|
||||
* This tells the callback function to force setting IDs
|
||||
* using target one with a 'never NULL' pointer to NULL.
|
||||
* \warning Use with extreme care, this will leave database in broken state
|
||||
* and can cause crashes very easily!
|
||||
@@ -86,7 +86,8 @@ enum {
|
||||
* etc.). */
|
||||
ID_REMAP_DO_LIBRARY_POINTERS = 1 << 8,
|
||||
|
||||
/** Allow remapping of an ID opinter of a certain to another one of a different type.
|
||||
/**
|
||||
* Allow remapping of an ID pointer of a certain to another one of a different type.
|
||||
*
|
||||
* WARNING: Use with caution. Should only be needed in a very small amount of cases, e.g. when
|
||||
* converting an ID type to another. */
|
||||
|
||||
@@ -265,7 +265,7 @@ void BKE_library_main_rebuild_hierarchy(Main *bmain)
|
||||
}
|
||||
|
||||
/* Otherwise, it's an indirectly used library with no known parent, another loop is needed to
|
||||
* ansure all knwon hierarcy has valid indices when trying to find the best valid parent
|
||||
* ensure all known hierarchy has valid indices when trying to find the best valid parent
|
||||
* library. */
|
||||
}
|
||||
|
||||
|
||||
@@ -95,7 +95,7 @@ inline void parallel_for(IndexRange range, int64_t grain_size, const Function &f
|
||||
* Using this function makes sense when the work load for each index can differ significantly, so
|
||||
* that it is impossible to determine a good constant grain size.
|
||||
*
|
||||
* This function has a bit more overhead than the unweighted #parallel_for. If that is noticable
|
||||
* This function has a bit more overhead than the unweighted #parallel_for. If that is noticeable
|
||||
* highly depends on the use-case. So the overhead should be measured when trying to use this
|
||||
* function for cases where all tasks may be very small.
|
||||
*
|
||||
|
||||
@@ -50,7 +50,7 @@ struct GBufferData {
|
||||
struct GBufferWriter {
|
||||
/* Packed GBuffer data in layer indexing. */
|
||||
vec4 data[GBUFFER_DATA_MAX];
|
||||
/* Packed normal data. Redundant normals are omited. */
|
||||
/* Packed normal data. Redundant normals are omitted. */
|
||||
vec2 N[GBUFFER_NORMAL_MAX];
|
||||
/* Header containing which closures are encoded and which normals are used. */
|
||||
uint header;
|
||||
|
||||
@@ -177,8 +177,8 @@ Closure closure_eval(ClosureTranslucent translucent)
|
||||
* Allow clearcoat layer without noise.
|
||||
* Choosing the bin with the least weight can choose a
|
||||
* different bin for the same closure and
|
||||
* produce issue with raytracing denoiser.
|
||||
* Alway start with the second bin, this one doesn't
|
||||
* produce issue with ray-tracing denoiser.
|
||||
* Always start with the second bin, this one doesn't
|
||||
* overlap with other closure. */
|
||||
bool g_closure_reflection_bin = true;
|
||||
#define CHOOSE_MIN_WEIGHT_CLOSURE_BIN(a, b) \
|
||||
|
||||
Reference in New Issue
Block a user