Cleanup: prefer ASCII characters

Use ASCII quotes, punctuation so strings are easily editable.
This commit is contained in:
Campbell Barton
2024-09-17 17:28:01 +10:00
parent 0791f53029
commit b70925a8cc
8 changed files with 12 additions and 12 deletions

View File

@@ -704,7 +704,7 @@ static void create_samples(CurveProfile *profile,
int n_left;
if (n_segments >= totedges) {
if (sample_straight_edges) {
/* Assign an even number to each edge if its possible, then add the remainder of sampled
/* Assign an even number to each edge if it's possible, then add the remainder of sampled
* points starting with the most curved edges. */
int n_common = n_segments / totedges;
n_left = n_segments % totedges;

View File

@@ -49,7 +49,7 @@ struct RealizationOptions {
* output, but also by its transformation in that virtual space. The transformation of the result
* together with the dimension of its image is stored and represented by a Domain. In the figure
* below, two results of different domains are illustrated on the virtual compositing space. One of
* the results is centered in space with an image dimension of 800px × 600px, and the other result
* the results is centered in space with an image dimension of 800px x 600px, and the other result
* is scaled down and translated such that it lies in the upper right quadrant of the space with an
* image dimension of 800px × 400px. The position of the domain is in pixel space, and the domain
* is considered centered if it has an identity transformation. Note that both results have the

View File

@@ -272,7 +272,7 @@ static NeededBuffers compute_number_of_needed_buffers(Stack<DNode> &output_nodes
* stored in extra buffers in addition to the buffers needed by A. The number of buffers needed by
* each node is estimated as described in the compute_number_of_needed_buffers function.
*
* This is a heuristic generalization of the SethiUllman algorithm, a generalization that
* This is a heuristic generalization of the Sethi-Ullman algorithm, a generalization that
* doesn't always guarantee an optimal evaluation order, as the optimal evaluation order is very
* difficult to compute, however, this method works well in most cases. Moreover it assumes that
* all buffers will have roughly the same size, which may not always be the case. */

View File

@@ -117,7 +117,7 @@ void main()
float clamp_indirect = uniform_buf.clamp.surface_indirect;
out_direct = colorspace_brightness_clamp_max(out_direct, clamp_direct);
out_indirect = colorspace_brightness_clamp_max(out_indirect, clamp_indirect);
/* TODO(fcleù): Shouldn't we clamp these relative the main clamp? */
/* TODO(@fclem): Shouldn't we clamp these relative the main clamp? */
diffuse_direct = colorspace_brightness_clamp_max(diffuse_direct, clamp_direct);
diffuse_indirect = colorspace_brightness_clamp_max(diffuse_indirect, clamp_indirect);
specular_direct = colorspace_brightness_clamp_max(specular_direct, clamp_direct);

View File

@@ -1811,7 +1811,7 @@ void PreviewLoadJob::run_fn(void *customdata, wmJobWorkerStatus *worker_status)
continue;
}
// printf("loading deferred %d×%d preview for %s\n", request->sizex, request->sizey, filepath);
// printf("loading deferred %dx%d preview for %s\n", request->sizex, request->sizey, filepath);
IMB_thumb_path_lock(filepath);
ImBuf *thumb = IMB_thumb_manage(filepath, THB_LARGE, ThumbSource(*source));

View File

@@ -121,7 +121,7 @@ void immUniformColor3ubvAlpha(const unsigned char rgb[3], unsigned char a);
void immUniformColor4ubv(const unsigned char rgba[4]);
/**
* Extend #immBindShader to use Blenders library of built-in shader programs.
* Extend #immBindShader to use Blender's library of built-in shader programs.
* Use #immUnbindProgram() when done.
*/
void immBindBuiltinProgram(eGPUBuiltinShader shader_id);

View File

@@ -5348,7 +5348,7 @@ static void def_sh_tex_brick(StructRNA *srna)
RNA_def_property_int_default(prop, 2);
RNA_def_property_range(prop, 1, 99);
RNA_def_property_ui_text(
prop, "Squash Frequency", "How often rows consist of squished bricks");
prop, "Squash Frequency", "How often rows consist of \"squished\" bricks");
RNA_def_property_update(prop, 0, "rna_Node_update");
prop = RNA_def_property(srna, "offset", PROP_FLOAT, PROP_NONE);
@@ -5366,7 +5366,7 @@ static void def_sh_tex_brick(StructRNA *srna)
RNA_def_property_ui_text(
prop,
"Squash Amount",
"Factor to adjust the bricks width for particular rows determined by the Offset Frequency");
"Factor to adjust the brick's width for particular rows determined by the Offset Frequency");
RNA_def_property_update(prop, 0, "rna_Node_update");
}
@@ -9216,7 +9216,7 @@ static void def_tex_bricks(StructRNA *srna)
RNA_def_property_ui_text(
prop,
"Squash Amount",
"Factor to adjust the bricks width for particular rows determined by the Offset Frequency");
"Factor to adjust the brick's width for particular rows determined by the Offset Frequency");
RNA_def_property_update(prop, NC_NODE | NA_EDITED, "rna_Node_update");

View File

@@ -44,7 +44,7 @@ static void sh_node_tex_brick_declare(NodeDeclarationBuilder &b)
.default_value(0.02f)
.no_muted_links()
.description(
"Size of the filling between the bricks (known as “mortar”). "
"Size of the filling between the bricks (known as \"mortar\"). "
"0 means no mortar");
b.add_input<decl::Float>("Mortar Smooth")
.min(0.0f)
@@ -63,13 +63,13 @@ static void sh_node_tex_brick_declare(NodeDeclarationBuilder &b)
.max(100.0f)
.default_value(0.5f)
.no_muted_links()
.description("Ratio of bricks width relative to the texture scale");
.description("Ratio of brick's width relative to the texture scale");
b.add_input<decl::Float>("Row Height")
.min(0.01f)
.max(100.0f)
.default_value(0.25f)
.no_muted_links()
.description("Ratio of bricks row height relative to the texture scale");
.description("Ratio of brick's row height relative to the texture scale");
b.add_output<decl::Color>("Color");
b.add_output<decl::Float>("Fac");
}