Merge pull request #36987 from luzpaz/typos

Fix various typos

6 files changed, 9 insertions, 9 deletions

diff --git a/modules/csg/csg.cpp b/modules/csg/csg.cpp
index e9ca1d3e5b..4e39cce4a5 100644
--- a/modules/csg/csg.cpp
+++ b/modules/csg/csg.cpp
@@ -88,7 +88,7 @@ static inline bool ray_intersects_triangle(const Vector3 &p_from, const Vector3
 	Vector3 edge2 = p_vertices[2] - p_vertices[0];
 	Vector3 h = p_dir.cross(edge2);
 	real_t a = edge1.dot(h);
-	// Check if ray is parrallel to triangle.
+	// Check if ray is parallel to triangle.
 	if (Math::is_zero_approx(a))
 		return false;
 	real_t f = 1.0 / a;
@@ -818,7 +818,7 @@ void CSGBrushOperation::Build2DFaces::_add_vertex_idx_sorted(Vector<int> &r_vert
 			int axis = 0;
 			if (Math::abs(new_point.x - first_point.x) < Math::abs(new_point.y - first_point.y)) axis = 1;
 
-			// Add it to the beginnig or the end appropriately.
+			// Add it to the beginning or the end appropriately.
 			if (new_point[axis] < first_point[axis])
 				r_vertex_indices.insert(0, p_new_vertex_index);
 			else
@@ -868,7 +868,7 @@ void CSGBrushOperation::Build2DFaces::_merge_faces(const Vector<int> &p_segment_
 			inner_idx = p_segment_indices[segments + segments / 2 - sorted_idx];
 		}
 
-		// Find the mergable faces.
+		// Find the mergeable faces.
 		Vector<int> merge_faces_idx;
 		Vector<Face2D> merge_faces;
 		Vector<int> merge_faces_inner_vertex_idx;
diff --git a/modules/enet/doc_classes/NetworkedMultiplayerENet.xml b/modules/enet/doc_classes/NetworkedMultiplayerENet.xml
index 456bf649d2..860da32a22 100644
--- a/modules/enet/doc_classes/NetworkedMultiplayerENet.xml
+++ b/modules/enet/doc_classes/NetworkedMultiplayerENet.xml
@@ -134,7 +134,7 @@
 			The compression method used for network packets. These have different tradeoffs of compression speed versus bandwidth, you may need to test which one works best for your use case if you use compression at all.
 		</member>
 		<member name="dtls_verify" type="bool" setter="set_dtls_verify_enabled" getter="is_dtls_verify_enabled" default="true">
-			Enable or disable certiticate verification when [member use_dtls] [code]true[/code].
+			Enable or disable certificate verification when [member use_dtls] [code]true[/code].
 		</member>
 		<member name="refuse_new_connections" type="bool" setter="set_refuse_new_connections" getter="is_refusing_new_connections" override="true" default="false" />
 		<member name="server_relay" type="bool" setter="set_server_relay_enabled" getter="is_server_relay_enabled" default="true">
diff --git a/modules/gdnavigation/gd_navigation_server.cpp b/modules/gdnavigation/gd_navigation_server.cpp
index 4db10cda78..a1f6ddfedc 100644
--- a/modules/gdnavigation/gd_navigation_server.cpp
+++ b/modules/gdnavigation/gd_navigation_server.cpp
@@ -41,7 +41,7 @@
 */
 
 /// Creates a struct for each function and a function that once called creates
-/// an instance of that struct with the submited parameters.
+/// an instance of that struct with the submitted parameters.
 /// Then, that struct is stored in an array; the `sync` function consume that array.
 
 #define COMMAND_1(F_NAME, T_0, D_0)                      \
diff --git a/modules/gdnavigation/nav_map.cpp b/modules/gdnavigation/nav_map.cpp
index 00a1901c48..338e49eb9f 100644
--- a/modules/gdnavigation/nav_map.cpp
+++ b/modules/gdnavigation/nav_map.cpp
@@ -691,7 +691,7 @@ void NavMap::sync() {
 		const float ecm_squared(edge_connection_margin * edge_connection_margin);
 #define LEN_TOLLERANCE 0.1
 #define DIR_TOLLERANCE 0.9
-		// In front of tollerance
+		// In front of tolerance
 #define IFO_TOLLERANCE 0.5
 
 		// Find the compatible near edges.
@@ -715,7 +715,7 @@ void NavMap::sync() {
 				Vector3 rel_centers = other_edge.edge_center - edge.edge_center;
 				if (ecm_squared > rel_centers.length_squared() // Are enough closer?
 						&& ABS(edge.edge_len_squared - other_edge.edge_len_squared) < LEN_TOLLERANCE // Are the same length?
-						&& ABS(edge.edge_dir.dot(other_edge.edge_dir)) > DIR_TOLLERANCE // Are alligned?
+						&& ABS(edge.edge_dir.dot(other_edge.edge_dir)) > DIR_TOLLERANCE // Are aligned?
 						&& ABS(rel_centers.normalized().dot(edge.edge_dir)) < IFO_TOLLERANCE // Are one in front the other?
 				) {
 					// The edges can be connected
diff --git a/modules/gdscript/gdscript_parser.cpp b/modules/gdscript/gdscript_parser.cpp
index 353c79d6bb..b42fcba7d3 100644
--- a/modules/gdscript/gdscript_parser.cpp
+++ b/modules/gdscript/gdscript_parser.cpp
@@ -1517,7 +1517,7 @@ GDScriptParser::Node *GDScriptParser::_parse_expression(Node *p_parent, bool p_s
 				}
 			}
 
-			//consecutively do unary opeators
+			//consecutively do unary operators
 			for (int i = expr_pos - 1; i >= next_op; i--) {
 
 				OperatorNode *op = alloc_node<OperatorNode>();
diff --git a/modules/visual_script/visual_script_expression.cpp b/modules/visual_script/visual_script_expression.cpp
index 23d1c8ccc0..c52315a477 100644
--- a/modules/visual_script/visual_script_expression.cpp
+++ b/modules/visual_script/visual_script_expression.cpp
@@ -1141,7 +1141,7 @@ VisualScriptExpression::ENode *VisualScriptExpression::_parse_expression() {
 				}
 			}
 
-			//consecutively do unary opeators
+			//consecutively do unary operators
 			for (int i = expr_pos - 1; i >= next_op; i--) {
 
 				OperatorNode *op = alloc_node<OperatorNode>();