Fix doxygen warnings which were failing the CI.

Author: ned14

Doxyfile

@@ -229,9 +229,9 @@ TAB_SIZE               = 2
 # newlines.
 
 ALIASES                = "errors=@par Errors returnable\n" "mallocs=@par Memory Allocations\n" \
-			"raceguarantees{1}=@par Race Guarantees\n\1" \
-			"complexity{1}=@par Complexity\n\1" \
-      "exceptionmodel{1}=@par Errors returnable\n\1"
+			"raceguarantees{1}=@par Race Guarantees^^\1" \
+			"complexity{1}=@par Complexity^^\1" \
+      "exceptionmodel{1}=@par Errors returnable^^\1"
 
 # This tag can be used to specify a number of word-keyword mappings (TCL only).
 # A mapping has the form "name=value". For example adding "class=itcl::class"

include/quickcpplib/algorithm/bit_interleave.hpp

@@ -30,7 +30,7 @@ Distributed under the Boost Software License, Version 1.0.
 #include <cstdint>
 #include <type_traits>
 
-#if 0 //defined(__AVX__) || defined(__SSE4_1__) || defined(__SSSE3__)
+#if 0                   // defined(__AVX__) || defined(__SSE4_1__) || defined(__SSSE3__)
 #include <tmmintrin.h>  // for _mm_shuffle_epi8
 #endif
 
@@ -86,7 +86,7 @@ namespace algorithm
 #pragma warning(disable : 4310)  // cast truncates constant value
 #pragma warning(disable : 4333)  // right shift by too large amount
 #endif
-    /*! \brief Interleaves the bits of \emph a and \emph b.
+    /*! \brief Interleaves the bits of \em a and \em b.
 
     On my Intel i7-8565u laptop able to boost to 4.6Ghz:
 
@@ -97,7 +97,7 @@ namespace algorithm
     QUICKCPPLIB_TREQUIRES(QUICKCPPLIB_TPRED(std::is_unsigned<T>::value))
     inline R bit_interleave(T a, T b) noexcept
     {
-#if 0 // defined(__AVX__) || defined(__SSE4_1__) || defined(__SSSE3__)
+#if 0  // defined(__AVX__) || defined(__SSE4_1__) || defined(__SSSE3__)
       /* https://lemire.me/blog/2018/01/09/how-fast-can-you-bit-interleave-32-bit-integers-simd-edition/
       says that AVX is considerably faster than the SSSE3 bit interleave if you need to interleave two 128
       bit values into a 256 bit value, but we don't support that here yet.
@@ -141,9 +141,10 @@ namespace algorithm
     inline bit_deinterleave_result<R> bit_deinterleave(T x) noexcept
     {
       constexpr T /* mask32 = T(0x00000000ffffffff), */ mask16 = T(0x0000ffff0000ffff),
-                  mask8 = T(0x00ff00ff00ff00ff) /* 0000 0000 1111 1111 */,
-                  mask4 = T(0x0f0f0f0f0f0f0f0f) /* 0000 1111 */, mask2 = T(0x3333333333333333) /* 0011 0011 */,
-                  mask1 = T(0x5555555555555555) /* 0101 0101 */;
+                                                        mask8 = T(0x00ff00ff00ff00ff) /* 0000 0000 1111 1111 */,
+                                                        mask4 = T(0x0f0f0f0f0f0f0f0f) /* 0000 1111 */,
+                                                        mask2 = T(0x3333333333333333) /* 0011 0011 */,
+                                                        mask1 = T(0x5555555555555555) /* 0101 0101 */;
       T ret1 = x & mask1, ret2 = (x >> 1) & mask1;
       ret1 = (ret1 ^ (ret1 >> 1)) & mask2;
       ret2 = (ret2 ^ (ret2 >> 1)) & mask2;

include/quickcpplib/revision.hpp

@@ -1,4 +1,4 @@
 // Note the second line of this file must ALWAYS be the git SHA, third line ALWAYS the git SHA update time
-#define QUICKCPPLIB_PREVIOUS_COMMIT_REF    659f470cec041df6c7d74c5786d9c518dc42263e
-#define QUICKCPPLIB_PREVIOUS_COMMIT_DATE   "2025-07-09 14:47:44 +00:00"
-#define QUICKCPPLIB_PREVIOUS_COMMIT_UNIQUE 659f470c
+#define QUICKCPPLIB_PREVIOUS_COMMIT_REF    dbc0d662c801806acb2341308217f596fa80d20a
+#define QUICKCPPLIB_PREVIOUS_COMMIT_DATE   "2025-12-16 17:25:20 +00:00"
+#define QUICKCPPLIB_PREVIOUS_COMMIT_UNIQUE dbc0d662

include/quickcpplib/signal_guard.hpp

@@ -628,8 +628,7 @@ namespace signal_guard
     `true` if execution is to resume, `false` if the next decider function should be called.
     Note that on Windows only, `signalc::interrupt` and `signalc::process_terminate` call `f` from some other
     kernel thread, and the return value is always treated as `false`.
-    \param callfirst True if this decider should be called before any other. Otherwise
-    call order is in the order of addition.
+    \param ms The number of milliseconds before invoking the callable.
     */
     QUICKCPPLIB_TEMPLATE(class U)
     QUICKCPPLIB_TREQUIRES(QUICKCPPLIB_TPRED(std::is_constructible<T, U>::value), QUICKCPPLIB_TEXPR(std::declval<U>()()))