view release on metacpan or search on metacpan
lib/Akamai/Edgegrid.pm view on Meta::CPAN
use 5.006;
use strict;
use warnings FATAL => 'all';
use base 'LWP::UserAgent';
use Data::Dumper;
use Digest::SHA qw(hmac_sha256_base64 sha256_base64);
use POSIX qw(strftime);
use Data::UUID;
use Config::IniFiles;
view release on metacpan or search on metacpan
lib/Akamai/Open/Debug.pm view on Meta::CPAN
$Akamai::Open::Debug::VERSION = '0.03';
use strict;
use warnings;
use MooseX::Singleton;
use Data::Dumper qw/Dumper/;
use Log::Log4perl;
our $default_conf = q/
log4perl.category.Akamai.Open.Debug = ERROR, Screen
log4perl.appender.Screen = Log::Log4perl::Appender::Screen
view release on metacpan or search on metacpan
lib/Album.pm view on Meta::CPAN
=back
=head1 BUGS AND PROBLEMS
Some versions of Perl may exhibit Data::Dumper problems with non-ASCII
data. Perl 5.6.x and 5.8.3 and later should be fine.
=head1 AUTHOR AND CREDITS
Johan Vromans (jvromans@squirrel.nl) wrote this module.
view release on metacpan or search on metacpan
lib/Algorithm/Bitonic/Sort.pm view on Meta::CPAN
use feature 'say';
use common::sense;
use constant DEBUG => $ENV{ALGORITHM_BITONIC_SORT_DEBUG};
if (DEBUG) {
require Data::Dumper::Simple;
}
our (@ISA, @EXPORT);
BEGIN {
require Exporter;
view release on metacpan or search on metacpan
eg/sample.pl view on Meta::CPAN
###########################################
use warnings;
use strict;
use Algorithm::Bucketizer;
use Data::Dumper;
print "$Algorithm::Bucketizer::VERSION\n";
my @items = (
[2,2],
view release on metacpan or search on metacpan
t/02-predict.t view on Meta::CPAN
my @original = @whole_series[64 .. $#whole_series];
my @predicted = @{ $burg->predict(64) };
is($#original, $#predicted, 'cardinality');
# use Data::Dumper;
# diag Dumper(\@original, \@predicted);
my $error = 0.0;
my $epsilon = 3.0;
for my $i (0 .. $#original) {
view release on metacpan or search on metacpan
# NoGood is registered
ok($ngs->nb_no_goods > 0);
my $nng = $ngs->nb_no_goods;
use Data::Dumper;
$ngs->filter_no_good(sub {
return 1;
}); # use this NG
is($ngs->nb_no_goods, $nng);
view release on metacpan or search on metacpan
lib/Algorithm/CheckDigits/MXX_006.pm view on Meta::CPAN
use 5.006;
use strict;
use warnings;
use integer;
use Data::Dumper;
use version; our $VERSION = 'v1.3.6';
our @ISA = qw(Algorithm::CheckDigits);
view release on metacpan or search on metacpan
example/cluster.pl view on Meta::CPAN
use strict;
use warnings;
use Algorithm::ClusterPoints;
use Data::Dumper;
my $clp = Algorithm::ClusterPoints->new(radius => 0.1, min_size => 2, ordered => 1);
while (<DATA>) {
next if /^\s*(?:#.*)?$/;
example/cluster.pl view on Meta::CPAN
$clp->add_point($x, $y);
}
my @clusters_ix = $clp->clusters_ix;
print Data::Dumper->Dump([\@clusters_ix], ['clusters_ix']);
for my $i (0..$#clusters_ix) {
print( join( ' ',
"cluster $i:",
map {
example/cluster.pl view on Meta::CPAN
), "\n"
);
}
my @clusters = $clp->clusters;
print Data::Dumper->Dump([\@clusters], ['clusters']);
__DATA__
0.43 0.62
0.50 0.65
0.49 0.32
view release on metacpan or search on metacpan
lib/Algorithm/CriticalPath.pm view on Meta::CPAN
our $VERSION = '0.07';
use Graph;
use Carp;
use Data::Dumper;
has 'graph' => (
is => 'ro'
, isa => 'Graph'
, required => 1
view release on metacpan or search on metacpan
examples/examplefit.pl view on Meta::CPAN
xdata => \@xdata,
ydata => \@ydata,
maximum_iterations => $max_iter,
);
use Data::Dumper;
print Dumper \@parameters;
print Dumper $square_residual;
view release on metacpan or search on metacpan
lib/Algorithm/DBSCAN.pm view on Meta::CPAN
use strict;
use warnings;
use 5.10.1;
use Data::Dumper;
use Algorithm::DBSCAN::Point;
use Algorithm::DBSCAN::Dataset;
=head1 NAME
view release on metacpan or search on metacpan
lib/Algorithm/DependencySolver/Traversal.pm view on Meta::CPAN
use MooseX::FollowPBP;
use MooseX::Method::Signatures;
use List::MoreUtils qw(all uniq);
use Data::Dumper;
=head1 NAME
Algorithm::DependencySolver::Traversal - A module for traversing a dependency graph
view release on metacpan or search on metacpan
use strict;
$^W++;
use lib qw(blib lib);
use Algorithm::Diff::Any qw(diff LCS traverse_sequences traverse_balanced sdiff);
use Algorithm::Diff;
use Data::Dumper;
use Test;
BEGIN
{
$|++;
my @lcs = LCS( \@a, \@b );
ok( "@lcs", $correctResult );
# Compare the diff output with the one from the Algorithm::Diff manpage.
my $diff = diff( \@a, \@b );
$Data::Dumper::Indent = 0;
my $cds = Dumper($correctDiffResult);
my $dds = Dumper($diff);
ok( $dds, $cds );
##################################################
view release on metacpan or search on metacpan
# `make test'. After `make install' it should work as `perl base.t'
use strict;
$^W++;
use lib qw(blib lib);
use Algorithm::Diff::XS qw(diff LCS traverse_sequences traverse_balanced sdiff);
use Data::Dumper;
use Test;
BEGIN
{
$|++;
my @lcs = LCS( \@a, \@b );
ok( "@lcs", $correctResult );
# Compare the diff output with the one from the Algorithm::Diff manpage.
my $diff = diff( \@a, \@b );
$Data::Dumper::Indent = 0;
my $cds = Dumper($correctDiffResult);
my $dds = Dumper($diff);
ok( $dds, $cds );
##################################################
view release on metacpan or search on metacpan
# `make test'. After `make install' it should work as `perl base.t'
use strict;
$^W++;
use lib qw(blib lib);
use Algorithm::Diff qw(diff LCS traverse_sequences traverse_balanced sdiff);
use Data::Dumper;
use Test;
BEGIN
{
$|++;
my @lcs = LCS( \@a, \@b );
ok( "@lcs", $correctResult );
# Compare the diff output with the one from the Algorithm::Diff manpage.
my $diff = diff( \@a, \@b );
$Data::Dumper::Indent = 0;
my $cds = Dumper($correctDiffResult);
my $dds = Dumper($diff);
ok( $dds, $cds );
##################################################
view release on metacpan or search on metacpan
inc/Spiffy.pm view on Meta::CPAN
*{"${package}::$field"} = $sub;
return $code if defined wantarray;
}
sub default_as_code {
require Data::Dumper;
local $Data::Dumper::Sortkeys = 1;
my $code = Data::Dumper::Dumper(shift);
$code =~ s/^\$VAR1 = //;
$code =~ s/;$//;
return $code;
}
inc/Spiffy.pm view on Meta::CPAN
# Debugging support
#===============================================================================
sub spiffy_dump {
no warnings;
if ($dump eq 'dumper') {
require Data::Dumper;
$Data::Dumper::Sortkeys = 1;
$Data::Dumper::Indent = 1;
return Data::Dumper::Dumper(@_);
}
require YAML;
$YAML::UseVersion = 0;
return YAML::Dump(@_) . "...\n";
}
view release on metacpan or search on metacpan
Allow fitness to not be memo-ized (re-evaulate every generation)
Write more tests
Support for freezing state using Storable or Data::Dumper or something
Non-aligned crossover
Better POD for EA-n00bs ;)
view release on metacpan or search on metacpan
lib/Algorithm/FeatureSelection.pm view on Meta::CPAN
my $sum = sum(@$arrayref);
for (@$arrayref) {
next if $_ <= 0;
eval { push @ratio, $_ / $sum; };
if ($@) {
use Data::Dumper;
print Dumper $arrayref;
die($@);
}
}
return @ratio;
view release on metacpan or search on metacpan
t/01-all_reachable.t view on Meta::CPAN
use Algorithm::Graphs::Reachable::Tiny qw(all_reachable);
use Test::More tests => 36;
## use Data::Dumper;
{
# Empty input
is_deeply(all_reachable({}, {}), {}, "all_reachable({}, {})");
is_deeply(all_reachable({}, []), {}, "all_reachable({}, {})");
view release on metacpan or search on metacpan
eg/rainmidi3000.pl view on Meta::CPAN
# holes in a gutter either produce MIDI note events or toggle other
# holes on or off over time, as fed by changing amounts of rainfall.
# There are lots of things to TWEAK.
use v5.26.0;
use Algorithm::Gutter 0.02;
use Data::Dumper;
use List::Util 'shuffle';
use MIDI;
my $out_file = shift // 'out.midi';
my $ch = 0; # MIDI channel (9 for drums)
eg/rainmidi3000.pl view on Meta::CPAN
unless ( defined $slosh_iters ) {
$slosh{$r}++;
}
}
unless ( defined $slosh_iters ) {
warn Data::Dumper->Dump( [ \%slosh ], ['slosh_iters'] );
}
}
MIDI::Opus->new(
{ format => 0, ticks => 96, tracks => make_track() } )
view release on metacpan or search on metacpan
lib/Algorithm/HITS.pm view on Meta::CPAN
sub new { bless {}, $_[0] }
use PDL;
use List::Util;
#use Data::Dumper;
use PDL::IO::Dumper;
sub graph {
my $self = shift;
my $graph = shift;
view release on metacpan or search on metacpan
t/max_heap.t view on Meta::CPAN
#########################
use strict;
use warnings;
use Devel::Peek;
use Data::Dumper;
package OloadAry {
use strict;
use warnings;
my $called= 0;
t/max_heap.t view on Meta::CPAN
my $sort_elapsed= 0 - time();
{
@$_= sort { $b <=> $a } @$_ for @arrays2;
@arrays2= sort { $b <=> $a } @arrays2;
#die Data::Dumper::Dumper(\@arrays2);
my %taken;
while (@arrays2) {
my $best_ary= shift @arrays2;
last if !@$best_ary;
my $best_item= shift @$best_ary;
view release on metacpan or search on metacpan
Makefile.PL view on Meta::CPAN
# Modules for the test script
Test::More => 0,
Test::ManyParams => 0.04,
Test::Exception => 0,
Data::Dumper => 0,
String::Random => 0
}, # e.g., Module::Name => 1.1
($] >= 5.005 ? ## Add these new keywords supported since 5.005
(AUTHOR => 'Janek Schleicher <bigj@kamelfreund.de>') : ()),
);
view release on metacpan or search on metacpan
lib/Algorithm/IRCSRP2.pm view on Meta::CPAN
# ABSTRACT: IRC channel encryption algorithm
use Moose;
# core
use Data::Dumper;
use Digest::SHA;
use MIME::Base64;
use Math::BigInt only => 'GMP,Pari';
# CPAN
view release on metacpan or search on metacpan
t/02interface.t view on Meta::CPAN
use strict;
use warnings;
use Data::Dumper;
use Algorithm::KNN::XS;
use Test::More tests => 119;
my @points = (
[1.1345, 2.657],
view release on metacpan or search on metacpan
lib/Algorithm/LBFGS.pm view on Meta::CPAN
# log iterations information in the array ref $log
my $log = [];
fmin($eval_cb, $x0, 'logging', $log);
use Data::Dumper;
print Dumper $log;
=head3 user_data
view release on metacpan or search on metacpan
use Test::More tests => 10;
#use lib "../lib";
BEGIN { use_ok( 'Algorithm::Line::Bresenham', qw/line circle quad_bezier ellipse_rect polyline thick_line varthick_line/); }
use Data::Dumper;
is_deeply (
[[0,0], [1,1], [2,2]],
[line(0,0,2,2)],
'up-right' );
[6,-1],[6,-2],[7,-2],[6,-3],[5,-3],[6,-4],[5,-4],[5,-5]],
[thick_line(13,13,5,-5,2)],
'thick_line');
__END__
$Data::Dumper::Indent = 0;
print Data::Dumper->Dump([[polyline(2,3,6,4,5,7)]]);
print Data::Dumper->Dump([[polyline(55,10,60,15,55,20,60,25,55,30,60,35)]]);;
view release on metacpan or search on metacpan
lib/Algorithm/MLCS.pm view on Meta::CPAN
Version 1.02
=head1 SYNOPSIS
use Data::Dumper;
use Algorithm::MLCS;
my @seqs = (
[ qw/a b c d f g h j q z/ ],
[ qw/a b c d f g h j q z/ ],
view release on metacpan or search on metacpan
#!/usr/bin/perl -w
use strict;
use lib qw(../blib/lib ./blib/lib);
use Algorithm::MarkovChain;
use Data::Dumper;
my $mc = Algorithm::MarkovChain->new();
my $infile = shift;
if ($infile) {