Changeset 26d2990 in mainline

Timestamp:

2018-07-05T21:41:22Z (7 years ago)

Author:

Dzejrou <dzejrou@…>

Branches:

lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export

Children:

026cb10

Parents:

7ca0410f

git-author:

Dzejrou <dzejrou@…> (2018-04-30 22:21:53)

git-committer:

Dzejrou <dzejrou@…> (2018-07-05 21:41:22)

Message:

cpp: added lexicographical_compare

File:

• uspace/lib/cpp/include/impl/algorithm.hpp (modified) (1 diff)

uspace/lib/cpp/include/impl/algorithm.hpp

@@ -1087 +1087 @@
      */
 
-    // TODO: implement
+    template<class InputIterator1, class InputIterator2>
+    bool lexicographical_compare(InputIterator1 first1,
+                                 InputIterator1 last1,
+                                 InputIterator2 first2,
+                                 InputIterator2 last2)
+    {
+        /**
+         * *first1 and *first2 can have different types
+         * so we use a transparent comparator.
+         */
+        return lexicographical_compare(
+            first1, last1, first2, last2,
+            less<void>{}
+        );
+    }
+
+    template<class InputIterator1, class InputIterator2, class Compare>
+    bool lexicographical_compare(InputIterator1 first1,
+                                 InputIterator1 last1,
+                                 InputIterator2 first2,
+                                 InputIterator2 last2,
+                                 Compare comp)
+    {
+        while ((first1 != last1) && (first2 != last2))
+        {
+            if (comp(*first1, *first2))
+                return true;
+            if (comp(*first2, *first1))
+                return false;
+
+            ++first1;
+            ++first2;
+        }
+
+        /**
+         * Up until now they are same, so we have to check
+         * if we reached the end on one.
+         */
+        return (first1 == last1) && (first2 != last2);
+    }
 
     /**