From: Giftpflanze <gifti@tools.wmflabs.org>
Date: Tue, 23 Aug 2022 20:37:20 +0000 (+0200)
Subject: Harmonize spelling
X-Git-Tag: 0.99~1112
X-Git-Url: https://gitweb.factorcode.org/gitweb.cgi?p=factor.git;a=commitdiff_plain;h=0d57b1b43bcfbd6498745ec78be836c45233c6a0

Harmonize spelling
---

diff --git a/extra/boids/boids.factor b/extra/boids/boids.factor
index 7ca546fba5..fbe6db5040 100644
--- a/extra/boids/boids.factor
+++ b/extra/boids/boids.factor
@@ -29,7 +29,7 @@ CONSTANT: initial-dt 5
         t >>clipped?
         ${ WIDTH HEIGHT } >>pref-dim
         initial-population random-boids >>boids
-        initial-behaviors >>behaviours
+        initial-behaviors >>behaviors
         initial-dt >>dt ;
 
 M: boids-gadget ungraft*
diff --git a/extra/path-finding/path-finding-docs.factor b/extra/path-finding/path-finding-docs.factor
index 8d8b1c0798..8d5e881405 100644
--- a/extra/path-finding/path-finding-docs.factor
+++ b/extra/path-finding/path-finding-docs.factor
@@ -48,7 +48,7 @@ HELP: <astar>
   { "astar" astar }
 }
 { $description "Build an astar object from the given quotations. The "
-  { $snippet "neighbors" } " one builds the list of neighbours. The "
+  { $snippet "neighbors" } " one builds the list of neighbors. The "
   { $snippet "cost" } " and " { $snippet "heuristic" } " ones represent "
   "respectively the cost for transitioning from a node to one of its neighbor, "
   "and the underestimated cost for going from a node to the target. This solution "
diff --git a/extra/path-finding/path-finding.factor b/extra/path-finding/path-finding.factor
index e5048da6f7..39ea8a8f22 100644
--- a/extra/path-finding/path-finding.factor
+++ b/extra/path-finding/path-finding.factor
@@ -67,12 +67,12 @@ TUPLE: (astar) astar goal origin in-open-set open-set ;
 TUPLE: astar-simple < astar cost heuristic neighbors ;
 M: astar-simple cost cost>> call( n1 n2 -- c ) ;
 M: astar-simple heuristic heuristic>> call( n1 n2 -- c ) ;
-M: astar-simple neighbors neighbours>> call( n -- neighbours ) ;
+M: astar-simple neighbors neighbors>> call( n -- neighbors ) ;
 
 TUPLE: bfs < astar neighbors ;
 M: bfs cost 3drop 1 ;
 M: bfs heuristic 3drop 0 ;
-M: bfs neighbors neighbours>> at ;
+M: bfs neighbors neighbors>> at ;
 
 TUPLE: dijkstra < astar costs ;
 M: dijkstra cost costs>> swapd at at ;
diff --git a/extra/project-euler/116/116.factor b/extra/project-euler/116/116.factor
index a7af001f30..229c62ec74 100644
--- a/extra/project-euler/116/116.factor
+++ b/extra/project-euler/116/116.factor
@@ -20,7 +20,7 @@ IN: project-euler.116
 ! replacing the black tiles in a row measuring five units in length.
 
 ! How many different ways can the black tiles in a row measuring fifty units in
-! length be replaced if colors cannot be mixed and at least one coloured tile
+! length be replaced if colors cannot be mixed and at least one colored tile
 ! must be used?
 
 
diff --git a/extra/rosetta-code/one-d-cellular/one-d-cellular.factor b/extra/rosetta-code/one-d-cellular/one-d-cellular.factor
index 8476073daa..bbdef327e1 100644
--- a/extra/rosetta-code/one-d-cellular/one-d-cellular.factor
+++ b/extra/rosetta-code/one-d-cellular/one-d-cellular.factor
@@ -32,7 +32,7 @@ IN: rosetta-code.one-d-cellular
 :: neighbors ( index world -- # )
     index [ 1 - ] [ 1 + ] bi [ world ?nth ] bi@ bool-sum ;
 
-: count-neighbors ( world -- neighbours )
+: count-neighbors ( world -- neighbors )
     [ length <iota> ] keep [ neighbors ] curry map ;
 
 : life-law ( alive? neighbors -- alive? )