Typos.

Summary: As pointed out by orbitcowboy at facebook#6 Test Plan: No Reviewers: jdelong, aalexandre Reviewed By: jdelong CC: folly@lists, bagashe Differential Revision: https://phabricator.fb.com/D486754
eddiezzz · Jun 5, 2012 · f0ced41 · f0ced41
1 parent 8b71b71
commit f0ced41
Show file tree

Hide file tree

Showing 7 changed files with 8 additions and 8 deletions.
diff --git a/folly/AtomicHashArray-inl.h b/folly/AtomicHashArray-inl.h
@@ -252,7 +252,7 @@ create(size_t maxSize, const Config& c) {
    * constructor.)  This is in order to avoid needing to default
    * construct a bunch of value_type when we first start up: if you
    * have an expensive default constructor for the value type this can
-   * noticably speed construction time for an AHA.
+   * noticeably speed construction time for an AHA.
    */
   FOR_EACH_RANGE(i, 0, map->capacity_) {
     cellKeyPtr(map->cells_[i])->store(map->kEmptyKey_,

diff --git a/folly/FBString.h b/folly/FBString.h
@@ -1484,7 +1484,7 @@ class basic_fbstring {
   }
 
   // Replaces at most n1 chars of *this, starting with pos, with n2
-  // occurences of c
+  // occurrences of c
   //
   // consolidated with
   //
@@ -2224,7 +2224,7 @@ basic_fbstring<E1, T, A, S>::npos =
               static_cast<typename basic_fbstring<E1, T, A, S>::size_type>(-1);
 
 #ifndef _LIBSTDCXX_FBSTRING
-// basic_string compatiblity routines
+// basic_string compatibility routines
 
 template <typename E, class T, class A, class S>
 inline

diff --git a/folly/PackedSyncPtr.h b/folly/PackedSyncPtr.h
@@ -105,7 +105,7 @@ class PackedSyncPtr {
   reference operator*() const { return *get(); }
   reference operator[](std::ptrdiff_t i) const { return get()[i]; }
 
-  // Syncronization (logically const, even though this mutates our
+  // Synchronization (logically const, even though this mutates our
   // locked state: you can lock a const PackedSyncPtr<T> to read it).
   void lock() const { data_.lock(); }
   void unlock() const { data_.unlock(); }

diff --git a/folly/docs/AtomicHashMap.md b/folly/docs/AtomicHashMap.md
@@ -26,7 +26,7 @@ compare-and-swap'ed.
 the approximate number of elements you'll be inserting into the map, you
 probably shouldn't use this class.
 
-* Must manage syncronization externally in order to modify values in the map
+* Must manage synchronization externally in order to modify values in the map
 after insertion.  Lock pools are a common way to do this, or you may
 consider using `folly::PackedSyncPtr<T>` as your `ValueT`.
 

diff --git a/folly/test/ConcurrentSkipListBenchmark.cpp b/folly/test/ConcurrentSkipListBenchmark.cpp
@@ -579,7 +579,7 @@ BENCHMARK_PARAM(BM_CSLMergeLookup,       1000000);
 BENCHMARK_DRAW_LINE();
 
 
-// multi-thread benchmarking
+// multithreaded benchmarking
 
 BENCHMARK_PARAM(BM_ContentionStdSet, 1024);
 BENCHMARK_PARAM(BM_ContentionCSL,    1024);

diff --git a/folly/test/PackedSyncPtrTest.cpp b/folly/test/PackedSyncPtrTest.cpp
@@ -111,7 +111,7 @@ TEST(PackedSyncPtr, Application) {
   }
 
   for (auto& kv : map) {
-    // Make sure every thread succesfully inserted it's ID into every vec
+    // Make sure every thread successfully inserted it's ID into every vec
     std::set<intptr_t> idsFound;
     for (auto& elem : kv.second) {
       EXPECT_TRUE(idsFound.insert(elem).second);  // check for dups

diff --git a/folly/test/ThreadCachedIntTest.cpp b/folly/test/ThreadCachedIntTest.cpp
@@ -155,7 +155,7 @@ std::atomic<int32_t> globalInt32Baseline(0);
 __thread int64_t global__thread64;
 __thread int32_t global__thread32;
 
-// Alternate lock-free implementation.  Acheives about the same performance,
+// Alternate lock-free implementation.  Achieves about the same performance,
 // but uses about 20x more memory than ThreadCachedInt with 24 threads.
 struct ShardedAtomicInt {
   static const int64_t kBuckets_ = 2048;