Morwenn

Results 73 issues of Morwenn

The name "contrib" isn't the best one, but it would be nice to have another repository where we could store: * Sorters relying on code with different licenses * Sorters...

enhancement
future

In [one of his blog posts](http://ericniebler.com/2014/10/06/counted-ranges-and-efficiency/), Eric Nieber introduces generic counted iterators, which might come along with the Ranges TS. These iterators allow to use the same algorithms for usual...

enhancement
future

At first, sorter adapters were mostly designed to return the value returned by the wrapped sorters. However, with time some problems appeared with that design: 1. Some adapters such as...

question

cpp-sort currently gives the middle finger to mutable sorters, which might not be the right reaction to have. It never really mattered because every sorter in the library is immutable....

enhancement

### The issue Many of the `schwartz_adapter` tests segfault with the following configuration: * 64-bit MinGW-w64 * Release mode * Sorting a `wrapper` Instead of just Release mode, we can...

bug
help wanted

The [Ranges TS](http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2015/p0021r0.pdf) introduces the notion of _sentinels_. A sentinel is an end iterator with a different type than the actual iterators; it shall be comparable to the other iterators...

enhancement
question
future

We can consider that an unstable sorting algorithm is stable as long as the stability isn't actually observable. For example, the lack of stability of a quicksort shouldn't be observable...

enhancement
question

More than once, Matt Austern [raised](http://lafstern.org/matt/segmented.pdf) [awareness](https://meetingcpp.com/tl_files/mcpp/2015/talks/meetingc++2015-guntramberti.pdf) of segmented data structures such as `std::deque`. The standard algorithms are currently suboptimal for these data structures, while they could be way better...

enhancement

Issue #67 introduced the basic `container_aware_adapter` understanding a `sort` ADL-found function and added algorithms for `std::list` and `std::forward_list` with a few sorters. However, it lets a lot of questions unanswered,...

enhancement
question

I had forgotten about it in the meantime, but I [asked on /r/compsci][1] whether the final `make_heap` ran with the anticipated time complexity. While it didn't give me a clear...