Release 1.0.24

* Added definition of MacOS dependencies in build scripts.
* Updated module versions in dependencies.

Author: sadko4u

CHANGELOG

@@ -2,6 +2,10 @@
 * RECENT CHANGES
 *******************************************************************************
 
+=== 1.0.24 ===
+* Added definition of MacOS dependencies in build scripts.
+* Updated module versions in dependencies.
+
 === 1.0.23 ===
 * Updated build scripts.
 * Updated module versions in dependencies.

dependencies.mk

@@ -1,6 +1,6 @@
 #
-# Copyright (C) 2020 Linux Studio Plugins Project <https://lsp-plug.in/>
-#           (C) 2020 Vladimir Sadovnikov <sadko4u@gmail.com>
+# Copyright (C) 2025 Linux Studio Plugins Project <https://lsp-plug.in/>
+#           (C) 2025 Vladimir Sadovnikov <sadko4u@gmail.com>
 #
 # This file is part of lsp-lltl-lib
 #
@@ -60,6 +60,17 @@ ifeq ($(PLATFORM),Windows)
   TEST_DEPENDENCIES        += $(WINDOWS_TEST_DEPENDENCIES)
 endif
 
+#------------------------------------------------------------------------------
+# MacOS dependencies
+MACOS_DEPENDENCIES =
+
+MACOS_TEST_DEPENDENCIES =
+
+ifeq ($(PLATFORM),MacOS)
+  DEPENDENCIES             += $(MACOS_DEPENDENCIES)
+  TEST_DEPENDENCIES        += $(MACOS_TEST_DEPENDENCIES)
+endif
+
 #------------------------------------------------------------------------------
 # Haiku dependencies
 HAIKU_DEPENDENCIES = \
@@ -80,9 +91,11 @@ ALL_DEPENDENCIES = \
   $(LINUX_DEPENDENCIES) \
   $(BSD_DEPENDENCIES) \
   $(WINDOWS_DEPENDENCIES) \
+  $(MACOS_DEPENDENCIES) \
   $(HAIKU_DEPENDENCIES) \
   $(TEST_DEPENDENCIES) \
   $(LINUX_TEST_DEPENDENCIES) \
   $(BSD_TEST_DEPENDENCIES) \
   $(WINDOWS_TEST_DEPENDENCIES) \
+  $(MACOS_TEST_DEPENDENCIES) \
   $(HAIKU_TEST_DEPENDENCIES)

include/lsp-plug.in/lltl/iterator.h

@@ -45,16 +45,41 @@ namespace lsp
          *
          * @param i pointer to the iterator
          * @param n number of steps to advance (can be negative)
-         * @return pointer to modified raw iterator
          */
         typedef void (*iter_move_t)(raw_iterator *i, ssize_t n);
 
+        /**
+         * Get pointer to a value at which the iterator is currently pointing
+         *
+         * @param i pointer to the iterator
+         * @return the actual value iterator is pointing to
+         */
         typedef void *(*iter_get_t)(raw_iterator *i);
 
+        /**
+         * Compare positions of two iterators.
+         *
+         * @param a first iterator to compare
+         * @param b second iterator to compare
+         * @return comparison result
+         */
         typedef ssize_t (*iter_compare_t)(const raw_iterator *a, const raw_iterator *b);
 
+        /**
+         * Compute difference in position between two iterators
+         *
+         * @param a first iterator to compare
+         * @param b second iterator to compare
+         * @return difference in position between two iterators
+         */
         typedef ssize_t (*iter_diff_t)(const raw_iterator *a, const raw_iterator *b);
 
+        /**
+         * Obtain the overall number of elements in a collection the iterator is operating with
+         *
+         * @param i pointer to the iterator
+         * @return number of elements in collection the iterator is operating with
+         */
         typedef size_t (*iter_count_t)(const raw_iterator *i);
 
         /**

include/lsp-plug.in/lltl/phashset.h

@@ -1,6 +1,6 @@
 /*
- * Copyright (C) 2020 Linux Studio Plugins Project <https://lsp-plug.in/>
- *           (C) 2020 Vladimir Sadovnikov <sadko4u@gmail.com>
+ * Copyright (C) 2025 Linux Studio Plugins Project <https://lsp-plug.in/>
+ *           (C) 2025 Vladimir Sadovnikov <sadko4u@gmail.com>
  *
  * This file is part of lsp-lltl-lib
  * Created on: 31 июл. 2020 г.
@@ -207,9 +207,9 @@ namespace lsp
                      * Get value by key or return default value if the value was not found
                      * @param value the desired value
                      * @param dfl default value to return if there is no such value in the set
-                     * @return the associated value
+                     * @return the associated value or default value if not exists
                      */
-                    inline V *dget(const V *key, V *dfl) const              { return vcast(v.get(key, dfl));                                }
+                    inline V *dget(const V *value, V *dfl) const            { return vcast(v.get(value, dfl));                                }
 
                     /**
                      * Remove the item from set if it is present in the set, add the item if not

include/lsp-plug.in/lltl/pphash.h

@@ -275,7 +275,6 @@ namespace lsp
                      * Replace the entry ONLY if it exists
                      * @param key key to use
                      * @param value value to use
-                     * @param ok key removed from hash
                      * @param ov value removed from hash
                      * @return pointer to write data or NULL if no allocation possible
                      */
@@ -284,7 +283,6 @@ namespace lsp
                     /**
                      * Replace the entry ONLY if it exists
                      * @param key key to use
-                     * @param ok old key removed from hash
                      * @param ov old value removed from hash
                      * @return pointer to write data or NULL if no allocation possible
                      */
@@ -293,7 +291,6 @@ namespace lsp
                     /**
                      * Remove the associated key
                      * @param key the key to use for seacrh
-                     * @param ok key removed from hash
                      * @param ov value removed from hash
                      * @return true if the data has been removed
                      */

include/lsp-plug.in/lltl/ptrset.h

@@ -1,6 +1,6 @@
 /*
- * Copyright (C) 2023 Linux Studio Plugins Project <https://lsp-plug.in/>
- *           (C) 2023 Vladimir Sadovnikov <sadko4u@gmail.com>
+ * Copyright (C) 2025 Linux Studio Plugins Project <https://lsp-plug.in/>
+ *           (C) 2025 Vladimir Sadovnikov <sadko4u@gmail.com>
  *
  * This file is part of lsp-lltl-lib
  * Created on: 12 нояб. 2023 г.
@@ -202,9 +202,9 @@ namespace lsp
                      * Get value by key or return default value if the value was not found
                      * @param value the desired value
                      * @param dfl default value to return if there is no such value in the set
-                     * @return the associated value
+                     * @return the associated value or default value if not exists
                      */
-                    inline V *dget(const V *key, V *dfl) const              { return vcast(v.get(key, dfl));                                }
+                    inline V *dget(const V *value, V *dfl) const            { return vcast(v.get(value, dfl));                              }
 
                     /**
                      * Remove the item from set if it is present in the set, add the item if not
@@ -223,16 +223,13 @@ namespace lsp
                     /**
                      * Put the value to the set
                      * @param value value to put
-                     * @param ov value removed from hash
                      * @return true if value was not present in the set previously
                      */
                     inline bool put(V *value)                               { return v.put(value);                                          }
 
                     /**
                      * Remove the pointer from set
                      * @param value the value to remove
-                     * @param ok key removed from hash
-                     * @param ov value removed from hash
                      * @return true if the pointer has been removed
                      */
                     inline bool remove(const V *value)                      { return v.remove(value);                                       }

include/lsp-plug.in/lltl/state.h

@@ -1,6 +1,6 @@
 /*
- * Copyright (C) 2024 Linux Studio Plugins Project <https://lsp-plug.in/>
- *           (C) 2024 Vladimir Sadovnikov <sadko4u@gmail.com>
+ * Copyright (C) 2025 Linux Studio Plugins Project <https://lsp-plug.in/>
+ *           (C) 2025 Vladimir Sadovnikov <sadko4u@gmail.com>
  *
  * This file is part of lsp-lltl-lib
  * Created on: 19 июн. 2024 г.
@@ -127,7 +127,6 @@ namespace lsp
                 /**
                  * Refresh and get current state. Call deleter for garbage and previous pending state.
                  * This is RT-unsafe method.
-                 * @param new_state new state to set
                  * @return pointer to current state
                  */
                 inline T *pull()                        { return tcast(v.pull());               }
@@ -146,15 +145,13 @@ namespace lsp
                  * This is RT-safe method that should be called only in conjunction with push().
                  * Otherwise it won't update until garbage is properly cleaned up.
                  *
-                 * @param new_state new state to set
                  * @return pointer to current state
                  */
                 inline T *get()                         { return tcast(v.get());                }
 
                 /**
                  * Get current state without refresh.
                  *
-                 * @param new_state new state to set
                  * @return pointer to current state
                  */
                 inline T *current() const               { return tcast(v.current());            }

include/lsp-plug.in/lltl/version.h

@@ -24,7 +24,7 @@
 
 #define LSP_LLTL_LIB_MAJOR      1
 #define LSP_LLTL_LIB_MINOR      0
-#define LSP_LLTL_LIB_MICRO      23
+#define LSP_LLTL_LIB_MICRO      24
 
 #if defined(LSP_LLTL_LIB_PUBLISHER)
     #define LSP_LLTL_LIB_PUBLIC         LSP_EXPORT_MODIFIER

modules.mk

@@ -20,13 +20,13 @@
 
 #------------------------------------------------------------------------------
 # Variables that describe source code dependencies
-LSP_COMMON_LIB_VERSION     := 1.0.40
+LSP_COMMON_LIB_VERSION     := 1.0.41
 LSP_COMMON_LIB_NAME        := lsp-common-lib
 LSP_COMMON_LIB_TYPE        := src
 LSP_COMMON_LIB_URL_RO      := https://github.com/lsp-plugins/$(LSP_COMMON_LIB_NAME).git
 LSP_COMMON_LIB_URL_RW      := git@github.com:lsp-plugins/$(LSP_COMMON_LIB_NAME).git
 
-LSP_TEST_FW_VERSION        := 1.0.29
+LSP_TEST_FW_VERSION        := 1.0.30
 LSP_TEST_FW_NAME           := lsp-test-fw
 LSP_TEST_FW_TYPE           := src
 LSP_TEST_FW_URL_RO         := https://github.com/lsp-plugins/$(LSP_TEST_FW_NAME).git

project.mk

@@ -23,4 +23,4 @@ ARTIFACT_ID                 = LSP_LLTL_LIB
 ARTIFACT_NAME               = lsp-lltl-lib
 ARTIFACT_DESC               = Low-Level Template Library for C++
 ARTIFACT_HEADERS            = lsp-plug.in
-ARTIFACT_VERSION            = 1.0.23
+ARTIFACT_VERSION            = 1.0.24

src/test/utest/darray.cpp

@@ -46,7 +46,7 @@ UTEST_BEGIN("lltl", darray)
 
     void dump(lltl::darray<int> &x)
     {
-        for (int i=0, n=x.size(); i<n; ++i)
+        for (size_t i=0, n=x.size(); i<n; ++i)
             printf("%d ", *x.get(i));
         printf("\n");
     }
@@ -729,7 +729,7 @@ UTEST_BEGIN("lltl", darray)
         dump(x);
 
         // Reverse order
-        for (int i=0, j=x.size()-1; i<j; ++i, --j)
+        for (ssize_t i=0, j=x.size()-1; i<j; ++i, --j)
         {
             UTEST_ASSERT(x.xswap(i, j));
         }
@@ -759,8 +759,8 @@ UTEST_BEGIN("lltl", darray)
         // Initialize
         for (size_t i=0; i<sizeof(large_struct_t::data)/sizeof(int); ++i)
         {
-            a->data[i] = 0x55aa0000 | i;
-            b->data[i] = (i << 16) | 0xcc33;
+            a->data[i] = int(0x55aa0000 | i);
+            b->data[i] = int((i << 16) | 0xcc33);
         }
 
         UTEST_ASSERT(x.add(a));
@@ -784,7 +784,7 @@ UTEST_BEGIN("lltl", darray)
 
         int v[N];
         for (ssize_t i=0; i<N; ++i)
-            v[i]    = N - i;
+            v[i]    = int(N - i);
 
         lltl::darray<int> a;
         for (ssize_t i=0; i<N; ++i)
@@ -816,7 +816,7 @@ UTEST_BEGIN("lltl", darray)
         printf("Testing iterator...\n");
         int v[N];
         for (ssize_t i=0; i<N; ++i)
-            v[i]    = i;
+            v[i]    = int(i);
 
         lltl::darray<int> a;
         for (ssize_t i=0; i<N; ++i)

src/test/utest/parray.cpp

@@ -1,6 +1,6 @@
 /*
- * Copyright (C) 2020 Linux Studio Plugins Project <https://lsp-plug.in/>
- *           (C) 2020 Vladimir Sadovnikov <sadko4u@gmail.com>
+ * Copyright (C) 2025 Linux Studio Plugins Project <https://lsp-plug.in/>
+ *           (C) 2025 Vladimir Sadovnikov <sadko4u@gmail.com>
  *
  * This file is part of lsp-lltl-lib
  * Created on: 8 апр. 2020 г.
@@ -41,7 +41,7 @@ UTEST_BEGIN("lltl", parray)
 
     void dump(lltl::parray<int> &x)
     {
-        for (int i=0, n=x.size(); i<n; ++i)
+        for (size_t i=0, n=x.size(); i<n; ++i)
             printf("%d ", *x.get(i));
         printf("\n");
     }
@@ -66,8 +66,8 @@ UTEST_BEGIN("lltl", parray)
     {
         printf("Testing single operations on parray...\n");
         int array[0x20];
-        for (int i=0, n=sizeof(array)/sizeof(int); i<n; ++i)
-            array[i] = i;
+        for (size_t i=0, n=sizeof(array)/sizeof(int); i<n; ++i)
+            array[i] = int(i);
         int *s = array;
 
         lltl::parray<int> x;
@@ -165,8 +165,8 @@ UTEST_BEGIN("lltl", parray)
     {
         printf("Testing single operations on parray with copying...\n");
         int array[0x20];
-        for (int i=0, n=sizeof(array)/sizeof(int); i<n; ++i)
-            array[i] = i;
+        for (size_t i=0, n=sizeof(array)/sizeof(int); i<n; ++i)
+            array[i] = int(i);
         int *s = array;
 
         lltl::parray<int> x;
@@ -317,8 +317,8 @@ UTEST_BEGIN("lltl", parray)
     {
         printf("Testing multiple operations on darray...\n");
         int array[0x20];
-        for (int i=0, n=sizeof(array)/sizeof(int); i<n; ++i)
-            array[i] = i;
+        for (size_t i=0, n=sizeof(array)/sizeof(int); i<n; ++i)
+            array[i] = int(i);
         int *s = array;
 
         lltl::parray<int> x;
@@ -405,8 +405,8 @@ UTEST_BEGIN("lltl", parray)
     {
         printf("Testing multiple operations on darray with copying...\n");
         int array[0x20];
-        for (int i=0, n=sizeof(array)/sizeof(int); i<n; ++i)
-            array[i] = i;
+        for (size_t i=0, n=sizeof(array)/sizeof(int); i<n; ++i)
+            array[i] = int(i);
         int *s = array;
 
         lltl::parray<int> x;
@@ -733,7 +733,7 @@ UTEST_BEGIN("lltl", parray)
         dump(x);
 
         // Reverse order
-        for (int i=0, j=x.size()-1; i<j; ++i, --j)
+        for (ssize_t i=0, j=x.size()-1; i<j; ++i, --j)
         {
             UTEST_ASSERT(x.xswap(i, j));
         }
@@ -754,7 +754,7 @@ UTEST_BEGIN("lltl", parray)
 
         int v[N];
         for (ssize_t i=0; i<N; ++i)
-            v[i]    = N - i;
+            v[i]    = int(N - i);
 
         lltl::parray<int> a;
         for (ssize_t i=0; i<N; ++i)
@@ -786,7 +786,7 @@ UTEST_BEGIN("lltl", parray)
         printf("Testing iterator...\n");
         int v[N];
         for (ssize_t i=0; i<N; ++i)
-            v[i]    = i;
+            v[i]    = int(i);
 
         lltl::parray<int> a;
         for (ssize_t i=0; i<N; ++i)

src/test/utest/phashset.cpp

@@ -34,6 +34,7 @@ namespace lsp
             int v;
 
             explicit item_t(int x): v(x) {}
+            explicit item_t(size_t x): v(int(x)) {}
         } item_t;
     }