Add a function wrapper for sort(). Add wrappers to each sorting algorithm for handling the same random access iterators present in std::sort(). This ensures that pawlib::sort() is a drop-in replacement for std::sort().
Description
Description
Details
Details
- Task Type
- Not Set
- Proposed Urgency
- Established
- Gravity
- g4: Significant
- Friction
- f1: Freeway
- Volatility (Caught At)
- Not a Bug
- Origin
- Not a Bug/Unknown
Revisions and Commits
Revisions and Commits
Status | Assigned | Task | ||
---|---|---|---|---|
Completed | lulu731 | T758 Introsort | ||
Completed | lulu731 | T762 sort() Function Wrappers |
Event Timeline
Comment Actions
@lulu731 Hi there! You're absolutely welcome to. The repository is at rP PawLIB, and the instructions for setting up your dev environment, building, and submitting code can all be found at https://mousepawmedia.net/help.
If you have any questions, just pop into {Z51}.
Be advised, PawSort is still in experimental phase. Some of the sorting algorithms still need to be completed, debugged, improved, and optimized.
Also, see V11. (I'm trying to get more feedback on that. You're welcome to repost it in {Z51} to get input from some of the other contribs.