From 9539017ee35ce280758f22e589aa52c3baf9aaf3 Mon Sep 17 00:00:00 2001
From: Matthew Hoops
Date: Wed, 25 May 2011 11:17:11 -0400
Subject: ALL: initialise -> initialize

---
 engines/sword25/math/polygon.cpp    | 2 +-
 engines/sword25/math/polygon.h      | 6 +++---
 engines/sword25/math/region.cpp     | 2 +-
 engines/sword25/math/region.h       | 4 ++--
 engines/sword25/math/walkregion.cpp | 6 +++---
 5 files changed, 10 insertions(+), 10 deletions(-)

(limited to 'engines/sword25/math')

diff --git a/engines/sword25/math/polygon.cpp b/engines/sword25/math/polygon.cpp
index fe2fc84cad..2e7836ff77 100644
--- a/engines/sword25/math/polygon.cpp
+++ b/engines/sword25/math/polygon.cpp
@@ -59,7 +59,7 @@ Polygon::~Polygon() {
 }
 
 bool Polygon::init(int vertexCount_, const Vertex *vertices_) {
-	// Rember the old obstate to restore it if an error occurs whilst initialising it with the new data
+	// Rember the old obstate to restore it if an error occurs whilst initializing it with the new data
 	int oldvertexCount = this->vertexCount;
 	Vertex *oldvertices = this->vertices;
 
diff --git a/engines/sword25/math/polygon.h b/engines/sword25/math/polygon.h
index eac19d7900..ffdbf14f6b 100644
--- a/engines/sword25/math/polygon.h
+++ b/engines/sword25/math/polygon.h
@@ -78,15 +78,15 @@ public:
 	virtual ~Polygon();
 
 	/**
-	 * Initialises the BS_Polygon with a list of Vertecies.
+	 * Initializes the BS_Polygon with a list of Vertecies.
 	 *
 	 * The Vertices need to define a polygon must not have self-intersections.
-	 * If a polygon already has verticies, this will re-initialise it with the new list.
+	 * If a polygon already has verticies, this will re-initialize it with the new list.
 	 *
 	 * @param VertexCount       The number of vertices being passed
 	 * @param Vertecies         An array of BS_Vertex objects representing the vertices in the polygon.
 	 * @return                  Returns false if the Vertecies have self-intersections. In this case,
-	 * the object is not initialised.
+	 * the object is not initialized.
 	 */
 	bool init(int vertexCount_, const Vertex *vertices_);
 
diff --git a/engines/sword25/math/region.cpp b/engines/sword25/math/region.cpp
index 8790860a55..7681ef6d9f 100644
--- a/engines/sword25/math/region.cpp
+++ b/engines/sword25/math/region.cpp
@@ -115,7 +115,7 @@ bool Region::init(const Polygon &contour, const Common::Array<Polygon> *pHoles)
 	}
 
 
-	// Initialise bounding box
+	// Initialize bounding box
 	updateBoundingBox();
 
 	_valid = true;
diff --git a/engines/sword25/math/region.h b/engines/sword25/math/region.h
index f9a3f50b3f..0fd7223631 100644
--- a/engines/sword25/math/region.h
+++ b/engines/sword25/math/region.h
@@ -73,12 +73,12 @@ public:
 	virtual ~Region();
 
 	/**
-	 * Initialises a BS_Region object
+	 * Initializes a BS_Region object
 	 * @param Contour       A polygon indicating the outline of the region
 	 * @param pHoles        A pointer to an array of polygons representing the hole state in the region.
 	 * If the region has no holes, it must be passed as NULL. The default value is NULL.
 	 * @return              Returns true if the initialisation was successful, otherwise false.
-	 * @remark              If the region was already initialised, the old state will be deleted.
+	 * @remark              If the region was already initialized, the old state will be deleted.
 	 */
 	virtual bool init(const Polygon &contour, const Common::Array<Polygon> *pHoles = NULL);
 
diff --git a/engines/sword25/math/walkregion.cpp b/engines/sword25/math/walkregion.cpp
index 3eea689877..bace4d54bc 100644
--- a/engines/sword25/math/walkregion.cpp
+++ b/engines/sword25/math/walkregion.cpp
@@ -101,7 +101,7 @@ static void initDijkstraNodes(DijkstraNode::Container &dijkstraNodes, const Regi
 	// Allocate sufficient space in the array
 	dijkstraNodes.resize(nodes.size());
 
-	// Initialise all the nodes which are visible from the starting node
+	// Initialize all the nodes which are visible from the starting node
 	DijkstraNode::Iter dijkstraIter = dijkstraNodes.begin();
 	for (Common::Array<Vertex>::const_iterator nodesIter = nodes.begin();
 	        nodesIter != nodes.end(); nodesIter++, dijkstraIter++) {
@@ -173,7 +173,7 @@ void reverseArray(Common::Array<T> &arr) {
 bool WalkRegion::findPath(const Vertex &start, const Vertex &end, BS_Path &path) const {
 	// This is an implementation of Dijkstra's algorithm
 
-	// Initialise edge node list
+	// Initialize edge node list
 	DijkstraNode::Container dijkstraNodes;
 	initDijkstraNodes(dijkstraNodes, *this, start, _nodes);
 
@@ -247,7 +247,7 @@ void WalkRegion::initNodeVector() {
 }
 
 void WalkRegion::computeVisibilityMatrix() {
-	// Initialise visibility matrix
+	// Initialize visibility matrix
 	_visibilityMatrix = Common::Array< Common::Array <int> >();
 	for (uint idx = 0; idx < _nodes.size(); ++idx) {
 		Common::Array<int> arr;
-- 
cgit v1.2.3