chore: fix some comments

Signed-off-by: findseat <penglili@outlook.com>

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.
 //!

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.

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`

docs/pages/repo/docs/core-concepts/monorepos/task-graph.mdx

@@ -12,7 +12,7 @@ Graph.
 
 Turborepo uses a data structure called a [directed acyclic graph (DAG)][1] to
 understand your repository and its tasks. A graph is made up of "nodes" and
-"edges". In our Task Graph, the nodes are tasks and the edges are the the
+"edges". In our Task Graph, the nodes are tasks and the edges are the
 dependencies between tasks. A _directed_ graph indicates that the edges
 connecting each node have a direction, so if Task A points to Task B, we can say
 that Task A depends on Task B. The direction of the edge depends on which task