finor fixes

n0lavar · Jun 9, 2023 · bf3a0d9 · bf3a0d9
1 parent eacef5c
commit bf3a0d9
Show file tree

Hide file tree

Showing 4 changed files with 8 additions and 7 deletions.
diff --git a/include/qx/algo/contains.h b/include/qx/algo/contains.h
@@ -39,7 +39,7 @@ bool contains(fwd_it_t itBegin, fwd_it_t itEnd, const T& value)
     @retval             - true if container contains value
 **/
 template<class container_t, class T>
-bool contains(container_t& container, const T& value)
+bool contains(const container_t& container, const T& value)
 {
     return contains(container.begin(), container.end(), value);
 }
@@ -68,7 +68,7 @@ bool contains_if(fwd_it_t itBegin, fwd_it_t itEnd, const predicate_t& predicate)
     @retval             - true if at least one of container elements satisfies predicate
 **/
 template<class container_t, class predicate_t>
-bool contains_if(container_t& container, const predicate_t& predicate)
+bool contains_if(const container_t& container, const predicate_t& predicate)
 {
     return contains_if(container.begin(), container.end(), predicate);
 }

diff --git a/include/qx/meta/concepts.h b/include/qx/meta/concepts.h
@@ -10,6 +10,7 @@
 #pragma once
 
 #include <type_traits>
+#include <utility>
 
 namespace qx
 {
@@ -27,8 +28,8 @@ template<class T>
 concept is_random_access_iterator =
     is_iterator<T> && std::derived_from<typename T::iterator_category, std::random_access_iterator_tag>;
 
-template<class T, class return_t = void, class... args_t>
-concept callable = requires(T t, args_t&&... args) {
+template<class T, class return_t, class... args_t>
+concept callable_c = requires(T t, args_t&&... args) {
     {
         t(std::forward<args_t>(args)...)
     } -> std::convertible_to<return_t>;

diff --git a/include/qx/patterns/iterator.h b/include/qx/patterns/iterator.h
@@ -573,7 +573,7 @@ class base_return_object_iterator : public base_iterator_t
     using iterator_category = std::contiguous_iterator_tag;
     using iterator_concept  = std::contiguous_iterator_tag;
 
-    using base_iterator_t::BaseIterator;
+    using base_iterator_t::base_iterator_t;
 
     [[nodiscard]] constexpr value_type operator*() const noexcept
     {

diff --git a/include/qx/recursive_lambda.h b/include/qx/recursive_lambda.h
@@ -38,8 +38,8 @@ struct recursive_lambda
 /**
     @brief  Create lambda that can be called recursively 
     @tparam lambda_t - lambda type: see code example
-    @param  lambda     - lambda object
-    @retval            - lambda that can be called recursively
+    @param  lambda   - lambda object
+    @retval          - lambda that can be called recursively
 
     @code
     auto calc_fibonacci = qx::make_recursive_lambda(