misc:

- Explicit memset/memcpy ignored return value
- One statement per line refactoring
- MD files formatting

Author: SMFSW

ReleaseNotes.md

@@ -1,56 +1,70 @@
-Queue handling library (designed on Arduino)
+# Queue handling library (designed on Arduino)
+
 2017-2026 SMFSW
 
-Feel free to share your thoughts @ [email protected] about:
-	- issues encountered
-	- optimizations
-	- improvements & new functionalities
+Feel free to share your thoughts @ <[email protected]> about:
+
+- issues encountered
+- optimizations
+- improvements & new functionalities
 
 ------------
 
 ** Actual:
 
-v2.1:	02 Jan 2026:
+v2.1: (02 Jan 2026):
+
 - Internal functions name refactoring
 - Unused tags removal
 - always_inline attribute removal for index manipulation functions
 - c-cast updated to cpp static_cast
 - Legacy standard library headers replaced by their cpp equivalents
 - const qualifiers for getter functions
+- Explicit memset/memcpy ignored return value
+- One statement per line refactoring
+- MD files formatting
+
+v2.0: (15 Apr 2024):
 
-v2.0:	15 Apr 2024:
 - No more inlines in header file (to generate proper static library)
 - MISRA refactoring
 
-v1.11:	18 Dec 2022:
+v1.11: (18 Dec 2022):
+
 - Include missing stddef.h
 
-v1.10:	15 Nov 2022:
+v1.10: (15 Nov 2022):
+
 - SimpleQueueStatic.ino example added
 - Constructor parameters added to setup a queue from statically allocated data area
 - Constructor refactoring for consistency and robustness (when using queue functions regardless init performed with success)
 - Doxyfiles update
 - Outdated travisCI status in README.md removed
 - LICENSE years update
 
-v1.9.1:	14 Jan 2021:
+v1.9.1: (14 Jan 2021):
+
 - SerialQueue.ino example added
 
-v1.9:	4 Nov 2020:
+v1.9: (4 Nov 2020):
+
 - Queue class renamed to cppQueue
 
-v1.8:	4 Nov 2019:
+v1.8: (4 Nov 2019):
+
 - const qualifiers added where missing
 - Added peekIdx and peekPrevious methods
 - Added related examples
 
-v1.7:	2 Jun 2019:
-- Fixed README.md thanks to @reydelleon
+v1.7: (2 Jun 2019):
+
+- Fixed README.md thanks to [\@reydelleon](https://github.com/reydelleon)
 - INC_IDX & DEC_IDX macros changed to inlines
 - Added nonnull function attribute where needed
 - Updated Doxyfile
 
-v1.6	26 May 2018:
+v1.6 (26 May 2018):
+
 - Constructor does not check anymore if class instance is already allocated (as it supposedly isn't)
 - Added getRemainingCount inline returning how much records are left in the queue
 - Added sizeOf inline to check full queue size in byte (may also be used to check if queue has been allocated properly)
@@ -60,28 +74,34 @@ v1.6	26 May 2018:
 - Updated README.md
 - Added more example sketches & updated LibTst example using latest inlines additions
 
-v1.5	14 March 2018:
+v1.5 (14 March 2018):
+
 - Added isInitialized inline to be able to check after init if queue has been properly allocated
 - Added flush inline (to have the same functions as in cQueue library)
 - LIFO peek temporary variable is uint16_t (same type as in variable)
 - Comments fixes
 
-v1.4	21 November 2017:
+v1.4 (21 November 2017):
+
 - Added const qualifier for function parameters
 
-v1.3	12 July 2017:
+v1.3 (12 July 2017):
+
 - #2 fix for esp8266: renamed cpp/h files : header name already used in compiler sys includes
 - examples updated with new header file name (cppQueue.h)
 - comply with Arduino v1.5+ IDE source located in src subfolder
 
-v1.2	07 July 2017:
+v1.2 (07 July 2017):
+
 - #1 added pull inline for compatibility with older versions (v1.0)
 - #2 surrounded c libs with extern C
 
-v1.1	06 July 2017:
+v1.1 (06 July 2017):
+
 - pop keyword used (instead of pull)
 - peek & drop functions added
 - examples updated to reflect latest changes
 
-v1.0	22 March 2017:
+v1.0 (22 March 2017):
+
 - First release

src/cppQueue.cpp

@@ -27,8 +27,14 @@
 **/
 static inline void __attribute__((nonnull)) cppq_inc_idx(uint16_t * const pIdx, const uint16_t end, const uint16_t start)
 {
-	if (*pIdx < (end - 1U))	{ (*pIdx)++; }
-	else					{ *pIdx = start; }
+	if (*pIdx < (end - 1U))
+	{
+		(*pIdx)++;
+	}
+	else
+	{
+		*pIdx = start;
+	}
 }
 
 /*!	\brief Decrement index
@@ -39,8 +45,14 @@ static inline void __attribute__((nonnull)) cppq_inc_idx(uint16_t * const pIdx,
 **/
 static inline void __attribute__((nonnull)) cppq_dec_idx(uint16_t * const pIdx, const uint16_t end, const uint16_t start)
 {
-	if (*pIdx > start)		{ (*pIdx)--; }
-	else					{ *pIdx = end - 1U; }
+	if (*pIdx > start)
+	{
+		(*pIdx)--;
+	}
+	else
+	{
+		*pIdx = end - 1U;
+	}
 }
 
 
@@ -81,18 +93,26 @@ inline uint16_t __attribute__((always_inline)) cppQueue::_getCount(void) const {
 /************************/
 cppQueue::cppQueue(const size_t size_rec, const uint16_t nb_recs, const cppQueueType type, const bool overwrite, void * const pQDat, const size_t lenQDat)
 {
+	flush();					// variables needs to be 0 to ensure proper functions behavior when queue is not allocated
 	init = 0;
-	rec_nb = 0;		// rec_nb needs to be 0 to ensure proper push behavior when queue is not allocated
-	ovw = false;	// ovw needs to be false to ensure proper push behavior when queue is not allocated
-	flush();		// other variables needs to be 0 to ensure proper functions behavior when queue is not allocated
+	rec_nb = 0;					// rec_nb needs to be 0 to ensure proper push behavior when queue is not allocated
+	ovw = false;				// ovw needs to be false to ensure proper push behavior when queue is not allocated
+	dynamic = (pQDat == NULL);
 
 	const size_t size = nb_recs * size_rec;
 
-	dynamic = (pQDat == NULL);
-
-	if (dynamic)				{ queue = static_cast<uint8_t *>(malloc(size)); }
-	else if (lenQDat >= size)	{ queue = static_cast<uint8_t *>(pQDat); }
-	else						{ queue = NULL; }
+	if (dynamic)
+	{
+		queue = static_cast<uint8_t *>(malloc(size));
+	}
+	else if (lenQDat >= size)
+	{
+		queue = static_cast<uint8_t *>(pQDat);
+	}
+	else
+	{
+		queue = NULL;
+	}
 
 	if (queue != NULL)
 	{
@@ -108,7 +128,10 @@ cppQueue::cppQueue(const size_t size_rec, const uint16_t nb_recs, const cppQueue
 
 cppQueue::~cppQueue()
 {
-	if (_isInitialized() && dynamic && (queue != NULL))	{ free(queue); }
+	if (_isInitialized() && dynamic && (queue != NULL))
+	{
+		free(queue);
+	}
 }
 
 
@@ -147,7 +170,7 @@ bool __attribute__((nonnull)) cppQueue::push(const void * const record)
 	if (ret)
 	{
 		uint8_t * const pStart = queue + (rec_sz * in);
-		memcpy(pStart, record, rec_sz);
+		(void) memcpy(pStart, record, rec_sz);
 		cppq_inc_idx(&in, rec_nb, 0);
 	}
 
@@ -177,7 +200,7 @@ bool __attribute__((nonnull)) cppQueue::pop(void * const record)
 			pStart = queue + (rec_sz * in);
 		}
 
-		memcpy(record, pStart, rec_sz);
+		(void) memcpy(record, pStart, rec_sz);
 		cnt--;	// Decrease records count
 	}
 
@@ -209,7 +232,7 @@ bool __attribute__((nonnull)) cppQueue::peek(void * const record)
 			pStart = queue + (rec_sz * rec);
 		}
 
-		memcpy(record, pStart, rec_sz);
+		(void) memcpy(record, pStart, rec_sz);
 	}
 
 	return ret;
@@ -263,7 +286,7 @@ bool __attribute__((nonnull)) cppQueue::peekIdx(void * const record, const uint1
 			pStart = queue + (rec_sz * idx);
 		}
 
-		memcpy(record, pStart, rec_sz);
+		(void) memcpy(record, pStart, rec_sz);
 	}
 
 	return ret;