foundational_lib 1.0 → 1.0.1

data/tests/test_log.txt

@@ -211,15 +211,15 @@ Frozenset | The value for 'banana' is: 1
 Frozenset | The value for 'apple' is: 1
 Frozenset | Frozenset size is 3
 Test 50 - randomness.
-cherry
+banana
+banana
 apple
-elderberry
 apple
-banana
-date
-date
 date
+apple
 banana
+cherry
+elderberry
 banana
 Test 52
 3 size set should be. 3 <=> 3.
@@ -273,7 +273,7 @@ dict destroyed test52
 Reading words file into array.
 /usr/share/dict/words is 104335 lines and we can efficiently play around with it in a more easy fashion than Python.
 Shuffling words
-Randomly chosen word is "teaspoonful's". Randomly chosen word is "Cochise's". Randomly chosen word is "renounced". Randomly chosen word is "own". Randomly chosen word is "household". Randomly chosen word is "renovator". Randomly chosen word is "cast's". Randomly chosen word is "philanthropist". Randomly chosen word is "hum". Randomly chosen word is "exemplar's". Randomly chosen word is "cheesecloth's". Randomly chosen word is "tippler". Randomly chosen word is "apostasy's". Randomly chosen word is "parties". Randomly chosen word is "Nova". Randomly chosen word is "quashed". Randomly chosen word is "tats". Randomly chosen word is "sterilization". Randomly chosen word is "painless". Randomly chosen word is "hankerings". Randomly chosen word is "reportedly". Randomly chosen word is "wanderlusts". Randomly chosen word is "forge". Randomly chosen word is "Slovak". Randomly chosen word is "cocoa". Randomly chosen word is "Attic's". Randomly chosen word is "nonproductive". Randomly chosen word is "burnouts". Randomly chosen word is "erupting". Randomly chosen word is "unwisest". Randomly chosen word is "crossfire". Randomly chosen word is "carrousels". Randomly chosen word is "babes". Randomly chosen word is "bursar". Randomly chosen word is "commentates". Randomly chosen word is "redounded". Randomly chosen word is "Confederate's". Randomly chosen word is "panacea's". Randomly chosen word is "Cantu's". Randomly chosen word is "Avery". Randomly chosen word is "nutshell". Randomly chosen word is "króna's". Randomly chosen word is "bristly". Randomly chosen word is "substratum's". Randomly chosen word is "Frankie's". Randomly chosen word is "soft". Randomly chosen word is "reconnects". Randomly chosen word is "specifications". Randomly chosen word is "dusk". Randomly chosen word is "mustang's". Randomly chosen word is "knocker". Randomly chosen word is "Faustian's". Randomly chosen word is "Lamont's". Randomly chosen word is "nibble's". Randomly chosen word is "Multics". Randomly chosen word is "gambler". Randomly chosen word is "Asunción's". Randomly chosen word is "Jan's". Randomly chosen word is "truncheon's". Randomly chosen word is "Elizabethan". Randomly chosen word is "photoing". Randomly chosen word is "adjoining". Randomly chosen word is "reviler's". Randomly chosen word is "confidence's". Randomly chosen word is "Pabst's". Randomly chosen word is "antigen". Randomly chosen word is "penis". Randomly chosen word is "Miami". Randomly chosen word is "Ebeneezer's". Randomly chosen word is "BA". Randomly chosen word is "sloshed". Randomly chosen word is "venomous". Randomly chosen word is "idiocies". Randomly chosen word is "blintzes". Randomly chosen word is "recompense's". Randomly chosen word is "anguished". Randomly chosen word is "Eddie's". Randomly chosen word is "aristocratically". Randomly chosen word is "showcasing". Randomly chosen word is "blockhead's". Randomly chosen word is "missionaries". Randomly chosen word is "gathered". Randomly chosen word is "dishonors". Randomly chosen word is "overhanging". Randomly chosen word is "treetop". Randomly chosen word is "chanter's". Randomly chosen word is "desperate". Randomly chosen word is "torturing". Randomly chosen word is "Antoinette's". Randomly chosen word is "Mathewson's". Randomly chosen word is "cutlass". Randomly chosen word is "amaranth's". Randomly chosen word is "Mongolia". Randomly chosen word is "cabbie's". Randomly chosen word is "vocalizing". Randomly chosen word is "sarong's". Randomly chosen word is "widening". Randomly chosen word is "nuthatches". Randomly chosen word is "Sevastopol". Randomly chosen word is "cowgirls". Randomly chosen word is "metabolizing". Randomly chosen word is "bloodiest". Randomly chosen word is "hotcake". Randomly chosen word is "conqueror". Randomly chosen word is "stagflation's". Randomly chosen word is "turnabout". Randomly chosen word is "cooker". Randomly chosen word is "fretting". Randomly chosen word is "gruffness's". Randomly chosen word is "days". Randomly chosen word is "witchery". Randomly chosen word is "capitulated". 
+Randomly chosen word is "Melody". Randomly chosen word is "Gray's". Randomly chosen word is "lewdest". Randomly chosen word is "bridge's". Randomly chosen word is "Kwangju". Randomly chosen word is "howlers". Randomly chosen word is "database". Randomly chosen word is "tweet's". Randomly chosen word is "did". Randomly chosen word is "traveller's". Randomly chosen word is "harmless". Randomly chosen word is "hunter's". Randomly chosen word is "Tanisha's". Randomly chosen word is "destructive". Randomly chosen word is "homestead". Randomly chosen word is "oddity's". Randomly chosen word is "cockily". Randomly chosen word is "egalitarianism". Randomly chosen word is "stingily". Randomly chosen word is "harmonicas". Randomly chosen word is "squeaky". Randomly chosen word is "segregating". Randomly chosen word is "voltage's". Randomly chosen word is "pining". Randomly chosen word is "sanding". Randomly chosen word is "businessman's". Randomly chosen word is "deportation's". Randomly chosen word is "shoplifting's". Randomly chosen word is "financier". Randomly chosen word is "continuation". Randomly chosen word is "remarkably". Randomly chosen word is "blockchains". Randomly chosen word is "opiate". Randomly chosen word is "Bowers". Randomly chosen word is "chaperones". Randomly chosen word is "sorter's". Randomly chosen word is "callipering". Randomly chosen word is "ageing's". Randomly chosen word is "holdovers". Randomly chosen word is "Mexican's". Randomly chosen word is "dislike". Randomly chosen word is "tertiary". Randomly chosen word is "monolith's". Randomly chosen word is "reverse". Randomly chosen word is "prod's". Randomly chosen word is "intern". Randomly chosen word is "compact's". Randomly chosen word is "concatenating". Randomly chosen word is "pendulous". Randomly chosen word is "ventured". Randomly chosen word is "folk". Randomly chosen word is "Los". Randomly chosen word is "inspiration's". Randomly chosen word is "deerskin". Randomly chosen word is "disillusionment's". Randomly chosen word is "autoworkers". Randomly chosen word is "Sun". Randomly chosen word is "headwaters's". Randomly chosen word is "cannoned". Randomly chosen word is "tamarind". Randomly chosen word is "toss's". Randomly chosen word is "Chan's". Randomly chosen word is "sojourning". Randomly chosen word is "camcorders". Randomly chosen word is "dimension". Randomly chosen word is "diadem's". Randomly chosen word is "Reuther". Randomly chosen word is "ventures". Randomly chosen word is "Coventry's". Randomly chosen word is "respirator". Randomly chosen word is "plumper". Randomly chosen word is "circlet's". Randomly chosen word is "tarnished". Randomly chosen word is "redefinition". Randomly chosen word is "primate's". Randomly chosen word is "constitutional's". Randomly chosen word is "tamped". Randomly chosen word is "dribbling". Randomly chosen word is "lunches". Randomly chosen word is "mistakenly". Randomly chosen word is "unbars". Randomly chosen word is "Toby's". Randomly chosen word is "London's". Randomly chosen word is "grandparents". Randomly chosen word is "Buber". Randomly chosen word is "telemetry". Randomly chosen word is "Bantu's". Randomly chosen word is "archbishop". Randomly chosen word is "caption's". Randomly chosen word is "vernal". Randomly chosen word is "oxygenation". Randomly chosen word is "wimp's". Randomly chosen word is "amnesty's". Randomly chosen word is "river's". 
 Test 54.
 Test 1 passes.
 Test 2 passes.
@@ -327,11 +327,11 @@ i = 900000, size [899999 => 8398932]
 i = 950000, size [949999 => 8398932]
 i = 1000000, size [999999 => 8398932]
 All tests passed!
-==2820653== Memcheck, a memory error detector
-==2820653== Copyright (C) 2002-2017, and GNU GPL'd, by Julian Seward et al.
-==2820653== Using Valgrind-3.18.1 and LibVEX; rerun with -h for copyright info
-==2820653== Command: ./lib_and_tests
-==2820653== 
+==8291== Memcheck, a memory error detector
+==8291== Copyright (C) 2002-2017, and GNU GPL'd, by Julian Seward et al.
+==8291== Using Valgrind-3.18.1 and LibVEX; rerun with -h for copyright info
+==8291== Command: ./lib_and_tests
+==8291== 
 Allocation works.
 "Line one"
 "Line two line two"
@@ -652,20 +652,20 @@ Words file 2 is 985084
 Words file 3 is 985084
 Words file 4 is 985084
 All tests pass.
-==2820653== 
-==2820653== HEAP SUMMARY:
-==2820653==     in use at exit: 0 bytes in 0 blocks
-==2820653==   total heap usage: 787,211 allocs, 787,211 frees, 22,320,193 bytes allocated
-==2820653== 
-==2820653== All heap blocks were freed -- no leaks are possible
-==2820653== 
-==2820653== For lists of detected and suppressed errors, rerun with: -s
-==2820653== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0)
-==2820712== Memcheck, a memory error detector
-==2820712== Copyright (C) 2002-2017, and GNU GPL'd, by Julian Seward et al.
-==2820712== Using Valgrind-3.18.1 and LibVEX; rerun with -h for copyright info
-==2820712== Command: ./decoupled_thorough_tests
-==2820712== 
+==8291== 
+==8291== HEAP SUMMARY:
+==8291==     in use at exit: 0 bytes in 0 blocks
+==8291==   total heap usage: 787,211 allocs, 787,211 frees, 22,320,193 bytes allocated
+==8291== 
+==8291== All heap blocks were freed -- no leaks are possible
+==8291== 
+==8291== For lists of detected and suppressed errors, rerun with: -s
+==8291== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0)
+==8311== Memcheck, a memory error detector
+==8311== Copyright (C) 2002-2017, and GNU GPL'd, by Julian Seward et al.
+==8311== Using Valgrind-3.18.1 and LibVEX; rerun with -h for copyright info
+==8311== Command: ./decoupled_thorough_tests
+==8311== 
 Test 1
 First element
 First element is good.
@@ -691,15 +691,15 @@ i = 900000, size [899999 => 8398932]
 i = 950000, size [949999 => 8398932]
 i = 1000000, size [999999 => 8398932]
 All tests passed!
-==2820712== 
-==2820712== HEAP SUMMARY:
-==2820712==     in use at exit: 0 bytes in 0 blocks
-==2820712==   total heap usage: 33 allocs, 33 frees, 25,200,324 bytes allocated
-==2820712== 
-==2820712== All heap blocks were freed -- no leaks are possible
-==2820712== 
-==2820712== For lists of detected and suppressed errors, rerun with: -s
-==2820712== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0)
+==8311== 
+==8311== HEAP SUMMARY:
+==8311==     in use at exit: 0 bytes in 0 blocks
+==8311==   total heap usage: 33 allocs, 33 frees, 25,200,324 bytes allocated
+==8311== 
+==8311== All heap blocks were freed -- no leaks are possible
+==8311== 
+==8311== For lists of detected and suppressed errors, rerun with: -s
+==8311== ERROR SUMMARY: 0 errors from 0 contexts (suppressed: 0 from 0)
 Allocation works.
 "Line one"
 "Line two line two"
@@ -905,7 +905,7 @@ Printing dict values
 4. is cute
 5. barks a lot
 To a
-{man: 0x56642d13, frog: 0x56642d06, banana: 0x56642cd3, apple: 0x56642cde, cat: 0x56642cee, dog: 0x56642cf6}
+{man: 0x565f5d13, frog: 0x565f5d06, banana: 0x565f5cd3, apple: 0x565f5cde, cat: 0x565f5cee, dog: 0x565f5cf6}
 {man: walks, frog: ribbits, banana: is curved., apple: is red or green, cat: is cute, dog: barks a lot}
 Adding 1000
 dict_destructor(my_dict)

data/tools/foundationallib.h

@@ -114,7 +114,7 @@ FOUNDATIONAL_LIB_STATIC_ASSERT_MSG((sizeof(size_t) <= 8 && FOUNDATIONAL_LIB_SIZE
 
 #endif
 #ifndef FOUNDATIONAL_LIB_UNSAFE_FUNCTIONS_ENABLED
-// Default true
+/* Default true */
 #define FOUNDATIONAL_LIB_UNSAFE_FUNCTIONS_ENABLED 1
 #endif
 
@@ -330,7 +330,7 @@ FOUNDATIONAL_LIB_STATIC_ASSERT_MSG((sizeof(size_t) <= 8 && FOUNDATIONAL_LIB_SIZE
 #endif
 
 #ifndef FOUNDATIONAL_LIB_FPUTC
-#define FOUNDATIONAL_LIB_FPUTC putc
+#define FOUNDATIONAL_LIB_FPUTC fputc
 #endif
 
 #ifndef FOUNDATIONAL_LIB_STRPBRK
@@ -417,10 +417,10 @@ FOUNDATIONAL_LIB_STATIC_ASSERT_MSG((sizeof(size_t) <= 8 && FOUNDATIONAL_LIB_SIZE
 #endif
 
 #if defined(__GNUC__) || defined(__clang__)
-#define FOUNDATIONAL_LIB_likely(x) __builtin_expect(!!(x), 1)
+#define FOUNDATIONAL_LIB_LIKELY(x) __builtin_expect(!!(x), 1)
 #define FOUNDATIONAL_LIB_UNLIKELY(x) __builtin_expect(!!(x), 0)
 #else
-#define FOUNDATIONAL_LIB_likely(x) (x)
+#define FOUNDATIONAL_LIB_LIKELY(x) (x)
 #define FOUNDATIONAL_LIB_UNLIKELY(x) (x)
 #endif
 
@@ -437,9 +437,13 @@ FOUNDATIONAL_LIB_STATIC_ASSERT_MSG((sizeof(size_t) <= 8 && FOUNDATIONAL_LIB_SIZE
 #endif /* assert checking. */
 
 #ifdef __GNUC__
-/** @brief Safely multiply 2 numbers to avoid unsigned integer overflows and security and stability issues. We never, NEVER want any of those things. Ever. */
+/**
+ * @brief
+ * Safely multiply 2 numbers to avoid unsigned integer overflows and security
+ * and stability issues. We never, NEVER want any of those things. Ever.
+ */
 FOUNDATIONAL_LIB_NOTHROW
-FOUNDATIONAL_LIB_CONST
+FOUNDATIONAL_LIB_PURE
 static inline size_t FOUNDATIONAL_LIB_safe_mul(size_t a, size_t b)
 {
     size_t result;
@@ -525,9 +529,13 @@ static inline int FOUNDATIONAL_LIB_safe_add_2_ptr(size_t a, size_t b, size_t *ou
 }
 
 #else  /* GNUC */
-/** @brief Safely multiply 2 numbers to avoid unsigned integer overflows and security and stability issues. We never, NEVER want any of those things. Ever. */
+/**
+ * @brief
+ * Safely multiply 2 numbers to avoid unsigned integer overflows and security
+ * and stability issues. We never, NEVER want any of those things. Ever.
+ */
 FOUNDATIONAL_LIB_NOTHROW
-FOUNDATIONAL_LIB_CONST
+FOUNDATIONAL_LIB_PURE
 static inline size_t FOUNDATIONAL_LIB_safe_mul(size_t a, size_t b)
 {
     size_t result;
@@ -625,7 +633,6 @@ static inline int FOUNDATIONAL_LIB_safe_add_3_ptr(size_t a, size_t b, size_t c,
 
 // Adjust as needed. On embedded platforms or low memory systems, you might want to change the algorithm to be somewhat lower than 1.5x
 // new len calculations need to be checked, before and after this, for overflow.
-
 #ifndef FOUNDATIONAL_LIB_LOW_MEMORY_USAGE
 #define FOUNDATIONAL_LIB_LOW_MEMORY_USAGE 12
 #endif
@@ -2207,7 +2214,7 @@ FOUNDATIONAL_LIB_FUNC void print_short_ptr_array_to_stream(const short **array,
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         FOUNDATIONAL_LIB_FPRINTF(stream, "%d", *array[i]);
         if (i < size - 1)
@@ -2235,7 +2242,7 @@ FOUNDATIONAL_LIB_FUNC void print_ulong_array_to_stream(const unsigned long *arra
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         FOUNDATIONAL_LIB_FPRINTF(stream, "%lu", array[i]);
         if (i < size - 1)
@@ -2264,7 +2271,7 @@ FOUNDATIONAL_LIB_FUNC void print_ulong_ptr_array_to_stream(const unsigned long *
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         FOUNDATIONAL_LIB_FPRINTF(stream, "%lu", *array[i]);
         if (i < size - 1)
@@ -2291,7 +2298,7 @@ FOUNDATIONAL_LIB_FUNC void print_long_array_to_stream(const long *array, size_t
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         FOUNDATIONAL_LIB_FPRINTF(stream, "%ld", array[i]);
         if (i < size - 1)
@@ -2320,7 +2327,7 @@ FOUNDATIONAL_LIB_FUNC void print_long_ptr_array_to_stream(const long **array, si
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         FOUNDATIONAL_LIB_FPRINTF(stream, "%ld", *array[i]);
         if (i < size - 1)
@@ -2349,7 +2356,7 @@ FOUNDATIONAL_LIB_FUNC void print_ulong_long_array_to_stream(const unsigned long
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         const unsigned long long value = array[i];
         char buffer[FOUNDATIONAL_LIB_SIZE_STRING_OF_NUMBER_SIZE_PLUS_ZERO_TERMINATOR];
@@ -2382,7 +2389,7 @@ FOUNDATIONAL_LIB_FUNC void print_ulong_long_ptr_array_to_stream(const unsigned l
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         const unsigned long long value = *(array[i]);
         char buffer[FOUNDATIONAL_LIB_SIZE_STRING_OF_NUMBER_SIZE_PLUS_ZERO_TERMINATOR];
@@ -2414,7 +2421,7 @@ FOUNDATIONAL_LIB_FUNC void print_long_long_array_to_stream(const long long *arra
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         const unsigned long long value = array[i];
         char buffer[FOUNDATIONAL_LIB_SIZE_STRING_OF_NUMBER_SIZE_PLUS_ZERO_TERMINATOR];
@@ -2449,7 +2456,7 @@ FOUNDATIONAL_LIB_FUNC void print_long_long_ptr_array_to_stream(const long long *
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         const long long value = *(array[i]);
 
@@ -2482,7 +2489,7 @@ FOUNDATIONAL_LIB_FUNC void print_float_array_to_stream(const float *array, size_
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         FOUNDATIONAL_LIB_FPRINTF(stream, "%f", array[i]);
         if (i < size - 1)
@@ -2511,7 +2518,7 @@ FOUNDATIONAL_LIB_FUNC void print_float_ptr_array_to_stream(const float **array,
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         FOUNDATIONAL_LIB_FPRINTF(stream, "%f", *array[i]);
         if (i < size - 1)
@@ -2539,7 +2546,7 @@ FOUNDATIONAL_LIB_FUNC void print_double_array_to_stream(const double *array, siz
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         FOUNDATIONAL_LIB_FPRINTF(stream, "%lf", array[i]);
         if (i < size - 1)
@@ -2568,7 +2575,7 @@ FOUNDATIONAL_LIB_FUNC void print_double_ptr_array_to_stream(const double **array
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         FOUNDATIONAL_LIB_FPRINTF(stream, "%lf", *array[i]);
         if (i < size - 1)
@@ -2596,7 +2603,7 @@ FOUNDATIONAL_LIB_FUNC void print_size_t_array_to_stream(const size_t *array, siz
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
 #pragma GCC diagnostic push
 #pragma GCC diagnostic ignored "-Wpragmas"
@@ -2631,7 +2638,7 @@ FOUNDATIONAL_LIB_FUNC void print_size_t_ptr_array_to_stream(const size_t **array
 {
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_FPUTC('[', stream);
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
 #pragma GCC diagnostic push
 #pragma GCC diagnostic ignored "-Wpragmas"
@@ -2686,7 +2693,7 @@ FOUNDATIONAL_LIB_FUNC void *arraydup(const void *array, size_t num_mem, size_t s
         return NULL;
     }
 
-    for (size_t i = 0; i < tot_size; i++)
+    for (size_t i = 0; i < tot_size; ++i)
     {
         duplicate[i] = ((char *)array)[i];
     }
@@ -3659,7 +3666,7 @@ FOUNDATIONAL_LIB_FUNC char **split(const char *str, size_t *output_size, const c
     const char *ptr;
 
     /* Split the string into tokens */
-    for (size_t i = 0; i < *output_size; i++)
+    for (size_t i = 0; i < *output_size; ++i)
     {
         ptr = FOUNDATIONAL_LIB_STRSTR(token_start, delim);
 
@@ -3763,7 +3770,7 @@ FOUNDATIONAL_LIB_FUNC char *join(const char **array, size_t count, const char *d
     size_t total_length;
 
     total_length = 1; // NUL byte
-    for (size_t i = 0; i < count; i++)
+    for (size_t i = 0; i < count; ++i)
     {
         const size_t new_len = FOUNDATIONAL_LIB_STRLEN(array[i]);
         lens[i] = new_len;
@@ -4394,7 +4401,7 @@ FOUNDATIONAL_LIB_FUNC size_t array_total_string_length(char **array, size_t coun
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     size_t length = 0;
 
-    for (size_t i = 0; i < count; i++)
+    for (size_t i = 0; i < count; ++i)
     {
         // NOTE: Do not check for overflows here.
         length += FOUNDATIONAL_LIB_STRLEN(array[i]);
@@ -4501,7 +4508,7 @@ FOUNDATIONAL_LIB_FUNC char *reverse_string(const char *str)
     size_t length = FOUNDATIONAL_LIB_STRLEN(new_str);
     size_t i, j;
 
-    for (i = 0, j = length - 1; i < j; i++, j--)
+    for (i = 0, j = length - 1; i < j; ++i, j--)
     {
         char temp = new_str[i];
         new_str[i] = new_str[j];
@@ -4854,7 +4861,7 @@ FOUNDATIONAL_LIB_FUNC int is_string_numeric(const char *str)
 
     const size_t len = FOUNDATIONAL_LIB_STRLEN(str);
 
-    for (size_t i = 0; i < len; i++)
+    for (size_t i = 0; i < len; ++i)
     {
         if (!FOUNDATIONAL_LIB_ISDIGIT(str[i]))
         {
@@ -4889,7 +4896,7 @@ FOUNDATIONAL_LIB_FUNC int is_string_alphanumeric(const char *str)
 
     size_t len = FOUNDATIONAL_LIB_STRLEN(str);
 
-    for (size_t i = 0; i < len; i++)
+    for (size_t i = 0; i < len; ++i)
     {
         if (!FOUNDATIONAL_LIB_ISALNUM(str[i]))
         {
@@ -5113,7 +5120,7 @@ FOUNDATIONAL_LIB_FUNC ssize_t find_first_of(const char *str, const char *char_se
 
     const char *result = strpbrk(str, char_set);
 
-    return FOUNDATIONAL_LIB_likely(result != NULL) ? result - str : -1;
+    return FOUNDATIONAL_LIB_LIKELY(result != NULL) ? result - str : -1;
 }
 
 /**
@@ -5245,7 +5252,7 @@ FOUNDATIONAL_LIB_FUNC size_t common_prefix_length(const char *str1, const char *
 
     const size_t min_len = (len1 < len2) ? len1 : len2;
 
-    for (size_t i = 0; i < min_len; i++)
+    for (size_t i = 0; i < min_len; ++i)
     {
         if (str1[i] != str2[i])
         {
@@ -5279,7 +5286,7 @@ FOUNDATIONAL_LIB_FUNC size_t common_suffix_length(const char *str1, const char *
 
     const size_t min_len = (len1 < len2) ? len1 : len2;
 
-    for (size_t i = 1; i <= min_len; i++)
+    for (size_t i = 1; i <= min_len; ++i)
     {
         if (str1[len1 - i] != str2[len2 - i])
         {
@@ -5325,7 +5332,7 @@ FOUNDATIONAL_LIB_FUNC char *string_to_title_case(const char *str)
 
     int make_upper = 1; // Start with the first character as uppercase
 
-    for (size_t i = 0; i < len; i++)
+    for (size_t i = 0; i < len; ++i)
     {
         if (FOUNDATIONAL_LIB_ISSPACE(str[i]))
         {
@@ -5368,7 +5375,7 @@ FOUNDATIONAL_LIB_FUNC int find_max_int_in_array(const int *array, size_t size)
 
     int max = array[0];
 
-    for (size_t i = 1; i < size; i++)
+    for (size_t i = 1; i < size; ++i)
     {
         if (array[i] > max)
         {
@@ -5403,7 +5410,7 @@ FOUNDATIONAL_LIB_FUNC int find_min_int_in_array(const int *array, size_t size)
 
     int min = array[0];
 
-    for (size_t i = 1; i < size; i++)
+    for (size_t i = 1; i < size; ++i)
     {
         if (array[i] < min)
         {
@@ -8372,7 +8379,7 @@ FOUNDATIONAL_LIB_FUNC char *concatenate_strings(const char *str1, const char *st
  *
  *        If should_free_after_use is non-zero, a new dynamically allocated array with the replacements made.
  *        If should_free_after_use is zero, output aliases source, and they refer to the same memory.
- * @param should_free_after_use A pointer to a int indicating whether
+ * @param should_free_after_use A pointer to a int indicating whether one should free the memory after using the function.
  * @param num_matches A pointer to a variable to store the number of replacements made.
  * @param matches_max A pointer to the maximum number of replacements to make. If zero, there is no maximum.
  *
@@ -8902,7 +8909,7 @@ FOUNDATIONAL_LIB_FUNC void map_ints(int *array, size_t size, int (*transform)(in
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(transform);
 
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         array[i] = transform(array[i]);
     }
@@ -8948,7 +8955,7 @@ FOUNDATIONAL_LIB_FUNC int reduce_ints(int *array, size_t size, int (*operation)(
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(operation);
 
     int result = array[0];
-    for (size_t i = 1; i < size; i++)
+    for (size_t i = 1; i < size; ++i)
     {
         result = operation(result, array[i]);
     }
@@ -9004,7 +9011,7 @@ FOUNDATIONAL_LIB_FUNC int filter_ints(int *source, size_t source_size, int *dest
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(condition);
 
     size_t count = 0;
-    for (size_t i = 0; i < source_size; i++)
+    for (size_t i = 0; i < source_size; ++i)
     {
         if (condition(source[i]))
         {
@@ -9051,7 +9058,7 @@ FOUNDATIONAL_LIB_FUNC void map(void *array, size_t size, size_t elem_size, void
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(array);
     FOUNDATIONAL_LIB_ASSERT_ARGUMENT_IF_ENABLED(transform);
 
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         transform(((char *)array) + i * elem_size);
     }
@@ -9103,12 +9110,12 @@ FOUNDATIONAL_LIB_FUNC void reduce(void *array, size_t size, size_t elem_size, vo
     char *char_result = (char *)result;
 
     /* Initialize the result with the first element */
-    for (size_t i = 0; i < elem_size; i++)
+    for (size_t i = 0; i < elem_size; ++i)
     {
         char_result[i] = char_array[i];
     }
 
-    for (size_t i = 1; i < size; i++)
+    for (size_t i = 1; i < size; ++i)
     {
         operation(char_result, char_array + i * elem_size);
     }
@@ -9169,18 +9176,19 @@ FOUNDATIONAL_LIB_FUNC size_t filter(void *source, size_t source_size, size_t ele
     char *char_destination = (char *)destination;
 
     size_t count = 0;
-    for (size_t i = 0; i < source_size; i++)
+    for (size_t i = 0; i < source_size; ++i)
     {
         if (condition(char_source + i * elem_size))
         {
             if (count < dest_size)
             {
-                for (size_t j = 0; j < elem_size; j++)
+                for (size_t j = 0; j < elem_size; ++j)
                 {
                     char_destination[count * elem_size + j] = char_source[i * elem_size + j];
                 }
             }
-            count++;
+
+            ++count;
         }
     }
     return count;
@@ -10325,18 +10333,18 @@ FOUNDATIONAL_LIB_FUNC int string_array_uniq(const char **array, size_t size, cha
     }
 
     // Initialize all elements to NULL
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         (*output)[i] = NULL;
     }
 
     // Iterate through the input array to find unique strings
-    for (size_t i = 0; i < size; i++)
+    for (size_t i = 0; i < size; ++i)
     {
         int is_unique = 1;
 
         // Check if the current string is not equal to any previous strings
-        for (size_t j = 0; j < count; j++)
+        for (size_t j = 0; j < count; ++j)
         {
             if ((*output)[j] != NULL && FOUNDATIONAL_LIB_STRCMP(array[i], (*output)[j]) == 0)
             {
@@ -12902,7 +12910,7 @@ FOUNDATIONAL_LIB_FUNC int is_valid_utf8(const char *str, size_t len)
         if ((str[i] & 0x80) == 0)
         {
             // ASCII character (0xxxxxxx)
-            i++;
+            ++i;
         }
         else if ((str[i] & 0xE0) == 0xC0)
         {