1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
|
Source: libcharles0
Priority: optional
Maintainer: Ludovic Brenta <ludovic.brenta@insalien.org>
Uploaders: Matthias Klose <doko@debian.org>
Build-Depends: debhelper (>> 4.0.0), gnat
Standards-Version: 3.6.0
Package: libcharles0-dev
Section: libdevel
Architecture: i386 powerpc sparc
Depends: libcharles0 (= ${Source-Version})
Description: Data structure library for Ada95 modelled on the C++ STL
Charles is a data structure library for Ada95, modelled principally on
the C++ STL. It features both ordered (lists and arrays) and unordered
(sets and maps) collections.
.
Associated with each data structure type is a separate iterator type,
which allows you to visit each item in the container. In particular,
an iterator abstracts away differences in specific container types,
allowing you to view the collection simply as a sequence of items. A
generic algorithm (for sorting, say) can be written in terms of an
iterator, so that you can use the algorithm over any data structure
having an iterator with the requisite operations.
.
This package contains the development files for Charles, and the
unstripped static library with debugging information.
Package: libcharles0
Section: libs
Architecture: i386 powerpc sparc
Depends: ${shlibs:Depends}
Description: Data structure library for Ada95 modelled on the C++ STL
Description: Data structure library for Ada95 modelled on the C++ STL
Charles is a data structure library for Ada95, modelled principally on
the C++ STL. It features both ordered (lists and arrays) and unordered
(sets and maps) collections.
.
Associated with each data structure type is a separate iterator type,
which allows you to visit each item in the container. In particular,
an iterator abstracts away differences in specific container types,
allowing you to view the collection simply as a sequence of items. A
generic algorithm (for sorting, say) can be written in terms of an
iterator, so that you can use the algorithm over any data structure
having an iterator with the requisite operations.
.
This package contains the run-time shared library.
|
