fixed strict comparator crash

Author: jkalias

include/vector.h

@@ -577,7 +577,7 @@ class vector
     }
 #endif
 
-    // Sorts the vector in place in ascending order, when its elements support comparison by std::less_equal [<=] (mutating).
+    // Sorts the vector in place in ascending order, when its elements support comparison by std::less [<] (mutating).
     //
     // example:
     //      fcpp::vector numbers({3, 1, 9, -4});
@@ -587,19 +587,19 @@ class vector
     //      numbers -> fcpp::vector({-4, 1, 3, 9});
     vector& sort_ascending()
     {
-        return sort(std::less_equal<T>());
+        return sort(std::less<T>());
     }
 
 #ifdef PARALLEL_ALGORITHM_AVAILABLE
     // Performs the `sort_ascending` algorithm in parallel.
     // See also the sequential version for more documentation.
     vector& sort_ascending_parallel()
     {
-        return sort_parallel(std::less_equal<T>());
+        return sort_parallel(std::less<T>());
     }
 #endif
 
-    // Sorts the vector in place in descending order, when its elements support comparison by std::greater_equal [>=] (mutating).
+    // Sorts the vector in place in descending order, when its elements support comparison by std::greater [>] (mutating).
     //
     // example:
     //      fcpp::vector numbers({3, 1, 9, -4});
@@ -609,15 +609,15 @@ class vector
     //      numbers -> fcpp::vector({9, 3, 1, -4});
     vector& sort_descending()
     {
-        return sort(std::greater_equal<T>());
+        return sort(std::greater<T>());
     }
 
 #ifdef PARALLEL_ALGORITHM_AVAILABLE
     // Performs the `sort_ascending` algorithm in parallel.
     // See also the sequential version for more documentation.
     vector& sort_descending_parallel()
     {
-        return sort_parallel(std::greater_equal<T>());
+        return sort_parallel(std::greater<T>());
     }
 #endif
 
@@ -671,7 +671,7 @@ class vector
     }
 #endif
 
-    // Sorts its elements copied and sorted in ascending order, when its elements support comparison by std::less_equal [<=] (non-mutating).
+    // Sorts its elements copied and sorted in ascending order, when its elements support comparison by std::less [<] (non-mutating).
     //
     // example:
     //      const fcpp::vector numbers({3, 1, 9, -4});
@@ -681,19 +681,19 @@ class vector
     //      sorted_numbers -> fcpp::vector({-4, 1, 3, 9});
     [[nodiscard]] vector sorted_ascending() const
     {
-        return sorted(std::less_equal<T>());
+        return sorted(std::less<T>());
     }
 
 #ifdef PARALLEL_ALGORITHM_AVAILABLE
     // Performs the `sorted_ascending` algorithm in parallel.
     // See also the sequential version for more documentation.
     [[nodiscard]] vector sorted_ascending_parallel() const
     {
-        return sorted_parallel(std::less_equal<T>());
+        return sorted_parallel(std::less<T>());
     }
 #endif
 
-    // Sorts its elements copied and sorted in descending order, when its elements support comparison by std::greater_equal [>=] (non-mutating).
+    // Sorts its elements copied and sorted in descending order, when its elements support comparison by std::greater [>] (non-mutating).
     //
     // example:
     //      const fcpp::vector numbers({3, 1, 9, -4});
@@ -703,15 +703,15 @@ class vector
     //      sorted_numbers -> fcpp::vector({9, 3, 1, -4});
     [[nodiscard]] vector sorted_descending() const
     {
-        return sorted(std::greater_equal<T>());
+        return sorted(std::greater<T>());
     }
 
 #ifdef PARALLEL_ALGORITHM_AVAILABLE
     // Performs the `sorted_descending` algorithm in parallel.
     // See also the sequential version for more documentation.
     [[nodiscard]] vector sorted_descending_parallel() const
     {
-        return sorted_parallel(std::greater_equal<T>());
+        return sorted_parallel(std::greater<T>());
     }
 #endif