deb_control_files:
- control
- md5sums
deb_fields:
Architecture: all
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.
Homepage: https://github.com/orlp/pdqsort
Installed-Size: '37'
Maintainer: Alexander GQ Gerasiov <gq@debian.org>
Package: pdqsort-dev
Priority: optional
Section: libs
Source: pdqsort
Version: 0.0.0+git20180419-2.1
srcpkg_name: pdqsort
srcpkg_version: 0.0.0+git20180419-2.1