Fix minor typos in code and docs (#7378)

# Objective

I found several words in code and docs are incorrect. This should be fixed.

## Solution

- Fix several minor typos

Co-authored-by: Chris Ohk <utilforever@gmail.com>

Author: utilForever

CONTRIBUTING.md

@@ -103,7 +103,7 @@ Some things that are reason to apply the [`S-Controversial`] label to a PR:
 
 Some things that are reason to apply the [`D-Complex`] label to a PR:
 
-1. Introduction or modification of soundness relevent code (for example `unsafe` code)
+1. Introduction or modification of soundness relevant code (for example `unsafe` code)
 2. High levels of technical complexity.
 3. Large-scale code reorganization
 
@@ -324,7 +324,7 @@ If you're new to Bevy, here's the workflow we use:
     * `cargo run -p ci -- test` - to run tests
     * `cargo run -p ci -- doc` - to run doc tests and doc checks
     * `cargo run -p ci -- compile` - to check that everything that must compile still does (examples and benches), and that some that shouldn't still don't ([`crates/bevy_ecs_compile_fail_tests`](./crates/bevy_ecs_compile_fail_tests))
-    * to get more informations on commands available and what is run, check the [tools/ci crate](./tools/ci)
+    * to get more information on commands available and what is run, check the [tools/ci crate](./tools/ci)
 
 4. When working with Markdown (`.md`) files, Bevy's CI will check markdown files (like this one) using [markdownlint](https://github.com/DavidAnson/markdownlint).
 To locally lint your files using the same workflow as our CI:

crates/bevy_animation/src/lib.rs

@@ -468,7 +468,7 @@ fn apply_animation(
             // any of their descendant Transforms.
             //
             // The system scheduler prevents any other system from mutating Transforms at the same time,
-            // so the only way this fetch can alias is if two AnimationPlayers are targetting the same bone.
+            // so the only way this fetch can alias is if two AnimationPlayers are targeting the same bone.
             // This can only happen if there are two or more AnimationPlayers are ancestors to the same
             // entities. By verifying that there is no other AnimationPlayer in the ancestors of a
             // running AnimationPlayer before animating any entity, this fetch cannot alias.

crates/bevy_ecs/src/archetype.rs

@@ -64,7 +64,7 @@ impl ArchetypeRow {
 /// Archetype IDs are only valid for a given World, and are not globally unique.
 /// Attempting to use an archetype ID on a world that it wasn't sourced from will
 /// not return the archetype with the same components. The only exception to this is
-/// [`EMPTY`] which is guarenteed to be identical for all Worlds.
+/// [`EMPTY`] which is guaranteed to be identical for all Worlds.
 ///
 /// [`World`]: crate::world::World
 /// [`EMPTY`]: crate::archetype::ArchetypeId::EMPTY

crates/bevy_ecs/src/lib.rs

@@ -1536,7 +1536,7 @@ mod tests {
         assert_eq!(4, query_min_size![&A, ()], "Simple Archetypal");
         assert_eq!(4, query_min_size![ChangeTrackers<A>, ()],);
         // All the following should set minimum size to 0, as it's impossible to predict
-        // how many entites the filters will trim.
+        // how many entities the filters will trim.
         assert_eq!(0, query_min_size![(), Added<A>], "Simple Added");
         assert_eq!(0, query_min_size![(), Changed<A>], "Simple Changed");
         assert_eq!(0, query_min_size![(&A, &B), Changed<A>],);
@@ -1616,7 +1616,7 @@ mod tests {
         assert_eq!(
             world_b.get::<B>(high_non_existent_entity),
             Some(&B(10)),
-            "inserting into newly allocated high / non-continous entity id works"
+            "inserting into newly allocated high / non-continuous entity id works"
         );
 
         let high_non_existent_but_reserved_entity = Entity::new(5, 0);

crates/bevy_ecs/src/schedule/stage.rs

@@ -1537,7 +1537,7 @@ mod tests {
         #[derive(Component)]
         struct Foo;
 
-        fn even_number_of_entities_critiera(query: Query<&Foo>) -> ShouldRun {
+        fn even_number_of_entities_criteria(query: Query<&Foo>) -> ShouldRun {
             if query.iter().len() % 2 == 0 {
                 ShouldRun::Yes
             } else {
@@ -1562,7 +1562,7 @@ mod tests {
             .with_system(spawn_entity.label(Spawn))
             .with_system_set(
                 SystemSet::new()
-                    .with_run_criteria(even_number_of_entities_critiera)
+                    .with_run_criteria(even_number_of_entities_criteria)
                     .with_system(count_entities.before(Spawn)),
             );
         stage.run(&mut world);
@@ -1579,7 +1579,7 @@ mod tests {
         #[derive(Component)]
         struct Foo;
 
-        fn even_number_of_entities_critiera(query: Query<&Foo>) -> ShouldRun {
+        fn even_number_of_entities_criteria(query: Query<&Foo>) -> ShouldRun {
             if query.iter().len() % 2 == 0 {
                 ShouldRun::Yes
             } else {
@@ -1599,7 +1599,7 @@ mod tests {
         world.init_resource::<EntityCount>();
         let mut stage_spawn = SystemStage::parallel().with_system(spawn_entity);
         let mut stage_count = SystemStage::parallel()
-            .with_run_criteria(even_number_of_entities_critiera)
+            .with_run_criteria(even_number_of_entities_criteria)
             .with_system(count_entities);
         stage_count.run(&mut world);
         stage_spawn.run(&mut world);

crates/bevy_ecs/src/schedule_v3/schedule.rs

@@ -519,8 +519,8 @@ impl ScheduleGraph {
 
         match ambiguous_with {
             Ambiguity::Check => (),
-            Ambiguity::IgnoreWithSet(ambigous_with) => {
-                for set in ambigous_with
+            Ambiguity::IgnoreWithSet(ambiguous_with) => {
+                for set in ambiguous_with
                     .into_iter()
                     .map(|set| self.system_set_ids[&set])
                 {

crates/bevy_ecs/src/system/commands/command_queue.rs

@@ -102,7 +102,7 @@ impl CommandQueue {
             // so this addition will not overflow its original allocation.
             let cmd = unsafe { self.bytes.as_mut_ptr().add(meta.offset) };
             // SAFETY: It is safe to transfer ownership out of `self.bytes`, since the call to `set_len(0)` above
-            // gaurantees that nothing stored in the buffer will get observed after this function ends.
+            // guarantees that nothing stored in the buffer will get observed after this function ends.
             // `cmd` points to a valid address of a stored command, so it must be non-null.
             let cmd = unsafe { OwningPtr::new(NonNull::new_unchecked(cmd.cast())) };
             // SAFETY: The underlying type of `cmd` matches the type expected by `meta.apply_command`.

crates/bevy_input/src/keyboard.rs

@@ -281,7 +281,7 @@ pub enum KeyCode {
     Apostrophe,
     /// The `Apps` key.
     Apps,
-    /// The `Asterik` / `*` key.
+    /// The `Asterisk` / `*` key.
     Asterisk,
     /// The `Plus` / `+` key.
     Plus,

crates/bevy_pbr/src/light.rs

@@ -88,7 +88,7 @@ impl Default for PointLightShadowMap {
 }
 
 /// A light that emits light in a given direction from a central point.
-/// Behaves like a point light in a perfectly absorbant housing that
+/// Behaves like a point light in a perfectly absorbent housing that
 /// shines light only in a given direction. The direction is taken from
 /// the transform, and can be specified with [`Transform::looking_at`](bevy_transform::components::Transform::looking_at).
 #[derive(Component, Debug, Clone, Copy, Reflect)]

crates/bevy_pbr/src/pbr_material.rs

@@ -190,7 +190,7 @@ pub struct StandardMaterial {
     /// When a triangle is in a viewport,
     /// if its vertices appear counter-clockwise from the viewport's perspective,
     /// then the viewport is seeing the triangle's front face.
-    /// Conversly, if the vertices appear clockwise, you are seeing the back face.
+    /// Conversely, if the vertices appear clockwise, you are seeing the back face.
     ///
     /// In short, in bevy, front faces winds counter-clockwise.
     ///