File: control

package info (click to toggle)
libdata-dump-streamer-perl 2.08-40-2
  • links: PTS, VCS
  • area: main
  • in suites: lenny
  • size: 408 kB
  • ctags: 101
  • sloc: perl: 2,669; makefile: 51
file content (38 lines) | stat: -rw-r--r-- 1,874 bytes parent folder | download
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
Source: libdata-dump-streamer-perl
Section: perl
Priority: optional
Build-Depends: debhelper (>= 5.0.0), perl (>= 5.8.8-7), libb-utils-perl,
 libpadwalker-perl (>= 1.0), libcompress-zlib-perl, libmime-perl,
 libalgorithm-diff-perl
Maintainer: Debian Perl Group <pkg-perl-maintainers@lists.alioth.debian.org>
Uploaders: Alexis Sukrieh <sukria@debian.org>,
 Damyan Ivanov <dmn@debian.org>, Gunnar Wolf <gwolf@debian.org>,
 Russ Allbery <rra@debian.org>, Niko Tyni <ntyni@debian.org>
Standards-Version: 3.7.3
Homepage: http://search.cpan.org/dist/Data-Dump-Streamer/
Vcs-Svn: svn://svn.debian.org/pkg-perl/trunk/libdata-dump-streamer-perl/
Vcs-Browser: http://svn.debian.org/wsvn/pkg-perl/trunk/libdata-dump-streamer-perl/

Package: libdata-dump-streamer-perl
Architecture: any
Depends: ${perl:Depends}, ${shlibs:Depends}, ${misc:Depends}, libb-utils-perl,
 perl-modules
Recommends: libpadwalker-perl (>= 1.0)
Description: Perl module for serializing a data structure as Perl code
 Given a list of scalars or reference variables, writes out
 their contents in perl syntax. The references can also be
 objects. The contents of each variable is output using the least
 number of Perl statements as convenient, usually only one.
 Self-referential structures, closures, and objects are output
 correctly.
 .
 The return value can be evaled to get back an identical copy of the
 original reference structure. In some cases this may require the use
 of utility subs that Data::Dump::Streamer will optionally export.
 .
 This module is very similar in concept to the core module
 Data::Dumper, with the major differences being that this module is
 designed to output to a stream instead of constructing its output in
 memory (trading speed for memory), and that the traversal over the
 data structure is effectively breadth first versus the depth first
 traversal done by the others.