Fix instances of "the the" in comments

Reviewed By: yfeldblum

Differential Revision: D21666740

fbshipit-source-id: 96975e777df0745f343c5b722f1d8c05bb8ac32e

folly/FileUtil.h

@@ -249,7 +249,7 @@ enum class SyncType {
  *
  * This writes the data to a temporary file in the destination directory, and
  * then renames it to the specified path.  This guarantees that the specified
- * file will be replaced the the specified contents on success, or will not be
+ * file will be replaced the specified contents on success, or will not be
  * modified on failure.
  *
  * Note that on platforms that do not provide atomic filesystem rename

folly/FixedString.h

@@ -1564,7 +1564,7 @@ class BasicFixedString : private detail::fixedstring::FixedStringBase {
   /**
    * Compare two strings for lexicographical ordering.
    *
-   * Let `A` be the the
+   * Let `A` be the
    *   character sequence {`(*this)[this_pos]`, ...
    *   `(*this)[this_pos + this_count - 1]`}. Let `B` be the character sequence
    *   {`that[0]`, ...`that[count - 1]`}. Then...

folly/Poly.h

@@ -1071,7 +1071,7 @@ using PolyValOrRef = If<std::is_reference<I>::value, PolyRef<I>, PolyVal<I>>;
  * added? Adding requires _two_ objects, both of which are type-erased. This
  * interface requires dispatching on both objects, doing the addition only
  * if the types are the same. For this we make use of the `PolySelf` template
- * alias to define an interface that takes more than one object of the the
+ * alias to define an interface that takes more than one object of the
  * erased type.
  *
  *     struct IAddable {

folly/docs/Poly.md

@@ -446,7 +446,7 @@ What if you want to create an `IAddable` interface for things that can be
 added? Adding requires _two_ objects, both of which are type-erased. This
 interface requires dispatching on both objects, doing the addition only
 if the types are the same. For this we make use of the `PolySelf` template
-alias to define an interface that takes more than one object of the the
+alias to define an interface that takes more than one object of the
 erased type.
 
 ``` Cpp

folly/experimental/coro/Sleep.h

@@ -25,7 +25,7 @@ namespace coro {
 /// Return a task that, when awaited, will sleep for the specified duration.
 ///
 /// May complete sooner that the specified duration if cancellation is requested
-/// on the the awaiting coroutine's associated CancellationToken.
+/// on the awaiting coroutine's associated CancellationToken.
 Task<void> sleep(Duration d, Timekeeper* tk = nullptr);
 
 } // namespace coro

folly/experimental/symbolizer/test/SymbolizedFrameTest.cpp

@@ -41,7 +41,7 @@ void checkPath(
 
   CHECK_EQ(expectedPath, path.toString());
 
-  // Check the the `toBuffer` function.
+  // Check the `toBuffer` function.
   char buf[1024];
   size_t len;
   len = path.toBuffer(buf, 1024);

folly/experimental/test/SingletonRelaxedCounterBench.cpp

@@ -36,7 +36,7 @@ struct PrivateTag {};
 using Counter = SingletonRelaxedCounter<size_t, PrivateTag>;
 
 // small wrappers around the functions being benchmarked
-// useful for looking at the the inlined native code of the fast path
+// useful for looking at the inlined native code of the fast path
 extern "C" void check() noexcept {
   Counter::add(1);
 }

folly/gen/Core-inl.h

@@ -180,7 +180,7 @@ class GenImpl : public FBounded<Self> {
 
   // Child classes should override if the sequence generated is *definitely*
   // infinite. 'infinite' may be false_type for some infinite sequences
-  // (due the the Halting Problem).
+  // (due to the Halting Problem).
   //
   // In general, almost all sources are finite (only seq(n) produces an infinite
   // source), almost all operators keep the finiteness of the source (only cycle

folly/io/async/NotificationQueue.h

@@ -185,7 +185,7 @@ class NotificationQueue {
 
    private:
     /**
-     * Consume messages off the the queue until
+     * Consume messages off the queue until
      *   - the queue is empty (1), or
      *   - until the consumer is destroyed, or
      *   - until the consumer is uninstalled, or

folly/logging/LoggerDB.cpp

@@ -260,7 +260,7 @@ void LoggerDB::startConfigUpdate(
         handler = factory->createHandler(handlerConfig->options);
       }
     } catch (const std::exception& ex) {
-      // Errors creating or updating the the log handler are generally due to
+      // Errors creating or updating the log handler are generally due to
       // bad configuration options.  It is useful to update the exception
       // message to include the name of the log handler we were trying to
       // update or create.

folly/logging/docs/Config.md

@@ -313,7 +313,7 @@ following fields:
 Custom Configuration Mechanisms
 -------------------------------
 
-Internally the the `LogConfig` class represents configuration settings for the
+Internally the `LogConfig` class represents configuration settings for the
 folly logging library.  Users of the logging library can also programmatically
 construct their own `LogConfig` objects and use the `LoggerDB::updateConfig()`
 and `LoggerDB::resetConfig()` APIs to apply the configuration changes.

folly/synchronization/Baton.h

@@ -74,7 +74,7 @@ class Baton {
     // requirement in which the caller must _know_ that this is true, they
     // are not allowed to be merely lucky.  If two threads are involved,
     // the destroying thread must actually have synchronized with the
-    // waiting thread after wait() returned.  To convey causality the the
+    // waiting thread after wait() returned.  To convey causality the
     // waiting thread must have used release semantics and the destroying
     // thread must have used acquire semantics for that communication,
     // so we are guaranteed to see the post-wait() value of state_,

folly/test/AtomicHashMapTest.cpp

@@ -387,7 +387,7 @@ TEST(Ahm, basicErase) {
     EXPECT_TRUE(success);
     EXPECT_EQ(s->size(), numEntries);
 
-    // Delete every key in the map and verify that the key is gone and the the
+    // Delete every key in the map and verify that the key is gone and the
     // size is correct.
     success = true;
     for (size_t i = 0; i < numEntries; ++i) {