1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
Source: pdqsort
Priority: optional
Maintainer: Alexander GQ Gerasiov <gq@debian.org>
Build-Depends: debhelper (>= 11)
Standards-Version: 4.3.0
Section: libs
Homepage: https://github.com/orlp/pdqsort
Vcs-Git: https://salsa.debian.org/debian/pdqsort.git
Vcs-Browser: https://salsa.debian.org/debian/pdqsort.git
Package: pdqsort-dev
Architecture: all
Depends: ${shlibs:Depends}, ${misc:Depends}
Pre-Depends: ${misc:Pre-Depends}
Description: pattern-defeating quicksort compile-time c++ library
Pattern-defeating quicksort (pdqsort) is a novel sorting algorithm that
combines the fast average case of randomized quicksort with the fast worst
case of heapsort, while achieving linear time on inputs with certain patterns.
pdqsort is an extension and improvement of David Mussers introsort.
.
This package provides c++ header with drop-in replacement for std::sort.
|
