Rename queue_t -> queue_tm

Author: polytypic

README.md

@@ -15,8 +15,8 @@ work like a natural part of C++ and a portable implementation that can be used
 today for prototyping parallel algorithms using transactional memory.
 
 See [`synopsis.hpp`](provides/include/trade_v1/synopsis.hpp) for the API and
-[`queue.hpp`](internals/include/testing/queue.hpp) for a transactional queue
-implementation written for testing purposes.
+[`queue_tm.hpp`](internals/include/testing/queue_tm.hpp) for a transactional
+queue implementation written for testing purposes.
 
 ## <a id="contents"></a> [≡](#contents) [Contents](#contents)
 
@@ -190,7 +190,7 @@ For example, a transactional dynamic queue data structure could be defined with
 the help of `std::shared_ptr` as
 
 ```c++
-template <class Value> struct queue_t {
+template <class Value> struct queue_tm {
   using value_t = Value;
   // ...
 private:

internals/include/testing/queue.hpp renamed to internals/include/testing/queue_tm.hpp

@@ -11,13 +11,13 @@
 namespace testing {
 
 /// A transactional queue for testing purposes.
-template <class Value> struct queue_t {
+template <class Value> struct queue_tm {
   using value_t = Value;
 
-  queue_t() = default;
+  queue_tm() = default;
 
-  queue_t(const queue_t &) = delete;
-  queue_t &operator=(const queue_t &) = delete;
+  queue_tm(const queue_tm &) = delete;
+  queue_tm &operator=(const queue_tm &) = delete;
 
   size_t size() {
     return trade::atomically(trade::assume_readonly, [&]() {
@@ -104,6 +104,6 @@ template <class Value> struct queue_t {
   trade::atom<std::shared_ptr<node_t>> m_last;
 };
 
-template <class Value> std::atomic<size_t> queue_t<Value>::s_live_nodes = 0;
+template <class Value> std::atomic<size_t> queue_tm<Value>::s_live_nodes = 0;
 
 } // namespace testing

internals/testing/dynamic_test.cpp

@@ -1,4 +1,4 @@
-#include "testing/queue.hpp"
+#include "testing/queue_tm.hpp"
 
 #include "testing_v1/test.hpp"
 
@@ -17,7 +17,7 @@ auto dynamic_test = test([]() {
 
   atom<size_t> n_threads_started = 0, n_threads_stopped = 0;
 
-  queue_t<int> queues[2];
+  queue_tm<int> queues[2];
 
   constexpr size_t n_values = 10;
   for (size_t i = 0; i < n_values; ++i)
@@ -35,8 +35,8 @@ auto dynamic_test = test([]() {
       while (n) {
         int r = std::rand();
 
-        queue_t<int> &q1 = queues[r & 1];
-        queue_t<int> &q2 = queues[(r & 2) >> 1];
+        queue_tm<int> &q1 = queues[r & 1];
+        queue_tm<int> &q2 = queues[(r & 2) >> 1];
 
         // Here we perform a composed transaction that tries to move a value
         // from one queue to (possibly) another queue atomically:
@@ -85,7 +85,7 @@ auto dynamic_test = test([]() {
     verify(values[i] == static_cast<int>(i));
 
   {
-    queue_t<int> q;
+    queue_tm<int> q;
     q.push_back(1);
 
     {
@@ -120,5 +120,5 @@ auto dynamic_test = test([]() {
     verify(0 == q.size());
   }
 
-  verify(!queue_t<int>::s_live_nodes);
+  verify(!queue_tm<int>::s_live_nodes);
 });

internals/testing/retry_test.cpp

@@ -1,4 +1,4 @@
-#include "testing/queue.hpp"
+#include "testing/queue_tm.hpp"
 
 #include "testing_v1/test.hpp"
 
@@ -10,7 +10,7 @@ using namespace trade_v1;
 using namespace testing;
 
 auto retry_test = test([]() {
-  queue_t<size_t> queues[2];
+  queue_tm<size_t> queues[2];
 
   queues[0].push_back(0);