Merge pull request #4867 from guqicun/trunk

chore: remove repetitive words

Author: aryairani

codebase2/codebase-sqlite/sql/007-add-name-lookup-mounts.sql

@@ -3,7 +3,7 @@
 
 -- This table is used to associate a mount point with a particular name lookup index.
 CREATE TABLE name_lookup_mounts (
-    -- The the parent index we're mounting inside of.
+    -- The parent index we're mounting inside of.
     parent_root_branch_hash_id INTEGER NOT NULL REFERENCES name_lookups(root_branch_hash_id) ON DELETE CASCADE,
     -- The index we're mounting.
     -- Don't allow deleting a mounted name lookup while it's still mounted in some other index,

parser-typechecker/src/Unison/Codebase/Metadata.hs

@@ -13,7 +13,7 @@ import Unison.Util.Star2 qualified as Star2
 type Value = TermReference
 
 -- `a` is generally the type of references or hashes
--- `n` is generally the the type of name associated with the references
+-- `n` is generally the type of name associated with the references
 -- `Value` is the metadata value itself.
 type Star a n = Star2 a n Value
 

parser-typechecker/src/Unison/Runtime/Pattern.hs

@@ -486,7 +486,7 @@ splitMatrix v rf cons (PM rs) =
     mmap = fmap (\(t, fs) -> (t, splitRow v rf t fs =<< rs)) cons
 
 -- Monad for pattern preparation. It is a state monad carrying a fresh
--- variable source, the list of variables bound the the pattern being
+-- variable source, the list of variables bound the pattern being
 -- prepared, and a variable renaming mapping.
 type PPM v a = State (Word64, [v], Map v v) a
 

parser-typechecker/src/Unison/Syntax/DeclParser.hs

@@ -68,7 +68,7 @@ declarations = do
           <> [(v, DD.annotation . DD.toDataDecl <$> es) | (v, es) <- Map.toList mesBad]
 
 -- | When we first walk over the modifier, it may be a `unique`, in which case we want to use a function in the parsing
--- environment to map the the type's name (which we haven't parsed yet) to a GUID to reuse (if any).
+-- environment to map the type's name (which we haven't parsed yet) to a GUID to reuse (if any).
 --
 -- So, we parse into this temporary "unresolved modifier" type, which is soon resolved to a real Modifier once we know
 -- the type name.

parser-typechecker/src/Unison/UnisonFile.hs

@@ -142,7 +142,7 @@ mapTerms f (UnisonFileId datas effects terms watches) =
 --   rule2 = @rewrite term (x -> f x) ==> f
 --
 -- Here, `rule1` introduces a variable `f`, which can stand for
--- any definition. Whereas `rule2` refers to the the top-level `f`
+-- any definition. Whereas `rule2` refers to the top-level `f`
 -- function in the file.
 --
 -- This function returns a tuple of: (prepareRule, preparedFile, finish)

parser-typechecker/tests/Unison/Test/UnisonSources.hs

@@ -142,7 +142,7 @@ resultTest rt uf filepath = do
               uf
       case term of
         Right tm -> do
-          -- compare the the watch expression from the .u with the expr in .ur
+          -- compare the watch expression from the .u with the expr in .ur
           let watchResult = head (view _5 <$> Map.elems watches)
               tm' = Term.letRec' False (bindings <&> \(sym, tm) -> (sym, (), tm)) watchResult
           -- note . show $ tm'

unison-cli/src/Unison/Codebase/TranscriptParser.hs

@@ -411,7 +411,7 @@ run verbosity dir stanzas codebase runtime sbRuntime nRuntime config ucmVersion
                     liftIO (outputEcho $ show s)
                     liftIO (writeIORef allowErrors errOk)
                     -- Open a ucm block which will contain the output from UCM
-                    -- after processing the the UnisonFileChanged event.
+                    -- after processing the UnisonFileChanged event.
                     liftIO (output "```ucm\n")
                     -- Close the ucm block after processing the UnisonFileChanged event.
                     atomically . Q.enqueue cmdQueue $ Nothing

unison-cli/src/Unison/LSP/HandlerUtils.hs

@@ -81,7 +81,7 @@ withCancellation mayTimeoutMillis handler message respond = do
     -- No matter what it's possible for a message to be cancelled before the
     -- canceller has been added, but this means we're not blocking the request waiting for
     -- contention on the cancellation map on every request.
-    -- The the majority of requests should be fast enough to complete "instantly" anyways.
+    -- The majority of requests should be fast enough to complete "instantly" anyways.
     waitForCancel :: (Int32 |? Text) -> Lsp ()
     waitForCancel reqId = do
       barrier <- newEmptyMVar

unison-cli/src/Unison/LSP/Queries.hs

@@ -194,7 +194,7 @@ instance Functor SourceNode where
   fmap f (TypeNode t) = TypeNode (fmap f t)
   fmap f (PatternNode t) = PatternNode (fmap f t)
 
--- | Find the the node in a term which contains the specified position, but none of its
+-- | Find the node in a term which contains the specified position, but none of its
 -- children contain that position.
 findSmallestEnclosingNode :: Pos -> Term Symbol Ann -> Maybe (SourceNode Ann)
 findSmallestEnclosingNode pos term
@@ -295,7 +295,7 @@ findSmallestEnclosingPattern pos pat
         | conRef == Builtins.pairRef && mayUnitRef == Builtins.unitRef -> Just pat1
       _ -> Nothing
 
--- | Find the the node in a type which contains the specified position, but none of its
+-- | Find the node in a type which contains the specified position, but none of its
 -- children contain that position.
 -- This is helpful for finding the specific type reference of a given argument within a type arrow
 -- that a position references.

unison-cli/src/Unison/Share/Sync.hs

@@ -602,7 +602,7 @@ completeTempEntities httpClient unisonShareUrl connect repoInfo downloadedCallba
                     workers <- readTVar workerCount
                     check (workers < maxSimultaneousPullDownloaders + 2)
                     -- we do need to record the downloader as working outside of the worker thread, not inside.
-                    -- otherwise, we might erroneously fall through the the teardown logic below and conclude there's
+                    -- otherwise, we might erroneously fall through the teardown logic below and conclude there's
                     -- nothing more for the dispatcher to do, when in fact a downloader thread just hasn't made it as
                     -- far as recording its own existence
                     recordWorking workerCount