src: remove duplicate words (#8493)

Author: jbampton

src/burp/restore.epp

@@ -1898,7 +1898,7 @@ void get_array(BurpGlobals* tdgbl, burp_rel* relation, UCHAR* record_buffer)
 			int elements_written = 1;
 			end_ranges = field->fld_ranges + 2 * field->fld_dimensions;
 			//
-			// Here is the important work. Calculate the the bounds to be written
+			// Here is the important work. Calculate the bounds to be written
 			// so that the resulting slice is a rectangular/square slice.
 			// For a 2 dimensional array of size 1..N, 1..M, which is partially
 			// filled, we have already calculated the dims of last element. Say

src/common/enc.cpp

@@ -637,7 +637,7 @@ static int des_setkey(unsigned char* key)
 
 /*
  * Encrypt (or decrypt if num_iter < 0) the 8 chars at "in" with abs(num_iter)
- * iterations of DES, using the the given 24-bit salt and the pre-computed key
+ * iterations of DES, using the given 24-bit salt and the pre-computed key
  * schedule, and store the resulting 8 chars at "out" (in == out is permitted).
  *
  * NOTE: the performance of this routine is critically dependent on your

src/dsql/DdlNodes.epp

@@ -12309,7 +12309,7 @@ void GrantRevokeNode::checkGrantorCanGrantRelation(thread_db* tdbb, jrd_tra* tra
 		status_exception::raise(Arg::PrivateDyn(175) << relationName.c_str());
 	}
 
-	// Verify the the input field exists.
+	// Verify the input field exists.
 
 	if (fieldName.hasData())
 	{

src/gpre/std/gpre_meta.epp

@@ -1804,7 +1804,7 @@ static void get_array(gpre_dbb* database, const TEXT* field_name, gpre_fld* fiel
 			field->fld_dtype = dtype_blob;
 			field->fld_flags |= FLD_blob;
 			field->fld_length = 8;
-			// CVC: Someone allocated the the max size inside the ary structure,
+			// CVC: Someone allocated the max size inside the ary structure,
 			// so the dynamic length is irrelevant to create the array_block.
 			field_dimensions = F.RDB$DIMENSIONS;
 			fb_assert(field_dimensions <= MAX_ARRAY_DIMENSIONS);

src/jrd/Collation.cpp

@@ -595,7 +595,7 @@ class MatchesMatcher
 private:
 	 // Return true if a string (p1, l1) matches a given pattern (p2, l2).
 	 // The character '?' in the pattern may match any single character
-	 // in the the string, and the character '*' may match any sequence
+	 // in the string, and the character '*' may match any sequence
 	 // of characters.
 	 //
 	 // Wide SCHAR version operates on short-based buffer,

src/lock/lock.cpp

@@ -1145,7 +1145,7 @@ void LockManager::acquire_shmem(SRQ_PTR owner_offset)
 #endif //USE_SHMEM_EXT
 
 	// If we were able to acquire the MUTEX, but there is an prior owner marked
-	// in the the lock table, it means that someone died while owning
+	// in the lock table, it means that someone died while owning
 	// the lock mutex.  In that event, lets see if there is any unfinished work
 	// left around that we need to finish up.