From 419f3bd3e48e5581458f28d8c9493836141bcf3a Mon Sep 17 00:00:00 2001
From: Roland Reichwein <Roland.Reichwein@bmw.de>
Date: Sat, 7 Mar 2026 19:31:23 +0100
Subject: [PATCH] Add missing constexpr in algorithm.h

---
 include/etl/algorithm.h | 13 +++++++++++++
 1 file changed, 13 insertions(+)

diff --git a/include/etl/algorithm.h b/include/etl/algorithm.h
index 74fbb8ed..0eca61b9 100644
--- a/include/etl/algorithm.h
+++ b/include/etl/algorithm.h
@@ -507,6 +507,7 @@ namespace etl
   //***************************************************************************
   template <typename TIterator, typename T, typename Compare>
   ETL_NODISCARD
+  ETL_CONSTEXPR14
   bool binary_search(TIterator first, TIterator last, const T& value, Compare compare)
   {
     first = etl::lower_bound(first, last, value, compare);
@@ -516,6 +517,7 @@ namespace etl
 
   template <typename TIterator, typename T>
   ETL_NODISCARD
+  ETL_CONSTEXPR14
   bool binary_search(TIterator first, TIterator last, const T& value)
   {
     typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
@@ -1016,6 +1018,7 @@ namespace etl
 
   // Pop Heap
   template <typename TIterator, typename TCompare>
+  ETL_CONSTEXPR14
   void pop_heap(TIterator first, TIterator last, TCompare compare)
   {
     typedef typename etl::iterator_traits<TIterator>::value_type value_t;
@@ -1029,6 +1032,7 @@ namespace etl
 
   // Pop Heap
   template <typename TIterator>
+  ETL_CONSTEXPR14
   void pop_heap(TIterator first, TIterator last)
   {
     typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
@@ -1038,6 +1042,7 @@ namespace etl
 
   // Push Heap
   template <typename TIterator, typename TCompare>
+  ETL_CONSTEXPR14
   void push_heap(TIterator first, TIterator last, TCompare compare)
   {
     typedef typename etl::iterator_traits<TIterator>::difference_type difference_t;
@@ -1048,6 +1053,7 @@ namespace etl
 
   // Push Heap
   template <typename TIterator>
+  ETL_CONSTEXPR14
   void push_heap(TIterator first, TIterator last)
   {
     typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
@@ -1057,6 +1063,7 @@ namespace etl
 
   // Make Heap
   template <typename TIterator, typename TCompare>
+  ETL_CONSTEXPR14
   void make_heap(TIterator first, TIterator last, TCompare compare)
   {
     typedef typename etl::iterator_traits<TIterator>::difference_type difference_t;
@@ -1084,6 +1091,7 @@ namespace etl
 
   // Make Heap
   template <typename TIterator>
+  ETL_CONSTEXPR14
   void make_heap(TIterator first, TIterator last)
   {
     typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
@@ -1094,6 +1102,7 @@ namespace etl
   // Is Heap
   template <typename TIterator>
   ETL_NODISCARD
+  ETL_CONSTEXPR14
     bool is_heap(TIterator first, TIterator last)
   {
     typedef etl::less<typename etl::iterator_traits<TIterator>::value_type> compare;
@@ -1104,6 +1113,7 @@ namespace etl
   // Is Heap
   template <typename TIterator, typename TCompare>
   ETL_NODISCARD
+  ETL_CONSTEXPR14
   bool is_heap(TIterator first, TIterator last, TCompare compare)
   {
     return private_heap::is_heap(first, last - first, compare);
@@ -1111,6 +1121,7 @@ namespace etl
 
   // Sort Heap
   template <typename TIterator>
+  ETL_CONSTEXPR14
   void sort_heap(TIterator first, TIterator last)
   {
     while (first != last)
@@ -1122,6 +1133,7 @@ namespace etl
 
   // Sort Heap
   template <typename TIterator, typename TCompare>
+  ETL_CONSTEXPR14
   void sort_heap(TIterator first, TIterator last, TCompare compare)
   {
     while (first != last)
@@ -1948,6 +1960,7 @@ namespace etl
   //***************************************************************************
   template <typename TIterator1, typename TIterator2, typename TBinaryPredicate>
   ETL_NODISCARD
+  ETL_CONSTEXPR14
   bool is_permutation(TIterator1       begin1,
                       TIterator1       end1,
                       TIterator2       begin2,