/usr/share/perl5/Paranoid/Data.pm is in libparanoid-perl 2.05-2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 | # Paranoid::Data -- Misc. Data Manipulation Functions
#
# (c) 2005 - 2017, Arthur Corliss <corliss@digitalmages.com>
#
# $Id: lib/Paranoid/Data.pm, 2.05 2017/02/06 01:48:57 acorliss Exp $
#
# This software is licensed under the same terms as Perl, itself.
# Please see http://dev.perl.org/licenses/ for more information.
#
#####################################################################
#####################################################################
#
# Environment definitions
#
#####################################################################
package Paranoid::Data;
use 5.008;
use strict;
use warnings;
use vars qw($VERSION @EXPORT @EXPORT_OK %EXPORT_TAGS);
use base qw(Exporter);
use Paranoid;
use Paranoid::Debug qw(:all);
use Carp;
($VERSION) = ( q$Revision: 2.05 $ =~ /(\d+(?:\.\d+)+)/sm );
@EXPORT = qw(deepCopy deepCmp);
@EXPORT_OK = @EXPORT;
%EXPORT_TAGS = ( all => [@EXPORT_OK], );
#####################################################################
#
# Module code follows
#
#####################################################################
sub deepCopy (\[$@%]\[$@%]) {
# Purpose: Attempts to safely copy an arbitrarily deep data
# structure from the source to the target
# Returns: True or False
# Usage: $rv = deepCopy($source, $target);
# Usage: $rv = deepCopy(@source, @target);
# Usage: $rv = deepCopy(%source, %target);
my $source = shift;
my $target = shift;
my $rv = 1;
my $counter = 0;
my $sref = defined $source ? ref $source : 'undef';
my $tref = defined $target ? ref $target : 'undef';
my ( @refs, $recurseSub );
croak 'source and target must be identical data types'
unless ref $sref eq ref $tref;
pdebug( 'entering w/(%s)(%s)', PDLEVEL1, $source, $target );
pIn();
$recurseSub = sub {
my $s = shift;
my $t = shift;
my $type = ref $s;
my $irv = 1;
my ( $key, $value );
# We'll grep the @refs list to make sure there's no
# circular references going on
if ( grep { $_ eq $s } @refs ) {
Paranoid::ERROR = pdebug(
'Found a circular reference in data structure: ' . '(%s) %s',
PDLEVEL1, $s, @refs
);
return 0;
}
# Push the reference onto the list
push @refs, $s;
# Copy data over
if ( $type eq 'ARRAY' ) {
# Copy over array elements
foreach my $element (@$s) {
$type = ref $element;
$counter++;
if ( $type eq 'ARRAY' or $type eq 'HASH' ) {
# Copy over sub arrays or hashes
push @$t, $type eq 'ARRAY' ? [] : {};
return 0 unless &$recurseSub( $element, $$t[-1] );
} else {
# Copy over everything else as-is
push @$t, $element;
}
}
} elsif ( $type eq 'HASH' ) {
while ( ( $key, $value ) = each %$s ) {
$type = ref $value;
$counter++;
if ( $type eq 'ARRAY' or $type eq 'HASH' ) {
# Copy over sub arrays or hashes
$$t{$key} = $type eq 'ARRAY' ? [] : {};
return 0 unless &$recurseSub( $value, $$t{$key} );
} else {
# Copy over everything else as-is
$$t{$key} = $value;
}
}
}
# We're done, so let's remove the reference we were working on
pop @refs;
return 1;
};
# Start the copy
if ( $sref eq 'ARRAY' or $sref eq 'HASH' ) {
# Copy over arrays & hashes
if ( $sref eq 'ARRAY' ) {
@$target = ();
} else {
%$target = ();
}
$rv = &$recurseSub( $source, $target );
} else {
# Copy over everything else directly
$$target = $$source;
$counter++;
}
$rv = $counter if $rv;
pOut();
pdebug( 'leaving w/rv: %s', PDLEVEL1, $rv );
return $rv;
}
sub _cmpArray (\@\@) {
# Purpose: Compares arrays, returns true if identical
# Returns: Boolean
# Usage: $rv = _cmpArray(@array1, @array2);
my $ref1 = shift;
my $ref2 = shift;
my $rv = 1;
my $i = 0;
my ( $n, $d1, $d2, $t1, $t2 );
pdebug( 'entering w/%s %s', PDLEVEL2, $ref1, $ref2 );
pIn();
$rv = scalar @$ref1 == scalar @$ref2;
$n = scalar @$ref1;
# Compare contents if there is any
if ( $rv and $n ) {
while ( $i <= $n ) {
# Collect some meta data
$d1 = defined $$ref1[$i];
$d2 = defined $$ref2[$i];
$t1 = $d1 ? ref $$ref1[$i] : 'undef';
$t2 = $d2 ? ref $$ref2[$i] : 'undef';
if ( $d1 == $d2 ) {
# Both are undefined, so move to the next item
unless ($d1) {
$i++;
next;
}
# Both are defined, so check for type
$rv = $t1 eq $t2;
if ($rv) {
# The types are the same, so do some comparisons
if ( $t1 eq 'ARRAY' ) {
$rv = deepCmp( $$ref1[$i], $$ref2[$i] );
} elsif ( $t1 eq 'HASH' ) {
$rv = deepCmp( $$ref1[$i], $$ref2[$i] );
} else {
# Compare scalar value of all other types
$rv = $$ref1[$i] eq $$ref2[$i];
}
}
} else {
# One of the two are undefined, so quick exit
$rv = 0;
}
# Early exit if we've found a difference already
last unless $rv;
# Otherwise, on to the next element
$i++;
}
}
# A little explicit sanitizing of input for false returns
$rv = 0 unless $rv;
pOut();
pdebug( 'leaving w/rv: %s', PDLEVEL2, $rv );
return $rv;
}
sub _cmpHash (\%\%) {
# Purpose: Compares hashes, returns true if identical
# Returns: Boolean
# Usage: $rv = _cmpHash(%hash1, %hash2);
my $ref1 = shift;
my $ref2 = shift;
my $rv = 1;
my ( @k1, @k2, @v1, @v2 );
pdebug( 'entering w/%s %s', PDLEVEL2, $ref1, $ref2 );
pIn();
@k1 = sort keys %$ref1;
@k2 = sort keys %$ref2;
# Compare first by key list
$rv = _cmpArray( @k1, @k2 );
if ($rv) {
# Compare by value list
foreach (@k1) {
push @v1, $$ref1{$_};
push @v2, $$ref2{$_};
}
$rv = _cmpArray( @v1, @v2 );
}
pOut();
pdebug( 'leaving w/rv: %s', PDLEVEL2, $rv );
return $rv;
}
sub deepCmp (\[$@%]\[$@%]) {
# Purpose: Compares data structures, returns true if identical
# Returns: Boolean
# Usage: $rv = deepCmp(%hash1, %hash2);
# Usage: $rv = deepCmp(@array1, @arrays2);
my $ref1 = shift;
my $ref2 = shift;
my $rv = 1;
pdebug( 'entering w/%s %s', PDLEVEL1, $ref1, $ref2 );
pIn();
unless ( ref $ref1 eq ref $ref1 ) {
$rv = 0;
Paranoid::ERROR =
pdebug( 'data structures are not the same type', PDLEVEL1 );
}
if ( $rv and ref $ref1 eq 'SCALAR' ) {
$rv = $ref1 eq $ref2;
} elsif ( $rv and ref $ref1 eq 'ARRAY' ) {
$rv = _cmpArray( @$ref1, @$ref2 );
} elsif ( $rv and ref $ref1 eq 'HASH' ) {
$rv = _cmpHash( %$ref1, %$ref2 );
} else {
$rv = 0;
Paranoid::ERROR =
pdebug( 'called with non-simple data types', PDLEVEL1 );
}
pOut();
pdebug( 'leaving w/rv: %s', PDLEVEL1, $rv );
return $rv;
}
1;
__END__
=head1 NAME
Paranoid::Data - Misc. Data Manipulation Functions
=head1 VERSION
$Id: lib/Paranoid/Data.pm, 2.05 2017/02/06 01:48:57 acorliss Exp $
=head1 SYNOPSIS
$rv = deepCopy($source, $target);
$rv = deepCopy(@source, @target);
$rv = deepCopy(%source, %target);
$rv = deepCmp($source, $target);
$rv = deepCmp(@source, @target);
$rv = deepCmp(%source, %target);
=head1 DESCRIPTION
This module provides data manipulation functions, which at this time only
consists of B<deepCopy> and B<deepCmp>.
=head1 SUBROUTINES/METHODS
=head2 deepCopy
$rv = deepCopy($source, $target);
$rv = deepCopy(@source, @target);
$rv = deepCopy(%source, %target);
This function performs a deep and safe copy of arbitrary data structures,
checking for circular references along the way. Hashes and lists are safely
duplicated while all other data types are just copied. This means that any
embedded object references, etc., are identical in both the source and the
target, which is probably not what you want.
In short, this should only be used on pure hash/list/scalar value data
structures. Both the source and the target data types must be of an identical
type.
This function returns the number of elements copied unless it runs into a
problem (such as a circular reference), in which case it returns a zero.
=head2 deepCmp
$rv = deepCmp($source, $target);
$rv = deepCmp(@source, @target);
$rv = deepCmp(%source, %target);
This function performs a deep comparison of arbitrarily complex data
structures (i.e., hashes of lists of lists of scalars, etc.). It returns true
if the values of the structures are identical, false otherwise. Like the
B<deepCopy> function there are no provisions for evaluating objects beyond
what their values are when coerced as scalar types.
End sum, the same caveats that applied to B<deepCopy> apply here.
=head1 DEPENDENCIES
=over
=item o
L<Carp>
=item o
L<Paranoid>
=item o
L<Paranoid::Debug>
=back
=head1 BUGS AND LIMITATIONS
=head1 AUTHOR
Arthur Corliss (corliss@digitalmages.com)
=head1 LICENSE AND COPYRIGHT
This software is licensed under the same terms as Perl, itself.
Please see http://dev.perl.org/licenses/ for more information.
(c) 2005 - 2017, Arthur Corliss (corliss@digitalmages.com)
|