Package: libavl-dev Source: libavl Version: 2.0.0 Architecture: armel Maintainer: Wessel Dankers Installed-Size: 44 Depends: libavl2 (= 2.0.0) Filename: wheezy/avl/libavl-dev_2.0.0_armel.deb Size: 20228 MD5sum: 61d9fb4136de1dbceda027fcc7da7d18 SHA1: dc6d33744152f5dc75dd606f27ae7d08933c919c SHA256: 07e1286176343c3684ef4ab8c217a6dc7b8d608c159648c6c384d179f13d4517 Section: libdevel Priority: extra Description: AVL tree manipulation library - development This library consists of a set of functions to manipulate AVL trees. AVL trees are very efficient balanced binary trees, similar to red-black trees. The functions in this library can handle any kind of payload and search key type. . This package contains the header files and documentation. Package: libavl2 Source: libavl Version: 2.0.0 Architecture: armel Maintainer: Wessel Dankers Installed-Size: 21 Depends: libc6 (>= 2.4) Filename: wheezy/avl/libavl2_2.0.0_armel.deb Size: 8586 MD5sum: afa7d0cde2d56a563c484a949f0ccd6d SHA1: 54d564b56958ba1761febc0cfc0750066a0ef940 SHA256: 095f855d160d06de9eaf313b6851ed32c80d538e23ffb517431f8867c3969b93 Section: libs Priority: extra Description: AVL tree manipulation library - runtime This library consists of a set of functions to manipulate AVL trees. AVL trees are very efficient balanced binary trees, similar to red-black trees. The functions in this library can handle any kind of payload and search key type. . This package contains the actual library.