Commit f0ced414 authored by Tudor Bosman's avatar Tudor Bosman Committed by Jordan DeLong

Typos.

Summary:
As pointed out by orbitcowboy at
https://github.com/facebook/folly/issues/6

Test Plan: No

Reviewers: jdelong, aalexandre

Reviewed By: jdelong

CC: folly@lists, bagashe

Differential Revision: https://phabricator.fb.com/D486754
parent 8b71b715
...@@ -252,7 +252,7 @@ create(size_t maxSize, const Config& c) { ...@@ -252,7 +252,7 @@ create(size_t maxSize, const Config& c) {
* constructor.) This is in order to avoid needing to default * constructor.) This is in order to avoid needing to default
* construct a bunch of value_type when we first start up: if you * construct a bunch of value_type when we first start up: if you
* have an expensive default constructor for the value type this can * 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_) { FOR_EACH_RANGE(i, 0, map->capacity_) {
cellKeyPtr(map->cells_[i])->store(map->kEmptyKey_, cellKeyPtr(map->cells_[i])->store(map->kEmptyKey_,
......
...@@ -1484,7 +1484,7 @@ public: ...@@ -1484,7 +1484,7 @@ public:
} }
// Replaces at most n1 chars of *this, starting with pos, with n2 // Replaces at most n1 chars of *this, starting with pos, with n2
// occurences of c // occurrences of c
// //
// consolidated with // consolidated with
// //
...@@ -2224,7 +2224,7 @@ basic_fbstring<E1, T, A, S>::npos = ...@@ -2224,7 +2224,7 @@ basic_fbstring<E1, T, A, S>::npos =
static_cast<typename basic_fbstring<E1, T, A, S>::size_type>(-1); static_cast<typename basic_fbstring<E1, T, A, S>::size_type>(-1);
#ifndef _LIBSTDCXX_FBSTRING #ifndef _LIBSTDCXX_FBSTRING
// basic_string compatiblity routines // basic_string compatibility routines
template <typename E, class T, class A, class S> template <typename E, class T, class A, class S>
inline inline
......
...@@ -105,7 +105,7 @@ public: ...@@ -105,7 +105,7 @@ public:
reference operator*() const { return *get(); } reference operator*() const { return *get(); }
reference operator[](std::ptrdiff_t i) const { return get()[i]; } 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). // locked state: you can lock a const PackedSyncPtr<T> to read it).
void lock() const { data_.lock(); } void lock() const { data_.lock(); }
void unlock() const { data_.unlock(); } void unlock() const { data_.unlock(); }
......
...@@ -26,7 +26,7 @@ compare-and-swap'ed. ...@@ -26,7 +26,7 @@ compare-and-swap'ed.
the approximate number of elements you'll be inserting into the map, you the approximate number of elements you'll be inserting into the map, you
probably shouldn't use this class. 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 after insertion. Lock pools are a common way to do this, or you may
consider using `folly::PackedSyncPtr<T>` as your `ValueT`. consider using `folly::PackedSyncPtr<T>` as your `ValueT`.
......
...@@ -579,7 +579,7 @@ BENCHMARK_PARAM(BM_CSLMergeLookup, 1000000); ...@@ -579,7 +579,7 @@ BENCHMARK_PARAM(BM_CSLMergeLookup, 1000000);
BENCHMARK_DRAW_LINE(); BENCHMARK_DRAW_LINE();
// multi-thread benchmarking // multithreaded benchmarking
BENCHMARK_PARAM(BM_ContentionStdSet, 1024); BENCHMARK_PARAM(BM_ContentionStdSet, 1024);
BENCHMARK_PARAM(BM_ContentionCSL, 1024); BENCHMARK_PARAM(BM_ContentionCSL, 1024);
......
...@@ -111,7 +111,7 @@ TEST(PackedSyncPtr, Application) { ...@@ -111,7 +111,7 @@ TEST(PackedSyncPtr, Application) {
} }
for (auto& kv : map) { 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; std::set<intptr_t> idsFound;
for (auto& elem : kv.second) { for (auto& elem : kv.second) {
EXPECT_TRUE(idsFound.insert(elem).second); // check for dups EXPECT_TRUE(idsFound.insert(elem).second); // check for dups
......
...@@ -155,7 +155,7 @@ std::atomic<int32_t> globalInt32Baseline(0); ...@@ -155,7 +155,7 @@ std::atomic<int32_t> globalInt32Baseline(0);
__thread int64_t global__thread64; __thread int64_t global__thread64;
__thread int32_t global__thread32; __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. // but uses about 20x more memory than ThreadCachedInt with 24 threads.
struct ShardedAtomicInt { struct ShardedAtomicInt {
static const int64_t kBuckets_ = 2048; static const int64_t kBuckets_ = 2048;
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment