/ 
Struct-Diff-0.90
River stage one • 3 direct dependents • 3 total dependents
/ Struct::Diff

NAME

Struct::Diff - Recursive diff for nested perl structures

VERSION

Version 0.90

SYNOPSIS

use Struct::Diff qw(diff list_diff patch split_diff valid_diff);

$a = {x => [7,{y => 4}]};
$b = {x => [7,{y => 9}],z => 33};

$diff = diff($a, $b, noO => 1, noU => 1); # omit unchanged items and old values
# $diff == {D => {x => {D => [{I => 1,N => {y => 9}}]},z => {A => 33}}}

@list_diff = list_diff($diff); # list (path and ref pairs) all diff entries
# $list_diff == [[{keys => ['z']}],\{A => 33},[{keys => ['x']},[0]],\{I => 1,N => {y => 9}}]

$splitted = split_diff($diff);
# $splitted->{a} # not exists
# $splitted->{b} == {x => [{y => 9}],z => 33}

patch($a, $diff); # $a now equal to $b by structure and data

@errors = valid_diff($diff);

EXPORT

Nothing is exported by default.

DIFF METADATA FORMAT

Diff is simply a HASH whose keys shows status for each item in passed structures.

A

Stands for 'added' (exists only in second structure), it's value - added item.

D

Means 'different' and contains subdiff.

I

Index for changed array item.

N

Is a new value for changed item.

O

Alike N, O is a changed item's old value.

R

Similar for A, but for removed items.

U

Represent unchanged items.

SUBROUTINES

diff

Returns hashref to recursive diff between two passed things. Beware when changing diff: some of it's substructures are links to original structures.

$diff = diff($a, $b, %opts);
$patch = diff($a, $b, noU => 1, noO => 1, trimR => 1); # smallest possible diff

Options

noX

Where X is a status (A, N, O, R, U); such status will be omitted.

trimR

Drop removed item's data.

list_diff

List pairs (path, ref_to_subdiff) for provided diff. See "ADDRESSING SCHEME" in Struct::Path for path format specification.

@list = list_diff(diff($frst, $scnd);

Options

depth <int>

Don't dive deeper than defined number of levels.

sort <sub|true|false>

Defines how to handle hash subdiffs. Keys will be picked randomely (default keys behavior), sorted by provided subroutine (if value is a coderef) or lexically sorted if set to some other true value.

split_diff

Divide diff to pseudo original structures

$structs = split_diff(diff($a, $b));
# $structs->{a}: items originated from $a
# $structs->{b}: same for $b

patch

Apply diff

patch($a, $diff);

valid_diff

Validate diff structure. In scalar context returns 1 for valid diff, undef otherwise. In list context returns list of pairs (path, type) for each error. See "ADDRESSING SCHEME" in Struct::Path for path format specification.

@errors_list = valid_diff($diff); # list context

or

$is_valid = valid_diff($diff); # scalar context

LIMITATIONS

Struct::Diff fails on structures with loops in references. has_circular_ref from Data::Structure::Util can help to detect such structures.

Only arrays and hashes traversed. All other data types compared by their references or content.

No object oriented interface provided.

AUTHOR

Michael Samoglyadov, <mixas at cpan.org>

BUGS

Please report any bugs or feature requests to bug-struct-diff at rt.cpan.org, or through the web interface at http://rt.cpan.org/NoAuth/ReportBug.html?Queue=Struct-Diff. I will be notified, and then you'll automatically be notified of progress on your bug as I make changes.

SUPPORT

You can find documentation for this module with the perldoc command.

perldoc Struct::Diff

You can also look for information at:

SEE ALSO

Algorithm::Diff, Data::Deep, Data::Diff, Data::Difference, JSON::MergePatch

Data::Structure::Util, Struct::Path, Struct::Path::PerlStyle

LICENSE AND COPYRIGHT

Copyright 2015-2017 Michael Samoglyadov.

This program is free software; you can redistribute it and/or modify it under the terms of either: the GNU General Public License as published by the Free Software Foundation; or the Artistic License.

See http://dev.perl.org/licenses/ for more information.