Increase verson number; update CHANGELOG and README

Author: kzhdev

CHANGELOG.md

@@ -0,0 +1,23 @@
+# Changelogs
+
+## [v1.0.1] - 2025-12-27
+
+### Fixed
+- Fixed extra `/` prefix being added to shared memory names on POSIX systems (Linux/macOS)
+- Fixed test failures on Linux and macOS platforms
+
+### Added
+- macOS shared memory name length validation (31 character limit including `/` prefix)
+- C++ extension support for Linux/macOS platforms with automatic fallback to native methods if unavailable
+- `atomic_store_64` and `atomic_cas_64` functions to C++ extension for improved cross-platform consistency
+
+### Changed
+- Linux/macOS now prioritize C++ extension for atomic operations, falling back to native methods (`__sync_val_compare_and_swap` or `libatomic`) if extension is not available
+- Improved atomic operation reliability across all platforms
+- Enhanced test suite for better cross-platform compatibility
+
+## [v1.0.0] - 2025-12-26
+
+- Initial release
+- Python implementation of SlickQueue - a lock-free multi-producer multi-consumer (MPMC) queue with C++ interoperability through shared memory.
+- Windows, Linux, and macOS support

README.md

@@ -140,7 +140,7 @@ def consumer_worker(q, cursor, worker_id, results):
     items_processed = 0
     while True:
         # Atomically claim next item (work-stealing)
-        data, size = q.read(cursor)
+        data, size, index = q.read(cursor)
 
         if data is None:
             break  # No more data
@@ -196,7 +196,7 @@ def consumer_worker(queue_name, cursor_name, worker_id):
     items_processed = 0
     while True:
         # Atomically claim next item (work-stealing)
-        data, size = q.read(cursor)
+        data, size, index = q.read(cursor)
 
         if data is None:
             break  # No more data
@@ -404,7 +404,7 @@ data, size, read_index = q.read(read_index)
 # Python multi-consumer (atomic cursor)
 from slick_queue_py import AtomicCursor
 cursor = AtomicCursor(cursor_shm.buf, 0)
-data, size = q.read(cursor)  # Atomically claim next item
+data, size, index = q.read(cursor)  # Atomically claim next item
 
 # C++ (updates by reference for both)
 auto [data, size] = queue.read(read_index);  // read_index modified in-place
@@ -431,7 +431,7 @@ cursor.store(0)
 
 # Multiple threads can share this cursor
 while True:
-    data, size = q.read(cursor)  # Each thread atomically claims items
+    data, size, index = q.read(cursor)  # Each thread atomically claims items
     if data is not None:
         process(data)
 ```
@@ -448,7 +448,7 @@ cursor.store(0)
 
 # Multiple processes can share this cursor
 while True:
-    data, size = q.read(cursor)  # Each process atomically claims items
+    data, size, index = q.read(cursor)  # Each process atomically claims items
     if data is not None:
         process(data)
 ```

atomic_ops.py

@@ -21,7 +21,7 @@
 """
 from __future__ import annotations
 
-__version__ = '1.0.0'
+__version__ = '1.0.1'
 
 import sys
 import struct

slick_queue_py.py

@@ -20,7 +20,7 @@
 """
 from __future__ import annotations
 
-__version__ = '1.0.0'
+__version__ = '1.0.1'
 
 import struct
 import sys