Package: pdqsort-dev
Source: pdqsort
Version: 0.0.0+git20180419-2.1
Architecture: all
Maintainer: Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
Original-Maintainer: Alexander GQ Gerasiov <gq@debian.org>
Installed-Size: 37
Section: libs
Priority: optional
Homepage: https://github.com/orlp/pdqsort
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.
