Pakiet: pdqsort-dev (0.0.0+git20180419-2.1)
Odnośniki dla pdqsort-dev
Zasoby systemu Trisquel:
- Install using apturl
- Entry at directory.fsf.org
- Raporty o błędach
- Changelog
- Informacje nt. praw autorskich
Pobieranie pakietu źródłowego pdqsort:
- [pdqsort_0.0.0+git20180419-2.1.dsc]
- [pdqsort_0.0.0+git20180419.orig.tar.gz]
- [pdqsort_0.0.0+git20180419-2.1.debian.tar.xz]
Opiekun:
Original Maintainer:
- Alexander GQ Gerasiov
Zasoby zewnętrzne:
- Strona internetowa [github.com]
Podobne pakiety:
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.
Pobieranie pdqsort-dev
Architektura | Rozmiar pakietu | Rozmiar po instalacji | Pliki |
---|---|---|---|
all | 9,8 KiB | 37 KiB | [lista plików] |