Bug#300570: O: xt-aterm -- Documentation and Examples for xt-aterm
Package: wnpp
Severity: normal
xt-aterm is orphaned, but it seems nobody filed a bug about it in
WNPP. If you want to be the new maintainer, please take it -- see
http://www.debian.org/devel/wnpp/index.html#howto-o for detailed
instructions how to adopt a package properly.
Some information about this package:
Package: xt-aterm
Binary: xt-aterm-dev, xt-aterm, xt-aterm-doc
Version: 2.0.5-2
Priority: optional
Section: devel
Maintainer: Debian QA Group <packages@qa.debian.org>
Build-Depends: debhelper (>= 4.0), autotools-dev, tetex-bin, tetex-extra,
docbook-to-man | docbook-utils, transfig, dpatch
Architecture: any
Standards-Version: 3.6.1
Format: 1.0
Directory: pool/main/x/xt-aterm
Files: d0f7c7778c7c59a8539b28a0e5095914 695 xt-aterm_2.0.5-2.dsc
6a78ce4a0b16ec5e180334c82dfe63cd 748323 xt-aterm_2.0.5.orig.tar.gz
00e3844c7bfe4e4f8d1c2e20a116e31c 7009 xt-aterm_2.0.5-2.diff.gz
Package: xt-aterm
Priority: optional
Section: devel
Installed-Size: 564
Maintainer: Debian QA Group <packages@qa.debian.org>
Architecture: i386
Version: 2.0.5-2
Replaces: cwi-aterm
Depends: libc6 (>= 2.3.2.ds1-4)
Conflicts: cwi-aterm
Filename: pool/main/x/xt-aterm/xt-aterm_2.0.5-2_i386.deb
Size: 222936
MD5sum: c58e1e936a596be51a94f75ada9c98db
Description: Data type (Tree) for exchange in distributed applications
ATerm (short for Annotated Term) is an abstract data type designed
for the exchange of tree-like data structures between distributed
applications.
.
The ATerm library forms a comprehensive procedural interface which
enables creation and manipulation of ATerms in C.
The ATerm implementation is based on maximal subterm sharing and
automatic garbage collection.
.
A binary exchange format for the concise representation of ATerms
(sharing preserved) allows the fast exchange of ATerms between
applications. In a typical application---parse trees which contain
considerable redundant information---less than 2 bytes are needed to
represent a node in memory, and less than 2 bits are needed to represent
it in binary format. The implementation of ATerms scales up to the
manipulation of ATerms in the giga-byte range.
Package: xt-aterm-dev
Priority: optional
Section: devel
Installed-Size: 184
Maintainer: Debian QA Group <packages@qa.debian.org>
Architecture: i386
Source: xt-aterm
Version: 2.0.5-2
Replaces: cwi-aterm-dev
Depends: xt-aterm
Conflicts: cwi-aterm-dev
Filename: pool/main/x/xt-aterm/xt-aterm-dev_2.0.5-2_i386.deb
Size: 66150
MD5sum: 4235d1bc7385629be789cdabd6b88ada
Description: Development headers and Libraries for xt-aterm
ATerm (short for Annotated Term) is an abstract data type designed
for the exchange of tree-like data structures between distributed
applications.
.
The ATerm library forms a comprehensive procedural interface which
enables creation and manipulation of ATerms in C.
The ATerm implementation is based on maximal subterm sharing and
automatic garbage collection.
.
A binary exchange format for the concise representation of ATerms
(sharing preserved) allows the fast exchange of ATerms between
applications. In a typical application---parse trees which contain
considerable redundant information---less than 2 bytes are needed to
represent a node in memory, and less than 2 bits are needed to represent
it in binary format. The implementation of ATerms scales up to the
manipulation of ATerms in the giga-byte range.
Package: xt-aterm-doc
Priority: optional
Section: doc
Installed-Size: 508
Maintainer: Debian QA Group <packages@qa.debian.org>
Architecture: all
Source: xt-aterm
Version: 2.0.5-2
Replaces: cwi-aterm-doc
Conflicts: cwi-aterm-doc
Filename: pool/main/x/xt-aterm/xt-aterm-doc_2.0.5-2_all.deb
Size: 447458
MD5sum: baa4205bf246b2355dc7d0d97a80bce9
Description: Documentation and Examples for xt-aterm
ATerm (short for Annotated Term) is an abstract data type designed
for the exchange of tree-like data structures between distributed
applications.
.
The ATerm library forms a comprehensive procedural interface which
enables creation and manipulation of ATerms in C.
The ATerm implementation is based on maximal subterm sharing and
automatic garbage collection.
.
A binary exchange format for the concise representation of ATerms
(sharing preserved) allows the fast exchange of ATerms between
applications. In a typical application---parse trees which contain
considerable redundant information---less than 2 bytes are needed to
represent a node in memory, and less than 2 bits are needed to represent
it in binary format. The implementation of ATerms scales up to the
manipulation of ATerms in the giga-byte range.
--
Martin Michlmayr
http://www.cyrius.com/
Reply to: