Source code of Windows XP (NT5)
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

1000 lines
29 KiB

  1. #
  2. # Data/Dumper.pm
  3. #
  4. # convert perl data structures into perl syntax suitable for both printing
  5. # and eval
  6. #
  7. # Documentation at the __END__
  8. #
  9. package Data::Dumper;
  10. $VERSION = $VERSION = '2.101';
  11. #$| = 1;
  12. require 5.004;
  13. require Exporter;
  14. require DynaLoader;
  15. require overload;
  16. use Carp;
  17. @ISA = qw(Exporter DynaLoader);
  18. @EXPORT = qw(Dumper);
  19. @EXPORT_OK = qw(DumperX);
  20. bootstrap Data::Dumper;
  21. # module vars and their defaults
  22. $Indent = 2 unless defined $Indent;
  23. $Purity = 0 unless defined $Purity;
  24. $Pad = "" unless defined $Pad;
  25. $Varname = "VAR" unless defined $Varname;
  26. $Useqq = 0 unless defined $Useqq;
  27. $Terse = 0 unless defined $Terse;
  28. $Freezer = "" unless defined $Freezer;
  29. $Toaster = "" unless defined $Toaster;
  30. $Deepcopy = 0 unless defined $Deepcopy;
  31. $Quotekeys = 1 unless defined $Quotekeys;
  32. $Bless = "bless" unless defined $Bless;
  33. #$Expdepth = 0 unless defined $Expdepth;
  34. #$Maxdepth = 0 unless defined $Maxdepth;
  35. #
  36. # expects an arrayref of values to be dumped.
  37. # can optionally pass an arrayref of names for the values.
  38. # names must have leading $ sign stripped. begin the name with *
  39. # to cause output of arrays and hashes rather than refs.
  40. #
  41. sub new {
  42. my($c, $v, $n) = @_;
  43. croak "Usage: PACKAGE->new(ARRAYREF, [ARRAYREF])"
  44. unless (defined($v) && (ref($v) eq 'ARRAY'));
  45. $n = [] unless (defined($n) && (ref($v) eq 'ARRAY'));
  46. my($s) = {
  47. level => 0, # current recursive depth
  48. indent => $Indent, # various styles of indenting
  49. pad => $Pad, # all lines prefixed by this string
  50. xpad => "", # padding-per-level
  51. apad => "", # added padding for hash keys n such
  52. sep => "", # list separator
  53. seen => {}, # local (nested) refs (id => [name, val])
  54. todump => $v, # values to dump []
  55. names => $n, # optional names for values []
  56. varname => $Varname, # prefix to use for tagging nameless ones
  57. purity => $Purity, # degree to which output is evalable
  58. useqq => $Useqq, # use "" for strings (backslashitis ensues)
  59. terse => $Terse, # avoid name output (where feasible)
  60. freezer => $Freezer, # name of Freezer method for objects
  61. toaster => $Toaster, # name of method to revive objects
  62. deepcopy => $Deepcopy, # dont cross-ref, except to stop recursion
  63. quotekeys => $Quotekeys, # quote hash keys
  64. 'bless' => $Bless, # keyword to use for "bless"
  65. # expdepth => $Expdepth, # cutoff depth for explicit dumping
  66. # maxdepth => $Maxdepth, # depth beyond which we give up
  67. };
  68. if ($Indent > 0) {
  69. $s->{xpad} = " ";
  70. $s->{sep} = "\n";
  71. }
  72. return bless($s, $c);
  73. }
  74. #
  75. # add-to or query the table of already seen references
  76. #
  77. sub Seen {
  78. my($s, $g) = @_;
  79. if (defined($g) && (ref($g) eq 'HASH')) {
  80. my($k, $v, $id);
  81. while (($k, $v) = each %$g) {
  82. if (defined $v and ref $v) {
  83. ($id) = (overload::StrVal($v) =~ /\((.*)\)$/);
  84. if ($k =~ /^[*](.*)$/) {
  85. $k = (ref $v eq 'ARRAY') ? ( "\\\@" . $1 ) :
  86. (ref $v eq 'HASH') ? ( "\\\%" . $1 ) :
  87. (ref $v eq 'CODE') ? ( "\\\&" . $1 ) :
  88. ( "\$" . $1 ) ;
  89. }
  90. elsif ($k !~ /^\$/) {
  91. $k = "\$" . $k;
  92. }
  93. $s->{seen}{$id} = [$k, $v];
  94. }
  95. else {
  96. carp "Only refs supported, ignoring non-ref item \$$k";
  97. }
  98. }
  99. return $s;
  100. }
  101. else {
  102. return map { @$_ } values %{$s->{seen}};
  103. }
  104. }
  105. #
  106. # set or query the values to be dumped
  107. #
  108. sub Values {
  109. my($s, $v) = @_;
  110. if (defined($v) && (ref($v) eq 'ARRAY')) {
  111. $s->{todump} = [@$v]; # make a copy
  112. return $s;
  113. }
  114. else {
  115. return @{$s->{todump}};
  116. }
  117. }
  118. #
  119. # set or query the names of the values to be dumped
  120. #
  121. sub Names {
  122. my($s, $n) = @_;
  123. if (defined($n) && (ref($n) eq 'ARRAY')) {
  124. $s->{names} = [@$n]; # make a copy
  125. return $s;
  126. }
  127. else {
  128. return @{$s->{names}};
  129. }
  130. }
  131. sub DESTROY {}
  132. #
  133. # dump the refs in the current dumper object.
  134. # expects same args as new() if called via package name.
  135. #
  136. sub Dump {
  137. my($s) = shift;
  138. my(@out, $val, $name);
  139. my($i) = 0;
  140. local(@post);
  141. $s = $s->new(@_) unless ref $s;
  142. for $val (@{$s->{todump}}) {
  143. my $out = "";
  144. @post = ();
  145. $name = $s->{names}[$i++];
  146. if (defined $name) {
  147. if ($name =~ /^[*](.*)$/) {
  148. if (defined $val) {
  149. $name = (ref $val eq 'ARRAY') ? ( "\@" . $1 ) :
  150. (ref $val eq 'HASH') ? ( "\%" . $1 ) :
  151. (ref $val eq 'CODE') ? ( "\*" . $1 ) :
  152. ( "\$" . $1 ) ;
  153. }
  154. else {
  155. $name = "\$" . $1;
  156. }
  157. }
  158. elsif ($name !~ /^\$/) {
  159. $name = "\$" . $name;
  160. }
  161. }
  162. else {
  163. $name = "\$" . $s->{varname} . $i;
  164. }
  165. my $valstr;
  166. {
  167. local($s->{apad}) = $s->{apad};
  168. $s->{apad} .= ' ' x (length($name) + 3) if $s->{indent} >= 2;
  169. $valstr = $s->_dump($val, $name);
  170. }
  171. $valstr = "$name = " . $valstr . ';' if @post or !$s->{terse};
  172. $out .= $s->{pad} . $valstr . $s->{sep};
  173. $out .= $s->{pad} . join(';' . $s->{sep} . $s->{pad}, @post)
  174. . ';' . $s->{sep} if @post;
  175. push @out, $out;
  176. }
  177. return wantarray ? @out : join('', @out);
  178. }
  179. #
  180. # twist, toil and turn;
  181. # and recurse, of course.
  182. #
  183. sub _dump {
  184. my($s, $val, $name) = @_;
  185. my($sname);
  186. my($out, $realpack, $realtype, $type, $ipad, $id, $blesspad);
  187. $type = ref $val;
  188. $out = "";
  189. if ($type) {
  190. # prep it, if it looks like an object
  191. if ($type =~ /[a-z_:]/) {
  192. my $freezer = $s->{freezer};
  193. $val->$freezer() if $freezer && UNIVERSAL::can($val, $freezer);
  194. }
  195. ($realpack, $realtype, $id) =
  196. (overload::StrVal($val) =~ /^(?:(.*)\=)?([^=]*)\(([^\(]*)\)$/);
  197. # if it has a name, we need to either look it up, or keep a tab
  198. # on it so we know when we hit it later
  199. if (defined($name) and length($name)) {
  200. # keep a tab on it so that we dont fall into recursive pit
  201. if (exists $s->{seen}{$id}) {
  202. # if ($s->{expdepth} < $s->{level}) {
  203. if ($s->{purity} and $s->{level} > 0) {
  204. $out = ($realtype eq 'HASH') ? '{}' :
  205. ($realtype eq 'ARRAY') ? '[]' :
  206. "''" ;
  207. push @post, $name . " = " . $s->{seen}{$id}[0];
  208. }
  209. else {
  210. $out = $s->{seen}{$id}[0];
  211. if ($name =~ /^([\@\%])/) {
  212. my $start = $1;
  213. if ($out =~ /^\\$start/) {
  214. $out = substr($out, 1);
  215. }
  216. else {
  217. $out = $start . '{' . $out . '}';
  218. }
  219. }
  220. }
  221. return $out;
  222. # }
  223. }
  224. else {
  225. # store our name
  226. $s->{seen}{$id} = [ (($name =~ /^[@%]/) ? ('\\' . $name ) :
  227. ($realtype eq 'CODE' and
  228. $name =~ /^[*](.*)$/) ? ('\\&' . $1 ) :
  229. $name ),
  230. $val ];
  231. }
  232. }
  233. $s->{level}++;
  234. $ipad = $s->{xpad} x $s->{level};
  235. if ($realpack) { # we have a blessed ref
  236. $out = $s->{'bless'} . '( ';
  237. $blesspad = $s->{apad};
  238. $s->{apad} .= ' ' if ($s->{indent} >= 2);
  239. }
  240. if ($realtype eq 'SCALAR') {
  241. if ($realpack) {
  242. $out .= 'do{\\(my $o = ' . $s->_dump($$val, "\${$name}") . ')}';
  243. }
  244. else {
  245. $out .= '\\' . $s->_dump($$val, "\${$name}");
  246. }
  247. }
  248. elsif ($realtype eq 'GLOB') {
  249. $out .= '\\' . $s->_dump($$val, "*{$name}");
  250. }
  251. elsif ($realtype eq 'ARRAY') {
  252. my($v, $pad, $mname);
  253. my($i) = 0;
  254. $out .= ($name =~ /^\@/) ? '(' : '[';
  255. $pad = $s->{sep} . $s->{pad} . $s->{apad};
  256. ($name =~ /^\@(.*)$/) ? ($mname = "\$" . $1) :
  257. # omit -> if $foo->[0]->{bar}, but not ${$foo->[0]}->{bar}
  258. ($name =~ /^\\?[\%\@\*\$][^{].*[]}]$/) ? ($mname = $name) :
  259. ($mname = $name . '->');
  260. $mname .= '->' if $mname =~ /^\*.+\{[A-Z]+\}$/;
  261. for $v (@$val) {
  262. $sname = $mname . '[' . $i . ']';
  263. $out .= $pad . $ipad . '#' . $i if $s->{indent} >= 3;
  264. $out .= $pad . $ipad . $s->_dump($v, $sname);
  265. $out .= "," if $i++ < $#$val;
  266. }
  267. $out .= $pad . ($s->{xpad} x ($s->{level} - 1)) if $i;
  268. $out .= ($name =~ /^\@/) ? ')' : ']';
  269. }
  270. elsif ($realtype eq 'HASH') {
  271. my($k, $v, $pad, $lpad, $mname);
  272. $out .= ($name =~ /^\%/) ? '(' : '{';
  273. $pad = $s->{sep} . $s->{pad} . $s->{apad};
  274. $lpad = $s->{apad};
  275. ($name =~ /^\%(.*)$/) ? ($mname = "\$" . $1) :
  276. # omit -> if $foo->[0]->{bar}, but not ${$foo->[0]}->{bar}
  277. ($name =~ /^\\?[\%\@\*\$][^{].*[]}]$/) ? ($mname = $name) :
  278. ($mname = $name . '->');
  279. $mname .= '->' if $mname =~ /^\*.+\{[A-Z]+\}$/;
  280. while (($k, $v) = each %$val) {
  281. my $nk = $s->_dump($k, "");
  282. $nk = $1 if !$s->{quotekeys} and $nk =~ /^[\"\']([A-Za-z_]\w*)[\"\']$/;
  283. $sname = $mname . '{' . $nk . '}';
  284. $out .= $pad . $ipad . $nk . " => ";
  285. # temporarily alter apad
  286. $s->{apad} .= (" " x (length($nk) + 4)) if $s->{indent} >= 2;
  287. $out .= $s->_dump($val->{$k}, $sname) . ",";
  288. $s->{apad} = $lpad if $s->{indent} >= 2;
  289. }
  290. if (substr($out, -1) eq ',') {
  291. chop $out;
  292. $out .= $pad . ($s->{xpad} x ($s->{level} - 1));
  293. }
  294. $out .= ($name =~ /^\%/) ? ')' : '}';
  295. }
  296. elsif ($realtype eq 'CODE') {
  297. $out .= 'sub { "DUMMY" }';
  298. carp "Encountered CODE ref, using dummy placeholder" if $s->{purity};
  299. }
  300. else {
  301. croak "Can\'t handle $realtype type.";
  302. }
  303. if ($realpack) { # we have a blessed ref
  304. $out .= ', \'' . $realpack . '\'' . ' )';
  305. $out .= '->' . $s->{toaster} . '()' if $s->{toaster} ne '';
  306. $s->{apad} = $blesspad;
  307. }
  308. $s->{level}--;
  309. }
  310. else { # simple scalar
  311. my $ref = \$_[1];
  312. # first, catalog the scalar
  313. if ($name ne '') {
  314. ($id) = ("$ref" =~ /\(([^\(]*)\)$/);
  315. if (exists $s->{seen}{$id}) {
  316. if ($s->{seen}{$id}[2]) {
  317. $out = $s->{seen}{$id}[0];
  318. #warn "[<$out]\n";
  319. return "\${$out}";
  320. }
  321. }
  322. else {
  323. #warn "[>\\$name]\n";
  324. $s->{seen}{$id} = ["\\$name", $ref];
  325. }
  326. }
  327. if (ref($ref) eq 'GLOB' or "$ref" =~ /=GLOB\([^()]+\)$/) { # glob
  328. my $name = substr($val, 1);
  329. if ($name =~ /^[A-Za-z_][\w:]*$/) {
  330. $name =~ s/^main::/::/;
  331. $sname = $name;
  332. }
  333. else {
  334. $sname = $s->_dump($name, "");
  335. $sname = '{' . $sname . '}';
  336. }
  337. if ($s->{purity}) {
  338. my $k;
  339. local ($s->{level}) = 0;
  340. for $k (qw(SCALAR ARRAY HASH)) {
  341. my $gval = *$val{$k};
  342. next unless defined $gval;
  343. next if $k eq "SCALAR" && ! defined $$gval; # always there
  344. # _dump can push into @post, so we hold our place using $postlen
  345. my $postlen = scalar @post;
  346. $post[$postlen] = "\*$sname = ";
  347. local ($s->{apad}) = " " x length($post[$postlen]) if $s->{indent} >= 2;
  348. $post[$postlen] .= $s->_dump($gval, "\*$sname\{$k\}");
  349. }
  350. }
  351. $out .= '*' . $sname;
  352. }
  353. elsif (!defined($val)) {
  354. $out .= "undef";
  355. }
  356. elsif ($val =~ /^-?[1-9]\d{0,8}$/) { # safe decimal number
  357. $out .= $val;
  358. }
  359. else { # string
  360. if ($s->{useqq}) {
  361. $out .= qquote($val, $s->{useqq});
  362. }
  363. else {
  364. $val =~ s/([\\\'])/\\$1/g;
  365. $out .= '\'' . $val . '\'';
  366. }
  367. }
  368. }
  369. if ($id) {
  370. # if we made it this far, $id was added to seen list at current
  371. # level, so remove it to get deep copies
  372. if ($s->{deepcopy}) {
  373. delete($s->{seen}{$id});
  374. }
  375. elsif ($name) {
  376. $s->{seen}{$id}[2] = 1;
  377. }
  378. }
  379. return $out;
  380. }
  381. #
  382. # non-OO style of earlier version
  383. #
  384. sub Dumper {
  385. return Data::Dumper->Dump([@_]);
  386. }
  387. #
  388. # same, only calls the XS version
  389. #
  390. sub DumperX {
  391. return Data::Dumper->Dumpxs([@_], []);
  392. }
  393. sub Dumpf { return Data::Dumper->Dump(@_) }
  394. sub Dumpp { print Data::Dumper->Dump(@_) }
  395. #
  396. # reset the "seen" cache
  397. #
  398. sub Reset {
  399. my($s) = shift;
  400. $s->{seen} = {};
  401. return $s;
  402. }
  403. sub Indent {
  404. my($s, $v) = @_;
  405. if (defined($v)) {
  406. if ($v == 0) {
  407. $s->{xpad} = "";
  408. $s->{sep} = "";
  409. }
  410. else {
  411. $s->{xpad} = " ";
  412. $s->{sep} = "\n";
  413. }
  414. $s->{indent} = $v;
  415. return $s;
  416. }
  417. else {
  418. return $s->{indent};
  419. }
  420. }
  421. sub Pad {
  422. my($s, $v) = @_;
  423. defined($v) ? (($s->{pad} = $v), return $s) : $s->{pad};
  424. }
  425. sub Varname {
  426. my($s, $v) = @_;
  427. defined($v) ? (($s->{varname} = $v), return $s) : $s->{varname};
  428. }
  429. sub Purity {
  430. my($s, $v) = @_;
  431. defined($v) ? (($s->{purity} = $v), return $s) : $s->{purity};
  432. }
  433. sub Useqq {
  434. my($s, $v) = @_;
  435. defined($v) ? (($s->{useqq} = $v), return $s) : $s->{useqq};
  436. }
  437. sub Terse {
  438. my($s, $v) = @_;
  439. defined($v) ? (($s->{terse} = $v), return $s) : $s->{terse};
  440. }
  441. sub Freezer {
  442. my($s, $v) = @_;
  443. defined($v) ? (($s->{freezer} = $v), return $s) : $s->{freezer};
  444. }
  445. sub Toaster {
  446. my($s, $v) = @_;
  447. defined($v) ? (($s->{toaster} = $v), return $s) : $s->{toaster};
  448. }
  449. sub Deepcopy {
  450. my($s, $v) = @_;
  451. defined($v) ? (($s->{deepcopy} = $v), return $s) : $s->{deepcopy};
  452. }
  453. sub Quotekeys {
  454. my($s, $v) = @_;
  455. defined($v) ? (($s->{quotekeys} = $v), return $s) : $s->{quotekeys};
  456. }
  457. sub Bless {
  458. my($s, $v) = @_;
  459. defined($v) ? (($s->{'bless'} = $v), return $s) : $s->{'bless'};
  460. }
  461. # used by qquote below
  462. my %esc = (
  463. "\a" => "\\a",
  464. "\b" => "\\b",
  465. "\t" => "\\t",
  466. "\n" => "\\n",
  467. "\f" => "\\f",
  468. "\r" => "\\r",
  469. "\e" => "\\e",
  470. );
  471. # put a string value in double quotes
  472. sub qquote {
  473. local($_) = shift;
  474. s/([\\\"\@\$])/\\$1/g;
  475. return qq("$_") unless /[^\040-\176]/; # fast exit
  476. my $high = shift || "";
  477. s/([\a\b\t\n\f\r\e])/$esc{$1}/g;
  478. # no need for 3 digits in escape for these
  479. s/([\0-\037])(?!\d)/'\\'.sprintf('%o',ord($1))/eg;
  480. s/([\0-\037\177])/'\\'.sprintf('%03o',ord($1))/eg;
  481. if ($high eq "iso8859") {
  482. s/([\200-\240])/'\\'.sprintf('%o',ord($1))/eg;
  483. } elsif ($high eq "utf8") {
  484. # use utf8;
  485. # $str =~ s/([^\040-\176])/sprintf "\\x{%04x}", ord($1)/ge;
  486. } elsif ($high eq "8bit") {
  487. # leave it as it is
  488. } else {
  489. s/([\0-\037\177-\377])/'\\'.sprintf('%03o',ord($1))/eg;
  490. }
  491. return qq("$_");
  492. }
  493. 1;
  494. __END__
  495. =head1 NAME
  496. Data::Dumper - stringified perl data structures, suitable for both printing and C<eval>
  497. =head1 SYNOPSIS
  498. use Data::Dumper;
  499. # simple procedural interface
  500. print Dumper($foo, $bar);
  501. # extended usage with names
  502. print Data::Dumper->Dump([$foo, $bar], [qw(foo *ary)]);
  503. # configuration variables
  504. {
  505. local $Data::Dump::Purity = 1;
  506. eval Data::Dumper->Dump([$foo, $bar], [qw(foo *ary)]);
  507. }
  508. # OO usage
  509. $d = Data::Dumper->new([$foo, $bar], [qw(foo *ary)]);
  510. ...
  511. print $d->Dump;
  512. ...
  513. $d->Purity(1)->Terse(1)->Deepcopy(1);
  514. eval $d->Dump;
  515. =head1 DESCRIPTION
  516. Given a list of scalars or reference variables, writes out their contents in
  517. perl syntax. The references can also be objects. The contents of each
  518. variable is output in a single Perl statement. Handles self-referential
  519. structures correctly.
  520. The return value can be C<eval>ed to get back an identical copy of the
  521. original reference structure.
  522. Any references that are the same as one of those passed in will be named
  523. C<$VAR>I<n> (where I<n> is a numeric suffix), and other duplicate references
  524. to substructures within C<$VAR>I<n> will be appropriately labeled using arrow
  525. notation. You can specify names for individual values to be dumped if you
  526. use the C<Dump()> method, or you can change the default C<$VAR> prefix to
  527. something else. See C<$Data::Dumper::Varname> and C<$Data::Dumper::Terse>
  528. below.
  529. The default output of self-referential structures can be C<eval>ed, but the
  530. nested references to C<$VAR>I<n> will be undefined, since a recursive
  531. structure cannot be constructed using one Perl statement. You should set the
  532. C<Purity> flag to 1 to get additional statements that will correctly fill in
  533. these references.
  534. In the extended usage form, the references to be dumped can be given
  535. user-specified names. If a name begins with a C<*>, the output will
  536. describe the dereferenced type of the supplied reference for hashes and
  537. arrays, and coderefs. Output of names will be avoided where possible if
  538. the C<Terse> flag is set.
  539. In many cases, methods that are used to set the internal state of the
  540. object will return the object itself, so method calls can be conveniently
  541. chained together.
  542. Several styles of output are possible, all controlled by setting
  543. the C<Indent> flag. See L<Configuration Variables or Methods> below
  544. for details.
  545. =head2 Methods
  546. =over 4
  547. =item I<PACKAGE>->new(I<ARRAYREF [>, I<ARRAYREF]>)
  548. Returns a newly created C<Data::Dumper> object. The first argument is an
  549. anonymous array of values to be dumped. The optional second argument is an
  550. anonymous array of names for the values. The names need not have a leading
  551. C<$> sign, and must be comprised of alphanumeric characters. You can begin
  552. a name with a C<*> to specify that the dereferenced type must be dumped
  553. instead of the reference itself, for ARRAY and HASH references.
  554. The prefix specified by C<$Data::Dumper::Varname> will be used with a
  555. numeric suffix if the name for a value is undefined.
  556. Data::Dumper will catalog all references encountered while dumping the
  557. values. Cross-references (in the form of names of substructures in perl
  558. syntax) will be inserted at all possible points, preserving any structural
  559. interdependencies in the original set of values. Structure traversal is
  560. depth-first, and proceeds in order from the first supplied value to
  561. the last.
  562. =item I<$OBJ>->Dump I<or> I<PACKAGE>->Dump(I<ARRAYREF [>, I<ARRAYREF]>)
  563. Returns the stringified form of the values stored in the object (preserving
  564. the order in which they were supplied to C<new>), subject to the
  565. configuration options below. In an array context, it returns a list
  566. of strings corresponding to the supplied values.
  567. The second form, for convenience, simply calls the C<new> method on its
  568. arguments before dumping the object immediately.
  569. =item I<$OBJ>->Dumpxs I<or> I<PACKAGE>->Dumpxs(I<ARRAYREF [>, I<ARRAYREF]>)
  570. This method is available if you were able to compile and install the XSUB
  571. extension to C<Data::Dumper>. It is exactly identical to the C<Dump> method
  572. above, only about 4 to 5 times faster, since it is written entirely in C.
  573. =item I<$OBJ>->Seen(I<[HASHREF]>)
  574. Queries or adds to the internal table of already encountered references.
  575. You must use C<Reset> to explicitly clear the table if needed. Such
  576. references are not dumped; instead, their names are inserted wherever they
  577. are encountered subsequently. This is useful especially for properly
  578. dumping subroutine references.
  579. Expects a anonymous hash of name => value pairs. Same rules apply for names
  580. as in C<new>. If no argument is supplied, will return the "seen" list of
  581. name => value pairs, in an array context. Otherwise, returns the object
  582. itself.
  583. =item I<$OBJ>->Values(I<[ARRAYREF]>)
  584. Queries or replaces the internal array of values that will be dumped.
  585. When called without arguments, returns the values. Otherwise, returns the
  586. object itself.
  587. =item I<$OBJ>->Names(I<[ARRAYREF]>)
  588. Queries or replaces the internal array of user supplied names for the values
  589. that will be dumped. When called without arguments, returns the names.
  590. Otherwise, returns the object itself.
  591. =item I<$OBJ>->Reset
  592. Clears the internal table of "seen" references and returns the object
  593. itself.
  594. =back
  595. =head2 Functions
  596. =over 4
  597. =item Dumper(I<LIST>)
  598. Returns the stringified form of the values in the list, subject to the
  599. configuration options below. The values will be named C<$VAR>I<n> in the
  600. output, where I<n> is a numeric suffix. Will return a list of strings
  601. in an array context.
  602. =item DumperX(I<LIST>)
  603. Identical to the C<Dumper()> function above, but this calls the XSUB
  604. implementation. Only available if you were able to compile and install
  605. the XSUB extensions in C<Data::Dumper>.
  606. =back
  607. =head2 Configuration Variables or Methods
  608. Several configuration variables can be used to control the kind of output
  609. generated when using the procedural interface. These variables are usually
  610. C<local>ized in a block so that other parts of the code are not affected by
  611. the change.
  612. These variables determine the default state of the object created by calling
  613. the C<new> method, but cannot be used to alter the state of the object
  614. thereafter. The equivalent method names should be used instead to query
  615. or set the internal state of the object.
  616. The method forms return the object itself when called with arguments,
  617. so that they can be chained together nicely.
  618. =over 4
  619. =item $Data::Dumper::Indent I<or> I<$OBJ>->Indent(I<[NEWVAL]>)
  620. Controls the style of indentation. It can be set to 0, 1, 2 or 3. Style 0
  621. spews output without any newlines, indentation, or spaces between list
  622. items. It is the most compact format possible that can still be called
  623. valid perl. Style 1 outputs a readable form with newlines but no fancy
  624. indentation (each level in the structure is simply indented by a fixed
  625. amount of whitespace). Style 2 (the default) outputs a very readable form
  626. which takes into account the length of hash keys (so the hash value lines
  627. up). Style 3 is like style 2, but also annotates the elements of arrays
  628. with their index (but the comment is on its own line, so array output
  629. consumes twice the number of lines). Style 2 is the default.
  630. =item $Data::Dumper::Purity I<or> I<$OBJ>->Purity(I<[NEWVAL]>)
  631. Controls the degree to which the output can be C<eval>ed to recreate the
  632. supplied reference structures. Setting it to 1 will output additional perl
  633. statements that will correctly recreate nested references. The default is
  634. 0.
  635. =item $Data::Dumper::Pad I<or> I<$OBJ>->Pad(I<[NEWVAL]>)
  636. Specifies the string that will be prefixed to every line of the output.
  637. Empty string by default.
  638. =item $Data::Dumper::Varname I<or> I<$OBJ>->Varname(I<[NEWVAL]>)
  639. Contains the prefix to use for tagging variable names in the output. The
  640. default is "VAR".
  641. =item $Data::Dumper::Useqq I<or> I<$OBJ>->Useqq(I<[NEWVAL]>)
  642. When set, enables the use of double quotes for representing string values.
  643. Whitespace other than space will be represented as C<[\n\t\r]>, "unsafe"
  644. characters will be backslashed, and unprintable characters will be output as
  645. quoted octal integers. Since setting this variable imposes a performance
  646. penalty, the default is 0. The C<Dumpxs()> method does not honor this
  647. flag yet.
  648. =item $Data::Dumper::Terse I<or> I<$OBJ>->Terse(I<[NEWVAL]>)
  649. When set, Data::Dumper will emit single, non-self-referential values as
  650. atoms/terms rather than statements. This means that the C<$VAR>I<n> names
  651. will be avoided where possible, but be advised that such output may not
  652. always be parseable by C<eval>.
  653. =item $Data::Dumper::Freezer I<or> $I<OBJ>->Freezer(I<[NEWVAL]>)
  654. Can be set to a method name, or to an empty string to disable the feature.
  655. Data::Dumper will invoke that method via the object before attempting to
  656. stringify it. This method can alter the contents of the object (if, for
  657. instance, it contains data allocated from C), and even rebless it in a
  658. different package. The client is responsible for making sure the specified
  659. method can be called via the object, and that the object ends up containing
  660. only perl data types after the method has been called. Defaults to an empty
  661. string.
  662. =item $Data::Dumper::Toaster I<or> $I<OBJ>->Toaster(I<[NEWVAL]>)
  663. Can be set to a method name, or to an empty string to disable the feature.
  664. Data::Dumper will emit a method call for any objects that are to be dumped
  665. using the syntax C<bless(DATA, CLASS)->METHOD()>. Note that this means that
  666. the method specified will have to perform any modifications required on the
  667. object (like creating new state within it, and/or reblessing it in a
  668. different package) and then return it. The client is responsible for making
  669. sure the method can be called via the object, and that it returns a valid
  670. object. Defaults to an empty string.
  671. =item $Data::Dumper::Deepcopy I<or> $I<OBJ>->Deepcopy(I<[NEWVAL]>)
  672. Can be set to a boolean value to enable deep copies of structures.
  673. Cross-referencing will then only be done when absolutely essential
  674. (i.e., to break reference cycles). Default is 0.
  675. =item $Data::Dumper::Quotekeys I<or> $I<OBJ>->Quotekeys(I<[NEWVAL]>)
  676. Can be set to a boolean value to control whether hash keys are quoted.
  677. A false value will avoid quoting hash keys when it looks like a simple
  678. string. Default is 1, which will always enclose hash keys in quotes.
  679. =item $Data::Dumper::Bless I<or> $I<OBJ>->Bless(I<[NEWVAL]>)
  680. Can be set to a string that specifies an alternative to the C<bless>
  681. builtin operator used to create objects. A function with the specified
  682. name should exist, and should accept the same arguments as the builtin.
  683. Default is C<bless>.
  684. =back
  685. =head2 Exports
  686. =over 4
  687. =item Dumper
  688. =back
  689. =head1 EXAMPLES
  690. Run these code snippets to get a quick feel for the behavior of this
  691. module. When you are through with these examples, you may want to
  692. add or change the various configuration variables described above,
  693. to see their behavior. (See the testsuite in the Data::Dumper
  694. distribution for more examples.)
  695. use Data::Dumper;
  696. package Foo;
  697. sub new {bless {'a' => 1, 'b' => sub { return "foo" }}, $_[0]};
  698. package Fuz; # a weird REF-REF-SCALAR object
  699. sub new {bless \($_ = \ 'fu\'z'), $_[0]};
  700. package main;
  701. $foo = Foo->new;
  702. $fuz = Fuz->new;
  703. $boo = [ 1, [], "abcd", \*foo,
  704. {1 => 'a', 023 => 'b', 0x45 => 'c'},
  705. \\"p\q\'r", $foo, $fuz];
  706. ########
  707. # simple usage
  708. ########
  709. $bar = eval(Dumper($boo));
  710. print($@) if $@;
  711. print Dumper($boo), Dumper($bar); # pretty print (no array indices)
  712. $Data::Dumper::Terse = 1; # don't output names where feasible
  713. $Data::Dumper::Indent = 0; # turn off all pretty print
  714. print Dumper($boo), "\n";
  715. $Data::Dumper::Indent = 1; # mild pretty print
  716. print Dumper($boo);
  717. $Data::Dumper::Indent = 3; # pretty print with array indices
  718. print Dumper($boo);
  719. $Data::Dumper::Useqq = 1; # print strings in double quotes
  720. print Dumper($boo);
  721. ########
  722. # recursive structures
  723. ########
  724. @c = ('c');
  725. $c = \@c;
  726. $b = {};
  727. $a = [1, $b, $c];
  728. $b->{a} = $a;
  729. $b->{b} = $a->[1];
  730. $b->{c} = $a->[2];
  731. print Data::Dumper->Dump([$a,$b,$c], [qw(a b c)]);
  732. $Data::Dumper::Purity = 1; # fill in the holes for eval
  733. print Data::Dumper->Dump([$a, $b], [qw(*a b)]); # print as @a
  734. print Data::Dumper->Dump([$b, $a], [qw(*b a)]); # print as %b
  735. $Data::Dumper::Deepcopy = 1; # avoid cross-refs
  736. print Data::Dumper->Dump([$b, $a], [qw(*b a)]);
  737. $Data::Dumper::Purity = 0; # avoid cross-refs
  738. print Data::Dumper->Dump([$b, $a], [qw(*b a)]);
  739. ########
  740. # object-oriented usage
  741. ########
  742. $d = Data::Dumper->new([$a,$b], [qw(a b)]);
  743. $d->Seen({'*c' => $c}); # stash a ref without printing it
  744. $d->Indent(3);
  745. print $d->Dump;
  746. $d->Reset->Purity(0); # empty the seen cache
  747. print join "----\n", $d->Dump;
  748. ########
  749. # persistence
  750. ########
  751. package Foo;
  752. sub new { bless { state => 'awake' }, shift }
  753. sub Freeze {
  754. my $s = shift;
  755. print STDERR "preparing to sleep\n";
  756. $s->{state} = 'asleep';
  757. return bless $s, 'Foo::ZZZ';
  758. }
  759. package Foo::ZZZ;
  760. sub Thaw {
  761. my $s = shift;
  762. print STDERR "waking up\n";
  763. $s->{state} = 'awake';
  764. return bless $s, 'Foo';
  765. }
  766. package Foo;
  767. use Data::Dumper;
  768. $a = Foo->new;
  769. $b = Data::Dumper->new([$a], ['c']);
  770. $b->Freezer('Freeze');
  771. $b->Toaster('Thaw');
  772. $c = $b->Dump;
  773. print $c;
  774. $d = eval $c;
  775. print Data::Dumper->Dump([$d], ['d']);
  776. ########
  777. # symbol substitution (useful for recreating CODE refs)
  778. ########
  779. sub foo { print "foo speaking\n" }
  780. *other = \&foo;
  781. $bar = [ \&other ];
  782. $d = Data::Dumper->new([\&other,$bar],['*other','bar']);
  783. $d->Seen({ '*foo' => \&foo });
  784. print $d->Dump;
  785. =head1 BUGS
  786. Due to limitations of Perl subroutine call semantics, you cannot pass an
  787. array or hash. Prepend it with a C<\> to pass its reference instead. This
  788. will be remedied in time, with the arrival of prototypes in later versions
  789. of Perl. For now, you need to use the extended usage form, and prepend the
  790. name with a C<*> to output it as a hash or array.
  791. C<Data::Dumper> cheats with CODE references. If a code reference is
  792. encountered in the structure being processed, an anonymous subroutine that
  793. contains the string '"DUMMY"' will be inserted in its place, and a warning
  794. will be printed if C<Purity> is set. You can C<eval> the result, but bear
  795. in mind that the anonymous sub that gets created is just a placeholder.
  796. Someday, perl will have a switch to cache-on-demand the string
  797. representation of a compiled piece of code, I hope. If you have prior
  798. knowledge of all the code refs that your data structures are likely
  799. to have, you can use the C<Seen> method to pre-seed the internal reference
  800. table and make the dumped output point to them, instead. See L<EXAMPLES>
  801. above.
  802. The C<Useqq> flag is not honored by C<Dumpxs()> (it always outputs
  803. strings in single quotes).
  804. SCALAR objects have the weirdest looking C<bless> workaround.
  805. =head1 AUTHOR
  806. Gurusamy Sarathy gsar@umich.edu
  807. Copyright (c) 1996-98 Gurusamy Sarathy. All rights reserved.
  808. This program is free software; you can redistribute it and/or
  809. modify it under the same terms as Perl itself.
  810. =head1 VERSION
  811. Version 2.10 (31 Oct 1998)
  812. =head1 SEE ALSO
  813. perl(1)
  814. =cut