epic/OpenRA
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Run spell check over solution.

Browse Source
This commit is contained in:
RoosterDragon
2025-02-15 14:50:31 +00:00
committed by Matthias Mailänder
parent ebf90970b2
commit 96de59f75a
20 changed files with 25 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
OpenRA.Mods.Common/MapGenerator/MatrixUtils.cs
View File

@@ -446,7 +446,7 @@ namespace OpenRA.Mods.Common.MapGenerator
/// <summary>
/// Apply a binomial filter-based blur to a matrix, returning a new matrix. The result is
/// somewhat similar to a gaussian blur. Maximum supported radius is MaxBinomialKernelRadius.
/// somewhat similar to a Gaussian blur. Maximum supported radius is MaxBinomialKernelRadius.
/// </summary>
public static Matrix<int> BinomialBlur(Matrix<int> input, int radius)
{
@@ -519,7 +519,7 @@ namespace OpenRA.Mods.Common.MapGenerator
/// extended out.
/// </para>
/// <para>
/// Along with the blured matrix, the number of changes compared to the
/// Along with the blurred matrix, the number of changes compared to the
/// original is returned.
/// </para>
/// <para>
@@ -1106,7 +1106,7 @@ namespace OpenRA.Mods.Common.MapGenerator
/// Each call only dilates thin regions by one cell's thickness on each border.
/// </para>
/// <para>
/// Only regions with a thickness less than width (in Chebychev distance) are considered.
/// Only regions with a thickness less than width (in Chebyshev distance) are considered.
/// </para>
/// <para>
/// Returns the number of changes made.
@@ -1256,7 +1256,7 @@ namespace OpenRA.Mods.Common.MapGenerator
/// <summary>
/// Traces a matrix of directions into a set of point sequences. Each point sequence is
/// traced up to but excluding junction points. Paths are traced in both directions. The
/// paths in the direction map must be bidrectional and contain no stubs.
/// paths in the direction map must be bidirectional and contain no stubs.
/// </summary>
public static int2[][] DirectionMapToPaths(Matrix<byte> input)
{

4
OpenRA.Mods.Common/MapGenerator/TilingPath.cs
View File

@@ -196,7 +196,7 @@ namespace OpenRA.Mods.Common.MapGenerator
public CPos[] Points;
/// <summary>
/// Maximum permitted Chebychev distance that layed TemplateSegments may be from the
/// Maximum permitted Chebyshev distance that layed TemplateSegments may be from the
/// specified points.
/// </summary>
public int MaxDeviation;
@@ -339,7 +339,7 @@ namespace OpenRA.Mods.Common.MapGenerator
//
// Then, from the end node, it works backwards. It finds any (random) suitable template
// segment which connects back to a previous node where the difference in cost is
// that of the template segment's cost, implying that that previous node is on an
// that of the template segment's cost, implying that the previous node is on an
// optimal path towards the end node. This process repeats until the start node is
// reached, painting templates along the way.
//