Merge pull request #1233 from kilobyte/codespell

typo fixes

Author: lukaszstolarczuk

.github/workflows/weekly.yml

@@ -37,7 +37,7 @@ jobs:
       - name: Clone the git repo
         uses: actions/checkout@v2
 
-      # It rebuilds images every time (push is not neccessary; they are pushed in other workflows)
+      # It rebuilds images every time (push is not necessary; they are pushed in other workflows)
       - name: Rebuild the image
         run: cd $WORKDIR && ${{ matrix.CONFIG }} ./pull-or-rebuild-image.sh rebuild
 

benchmarks/radix/radix_tree.cpp

@@ -89,7 +89,7 @@ gen_keys(size_t count)
 	std::vector<size_t> ret;
 	ret.reserve(count);
 	for (size_t i = 0; i < count; ++i) {
-		/* only even keys will be insterted */
+		/* only even keys will be inserted */
 		key = static_cast<size_t>(rand());
 		key <<= 32;
 		key1 = static_cast<size_t>(rand());

examples/radix_tree/radix_tree_complex_value.cpp

@@ -101,7 +101,7 @@ insert_elements_kv(pmem::obj::pool<root> pop)
 
 	/* Update "Gdańsk" latest_update_date field.
 	 *
-	 * This code will result in only one snaphot.
+	 * This code will result in only one snapshot.
 	 */
 	pmem::obj::transaction::run(pop, [&] {
 		it->value().latest_update_date.get_rw().year = 2021;

include/libpmemobj++/experimental/atomic_persistent_aware_ptr.hpp

@@ -37,7 +37,7 @@ namespace experimental
  *		are expected it's probably better to use this scenario.
  *  - Write-optimized - data is lazily flushed with a read operation. In this
  *		approach data storing is expected to be faster, but data is
- *guranteed to be flushed only after consequent read.
+ *		guaranteed to be flushed only after consequent read.
  */
 template <typename T, typename ReadOptimized>
 struct atomic_persistent_aware_ptr {

include/libpmemobj++/experimental/concurrent_map.hpp

@@ -45,8 +45,8 @@ namespace experimental
  * requires runtime_initialize() to be called in order to restore the map state
  * after process restart.
  *
- * Key, Value, Comp and Allcoator types should be persistent memory aware types.
- * Allocator type should satisfies the named requirements
+ * Key, Value, Comp and Allocator types should be persistent memory aware
+ * types. Allocator type should satisfy the named requirements
  * (https://en.cppreference.com/w/cpp/named_req/Allocator). The allocate() and
  * deallocate() methods are called inside transactions.
  * @ingroup experimental_containers

tests/mpsc_queue/mt.cpp

@@ -51,7 +51,7 @@ mt_test(pmem::obj::pool<root> pop, size_t concurrency)
 	std::vector<std::string> values_on_pmem;
 	parallel_exec(concurrency + 1, [&](size_t thread_id) {
 		if (thread_id == 0) {
-			/* Read data while writting */
+			/* Read data while writing */
 			while (threads_counter.load() > 0) {
 				queue.try_consume_batch(
 					[&](pmem::obj::experimental::

tests/mpsc_queue/ringbuf.cpp

@@ -27,7 +27,7 @@
 /* Copyright 2021, Intel Corporation */
 
 /*
- * ringbuf.cpp -- tests for internal implementaiton of ringbuffer used in
+ * ringbuf.cpp -- tests for internal implementation of ringbuffer used in
  * pmem::obj::experimental::mpsc_queue
  */