Changeset 7ea90cf 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:

65dde99

Parents:

b22ccaa

git-author:

Dzejrou <dzejrou@…> (2018-04-27 23:47:41)

git-committer:

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

Message:

cpp: added make-do sort for testing

File:

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

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

@@ -663 +663 @@
      */
 
-    // TODO: implement
+    template<class RandomAccessIterator, class Compare>
+    void make_heap(RandomAccessIterator, RandomAccessIterator,
+                   Compare);
+
+    template<class RandomAccessIterator, class Compare>
+    void sort_heap(RandomAccessIterator, RandomAccessIterator,
+                   Compare);
+
+    template<class RandomAccessIterator>
+    void sort(RandomAccessIterator first, RandomAccessIterator last)
+    {
+        using value_type = typename iterator_traits<RandomAccessIterator>::value_type;
+
+        sort(first, last, less<value_type>{});
+    }
+
+    template<class RandomAccessIterator, class Compare>
+    void sort(RandomAccessIterator first, RandomAccessIterator last,
+              Compare comp)
+    {
+        /**
+         * Note: This isn't the most effective approach,
+         *       but since we already have these two functions
+         *       and they satisfy asymptotic limitations
+         *       imposed by the standard, we're using them at
+         *       the moment. Might be good to change it to qsort
+         *       or merge sort later.
+         */
+
+        make_heap(first, last, comp);
+        sort_heap(first, last, comp);
+    }
 
     /**