Source: libxyla
Section: libs
Priority: optional
Maintainer: Mark Wooding <mdw@distorted.org.uk>
Build-Depends:
	debhelper (>= 10),
	autoconf, automake, libtool, autoconf-archive,
	python3 | python
Standards-Version: 4.3.0

Package: libxyla0
Architecture: any
Multi-Arch: same
Depends: ${shlibs:Depends}, ${misc:Depends}
Pre-Depends: ${misc:Pre-Depends}
Description: Library of fast, hard-mode binary tree implementations (run-time)
 The Xyla library implements AVL trees, red-black trees, splay trees, and
 treaps.  It provides search, iteration, insertion, deletion, splitting and
 joining, and set operations.  It supports search, update, and retrieval of
 user-defined annotations.  Except for the invariant-checking functionality,
 the library allocates no memory of its own.  The algorithm implementations
 are nonrecursive.
 .
 This package provides the run-time library.

Package: libxyla-dev
Architecture: any
Depends: libxyla0 (= ${binary:Version}), libc6-dev, ${misc:Depends}
Pre-Depends: ${misc:Pre-Depends}
Description: Library of fast, hard-mode binary tree implementations (development)
 The Xyla library implements AVL trees, red-black trees, splay trees, and
 treaps.  It provides search, iteration, insertion, deletion, splitting and
 joining, and set operations.  It supports search, update, and retrieval of
 user-defined annotations.  Except for the invariant-checking functionality,
 the library allocates no memory of its own.  The algorithm implementations
 are nonrecursive.
 .
 This package contains the header files and static libraries needed to
 compile programs which use Xyla.