From df3e6fef309fda280da9aa55398c9d17f975d640 Mon Sep 17 00:00:00 2001
From: hardlydearly <167623323+hardlydearly@users.noreply.github.com>
Date: Thu, 25 Apr 2024 06:39:41 +0800
Subject: [PATCH] chore: remove repetitive words (vercel/turbo#8032)
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

### Description

<!--
  ✍️ Write a short summary of your work.
  If necessary, include relevant screenshots.
-->

remove repetitive words

### Testing Instructions

<!--
  Give a quick description of steps to test your changes.
-->

Signed-off-by: hardlydearly <799511800@qq.com>
Co-authored-by: Anthony Shew <anthony.shew@vercel.com>
---
 crates/turbo-tasks-hash/src/xxh3_hash64.rs            | 4 ++--
 crates/turbo-tasks-memory/src/aggregation_tree/mod.rs | 2 +-
 crates/turbo-tasks/src/state.rs                       | 2 +-
 crates/turbo-tasks/src/task/function.rs               | 2 +-
 4 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/crates/turbo-tasks-hash/src/xxh3_hash64.rs b/crates/turbo-tasks-hash/src/xxh3_hash64.rs
index 0f1b620619cbc..e5dec287e4b30 100644
--- a/crates/turbo-tasks-hash/src/xxh3_hash64.rs
+++ b/crates/turbo-tasks-hash/src/xxh3_hash64.rs
@@ -20,13 +20,13 @@ impl Xxh3Hash64Hasher {
         Self(xxh3::Hash64::with_seed(0))
     }
 
-    /// Uses the DeterministicHash trait to to hash the input in a
+    /// Uses the DeterministicHash trait to hash the input in a
     /// cross-platform way.
     pub fn write_value<T: DeterministicHash>(&mut self, input: T) {
         input.deterministic_hash(self);
     }
 
-    /// Uses the DeterministicHash trait to to hash the input in a
+    /// Uses the DeterministicHash trait to hash the input in a
     /// cross-platform way.
     pub fn write_ref<T: DeterministicHash>(&mut self, input: &T) {
         input.deterministic_hash(self);
diff --git a/crates/turbo-tasks-memory/src/aggregation_tree/mod.rs b/crates/turbo-tasks-memory/src/aggregation_tree/mod.rs
index cb5e449176772..fd6e81a14e6a5 100644
--- a/crates/turbo-tasks-memory/src/aggregation_tree/mod.rs
+++ b/crates/turbo-tasks-memory/src/aggregation_tree/mod.rs
@@ -1,6 +1,6 @@
 //! The module implements a datastructure that aggregates a "forest" into less
 //! nodes. For any node one can ask for a single aggregated version of all
-//! children on that node. Changes the the forest will propagate up the
+//! children on that node. Changes the forest will propagate up the
 //! aggregation tree to keep it up to date. So asking of an aggregated
 //! information is cheap and one can even wait for aggregated info to change.
 //!
diff --git a/crates/turbo-tasks/src/state.rs b/crates/turbo-tasks/src/state.rs
index 072a2558729b1..d2346ba103fe1 100644
--- a/crates/turbo-tasks/src/state.rs
+++ b/crates/turbo-tasks/src/state.rs
@@ -54,7 +54,7 @@ impl<T> Eq for State<T> {}
 
 impl<T> Serialize for State<T> {
     fn serialize<S: serde::Serializer>(&self, _serializer: S) -> Result<S::Ok, S::Error> {
-        // For this to work at all we need to do more. Changing the the state need to
+        // For this to work at all we need to do more. Changing the state need to
         // invalidate the serialization of the task that contains the state. So we
         // probably need to store the state outside of the task to be able to serialize
         // it independent from the creating task.
diff --git a/crates/turbo-tasks/src/task/function.rs b/crates/turbo-tasks/src/task/function.rs
index 1a15f24f69585..b753f468158b8 100644
--- a/crates/turbo-tasks/src/task/function.rs
+++ b/crates/turbo-tasks/src/task/function.rs
@@ -12,7 +12,7 @@
 //! work, but they are described in this blog post:
 //! https://blog.logrocket.com/rust-bevy-entity-component-system/
 //!
-//! However, there are is an additional complication in our case: async methods
+//! However, there is an additional complication in our case: async methods
 //! that accept a reference to the receiver as their first argument.
 //!
 //! This complication handled through our own version of the `async_trait`