Remove immediately adjacent repeated words ("the the", "for for", "an an", etc.).

Author: practicalswift

docs/archive/LangRef.html

@@ -1901,7 +1901,7 @@ <h3 id="expr-closure">Closure Expression</h3>
       <i>// both have type 'Int'.</i>
       magic(42, { $0 &lt; $1 })
 
-      <i>// Compare the other way way.</i>
+      <i>// Compare the other way.</i>
       magic(42, { $1 &lt; $0 })
 
       <i>// Provide parameter names, but infer the types.</i>

docs/proposals/rejected/Bridging Container Protocols to Class Clusters.rst

@@ -24,7 +24,7 @@ Here's what I propose instead:
 
 Although I'll be talking about arrays in this proposal, I think the same
 approach would work for ``NSDictionary`` and ``NSSet`` as well, mapping them
-to generic containers for associative map and and unordered container protocols
+to generic containers for associative map and unordered container protocols
 respectively.
 
 NSArray vs Array

docs/proposals/valref.rst

@@ -179,7 +179,7 @@ When a reference to an array appears without a variable name, it can
 be written using the `usual syntax`__::
 
   var f : ()->ref Int[42] // a closure returning a reference to an array
-  var b : ref Int[42]     // equivalent to to "ref b : Int[42]"
+  var b : ref Int[42]     // equivalent to "ref b : Int[42]"
 
 __ `standalone types`_
 
@@ -192,7 +192,7 @@ brackets, that most users will never touch, e.g.::
   var z : Array<ref Array<Int,42>, 2> // an array of 2 references to arrays
   ref a : Array<Int,42>               // a reference to an array of 42 integers
   var f : ()->ref Array<Int,42>       // a closure returning a reference to an array
-  var b : ref Array<Int,42>           // equivalent to to "ref b : Int[42]"
+  var b : ref Array<Int,42>           // equivalent to "ref b : Int[42]"
 
 Rules for copying array elements follow those of instance variables.
 

include/swift/AST/ASTContext.h

@@ -590,7 +590,7 @@ class ASTContext {
   /// one.
   void loadExtensions(NominalTypeDecl *nominal, unsigned previousGeneration);
 
-  /// \brief Load the methods within the given class that that produce
+  /// \brief Load the methods within the given class that produce
   /// Objective-C class or instance methods with the given selector.
   ///
   /// \param classDecl The class in which we are searching for @objc methods.
@@ -604,7 +604,7 @@ class ASTContext {
   ///
   /// \param previousGeneration The previous generation with which this
   /// callback was invoked. The list of methods will already contain all of
-  /// the results from generations up and and including \c previousGeneration.
+  /// the results from generations up and including \c previousGeneration.
   ///
   /// \param methods The list of @objc methods in this class that have this
   /// selector and are instance/class methods as requested. This list will be

include/swift/AST/Availability.h

@@ -35,7 +35,7 @@ class VersionRange {
   // The concretization of lattice elements is:
   //    Empty: empty
   //    All: all versions
-  //    x.y.x: all versions greater than or equal to to x.y.z
+  //    x.y.x: all versions greater than or equal to x.y.z
 
   enum class ExtremalRange { Empty, All };
 

include/swift/AST/Decl.h

@@ -2798,7 +2798,7 @@ class NominalTypeDecl : public TypeDecl, public DeclContext,
     return ValidatingGenericSignature;
   }
 
-  /// \brief Returns true if this this decl contains delayed value or protocol
+  /// \brief Returns true if this decl contains delayed value or protocol
   /// declarations.
   bool hasDelayedMembers() const {
     return NominalTypeDeclBits.HasDelayedMembers;

include/swift/AST/ModuleLoader.h

@@ -95,7 +95,7 @@ class ModuleLoader {
   virtual void loadExtensions(NominalTypeDecl *nominal,
                               unsigned previousGeneration) { }
 
-  /// \brief Load the methods within the given class that that produce
+  /// \brief Load the methods within the given class that produce
   /// Objective-C class or instance methods with the given selector.
   ///
   /// \param classDecl The class in which we are searching for @objc methods.
@@ -109,7 +109,7 @@ class ModuleLoader {
   ///
   /// \param previousGeneration The previous generation with which this
   /// callback was invoked. The list of methods will already contain all of
-  /// the results from generations up and and including \c previousGeneration.
+  /// the results from generations up and including \c previousGeneration.
   ///
   /// \param methods The list of @objc methods in this class that have this
   /// selector and are instance/class methods as requested. This list will be

include/swift/AST/Types.h

@@ -2576,12 +2576,12 @@ inline bool isConsumedParameter(ParameterConvention conv) {
 }
 
 enum class InoutAliasingAssumption {
-  /// Assume that that an inout indirect parameter may alias other objects.
+  /// Assume that an inout indirect parameter may alias other objects.
   /// This is the safe assumption an optimizations should make if it may break
   /// memory safety in case the inout aliasing rule is violation.
   Aliasing,
 
-  /// Assume that that an inout indirect parameter cannot alias other objects.
+  /// Assume that an inout indirect parameter cannot alias other objects.
   /// Optimizations should only use this if they can guarantee that they will
   /// not break memory safety even if the inout aliasing rule is violated.
   NotAliasing

include/swift/SIL/SILCloner.h

@@ -29,7 +29,7 @@ namespace swift {
 /// operations requiring cloning (while possibly modifying, at the same time)
 /// instruction sequences.
 ///
-/// By default, this visitor will not do anything useful when when called on a
+/// By default, this visitor will not do anything useful when called on a
 /// basic block, or function; subclasses that want to handle those should
 /// implement the appropriate visit functions and/or provide other entry points.
 template<typename ImplClass>

include/swift/SIL/TypeLowering.h

@@ -232,7 +232,7 @@ class TypeLowering {
   virtual void emitDestroyAddress(SILBuilder &B, SILLocation loc,
                                   SILValue value) const = 0;
 
-  /// Given a +1 r-value which are are claiming ownership of, destroy it.
+  /// Given a +1 r-value which we are claiming ownership of, destroy it.
   ///
   /// Note that an r-value might be an address.
   virtual void emitDestroyRValue(SILBuilder &B, SILLocation loc,

include/swift/SILOptimizer/Utils/Local.h

@@ -485,7 +485,7 @@ class CastOptimizer {
   SILInstruction *
   optimizeUnconditionalCheckedCastAddrInst(UnconditionalCheckedCastAddrInst *Inst);
 
-  /// Check if is is a bridged cast and optimize it.
+  /// Check if it is a bridged cast and optimize it.
   /// May change the control flow.
   SILInstruction *
   optimizeBridgedCasts(SILInstruction *Inst,

include/swift/Serialization/ModuleFile.h

@@ -519,7 +519,7 @@ class ModuleFile : public LazyMemberLoader {
   /// Note that this may cause other decls to load as well.
   void loadExtensions(NominalTypeDecl *nominal);
 
-  /// \brief Load the methods within the given class that that produce
+  /// \brief Load the methods within the given class that produce
   /// Objective-C class or instance methods with the given selector.
   ///
   /// \param classDecl The class in which we are searching for @objc methods.

lib/AST/ConformanceLookupTable.cpp

@@ -487,7 +487,7 @@ void ConformanceLookupTable::addProtocols(NominalTypeDecl *nominal,
 void ConformanceLookupTable::expandImpliedConformances(NominalTypeDecl *nominal,
                                                        DeclContext *dc, 
                                                        LazyResolver *resolver) {
-  // Note: recursive type-checking implies that that AllConformances
+  // Note: recursive type-checking implies that AllConformances
   // may be reallocated during this traversal, so pay the lookup cost
   // during each iteration.
   for (unsigned i = 0; i != AllConformances[dc].size(); ++i) {

lib/AST/Stmt.cpp

@@ -248,7 +248,7 @@ bool DoCatchStmt::isSyntacticallyExhaustive() const {
 }
 
 void LabeledConditionalStmt::setCond(StmtCondition e) {
-  // When set set a condition into a Conditional Statement, inform each of the
+  // When set a condition into a Conditional Statement, inform each of the
   // variables bound in any patterns that this is the owning statement for the
   // pattern.
   for (auto &elt : e)

lib/ClangImporter/ImportDecl.cpp

@@ -4469,7 +4469,7 @@ namespace {
       auto superclass
         = cast<ClassDecl>(classDecl->getSuperclass()->getAnyNominal());
 
-      // If we we have a superclass, import from it.
+      // If we have a superclass, import from it.
       if (auto superclassClangDecl = superclass->getClangDecl()) {
         if (isa<clang::ObjCInterfaceDecl>(superclassClangDecl)) {
           inheritConstructors(superclass->getMembers(), kind);

lib/IDE/CodeCompletion.cpp

@@ -326,7 +326,7 @@ static Stmt *findNearestStmt(const AbstractFunctionDecl *AFD, SourceLoc Loc,
   auto &SM = AFD->getASTContext().SourceMgr;
   assert(SM.rangeContainsTokenLoc(AFD->getSourceRange(), Loc));
   StmtFinder Finder(SM, Loc, Kind);
-  // FIXME(thread-safety): the walker is is mutating the AST.
+  // FIXME(thread-safety): the walker is mutating the AST.
   const_cast<AbstractFunctionDecl *>(AFD)->walk(Finder);
   return Finder.getFoundStmt();
 }

lib/IDE/SourceEntityWalker.cpp

@@ -460,7 +460,7 @@ bool SourceEntityWalker::visitSubscriptReference(ValueDecl *D,
                                                  CharSourceRange Range,
                                                  bool IsOpenBracket) {
   // Most of the clients treat subscript reference the same way as a
-  // regular reference when called on the open open bracket and
+  // regular reference when called on the open bracket and
   // ignore the closing one.
   return IsOpenBracket ? visitDeclReference(D, Range, nullptr, Type()) : true;
 }

lib/IRGen/LoadableTypeInfo.h

@@ -129,7 +129,7 @@ class LoadableTypeInfo : public FixedTypeInfo {
                                      Explosion &targetExplosion,
                                      unsigned offset) const = 0;
 
-  /// Load a a reference counted pointer from an address.
+  /// Load a reference counted pointer from an address.
   /// Return the loaded pointer value.
   virtual LoadedRef loadRefcountedPtr(IRGenFunction &IGF, SourceLoc loc,
                                       Address addr) const;

lib/SIL/Projection.cpp

@@ -824,7 +824,7 @@ processUsersOfValue(ProjectionTree &Tree,
 
     assert(User->getNumTypes() == 1 && "Projections should only have one use");
 
-    // Look up the Node for this projection add add {User, ChildNode} to the
+    // Look up the Node for this projection add {User, ChildNode} to the
     // worklist.
     //
     // *NOTE* This means that we will process ChildNode multiple times

lib/SILGen/RValue.cpp

@@ -279,7 +279,7 @@ class EmitBBArguments : public CanTypeVisitor<EmitBBArguments,
 /// RValue) into an initialization. The RValue will have one scalar ManagedValue
 /// for each exploded tuple element in the RValue, so this needs to make the
 /// shape of the initialization match the available elements.  This can be done
-/// one one of two ways:
+/// one of two ways:
 ///
 ///  1) recursively scalarize down the initialization on demand if the type of
 ///     the RValue is tuple type and the initialization supports it.

lib/SILGen/SILGenApply.cpp

@@ -789,7 +789,7 @@ static Callee prepareArchetypeCallee(SILGenFunction &gen, SILLocation loc,
                               constant, substFnType, loc);
 }
 
-/// An ASTVisitor for decomposing a a nesting of ApplyExprs into an initial
+/// An ASTVisitor for decomposing a nesting of ApplyExprs into an initial
 /// Callee and a list of CallSites. The CallEmission class below uses these
 /// to generate the actual SIL call.
 ///

lib/SILOptimizer/ARC/GlobalARCSequenceDataflow.cpp

@@ -149,7 +149,7 @@ void ARCSequenceDataflowEvaluator::mergePredecessors(
     ARCBBState &PredBBState = PredDataHandle->getState();
 
     // If we found the state but the state is for a trap BB, skip it. Trap BBs
-    // leak all reference counts and do not reference reference semantic objects
+    // leak all reference counts and do not reference semantic objects
     // in any manner.
     //
     // TODO: I think this is a copy paste error, since we a trap BB should have

lib/SILOptimizer/Analysis/ArraySemantic.cpp

@@ -622,7 +622,7 @@ bool swift::ArraySemanticsCall::replaceByValue(SILValue V) {
   if (!ASI)
     return false;
 
-  // Expect a check_subscript call or the empty dependence dependence.
+  // Expect a check_subscript call or the empty dependence.
   auto SubscriptCheck = SemanticsCall->getArgument(3);
   ArraySemanticsCall Check(SubscriptCheck.getDef(), "array.check_subscript");
   auto *EmptyDep = dyn_cast<StructInst>(SubscriptCheck);

lib/SILOptimizer/Analysis/ClassHierarchyAnalysis.cpp

@@ -77,7 +77,7 @@ void ClassHierarchyAnalysis::init() {
 /// \brief Get all subclasses of a given class.
 /// Does not include any direct subclasses of given base class.
 ///
-/// \p Base base class, whose direct subclasses are to be excluded
+/// \p Base class, whose direct subclasses are to be excluded
 /// \p Current class, whose direct and indirect subclasses are
 ///    to be collected.
 /// \p IndirectSubs placeholder for collected results

lib/SILOptimizer/Analysis/ValueTracking.cpp

@@ -212,7 +212,7 @@ static bool valueMayBeCaptured(SILValue V, CaptureException Exception) {
   DEBUG(llvm::dbgs() << "        Checking for capture.\n");
 
 
-  // All all uses of V to the worklist.
+  // All uses of V to the worklist.
   for (auto *UI : V.getUses()) {
     // If we have more uses than the threshold, be conservative and bail so we
     // don't use too much compile time.

lib/SILOptimizer/IPO/CapturePromotion.cpp

@@ -783,7 +783,7 @@ examineAllocBoxInst(AllocBoxInst *ABI, ReachabilityInfo &RI,
       continue;
     }
 
-    // Verify that this this use does not otherwise allow the alloc_box to
+    // Verify that this use does not otherwise allow the alloc_box to
     // escape.
     if (!isNonescapingUse(O, Mutations))
       return false;

lib/SILOptimizer/IPO/ClosureSpecializer.cpp

@@ -721,7 +721,7 @@ void ClosureSpecializer::gatherCallSites(
 
       // Go through all uses of our closure.
       for (auto *Use : II.getUses()) {
-        // If this use use is not an apply inst or an apply inst with
+        // If this use is not an apply inst or an apply inst with
         // substitutions, there is nothing interesting for us to do, so
         // continue...
         auto AI = FullApplySite::isa(Use->getUser());

lib/SILOptimizer/LoopTransforms/LoopUnroll.cpp

@@ -202,7 +202,7 @@ static void redirectTerminator(SILBasicBlock *Latch, unsigned CurLoopIter,
   //   BackegdeBlock:
   //     br HeaderBlock:
   //
-  // Or a a conditional branch back to the header.
+  // Or a conditional branch back to the header.
   //   HeaderBlock:
   //     ...
   //     cond_br %cond, ExitBlock, HeaderBlock

lib/SILOptimizer/Transforms/ArrayElementValuePropagation.cpp

@@ -165,7 +165,7 @@ bool ArrayAllocation::isInitializationWithKnownElements() {
 /// Propagate the elements of an array literal to get_element method calls on
 /// the same array.
 ///
-/// We have to prove that the the array value is not changed in between the
+/// We have to prove that the array value is not changed in between the
 /// creation and the method call to get_element.
 bool ArrayAllocation::findValueReplacements() {
   if (!isInitializationWithKnownElements())

lib/SILOptimizer/Transforms/SimplifyCFG.cpp

@@ -2030,7 +2030,7 @@ static bool tryMoveCondFailToPreds(SILBasicBlock *BB) {
 
   // Find the underlying condition value of the cond_fail.
   // We only accept single uses. This is not a correctness check, but we only
-  // want to to the optimization if the condition gets dead after moving the
+  // want to the optimization if the condition gets dead after moving the
   // cond_fail.
   bool inverted = false;
   SILValue cond = skipInvert(CFI->getOperand(), inverted, true);

lib/SILOptimizer/Utils/Local.cpp

@@ -1154,7 +1154,7 @@ static Type getCastFromObjC(SILModule &M, CanType source, CanType target) {
 }
 
 /// Create a call of _forceBridgeFromObjectiveC_bridgeable or
-/// _conditionallyBridgeFromObjectiveC_bridgeable  which converts an an ObjC
+/// _conditionallyBridgeFromObjectiveC_bridgeable which converts an ObjC
 /// instance into a corresponding Swift type, conforming to
 /// _ObjectiveCBridgeable.
 SILInstruction *
@@ -1921,7 +1921,7 @@ CastOptimizer::optimizeCheckedCastBranchInst(CheckedCastBranchInst *Inst) {
       // Should be in the same BB.
       if (ASI->getParent() != EMI->getParent())
         return nullptr;
-      // Check if this alloc_stac is is only initialized once by means of
+      // Check if this alloc_stac is only initialized once by means of
       // single init_existential_addr.
       bool isLegal = true;
       // init_existential instruction used to initialize this alloc_stack.
@@ -1982,7 +1982,7 @@ CastOptimizer::optimizeCheckedCastBranchInst(CheckedCastBranchInst *Inst) {
       // Should be in the same BB.
       if (ASRI->getParent() != EMI->getParent())
         return nullptr;
-      // Check if this alloc_stac is is only initialized once by means of
+      // Check if this alloc_stack is only initialized once by means of
       // a single initt_existential_ref.
       bool isLegal = true;
       for (auto Use: getNonDebugUses(*ASRI)) {

lib/Sema/CSDiag.cpp

@@ -2878,7 +2878,7 @@ typeCheckChildIndependently(Expr *subExpr, Type convertType,
 
   // If we have no contextual type information and the subexpr is obviously a
   // overload set, don't recursively simplify this.  The recursive solver will
-  // sometimes pick one based on arbitrary ranking behavior behavior (e.g. like
+  // sometimes pick one based on arbitrary ranking behavior (e.g. like
   // which is the most specialized) even then all the constraints are being
   // fulfilled by UnresolvedType, which doesn't tell us anything.
   if (convertTypePurpose == CTP_Unused &&
@@ -3217,7 +3217,7 @@ bool FailureDiagnosis::diagnoseContextualConversionError() {
 
   exprType = exprType->getRValueType();
 
-  // Special case a some common common conversions involving Swift.String
+  // Special case of some common conversions involving Swift.String
   // indexes, catching cases where people attempt to index them with an integer.
   if (isIntegerToStringIndexConversion(exprType, contextualType, CS)) {
     diagnose(expr->getLoc(), diag::string_index_not_integer,
@@ -3320,7 +3320,7 @@ typeCheckArgumentChildIndependently(Expr *argExpr, Type argType,
     argType = Type();
 
 
-  // FIXME: This should all just be a matter of getting type type of the
+  // FIXME: This should all just be a matter of getting the type of the
   // sub-expression, but this doesn't work well when typeCheckChildIndependently
   // is over-conservative w.r.t. TupleExprs.
   auto *TE = dyn_cast<TupleExpr>(argExpr);

lib/Sema/CSSolver.cpp

@@ -1094,7 +1094,7 @@ static bool tryTypeVariableBindings(
     for (auto binding : bindings) {
       auto type = binding.BindingType;
 
-      // After our first pass, note that that we've explored these
+      // After our first pass, note that we've explored these
       // types.
       if (tryCount == 0)
         exploredTypes.insert(type->getCanonicalType());

lib/Sema/CodeSynthesis.cpp

@@ -764,7 +764,7 @@ static void maybeMarkTransparent(FuncDecl *accessor,
 }
 
 /// Synthesize the body of a trivial getter.  For a non-member vardecl or one
-/// which is not an override of a base class property, it performs a a direct
+/// which is not an override of a base class property, it performs a direct
 /// storage load.  For an override of a base member property, it chains up to
 /// super.
 static void synthesizeTrivialGetter(FuncDecl *getter,

lib/Sema/ConstraintLocator.h

@@ -51,7 +51,7 @@ namespace constraints {
 /// to indicate constraints on its argument or result type.
 class ConstraintLocator : public llvm::FoldingSetNode {
 public:
-  /// \brief Describes the kind of a a particular path element, e.g.,
+  /// \brief Describes the kind of a particular path element, e.g.,
   /// "tuple element", "call result", "base of member lookup", etc.
   enum PathElementKind : unsigned char {
     /// \brief The argument of function application.

lib/Sema/ConstraintSystem.h

@@ -2426,7 +2426,7 @@ class ConstraintSystem {
   }
 
   /// \brief Reorder the disjunctive clauses for a given expression to
-  /// increase the likelihood that a favored constraint will be be successfully
+  /// increase the likelihood that a favored constraint will be successfully
   /// resolved before any others.
   void optimizeConstraints(Expr *e);