Mercurial > treepkg
view recipes/gnupg/libassuan.py @ 538:6fb5e8b74414
contrib: Do a more conservative approach (full sorting) to figure out
the youngest debs. This _much_ slower but it works correctly.
TODO: make the heapq.nsmallest() work correct.
| author | Sascha Teichmann <teichmann@intevation.de> |
|---|---|
| date | Mon, 10 Jan 2011 14:58:51 +0000 |
| parents | 605f6784aae7 |
| children |
line wrap: on
line source
# Copyright (C) 2008 by Intevation GmbH # Authors: # Bernhard Herzog <bh@intevation.de> # # This program is free software under the GPL (>=v2) # Read the file COPYING coming with the software for details. """Recipe to build libassuan from SVN""" import base base.define_gnupg_packager("libassuan")