Release 1.0.2

CHANGELOG.md

@@ -1,5 +1,9 @@
 # Changelog
 
+## 1.0.2
+- Made all class members accidentally public private
+- Small doc fixes
+
 ## 1.0.1
 
 - Added static asserts to verify the template type arguments are trivial types

CMakeLists.txt

@@ -4,7 +4,7 @@
 cmake_minimum_required(VERSION 3.16)
 
 project(lockfree
-    VERSION 1.0.1
+    VERSION 1.0.2
     LANGUAGES CXX
 )
 

lockfree/inc/bipartite_buf.hpp

@@ -5,7 +5,7 @@
  * microcontrollers to HPC machines.
  * Lock-free for single consumer single producer scenarios.
  * @version	1.2.0
- * @date 11. May 2023
+ * @date 18. May 2023
  * @author Djordje Nedic
  **************************************************************/
 
@@ -37,7 +37,7 @@
  * This file is part of lockfree
  *
  * Author:          Djordje Nedic <[email protected]>
- * Version:         v1.0.1
+ * Version:         v1.0.2
  **************************************************************/
 
 /************************** INCLUDE ***************************/

lockfree/inc/bipartite_buf_impl.hpp

@@ -5,7 +5,7 @@
  * to HPC machines. Lock-free for single consumer single
  * producer scenarios.
  * @version	1.2.0
- * @date 11. May 2023
+ * @date 18. May 2023
  * @author Djordje Nedic
  **************************************************************/
 
@@ -37,7 +37,7 @@
  * This file is part of lockfree
  *
  * Author:          Djordje Nedic <[email protected]>
- * Version:         v1.0.1
+ * Version:         v1.0.2
  **************************************************************/
 
 /************************** INCLUDE ***************************/

lockfree/inc/lockfree.hpp

@@ -3,8 +3,8 @@
  * @brief A collection of lock free data structures written in
  * standard c++11 suitable for all systems, from low-end
  * microcontrollers to HPC machines.
- * @version	1.0.1
- * @date 11. May 2023
+ * @version	1.0.2
+ * @date 18. May 2023
  * @author Djordje Nedic
  **************************************************************/
 
@@ -36,7 +36,7 @@
  * This file is part of lockfree
  *
  * Author:          Djordje Nedic <[email protected]>
- * Version:         v1.0.1
+ * Version:         v1.0.2
  **************************************************************/
 
 /************************** DEFINE ****************************/
@@ -51,6 +51,6 @@
 
 /************************** INCLUDE ***************************/
 
+#include "bipartite_buf.hpp"
 #include "queue.hpp"
 #include "ring_buf.hpp"
-#include "bipartite_buf.hpp"

lockfree/inc/queue.hpp

@@ -4,8 +4,8 @@
  * suitable for both low-end microcontrollers all the way
  * to HPC machines. Lock-free for single consumer single
  * producer scenarios.
- * @version	1.0.1
- * @date 11. May 2023
+ * @version	1.0.2
+ * @date 18. May 2023
  * @author Djordje Nedic
  **************************************************************/
 
@@ -37,7 +37,7 @@
  * This file is part of lockfree
  *
  * Author:          Djordje Nedic <[email protected]>
- * Version:         v1.0.1
+ * Version:         v1.0.2
  **************************************************************/
 
 /************************** INCLUDE ***************************/

lockfree/inc/queue_impl.hpp

@@ -4,8 +4,8 @@
  * suitable for both low-end microcontrollers all the way
  * to HPC machines. Lock-free for single consumer single
  * producer scenarios.
- * @version	1.0.1
- * @date 11. May 2023
+ * @version	1.0.2
+ * @date 18. May 2023
  * @author Djordje Nedic
  **************************************************************/
 
@@ -37,16 +37,14 @@
  * This file is part of lockfree
  *
  * Author:          Djordje Nedic <[email protected]>
- * Version:         v1.0.1
+ * Version:         v1.0.2
  **************************************************************/
 
 /********************** PUBLIC METHODS ************************/
 
-template <typename T, size_t size>
-Queue<T, size>::Queue() : _r(0U), _w(0U) {}
+template <typename T, size_t size> Queue<T, size>::Queue() : _r(0U), _w(0U) {}
 
-template <typename T, size_t size>
-bool Queue<T, size>::Push(const T &element) {
+template <typename T, size_t size> bool Queue<T, size>::Push(const T &element) {
     /* Preload indexes with adequate memory ordering */
     const size_t w = _w.load(std::memory_order_relaxed);
     const size_t r = _r.load(std::memory_order_acquire);

lockfree/inc/ring_buf.hpp

@@ -4,8 +4,8 @@
  * c++11 suitable for both low-end microcontrollers all the way
  * to HPC machines. Lock-free for single consumer single
  * producer scenarios.
- * @version	1.0.1
- * @date 11. May 2023
+ * @version	1.0.2
+ * @date 18. May 2023
  * @author Djordje Nedic
  **************************************************************/
 
@@ -37,7 +37,7 @@
  * This file is part of lockfree
  *
  * Author:          Djordje Nedic <[email protected]>
- * Version:         v1.0.1
+ * Version:         v1.0.2
  **************************************************************/
 
 /************************** INCLUDE ***************************/

lockfree/inc/ring_buf_impl.hpp

@@ -4,8 +4,8 @@
  * c++11 suitable for both low-end microcontrollers all the way
  * to HPC machines. Lock-free for single consumer single
  * producer scenarios.
- * @version	1.0.1
- * @date 11. May 2023
+ * @version	1.0.2
+ * @date 18. May 2023
  * @author Djordje Nedic
  **************************************************************/
 
@@ -37,7 +37,7 @@
  * This file is part of lockfree
  *
  * Author:          Djordje Nedic <[email protected]>
- * Version:         v1.0.1
+ * Version:         v1.0.2
  **************************************************************/
 
 /********************** PUBLIC METHODS ************************/
@@ -175,7 +175,7 @@ template <typename T, size_t size> size_t RingBuf<T, size>::GetFree() const {
 template <typename T, size_t size>
 size_t RingBuf<T, size>::GetAvailable() const {
     const size_t r = _r.load(std::memory_order_relaxed);
-    const size_t w = _w.load(std::memory_order_acquire);    
+    const size_t w = _w.load(std::memory_order_acquire);
 
     return CalcAvailable(w, r);
 }