XML-Bare-0.53/ 0000755 0000000 0000000 00000000000 12214357757 011463 5 ustar root root XML-Bare-0.53/Bare.pm 0000755 0000000 0000000 00000136053 12214357572 012700 0 ustar root root #!/usr/bin/perl -w
package XML::Bare;
use Carp;
use strict;
use vars qw( @ISA @EXPORT @EXPORT_OK $VERSION );
use utf8;
require Exporter;
require DynaLoader;
@ISA = qw(Exporter DynaLoader);
$VERSION = "0.53";
use vars qw($VERSION *AUTOLOAD);
*AUTOLOAD = \&XML::Bare::AUTOLOAD;
bootstrap XML::Bare $VERSION;
@EXPORT = qw( );
@EXPORT_OK = qw( xget merge clean add_node del_node find_node del_node forcearray del_by_perl xmlin xval );
=head1 NAME
XML::Bare - Minimal XML parser implemented via a C state engine
=head1 VERSION
0.53
=cut
sub new {
my $class = shift;
my $self = { @_ };
$self->{'i'} = 0;
if( $self->{ 'text' } ) {
if( $self->{'unsafe'} ) {
$self->{'parser'} = XML::Bare::c_parse_unsafely( $self->{'text'} );
}
else {
$self->{'parser'} = XML::Bare::c_parse( $self->{'text'} );
}
}
else {
my $res = open( my $XML, $self->{ 'file' } );
if( !$res ) {
$self->{ 'xml' } = 0;
return 0;
}
{
local $/ = undef;
$self->{'text'} = <$XML>;
}
close( $XML );
$self->{'parser'} = XML::Bare::c_parse( $self->{'text'} );
}
bless $self, "XML::Bare::Object";
return $self if( !wantarray );
return ( $self, ( $self->{'simple'} ? $self->simple() : $self->parse() ) );
}
sub simple {
return new( @_, simple => 1 );
}
package XML::Bare::Object;
use Carp;
use strict;
# Stubs ( to allow these functions to be used via an object as well, not just via import or namespace )
sub find_by_perl { shift; return XML::Bare::find_by_perl( @_ ); }
sub find_node { shift; return XML::Bare::find_node( @_ ); }
sub DESTROY {
my $self = shift;
use Data::Dumper;
#print Dumper( $self );
undef $self->{'text'};
undef $self->{'i'};
$self->free_tree();
undef $self->{'parser'};
}
sub read_more {
my $self = shift;
my %p = ( @_ );
my $i = $self->{'i'}++;
if( $p{'text'} ) {
$self->{"text$i"} = $p{'text'};
XML::Bare::c_parse_more( $self->{"text$i"}, $self->{'parser'} );
}
}
sub parse {
my $self = shift;
my $res = XML::Bare::xml2obj( $self->{'parser'} );
if( defined( $self->{'scheme'} ) ) {
$self->{'xbs'} = new XML::Bare( %{ $self->{'scheme'} } );
}
if( defined( $self->{'xbs'} ) ) {
my $xbs = $self->{'xbs'};
my $ob = $xbs->parse();
$self->{'xbso'} = $ob;
readxbs( $ob );
}
if( !ref( $res ) && $res < 0 ) { croak "Error at ".$self->lineinfo( -$res ); }
$self->{ 'xml' } = $res;
if( defined( $self->{'xbso'} ) ) {
my $ob = $self->{'xbso'};
my $cres = $self->check( $res, $ob );
croak( $cres ) if( $cres );
}
return $self->{ 'xml' };
}
# xml bare schema
sub check {
my ( $self, $node, $scheme, $parent ) = @_;
my $fail = '';
if( ref( $scheme ) eq 'ARRAY' ) {
for my $one ( @$scheme ) {
my $res = $self->checkone( $node, $one, $parent );
return 0 if( !$res );
$fail .= "$res\n";
}
}
else { return $self->checkone( $node, $scheme, $parent ); }
return $fail;
}
sub checkone {
my ( $self, $node, $scheme, $parent ) = @_;
for my $key ( keys %$node ) {
next if( substr( $key, 0, 1 ) eq '_' || $key eq '_att' || $key eq 'comment' );
if( $key eq 'value' ) {
my $val = $node->{ 'value' };
my $regexp = $scheme->{'value'};
if( $regexp ) {
if( $val !~ m/^($regexp)$/ ) {
my $linfo = $self->lineinfo( $node->{'_i'} );
return "Value of '$parent' node ($val) does not match /$regexp/ [$linfo]";
}
}
next;
}
my $sub = $node->{ $key };
my $ssub = $scheme->{ $key };
if( !$ssub ) { #&& ref( $schemesub ) ne 'HASH'
my $linfo = $self->lineinfo( $sub->{'_i'} );
return "Invalid node '$key' in xml [$linfo]";
}
if( ref( $sub ) eq 'HASH' ) {
my $res = $self->check( $sub, $ssub, $key );
return $res if( $res );
}
if( ref( $sub ) eq 'ARRAY' ) {
my $asub = $ssub;
if( ref( $asub ) eq 'ARRAY' ) {
$asub = $asub->[0];
}
if( $asub->{'_t'} ) {
my $max = $asub->{'_max'} || 0;
if( $#$sub >= $max ) {
my $linfo = $self->lineinfo( $sub->[0]->{'_i'} );
return "Too many nodes of type '$key'; max $max; [$linfo]"
}
my $min = $asub->{'_min'} || 0;
if( ($#$sub+1)<$min ) {
my $linfo = $self->lineinfo( $sub->[0]->{'_i'} );
return "Not enough nodes of type '$key'; min $min [$linfo]"
}
}
for( @$sub ) {
my $res = $self->check( $_, $ssub, $key );
return $res if( $res );
}
}
}
if( my $dem = $scheme->{'_demand'} ) {
for my $req ( @{$scheme->{'_demand'}} ) {
my $ck = $node->{ $req };
if( !$ck ) {
my $linfo = $self->lineinfo( $node->{'_i'} );
return "Required node '$req' does not exist [$linfo]"
}
if( ref( $ck ) eq 'ARRAY' ) {
my $linfo = $self->lineinfo( $node->{'_i'} );
return "Required node '$req' is empty array [$linfo]" if( $#$ck == -1 );
}
}
}
return 0;
}
sub simple {
my $self = shift;
my $res = XML::Bare::xml2obj_simple( $self->{'parser'} );#$self->xml2obj();
if( !ref( $res ) && $res < 0 ) { croak "Error at ".$self->lineinfo( -$res ); }
$self->{ 'xml' } = $res;
return $res;
}
sub add_node {
my ( $self, $node, $name ) = @_;
my @newar;
my %blank;
$node->{ 'multi_'.$name } = \%blank if( ! $node->{ 'multi_'.$name } );
$node->{ $name } = \@newar if( ! $node->{ $name } );
my $newnode = new_node( 0, splice( @_, 3 ) );
push( @{ $node->{ $name } }, $newnode );
return $newnode;
}
sub add_node_after {
my ( $self, $node, $prev, $name ) = @_;
my @newar;
my %blank;
$node->{ 'multi_'.$name } = \%blank if( ! $node->{ 'multi_'.$name } );
$node->{ $name } = \@newar if( ! $node->{ $name } );
my $newnode = $self->new_node( splice( @_, 4 ) );
my $cur = 0;
for my $anode ( @{ $node->{ $name } } ) {
$anode->{'_pos'} = $cur if( !$anode->{'_pos'} );
$cur++;
}
my $opos = $prev->{'_pos'};
for my $anode ( @{ $node->{ $name } } ) {
$anode->{'_pos'}++ if( $anode->{'_pos'} > $opos );
}
$newnode->{'_pos'} = $opos + 1;
push( @{ $node->{ $name } }, $newnode );
return $newnode;
}
sub del_node {
my $self = shift;
my $node = shift;
my $name = shift;
my %match = @_;
$node = $node->{ $name };
return if( !$node );
for( my $i = 0; $i <= $#$node; $i++ ) {
my $one = $node->[ $i ];
foreach my $key ( keys %match ) {
my $val = $match{ $key };
if( $one->{ $key }->{'value'} eq $val ) {
delete $node->[ $i ];
}
}
}
}
# Created a node of XML hash with the passed in variables already set
sub new_node {
my $self = shift;
my %parts = @_;
my %newnode;
foreach( keys %parts ) {
my $val = $parts{$_};
if( m/^_/ || ref( $val ) eq 'HASH' ) {
$newnode{ $_ } = $val;
}
else {
$newnode{ $_ } = { value => $val };
}
}
return \%newnode;
}
sub simplify {
my $node = CORE::shift;
my $ref = ref( $node );
if( $ref eq 'ARRAY' ) {
my @ret;
for my $sub ( @$node ) {
CORE::push( @ret, simplify( $sub ) );
}
return \@ret;
}
if( $ref eq 'HASH' ) {
my %ret;
my $cnt = 0;
for my $key ( keys %$node ) {
next if( $key eq 'comment' || $key eq 'value' || $key =~ m/^_/ );
$cnt++;
$ret{ $key } = simplify( $node->{ $key } );
}
if( $cnt == 0 ) {
return $node->{'value'};
}
return \%ret;
}
return $node;
}
sub hash2xml {
my ( $node, $name ) = @_;
my $ref = ref( $node );
return '' if( $name && $name =~ m/^\_/ );
my $txt = $name ? "<$name>" : '';
if( $ref eq 'ARRAY' ) {
$txt = '';
for my $sub ( @$node ) {
$txt .= hash2xml( $sub, $name );
}
return $txt;
}
elsif( $ref eq 'HASH' ) {
for my $key ( keys %$node ) {
$txt .= hash2xml( $node->{ $key }, $key );
}
}
else {
$node ||= '';
if( $node =~ /[<]/ ) { $txt .= ''; }
else { $txt .= $node; }
}
if( $name ) {
$txt .= "";
}
return $txt;
}
# Save an XML hash tree into a file
sub save {
my $self = shift;
return if( ! $self->{ 'xml' } );
my $xml = $self->xml( $self->{'xml'} );
my $len;
{
use bytes;
$len = length( $xml );
}
return if( !$len );
# This is intentionally just :utf8 and not :encoding(UTF-8)
# :encoding(UTF-8) checks the data for actually being valid UTF-8, and doing so would slow down the file write
# See http://perldoc.perl.org/functions/binmode.html
my $os = $^O;
my $F;
# Note on the following conditional OS check... WTF? This is total bullshit.
if( $os eq 'MSWin32' ) {
open( $F, '>:utf8', $self->{ 'file' } );
binmode $F;
}
else {
open( $F, '>', $self->{ 'file' } );
binmode $F, ':utf8';
}
print $F $xml;
seek( $F, 0, 2 );
my $cursize = tell( $F );
if( $cursize != $len ) { # concurrency; we are writing a smaller file
warn "Truncating File $self->{'file'}";
`cp $self->{'file'} $self->{'file'}.bad`;
truncate( F, $len );
}
seek( $F, 0, 2 );
$cursize = tell( $F );
if( $cursize != $len ) { # still not the right size even after truncate??
die "Write problem; $cursize != $len";
}
close $F;
}
sub xml {
my ( $self, $obj, $name ) = @_;
if( !$name ) {
my %hash;
$hash{0} = $obj;
return XML::Bare::obj2xml( \%hash, '', 0 );
}
my %hash;
$hash{$name} = $obj;
return XML::Bare::obj2xml( \%hash, '', 0 );
}
sub html {
my ( $self, $obj, $name ) = @_;
my $pre = '';
if( $self->{'style'} ) {
$pre = "";
}
if( !$name ) {
my %hash;
$hash{0} = $obj;
return $pre.obj2html( \%hash, '', 0 );
}
my %hash;
$hash{$name} = $obj;
return $pre.obj2html( \%hash, '', 0 );
}
sub lineinfo {
my $self = shift;
my $res = shift;
my $line = 1;
my $j = 0;
for( my $i=0;$i<$res;$i++ ) {
my $let = substr( $self->{'text'}, $i, 1 );
if( ord($let) == 10 ) {
$line++;
$j = $i;
}
}
my $part = substr( $self->{'text'}, $res, 10 );
$part =~ s/\n//g;
$res -= $j;
if( $self->{'offset'} ) {
my $off = $self->{'offset'};
$line += $off;
return "$off line $line char $res \"$part\"";
}
return "line $line char $res \"$part\"";
}
sub free_tree { my $self = shift; XML::Bare::free_tree_c( $self->{'parser'} ); }
package XML::Bare;
sub find_node {
my $node = shift;
my $name = shift;
my %match = @_;
return 0 if( ! defined $node );
$node = $node->{ $name } or return 0;
$node = [ $node ] if( ref( $node ) eq 'HASH' );
if( ref( $node ) eq 'ARRAY' ) {
for( my $i = 0; $i <= $#$node; $i++ ) {
my $one = $node->[ $i ];
for my $key ( keys %match ) {
my $val = $match{ $key };
croak('undefined value in find') unless defined $val;
if( $one->{ $key }{'value'} eq $val ) {
return $node->[ $i ];
}
}
}
}
return 0;
}
sub xget {
my $hash = shift;
return map $_->{'value'}, @{$hash}{@_};
}
sub forcearray {
my $ref = shift;
return [] if( !$ref );
return $ref if( ref( $ref ) eq 'ARRAY' );
return [ $ref ];
}
sub merge {
# shift in the two array references as well as the field to merge on
my ( $a, $b, $id ) = @_;
my %hash = map { $_->{ $id } ? ( $_->{ $id }->{ 'value' } => $_ ) : ( 0 => 0 ) } @$a;
for my $one ( @$b ) {
next if( !$one->{ $id } );
my $short = $hash{ $one->{ $id }->{ 'value' } };
next if( !$short );
foreach my $key ( keys %$one ) {
next if( $key eq '_pos' || $key eq 'id' );
my $cur = $short->{ $key };
my $add = $one->{ $key };
if( !$cur ) { $short->{ $key } = $add; }
else {
my $type = ref( $cur );
if( $type eq 'HASH' ) {
my @arr;
$short->{ $key } = \@arr;
push( @arr, $cur );
}
if( ref( $add ) eq 'HASH' ) {
push( @{$short->{ $key }}, $add );
}
else { # we are merging an array
push( @{$short->{ $key }}, @$add );
}
}
# we need to deal with the case where this node
# is already there, either alone or as an array
}
}
return $a;
}
sub clean {
my $ob = new XML::Bare( @_ );
my $root = $ob->parse();
if( $ob->{'save'} ) {
$ob->{'file'} = $ob->{'save'} if( "$ob->{'save'}" ne "1" );
$ob->save();
return;
}
return $ob->xml( $root );
}
sub xmlin {
my $text = shift;
my %ops = ( @_ );
my $ob = new XML::Bare( text => $text );
my $simple = $ob->simple();
if( !$ops{'keeproot'} ) {
my @keys = keys %$simple;
my $first = $keys[0];
$simple = $simple->{ $first } if( $first );
}
return $simple;
}
sub tohtml {
my %ops = ( @_ );
my $ob = new XML::Bare( %ops );
return $ob->html( $ob->parse(), $ops{'root'} || 'xml' );
}
sub readxbs { # xbs = xml bare schema
my $node = shift;
my @demand;
for my $key ( keys %$node ) {
next if( substr( $key, 0, 1 ) eq '_' || $key eq '_att' || $key eq 'comment' );
if( $key eq 'value' ) {
my $val = $node->{'value'};
delete $node->{'value'} if( $val =~ m/^\W*$/ );
next;
}
my $sub = $node->{ $key };
if( $key =~ m/([a-z_]+)([^a-z_]+)/ ) {
my $name = $1;
my $t = $2;
my $min;
my $max;
if( $t eq '+' ) {
$min = 1;
$max = 1000;
}
elsif( $t eq '*' ) {
$min = 0;
$max = 1000;
}
elsif( $t eq '?' ) {
$min = 0;
$max = 1;
}
elsif( $t eq '@' ) {
$name = 'multi_'.$name;
$min = 1;
$max = 1;
}
elsif( $t =~ m/\{([0-9]+),([0-9]+)\}/ ) {
$min = $1;
$max = $2;
$t = 'r'; # range
}
if( ref( $sub ) eq 'HASH' ) {
my $res = readxbs( $sub );
$sub->{'_t'} = $t;
$sub->{'_min'} = $min;
$sub->{'_max'} = $max;
}
if( ref( $sub ) eq 'ARRAY' ) {
for my $item ( @$sub ) {
my $res = readxbs( $item );
$item->{'_t'} = $t;
$item->{'_min'} = $min;
$item->{'_max'} = $max;
}
}
push( @demand, $name ) if( $min );
$node->{$name} = $node->{$key};
delete $node->{$key};
}
else {
if( ref( $sub ) eq 'HASH' ) {
readxbs( $sub );
$sub->{'_t'} = 'r';
$sub->{'_min'} = 1;
$sub->{'_max'} = 1;
}
if( ref( $sub ) eq 'ARRAY' ) {
for my $item ( @$sub ) {
readxbs( $item );
$item->{'_t'} = 'r';
$item->{'_min'} = 1;
$item->{'_max'} = 1;
}
}
push( @demand, $key );
}
}
if( @demand ) { $node->{'_demand'} = \@demand; }
}
sub find_by_perl {
my $arr = shift;
my $cond = shift;
my @res;
if( ref( $arr ) eq 'ARRAY' ) {
$cond =~ s/-([a-z_]+)/\$ob->\{'$1'\}->\{'value'\}/gi;
foreach my $ob ( @$arr ) { push( @res, $ob ) if( eval( $cond ) ); }
}
else {
$cond =~ s/-([a-z_]+)/\$arr->\{'$1'\}->\{'value'\}/gi;
push( @res, $arr ) if( eval( $cond ) );
}
return \@res;
}
sub del_by_perl {
my $arr = shift;
my $cond = shift;
$cond =~ s/-value/\$ob->\{'value'\}/g;
$cond =~ s/-([a-z]+)/\$ob->\{'$1'\}->\{'value'\}/g;
my @res;
for( my $i = 0; $i <= $#$arr; $i++ ) {
my $ob = $arr->[ $i ];
delete $arr->[ $i ] if( eval( $cond ) );
}
return \@res;
}
sub newhash { shift; return { value => shift }; }
sub xval {
return $_[0] ? $_[0]->{'value'} : ( $_[1] || '' );
}
sub obj2xml {
my ( $objs, $name, $pad, $level, $pdex ) = @_;
$level = 0 if( !$level );
$pad = '' if( $level <= 2 );
my $xml = '';
my $att = '';
my $imm = 1;
return '' if( !$objs );
#return $objs->{'_raw'} if( $objs->{'_raw'} );
my @dex = sort {
my $oba = $objs->{ $a };
my $obb = $objs->{ $b };
my $posa = 0;
my $posb = 0;
$oba = $oba->[0] if( ref( $oba ) eq 'ARRAY' );
$obb = $obb->[0] if( ref( $obb ) eq 'ARRAY' );
if( ref( $oba ) eq 'HASH' ) { $posa = $oba->{'_pos'} || 0; }
if( ref( $obb ) eq 'HASH' ) { $posb = $obb->{'_pos'} || 0; }
return $posa <=> $posb;
} keys %$objs;
for my $i ( @dex ) {
my $obj = $objs->{ $i } || '';
my $type = ref( $obj );
if( $type eq 'ARRAY' ) {
$imm = 0;
my @dex2 = sort {
if( !$a ) { return 0; }
if( !$b ) { return 0; }
if( ref( $a ) eq 'HASH' && ref( $b ) eq 'HASH' ) {
my $posa = $a->{'_pos'};
my $posb = $b->{'_pos'};
if( !$posa ) { $posa = 0; }
if( !$posb ) { $posb = 0; }
return $posa <=> $posb;
}
return 0;
} @$obj;
for my $j ( @dex2 ) {
$xml .= obj2xml( $j, $i, $pad.' ', $level+1, $#dex );
}
}
elsif( $type eq 'HASH' && $i !~ /^_/ ) {
if( $obj->{ '_att' } ) {
$att .= ' ' . $i . '="' . $obj->{ 'value' } . '"' if( $i !~ /^_/ );;
}
else {
$imm = 0;
$xml .= obj2xml( $obj , $i, $pad.' ', $level+1, $#dex );
}
}
else {
if( $i eq 'comment' ) { $xml .= '' . "\n"; }
elsif( $i eq 'value' ) {
if( $level > 1 ) { # $#dex < 4 &&
if( $obj && $obj =~ /[<>&;]/ ) { $xml .= ''; }
else { $xml .= $obj if( $obj =~ /\S/ ); }
}
}
elsif( $i =~ /^_/ ) {}
else { $xml .= '<' . $i . '>' . $obj . ''; }
}
}
my $pad2 = $imm ? '' : $pad;
my $cr = $imm ? '' : "\n";
if( substr( $name, 0, 1 ) ne '_' ) {
if( $name ) {
if( $xml ) {
$xml = $pad . '<' . $name . $att . '>' . $cr . $xml . $pad2 . '';
}
else {
$xml = $pad . '<' . $name . $att . ' />';
}
}
return $xml."\n" if( $level > 1 );
return $xml;
}
return '';
}
sub obj2html {
my ( $objs, $name, $pad, $level, $pdex ) = @_;
my $less = "<";
my $more = ">";
my $tn0 = "";
my $tn1 = "";
my $eq0 = "";
my $eq1 = "";
my $qo0 = "";
my $qo1 = "";
my $sp0 = "";
my $sp1 = "";
my $cd0 = "";
my $cd1 = "";
$level = 0 if( !$level );
$pad = '' if( $level == 1 );
my $xml = '';
my $att = '';
my $imm = 1;
return '' if( !$objs );
my @dex = sort {
my $oba = $objs->{ $a };
my $obb = $objs->{ $b };
my $posa = 0;
my $posb = 0;
$oba = $oba->[0] if( ref( $oba ) eq 'ARRAY' );
$obb = $obb->[0] if( ref( $obb ) eq 'ARRAY' );
if( ref( $oba ) eq 'HASH' ) { $posa = $oba->{'_pos'} || 0; }
if( ref( $obb ) eq 'HASH' ) { $posb = $obb->{'_pos'} || 0; }
return $posa <=> $posb;
} keys %$objs;
if( $objs->{'_cdata'} ) {
my $val = $objs->{'value'};
$val =~ s/^(\s*\n)+//;
$val =~ s/\s+$//;
$val =~ s/&/&/g;
$val =~ s/{'value'} = $val;
#$xml = "$less![CDATA[]]$more";
$cd0 = "$less![CDATA[]]$more";
}
for my $i ( @dex ) {
my $obj = $objs->{ $i } || '';
my $type = ref( $obj );
if( $type eq 'ARRAY' ) {
$imm = 0;
my @dex2 = sort {
if( !$a ) { return 0; }
if( !$b ) { return 0; }
if( ref( $a ) eq 'HASH' && ref( $b ) eq 'HASH' ) {
my $posa = $a->{'_pos'};
my $posb = $b->{'_pos'};
if( !$posa ) { $posa = 0; }
if( !$posb ) { $posb = 0; }
return $posa <=> $posb;
}
return 0;
} @$obj;
for my $j ( @dex2 ) { $xml .= obj2html( $j, $i, $pad.' ', $level+1, $#dex ); }
}
elsif( $type eq 'HASH' && $i !~ /^_/ ) {
if( $obj->{ '_att' } ) {
my $val = $obj->{ 'value' };
$val =~ s/$i" if( $i !~ /^_/ );
}
else {
$att .= " $i$eq0=$eq1$qo0\"$qo1$val$qo0\"$qo1" if( $i !~ /^_/ );
}
}
else {
$imm = 0;
$xml .= obj2html( $obj , $i, $pad.' ', $level+1, $#dex );
}
}
else {
if( $i eq 'comment' ) { $xml .= "$less!--" . $obj . "--$more" . "
\n"; }
elsif( $i eq 'value' ) {
if( $level > 1 ) {
if( $obj && $obj =~ /[<>&;]/ && ! $objs->{'_cdata'} ) { $xml .= "$less![CDATA[$obj]]$more"; }
else { $xml .= $obj if( $obj =~ /\S/ ); }
}
}
elsif( $i =~ /^_/ ) {}
else { $xml .= "$less$tn0$i$tn1$more$obj$less/$tn0$i$tn1$more"; }
}
}
my $pad2 = $imm ? '' : $pad;
if( substr( $name, 0, 1 ) ne '_' ) {
if( $name ) {
if( $imm ) {
if( $xml =~ /\S/ ) {
$xml = "$sp0$pad$sp1$less$tn0$name$tn1$att$more$cd0$xml$cd1$less/$tn0$name$tn1$more";
}
else {
$xml = "$sp0$pad$sp1$less$tn0$name$tn1$att/$more";
}
}
else {
if( $xml =~ /\S/ ) {
$xml = "$sp0$pad$sp1$less$tn0$name$tn1$att$more$xml
$sp0$pad$sp1$less/$tn0$name$tn1$more";
}
else { $xml = "$sp0$pad$sp1$less$tn0$name$tn1$att/$more"; }
}
}
$xml .= "
" if( $objs->{'_br'} );
if( $objs->{'_note'} ) {
$xml .= "
";
my $note = $objs->{'_note'}{'value'};
my @notes = split( /\|/, $note );
for( @notes ) {
$xml .= "$sp0$pad$sp1<!-- $_ -->
";
}
}
return $xml."
\n" if( $level );
return $xml;
}
return '';
}
1;
__END__
=head1 SYNOPSIS
use XML::Bare;
my $ob = new XML::Bare( text => 'Bob' );
# Parse the xml into a hash tree
my $root = $ob->parse();
# Print the content of the name node
print $root->{xml}->{name}->{value};
---
# Load xml from a file ( assume same contents as first example )
my $ob2 = new XML::Bare( file => 'test.xml' );
my $root2 = $ob2->parse();
$root2->{xml}->{name}->{value} = 'Tim';
# Save the changes back to the file
$ob2->save();
---
# Load xml and verify against XBS ( XML Bare Schema )
my $xml_text = '- 1
- 2
PERL: $root->{xml}->{item}->[0]->{value} eq "1";
=item * Forcing array creation
XML: - 1
PERL: $root->{xml}->{item}->[0]->{value} eq "1";
=item * One comment supported per node
XML:
PERL: $root->{xml}->{comment} eq 'test';
=back
=head2 Schema Checking
Schema checking is done by providing the module with an XBS (XML::Bare Schema) to check
the XML against. If the XML checks as valid against the schema, parsing will continue as
normal. If the XML is invalid, the parse function will die, providing information about
the failure.
The following information is provided in the error message:
=over 2
=item * The type of error
=item * Where the error occured ( line and char )
=item * A short snippet of the XML at the point of failure
=back
=head2 XBS ( XML::Bare Schema ) Format
=over 2
=item * Required nodes
XML:
XBS:
=item * Optional nodes - allow one
XML:
XBS:
or XBS:
=item * Optional nodes - allow 0 or more
XML: -
Bob
=item * C<< $object->add_node_after( [node], [subnode within node to add after], [nodeset name], ... ) >>
=item * C<< $object->del_node( [node], [nodeset name], name => value ) >>
Example:
Starting XML:
1
2
Code:
$xml->del_node( $root->{xml}, 'a', b=>'1' );
Ending XML:
2
=item * C<< $object->find_node( [node], [nodeset name], name => value ) >>
Example:
Starting XML:
1
a
2
b
Code:
$object->find_node( $root->{xml}, 'ob', key => '1' )->{val}->{value} = 'test';
Ending XML:
1
test
2
b
=item * C<< $object->find_by_perl( [nodeset], "[perl code]" ) >>
find_by_perl evaluates some perl code for each node in a set of nodes, and
returns the nodes where the perl code evaluates as true. In order to
easily reference node values, node values can be directly referred
to from within the perl code by the name of the node with a dash(-) in
front of the name. See the example below.
Note that this function returns an array reference as opposed to a single
node unlike the find_node function.
Example:
Starting XML:
1
a
2
b
Code:
$object->find_by_perl( $root->{xml}->{ob}, "-key eq '1'" )->[0]->{val}->{value} = 'test';
Ending XML:
1
test
2
b
=item * C<< XML::Bare::merge( [nodeset1], [nodeset2], [id node name] ) >>
Merges the nodes from nodeset2 into nodeset1, matching the contents of
each node based up the content in the id node.
Example:
Code:
my $ob1 = new XML::Bare( text => "
bob
1
blue
" );
my $ob2 = new XML::Bare( text => "
john
1
bob
1
" );
my $root1 = $ob1->parse();
my $root2 = $ob2->parse();
merge( $root1->{'xml'}->{'a'}, $root2->{'xml'}->{'a'}, 'id' );
print $ob1->xml( $root1 );
Output:
bob
1
blue
bob
1
=item * C<< XML::Bare::del_by_perl( ... ) >>
Works exactly like find_by_perl, but deletes whatever matches.
=item * C<< XML::Bare::forcearray( [noderef] ) >>
Turns the node reference into an array reference, whether that
node is just a single node, or is already an array reference.
=item * C<< XML::Bare::new_node( ... ) >>
Creates a new node...
=item * C<< XML::Bare::newhash( ... ) >>
Creates a new hash with the specified value.
=item * C<< XML::Bare::simplify( [noderef] ) >>
Take a node with children that have immediate values and
creates a hashref to reference those values by the name of
each child.
=item * C<< XML::Bare::hash2xml( [hashref] ) >>
Take a recursive hash tree ( perhaps generated by the simplify function ) and turn it
into a raw XML string. Note that this function does not indent nicely. You will need
to feed this string back into the parser and output it again if you want it to look
nice. ( or you could use the 'clean' function to do it in one go )
=item * C<< XML::Bare->new( text => "[xml]", unsafe => 1 ) >>
An extra speedy way to parse XML. It is unsafe; may harm pets and children. Don't
say you weren't warned. 30% speed boost compared to the normal parsing. You -must-
use $ob->simple() in combination with this for it to work properly.
The speed boost is gained by skipping checks for the end of the string when in the
middle of properly formatted XML. The only time the check is done is within "values"
( which includes the space after the final closing )
Also, in the unsafe mode, tags, complete with their attributes, must be on one line.
Node contents of course, can still have carriage returns...
=item * C<< $object->read_more( text => "[xml fragment]" ) >>
Add more XML text to be handled. Note that this function must be called before
calling the parse function.
Example:
Code:
my $ob = XML::Bare->new( text => "
a" );
$ob->read_more( text => "b" );
$ob->read_more( text => "" );
my $root = $ob->parse();
print $ob->xml( $root );
Output:
a
b
Warning! Reading in additional XML fragments only works properly at proper "division points".
Currently the parser will -not- work properly if you split in the middle of a node value, or
in the middle of a node name. A future version of the module will be properly updated to handle
these cases.
Currently there is little to no benefit to parsing this way, rather than simple concatenating
the two strings together and then reading all the XML in at once.
=back
=head2 Functions Used Internally
=over 2
=item * C<< check() checkone() readxbs() free_tree_c() >>
=item * C<< lineinfo() c_parse() c_parse_unsafely() c_parse_more() c_parsefile() free_tree() xml2obj() >>
=item * C<< obj2xml() get_root() obj2html() xml2obj_simple() >>
=back
=head2 Controversy
Since the creation of this module there has been a fair amount of controvesy surrounding
it. A number of authors of other XML parsers have gone so far as to publicly attack this
module and claim that it 'does not parse XML', and 'it is not XML compliant'. Some of the
same people seem to be angered by the inclusion of a benchmark, claiming that it is an
unfair comparison, and that if the proper options and setup are used, that other XML
parsers are better.
The module should parse any XML document that conforms to the standardized
XML specifications, there is no need for alarm and fear that the module will corrupt
your XML documents on reading.
To be blunt about how the parser works, very little has been done to make the parser
follow the specification known as 'XML'. The parser is meant to be flexibile and somewhat
resilient, and will parse XML like garbage that would cause other parsers to error out.
As far as I am concerned, as the author of the module, the 'XML' in 'XML::Bare' should
be thought of to mean 'eXtremely Mad Language', because the module was written from
scratch without referring to the specification known as 'XML'.
In regard to the complaints about the unfairness of the included benchmarks, please
make your own intelligent decision as to what module you like by trying multiple
modules and/or running the performance tests yourself. If you like some other module,
use that module. If you like XML::Bare and think it is the fastest thing on the planet,
that is cool too.
If you hate XML::Bare and want to go around on the internet trashing it and telling
people to use something else, I think perhaps you may want to seek counseling.
=head2 Performance
In comparison to other available perl xml parsers that create trees, XML::Bare
is extremely fast. In order to measure the performance of loading and parsing
compared to the alternatives, a templated speed comparison mechanism has been
created and included with XML::Bare.
The include makebench.pl file runs when you make the module and creates perl
files within the bench directory corresponding to the .tmpl contained there.
Currently there are three types of modules that can be tested against,
executable parsers ( exe.tmpl ), tree parsers ( tree.tmpl ), and parsers
that do not generated trees ( notree.tmpl ).
A full list of modules currently tested against is as follows:
EzXML (exe)
Tiny XML (exe)
XML::Descent (notree)
XML::DOM
XML::Fast
XML::Grove::Builder
XML::Handler::Trees
XMLIO (exe)
XML::LibXML (notree)
XML::LibXML::Simple
XML::Parser (notree)
XML::Parser::EasyTree
XML::Parser::Expat (notree)
XML::SAX::Simple
XML::Simple using XML::Parser
XML::Simple using XML::SAX::PurePerl
XML::Simple using XML::LibXML::SAX::Parser
XML::Simple using XML::Bare::SAX::Parser
XML::Smart
XML::Twig
XML::TreePP
XML::Trivial
XML::XPath::XMLParser
To run the comparisons, run the appropriate perl file within the
bench directory. ( exe.pl, tree.pl, or notree.pl )
The script measures the milliseconds of loading and parsing, and
compares the time against the time of XML::Bare. So a 7 means
it takes 7 times as long as XML::Bare.
Here is a combined table of the script run against each alternative
using the included test.xml:
-Module- load parse total
XML::Bare 1 1 1
XML::TreePP 2.3063 33.1776 6.1598
XML::Parser::EasyTree 4.9405 25.7278 7.4571
XML::Handler::Trees 7.2303 26.5688 9.6447
XML::Trivial 5.0636 12.4715 7.3046
XML::Smart 6.8138 78.7939 15.8296
XML::Simple (XML::Parser) 2.3346 50.4772 10.7455
XML::Simple (PurePerl) 2.361 261.4571 33.6524
XML::Simple (LibXML) 2.3187 163.7501 23.1816
XML::Simple (XML::Bare) 2.3252 59.1254 10.9163
XML::SAX::Simple 8.7792 170.7313 28.3634
XML::Twig 27.8266 56.4476 31.3594
XML::Grove::Builder 7.1267 26.1672 9.4064
XML::XPath::XMLParser 9.7783 35.5486 13.0002
XML::LibXML (notree) 11.0038 4.5758 10.6881
XML::Parser (notree) 4.4698 17.6448 5.8609
XML::Parser::Expat(notree) 3.7681 50.0382 6.0069
XML::Descent (notree) 6.0525 37.0265 11.0322
Tiny XML (exe) 1.0095
EzXML (exe) 1.1284
XMLIO (exe) 1.0165
Here is a combined table of the script run against each alternative
using the included feed2.xml:
-Module- load parse total
XML::Bare 1 1 1
XML::Bare (simple) 1 0.7238 ?
XML::Bare (unsafe simple) 1 ~0.5538 ?
XML::Fast 1.516 0.9733 1.4783
XML::TreePP 0.6393 30.5951 2.6874
XML::MyXML 1.8266 14.2571 2.7113
XML::Parser::EasyTree 1.5208 22.8283 2.9748
XML::Trivial 2.007 25.742 3.615
XML::Tiny 0.1665 61.4918 4.3234
XML::XPath::XMLParser 2.5762 33.2567 4.6742
XML::Smart 1.702 59.4907 5.7566
XML::Simple (XML::Parser) 0.5838 64.7243 5.0006
XML::DOM::Lite 4.5207 17.4617 5.4033
XML::Simple (LibXML) 0.5904 161.7544 11.5731
XML::Twig 8.553 56.9034 11.8805
XML::Grove::Builder 7.2021 30.7926 12.9334
XML::Handler::Trees 6.8545 33.1007 13.0575
XML::LibXML::Simple 14.0204 11.8482 13.8707
XML::Simple (PurePerl) 0.6176 321.3422 23.0465
XML::Simple 2.7168 90.7203 26.7525
XML::SAX::Simple 8.7386 94.8276 29.2166
XML::LibXML (notree) 11.0023 5.022 10.5214
XML::Parser (notree) 4.3748 25.0213 5.9803
XML::Parser::Expat(notree) 3.6555 51.6426 7.4316
XML::Descent (notree) 5.9206 155.0289 18.7767
Tiny XML (exe) 1.2212
EzXML (exe) 1.3618
XMLIO (exe) 1.0145
These results show that XML::Bare is, at least on the
test machine, running all tests within cygwin, faster
at loading and parsing than everything being tested
against.
The following things are shown as well:
- XML::Bare can parse XML and create a hash tree
in less time than it takes LibXML just to parse.
- XML::Bare can parse XML and create a tree
in less time than all three binary parsers take
just to parse.
- XML::Fast is theoretically faster at parsing than
the default 'full' mode of XML::Bare. Despite that,
the 'simple' mode of XML::Bare is even faster.
Note that the executable parsers are not perl modules
and are timed using dummy programs that just uses the
library to load and parse the example files. The
executables are not included with this program. Any
source modifications used to generate the shown test
results can be found in the bench/src directory of
the distribution
=head1 LICENSE
Copyright (C) 2008 David Helkowski
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version. You may also can
redistribute it and/or modify it under the terms of the Perl
Artistic License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
=cut
XML-Bare-0.53/README 0000644 0000000 0000000 00000001707 12137622640 012336 0 ustar root root XML::Bare
------------
INSTALLATION
Download XML-Bare-latest.tar.gz and untar it:
% tar -xzf XML-Bare-latest.tar.gz
Follow the standard steps for making and compiling a perl module:
% cd XML-Bare-X.XX ( X.XX = the latest version )
% perl Makefile.PL
% make
% make test
% make install
COPYRIGHT
Copyright (C) 2013 David Helkowski
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License as
published by the Free Software Foundation; either version 2 of the
License, or (at your option) any later version. You may also can
redistribute it and/or modify it under the terms of the Perl
Artistic License.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
XML-Bare-0.53/META.json 0000644 0000000 0000000 00000002201 12214357757 013077 0 ustar root root {
"abstract" : "A minimal XML parser / schema checker / pretty-printer using C internally.",
"author" : [
"David Helkowski "
],
"dynamic_config" : 1,
"generated_by" : "ExtUtils::MakeMaker version 6.68, CPAN::Meta::Converter version 2.112621",
"license" : [
"perl_5"
],
"meta-spec" : {
"url" : "http://search.cpan.org/perldoc?CPAN::Meta::Spec",
"version" : "2"
},
"name" : "XML-Bare",
"no_index" : {
"directory" : [
"t",
"inc"
]
},
"prereqs" : {
"build" : {
"requires" : {
"Data::Dumper" : 0,
"English" : 0,
"File::Find" : 0,
"File::Temp" : 0,
"Scalar::Util" : 0,
"Test::Harness" : 0,
"Test::More" : "0.94"
}
},
"configure" : {
"requires" : {
"ExtUtils::MakeMaker" : "6.30"
}
},
"runtime" : {
"requires" : {
"Carp" : 0,
"DynaLoader" : 0,
"Exporter" : 0
}
}
},
"release_status" : "stable",
"version" : "0.53"
}
XML-Bare-0.53/META.yml 0000644 0000000 0000000 00000001217 12214357757 012735 0 ustar root root ---
abstract: 'A minimal XML parser / schema checker / pretty-printer using C internally.'
author:
- 'David Helkowski '
build_requires:
Data::Dumper: 0
English: 0
File::Find: 0
File::Temp: 0
Scalar::Util: 0
Test::Harness: 0
Test::More: 0.94
configure_requires:
ExtUtils::MakeMaker: 6.30
dynamic_config: 1
generated_by: 'ExtUtils::MakeMaker version 6.68, CPAN::Meta::Converter version 2.112621'
license: perl
meta-spec:
url: http://module-build.sourceforge.net/META-spec-v1.4.html
version: 1.4
name: XML-Bare
no_index:
directory:
- t
- inc
requires:
Carp: 0
DynaLoader: 0
Exporter: 0
version: 0.53
XML-Bare-0.53/t/ 0000755 0000000 0000000 00000000000 12214357756 011725 5 ustar root root XML-Bare-0.53/t/UTF8_Attributes.t 0000755 0000000 0000000 00000002557 12137622640 015051 0 ustar root root #!/usr/bin/perl -w
use strict;
use warnings;
# NB we have use utf8 here, but the source should be 7bit clean
# however I need the utf8::is_utf8 and utf8::valid names which
# are no longer exposed without the use line.
use utf8;
use Test::More qw(no_plan);
use_ok('XML::Bare');
my $data = {
hash => "#",
oo => "\x{f6}",
iso_a => "\x{c4}",
iso_oo => "\x{d6}",
aa => "\x{e4}",
euro => "\x{20ac}",
};
# build XML string with UTF8 values
my $xmldata = "\n";
foreach ( keys %{$data} ) {
$xmldata .= " <$_ char=\"" . $data->{$_} . "\" />\n";
}
$xmldata .= "\n";
# parse the provided XML
my $obj = new XML::Bare( text => $xmldata );
my $root = $obj->parse;
# convert back to XML from parse
my $roundtrip = $obj->xml($root);
## this isn't valid as order/spacing not preserved
is( $roundtrip, $xmldata, 'Round trip XML identical' );
while ( my ( $name, $char ) = each %{$data} ) {
my $str = $root->{data}{$name}{char}{value};
ok( $root->{data}{$name}{char}{_att}, "$name has char attribute" );
ok( utf8::is_utf8($str), "Character $name is correct encoding" )
if ( utf8::is_utf8($char) );
ok( utf8::valid($str), "Character $name is Valid" );
ok( ( length($str) == 1 ), "String returned for $name is 1 char long" );
is( $str, $char, "Character $name OK" );
} XML-Bare-0.53/t/Pod.t 0000755 0000000 0000000 00000000200 12137622640 012616 0 ustar root root use Test::More;
eval "use Test::Pod 1.00";
plan skip_all => "Test::Pod 1.00 required for testing POD" if $@;
all_pod_files_ok(); XML-Bare-0.53/t/test.xml 0000644 0000000 0000000 00000000010 12214357751 013410 0 ustar root root
XML-Bare-0.53/t/Bug_node_named_value.t 0000755 0000000 0000000 00000000461 12137622640 016167 0 ustar root root #!/usr/bin/perl -w
use strict;
use Test::More qw(no_plan);
use_ok( 'XML::Bare', qw/xmlin/ );
my ( $ob, $root ) = XML::Bare->new( text => qq{erower\n} );
ok( $root, "Got some root" );
my $val = $root->{'value'}{'value'};
is( $val, 'erower', "Got the right value" ); XML-Bare-0.53/t/Func_find_by_perl.t 0000755 0000000 0000000 00000000647 12137622640 015522 0 ustar root root #!/usr/bin/perl -w
use strict;
use Test::More qw(no_plan);
use_ok( 'XML::Bare', qw/xmlin/ );
my ( $ob, $root ) = XML::Bare->new( text => "" );
my $set = $ob->find_by_perl( $root->{'xml'}{'ob'}, "-key eq '1'" );
ok( $set, 'Got an array back' );
my $item1 = $set->[0];
ok( $set, 'Got at least one result' );
my $val = $item1->{'val'}{'value'};
is( $val, 'test', 'Value is correct' ); XML-Bare-0.53/t/Bug_simple_empty_is_one.t 0000755 0000000 0000000 00000000577 12137622640 016755 0 ustar root root #!/usr/bin/perl -w
use strict;
use Test::More qw(no_plan);
use_ok( 'XML::Bare', qw/xmlin/ );
my ( $ob, $root ) = XML::Bare->simple( text => "" );
ok( $root, "Got some root" );
my $attval = $root->{'node'}{'att'};
is( $attval, '2', "Got the right attribute value" );
my $sub_val = $root->{'node'}{'sub'};
is( $sub_val, '', "Got the right sub value" ); XML-Bare-0.53/t/Basic.t 0000755 0000000 0000000 00000007424 12137622640 013134 0 ustar root root #!/usr/bin/perl -w
use strict;
use Test::More qw(no_plan);
use_ok( 'XML::Bare', qw/xmlin/ );
my $xml;
my $root;
my $simple;
( $xml, $root, $simple ) = reparse( "val" );
is( $root->{xml}->{node}->{value}, 'val', 'normal node value reading' );
is( $simple->{node}, 'val', 'simple - normal node value reading' );
( $xml, $root, $simple ) = reparse( "" );
is( ref( $root->{xml}->{node} ), 'HASH', 'existence of blank node' );
is( $simple->{node}, '', 'simple - existence of blank node' );
( $xml, $root, $simple ) = reparse( "val" );
is( $root->{xml}->{node}->{att}->{value}, '12', 'reading of attribute value' );
is( $simple->{node}{att}, '12', 'simple - reading of attribute value' );
( $xml, $root, $simple ) = reparse( "val" );
is( $root->{xml}->{node}->{att}->{value}, '12', 'reading of " surrounded attribute value' );
is( $simple->{node}{att}, '12', 'simple - reading of " surrounded attribute value' );
( $xml, $root, $simple ) = reparse( "val" );
is( $root->{xml}{node}{att}{value}, '1', "reading of value of standalone attribute" );
is( $simple->{node}{att}, '1', "simple - reading of value of standalone attribute" );
( $xml, $root, $simple ) = reparse( "]]>" );
is( $root->{xml}->{node}->{value}, '', 'reading of cdata' );
is( $simple->{node}, '', 'simple - reading of cdata' );
( $xml, $root, $simple ) = reparse( "ab" );
is( $root->{xml}->{node}->[1]->{value}, 'b', 'multiple node array creation' );
is( $simple->{node}[1], 'b', 'simple - multiple node array creation' );
( $xml, $root, $simple ) = reparse( "a" );
is( $root->{xml}->{node}->[0]->{value}, 'a', 'use of multi_' );
is( $simple->{node}[0], 'a', 'simple - use of multi_' );
# note output of this does not work
( $xml, $root ) = new XML::Bare( text => "val" );
is( $root->{xml}->{node}->{value}, 'val', 'basic mixed - value before' );
#is( $simple->{xml}{node}[0], 'val', 'simple - basic mixed - value before' );
# note output of this does not work
( $xml, $root ) = new XML::Bare( text => "val" );
is( $root->{xml}->{node}->{value}, 'val', 'basic mixed - value after' );
( $xml, $root, $simple ) = reparse( "",1 );
is( $root->{xml}->{comment}, 'test', 'loading a comment' );
# test node addition
( $xml, $root ) = new XML::Bare( text => "" );
$xml->add_node( $root, 'item', name => 'bob' );
is( ref( $root->{'item'}[0]{'name'} ), 'HASH', 'node addition' );
is( $root->{'item'}[0]{'name'}{'value'}, 'bob', 'node addition' );
# test cyclic equalities
cyclic( "", 'comment' );
cyclic( "", 'cdata' ); # with cdata
my $text = 'checkval';
( $xml, $root ) = new XML::Bare( text => $text );
my $i = $root->{'xml'}{'node'}{'_i'}-1;
my $z = $root->{'xml'}{'node'}{'_z'}-$i+1;
#is( substr( $text, $i, $z ), 'checkval', '_i and _z vals' );
# saving test
( $xml, $root ) = XML::Bare->new( file => 't/test.xml' );
$xml->save();
sub reparse {
my $text = shift;
my $nosimp = shift;
my ( $xml, $root ) = new XML::Bare( text => $text );
my $a = $xml->xml( $root );
( $xml, $root ) = new XML::Bare( text => $a );
my $simple = $nosimp ? 0 : xmlin( $text );
return ( $xml, $root, $simple );
}
sub cyclic {
my ( $text, $name ) = @_;
( $xml, $root ) = new XML::Bare( text => $text );
my $a = $xml->xml( $root );
( $xml, $root ) = new XML::Bare( text => $a );
my $b = $xml->xml( $root );
is( $a, $b, "cyclic - $name" );
}
# test bad closing tags
# we need to a way to ensure that something dies... ?
XML-Bare-0.53/t/Multithreading.t 0000755 0000000 0000000 00000003627 12137622640 015074 0 ustar root root #!/usr/bin/perl -w
use strict;
use Test::More;
# Note that the strategy for testing for thread failure here is not very good.
# It is very timing dependent. On some systems this test will pass even with a parser
# that is not thread safe. There is some amount of luck in getting the non-thread safe
# code to crash. As it is now, the test below sucessfully crashes version 0.45 of XML::Bare
# seemingly every time I run the test.
my $threads_ok = 0;
eval("use threads;");
if( !$@ ) { $threads_ok = 1; }
my $shared_ok = 0;
if( $threads_ok ) {
eval("use threads::shared;");
if( !$@ ) { $shared_ok = 1; }
}
my $numok = 0;
if( !$threads_ok || !$shared_ok ) {
plan skip_all => 'Cannot load threads and/or threads::shared; skipping multithreading tests';
}
else {
#plan 'no_plan';
plan tests => 2;
use_ok( 'XML::Bare' );
threads::shared::share( \$numok );
for( my $i=0;$i<20;$i++ ) {
threads->create( \&single );
}
while( 1 ) {
my @joinable = threads->list(0);#joinable
my @running = threads->list(1);#running
for my $thr ( @joinable ) { $thr->join(); }
last if( !@running );
sleep(1);
}
is( $numok, 20, 'All threads completed okay' );
}
sub single {
my $xml = '';
my @arr;
for( my $i=0;$i<4000;$i++ ) {
my $n = rand(1000);
$arr[ $i ] = $n;
$xml .= "$n";
}
$xml .= "";
my ( $ob, $root ) = XML::Bare->new( text => $xml );
$root = $root->{'xml'};
my $nodes = $root->{'node'};
my $ok = 1;
my $i = 0;
for my $node ( @$nodes ) {
my $n = $node->{'n'}{'value'};
$ok = 0 if( $n ne $arr[ $i ] ); # note ne here instead of !=. Because $a=405.69280607542502; $a!="$a"; But $a=405.69280607542501; $a=="$a"; :(
$i++;
}
@arr = ();
return if( !$ok );
{
lock( $numok );
$numok++;
}
}
XML-Bare-0.53/t/Func_find_node.t 0000755 0000000 0000000 00000000546 12137622640 015011 0 ustar root root #!/usr/bin/perl -w
use strict;
use Test::More qw(no_plan);
use_ok( 'XML::Bare', qw/xmlin/ );
my ( $ob, $root ) = XML::Bare->new( text => "0a" );
my $node = $ob->find_node( $root->{'xml'}, 'ob', key => 0 );
ok( $node, 'Got something back' );
my $val = $node->{'val'}{'value'};
is( $val, 'a', 'Value Matches' ); XML-Bare-0.53/t/Bug_simple_with_cdata.t 0000755 0000000 0000000 00000000651 12137622640 016363 0 ustar root root #!/usr/bin/perl -w
use strict;
use Test::More qw(no_plan);
use_ok( 'XML::Bare', qw/xmlin/ );
my ( $ob, $root ) = XML::Bare->simple( text => "" );
ok( $root, "Got some root" );
my $attval = $root->{'node'}{'att'};
is( $attval, '2', "Got the right attribute value" );
my $cdataval = $root->{'node'}{'content'};
is( $cdataval, 'cdata contents', "Got the right cdata value" ); XML-Bare-0.53/t/UTF8_Values.t 0000755 0000000 0000000 00000003157 12137622640 014157 0 ustar root root #!/usr/bin/perl -w
use strict;
use warnings;
# NB we have use utf8 here, but the source should be 7bit clean
# however I need the utf8::is_utf8 and utf8::valid names which
# are no longer exposed without the use line.
#use utf8;
use Test::Harness;
$Test::Harness::verbose=1;
use Test::More qw(no_plan);
use_ok('XML::Bare');
my $data = {
hash => "#",
oo => "\x{f6}",
iso_a => "\x{c4}",
iso_oo => "\x{d6}",
aa => "\x{e4}",
euro => "\x{20ac}",
};
# build XML string with UTF8 values
my $xmldata = "\n";
foreach ( keys %{$data} ) {
$xmldata .= " <$_>";
$xmldata .= $data->{$_};
$xmldata .= "\n";
}
$xmldata .= "\n";
# parse the provided XML
my $obj = new XML::Bare( text => $xmldata, file => 't/test_utf8.xml' );
my $root = $obj->parse;
# convert back to XML from parse
use Data::Dumper;
my $roundtrip = $obj->xml($root);
## this isn't valid as order/spacing not preserved
is( $roundtrip, $xmldata, 'Round trip XML identical' );
while ( my ( $name, $char ) = each %{$data} ) {
my $str = $root->{data}{$name}{value};
ok( utf8::is_utf8($str), "Character $name is correct encoding" )
if ( utf8::is_utf8($char) );
ok( utf8::valid($str), "Character $name is Valid" );
ok( ( length($str) == 1 ), "String returned for $name is 1 char long" );
is( $str, $char, "Character $name OK" );
}
# save it to a file
$obj->save();
my ( $ob2, $root2 ) = XML::Bare->new( file => 't/test_utf8.xml' );
my $round2 = $obj->xml( $root2 );
is( $roundtrip, $xmldata, 'Written file reads back in the same' ); XML-Bare-0.53/t/Pod_Coverage.t 0000755 0000000 0000000 00000000240 12137622640 014435 0 ustar root root use Test::More;
eval "use Test::Pod::Coverage 1.00";
plan skip_all => "Test::Pod::Coverage 1.00 required for testing POD coverage" if $@;
all_pod_coverage_ok(); XML-Bare-0.53/makebench.PL 0000755 0000000 0000000 00000013322 12137622640 013627 0 ustar root root #!/usr/bin/perl -w
use strict;
if( !eval( "require Time::HiRes;" ) ) {
print "Time::HiRes not installed; benchmarks cannot be done\n";
}
opendir( DIR, "./bench" );
my @files = readdir(DIR);
closedir( DIR );
foreach my $file ( @files ) {
if( $file =~ m/(.+)\.tmpl/ ) {
print "Processing $file\n";
tmplfile( './bench/'.$file, $1 );
print "\n";
}
}
sub tmplfile {
my $file = shift;
my $name = shift;
open(TMPL,"$file");
$/ = undef;
my $tmpl = ;
close(TMPL);
$tmpl =~ s/#([c+0-])/#-$1/g;
#print $tmpl;
my @parts = split('#-',$tmpl);
open(OUT,">./bench/one$name.pl");
my $div;
sub has_cc {
my $div = (substr($ENV{'PATH'},0,1) eq '/') ? ':' : ';';
my @path = split($div,$ENV{'PATH'});
foreach my $dir ( @path ) {
return 1 if( -e "$dir/cc" ||
-e "$dir/gcc" ||
-e "$dir/cc.exe" ||
-e "$dir/gcc.exe" ); }
return 0;
}
if( $^O eq 'MSWin32' && !has_cc() ) { $div = '\\'; }
else { $div = '/'; }
print OUT <;
close(FILE);
}
START
#{
# (\$s, \$usec) = gettimeofday();
# if( eval( "require XML::Bare;" ) ) {
# (\$s2, \$usec2) = gettimeofday();
# my \$ob = new XML::Bare( file => \$file );
# \$root = \$ob->parse();
# (\$s3, \$usec3) = gettimeofday();
# timeit('XML::Bare',1);
# }
#}
#START
my $comment = '';
my $i = -1;
foreach my $part ( @parts ) {
my @requires;
$part = '#'.$part;
my $type = '';
my $module = '';
if( $part =~ m/#([c\-0\+]) (.+)\n/ ) {
$type = $1;
my $name = $2;
$module = $name if( $name =~ m/\w/ );
}
if( $part =~ m/#([c\-0\+]\+?)\n/ ) {
$type = $1;
}
#print "[$type $module]\n";
if( $type eq 'c' ) {
$part =~ s/c\n//g;
$part = "##".$part."##";
$part =~ s/^##[#c \n]+//;
$part =~ s/[ \n]+##$//;
$comment = $part;
next;
}
if( $type eq '0' ) {
if( $module ) {
$part =~ s/(#0)\W*.*/$1/;
}
while( $part =~ m/(require [A-Za-z\:]+;)/g ) {
my $req = $1;
if( !$module ) {
my $fmod = $req;
$fmod =~ s/require //; $fmod =~ s/;//;
$module = $fmod;
}
push( @requires, $req );
}
$part =~ s/require [A-Za-z\:]+;\n//g;
$part = "##".$part."##";
$part =~ s/^##[#0 \n]+//;
$part =~ s/[ \n]+##$//;
print OUT "
if( \$ARGV[0]*1 >= $i ) {
(\$s, \$usec) = gettimeofday();
if( eval( '@requires' ) ) {
(\$s2, \$usec2) = gettimeofday();
$part
(\$s3, \$usec3) = gettimeofday();
unload('$module');
timeit('$module',1);
}
}
";
}
if( $type eq '-' ) {
if( $module ) {
$part =~ s/(#[\-\0\+])\W*.*/$1/;
}
while( $part =~ m/(require [A-Za-z\:]+;)/g ) {
my $req = $1;
if( !$module ) {
my $fmod = $req;
$fmod =~ s/require //; $fmod =~ s/;//;
$module = $fmod;
}
push( @requires, $req );
}
$part =~ s/require [A-Za-z\:]+;\n//g;
$part = "##".$part."##";
$part =~ s/^##[#\- \n]+//;
$part =~ s/[ \n]+##$//;
print OUT "
if( \$ARGV[0] eq '$i' ) {
(\$s, \$usec) = gettimeofday();
if( eval( '@requires' ) ) {
(\$s2, \$usec2) = gettimeofday();
$part
(\$s3, \$usec3) = gettimeofday();
unload('$module');
timeit('$module');
}
}
";
}
if( $type eq '+' ) {
$part = "##".$part."##";
$part =~ s/^##[#\+ \n]+//;
$part =~ s/[ \n]+##$//;
print OUT "
if( \$ARGV[0] eq '$i' ) {
$part
}
";
}
if( $type eq '0+' ) {
$part = "##".$part."##";
$part =~ s/^##[0#\+ \n]+//;
$part =~ s/[ \n]+##$//;
print OUT "
#if( \$ARGV[0] eq '$i' ) {
$part
#}
";
}
$i++;
}
print OUT < 8 ) { \$a = substr( \$a, 8 ); }
if( \$len < 8 ) {
while( \$len < 8 ) {
\$a = "\${a} ";
\$len = length( \$a );
}
}
return \$a;
}
END
close(OUT);
open( SH, ">./bench/$name.pl" );
my $end = $i+1;
print SH "#!/usr/bin/perl
";
if( $comment ) {
print SH "
print <
#ifdef DARWIN
#include "stdlib.h"
#endif
#ifdef NOSTRING
void memset(char *s, int c, int n) {
char *se = s + n;
while(s < se) *s++ = c;
}
#else
#include
#endif
int dh_memcmp(char *a,char *b,int n) {
int c = 0;
while( c < n ) {
if( *a != *b ) return c+1;
a++; b++; c++;
}
return 0;
}
struct nodec *new_nodecp( struct nodec *newparent ) {
static int pos = 0;
int size = sizeof( struct nodec );
struct nodec *self = (struct nodec *) malloc( size );
memset( (char *) self, 0, size );
self->parent = newparent;
self->pos = ++pos;
return self;
}
struct nodec *new_nodec() {
int size = sizeof( struct nodec );
struct nodec *self = (struct nodec *) malloc( size );
memset( (char *) self, 0, size );
return self;
}
void del_nodec( struct nodec *node ) {
struct nodec *curnode;
struct attc *curatt;
struct nodec *next;
struct attc *nexta;
curnode = node->firstchild;
while( curnode ) {
next = curnode->next;
del_nodec( curnode );
if( !next ) break;
curnode = next;
}
curatt = node->firstatt;
while( curatt ) {
nexta = curatt->next;
free( curatt );
curatt = nexta;
}
free( node );
}
struct attc* new_attc( struct nodec *newparent ) {
int size = sizeof( struct attc );
struct attc *self = (struct attc *) malloc( size );
memset( (char *) self, 0, size );
self->parent = newparent;
return self;
}
//#define DEBUG
#define ST_val_1 1
#define ST_val_x 2
#define ST_comment_1dash 3
#define ST_comment_2dash 4
#define ST_comment 5
#define ST_comment_x 6
#define ST_pi 7
#define ST_bang 24
#define ST_cdata 8
#define ST_name_1 9
#define ST_name_x 10
#define ST_name_gap 11
#define ST_att_name1 12
#define ST_att_space 13
#define ST_att_name 14
#define ST_att_nameqs 15
#define ST_att_nameqsdone 16
#define ST_att_eq1 17
#define ST_att_eqx 18
#define ST_att_quot 19
#define ST_att_quots 20
#define ST_att_tick 21
#define ST_ename_1 22
#define ST_ename_x 23
int parserc_parse( struct parserc *self, char *xmlin ) {
// Variables that represent current 'state'
struct nodec *root = NULL;
char *tagname = NULL; int tagname_len = 0;
char *attname = NULL; int attname_len = 0;
char *attval = NULL; int attval_len = 0;
int att_has_val = 0;
struct nodec *curnode = NULL;
struct attc *curatt = NULL;
int last_state = 0;
self->rootpos = xmlin;
// Variables used temporarily during processing
struct nodec *temp;
char *cpos = &xmlin[0];
int res = 0;
int dent;
register int let;
if( self->last_state ) {
#ifdef DEBUG
printf( "Resuming parse in state %i\n", self->last_state );
#endif
self->err = 0;
root = self->rootnode;
curnode = self->curnode;
curatt = self->curatt;
tagname = self->tagname; tagname_len = self->tagname_len;
attname = self->attname; attname_len = self->attname_len;
attval = self->attval; attval_len = self->attval_len;
att_has_val = self->att_has_val;
switch( self->last_state ) {
case ST_val_1: goto val_1;
case ST_val_x: goto val_x;
case ST_comment_1dash: goto comment_1dash;
case ST_comment_2dash: goto comment_2dash;
case ST_comment: goto comment;
case ST_comment_x: goto comment_x;
case ST_pi: goto pi;
case ST_bang: goto bang;
case ST_cdata: goto cdata;
case ST_name_1: goto name_1;
case ST_name_x: goto name_x;
case ST_name_gap: goto name_gap;
case ST_att_name1: goto att_name1;
case ST_att_space: goto att_space;
case ST_att_name: goto att_name;
case ST_att_nameqs: goto att_nameqs;
case ST_att_nameqsdone: goto att_nameqsdone;
case ST_att_eq1: goto att_eq1;
case ST_att_eqx: goto att_eqx;
case ST_att_quot: goto att_quot;
case ST_att_quots: goto att_quots;
case ST_att_tick: goto att_tick;
case ST_ename_1: goto ename_1;
case ST_ename_x: goto ename_x;
}
}
else {
self->err = 0;
curnode = root = self->rootnode = new_nodec();
}
#ifdef DEBUG
printf("Entry to C Parser\n");
#endif
val_1:
#ifdef DEBUG
printf("val_1: %c\n", *cpos);
#endif
let = *cpos;
switch( let ) {
case 0: last_state = ST_val_1; goto done;
case '<': goto val_x;
}
if( !curnode->numvals ) {
curnode->value = cpos;
curnode->vallen = 1;
}
curnode->numvals++;
cpos++;
val_x:
#ifdef DEBUG
printf("val_x: %c\n", *cpos);
#endif
let = *cpos;
switch( let ) {
case 0: last_state = ST_val_x; goto done;
case '<':
switch( *(cpos+1) ) {
case '!':
if( *(cpos+2) == '[' ) { // type = 1;
goto cdata;
}
else {
cpos++; cpos++;
goto val_x;//actually goto error...
}
}
else if( *(cpos+2) == '-' && //
xhh
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
Ldqauu
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
tymd
kyk-qzuu
tymd
tymd
_htchuvd
tymd
tymd
ebjjhpcfhl qjlueqr
tymd
tymd
kyk-lfdpetuuel
d
h.u
h.u
tymd
Eduurt
tymd
tymd
ddzdtgg ut hlur
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
ddzdtgg ut uuut
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
ddzdtgg ddvdlucuót
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
ddzdtgg
tymd
tymd
tymd
hñrdut tqqzq
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
tymd
Tetqutrl Luute
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
grck lfeprqa
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
gzwuuky dd flllwa
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
veaudt
tymd
tymd
tymd
vulurluzrddt dd hlur
tymd
tymd
kyk-zddq-fuu
d
h.u
h.u
tymd
vulurluzrddt dd jluetue
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
vulurluzrddt dd azfttlp
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
vulurluzrddt dd uuutl
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
lblzcveg
tymd
tymd
kjgyt
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
uuutl
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
tymd
tqqzq
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
Tuuct dd Tetqutrqol
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
tymd
jdquqjdtel
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
tlfudjat
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
azfttlpcuót
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
kpt
tymd
tymd
h_cetcr dd GhOvIL
tymd
tymd
kyk-dpet
d
h.u
h.u
tymd
h_uudr
tymd
tymd
Frlzd
Frlzd
tymd
kpt geluuót dd qlgrt
tymd
rvc_nqqqob_hOhE
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
a
Frlzd
Frlzd
tymd
kpt geluuót dd cdudl
tymd
rvc_nqqqob_hOhE
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
a
Frlzd
Frlzd
s
tymd
tymd
tymd
w
tymd
Frlzd
Frlzd
Frlzd
tymd
kpt ludck rcuurl dd lfdducudl
tymd
rvc_nqqqob_hOhE
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
a
Frlzd
Frlzd
tymd
kpt qdgeedl dd uetqutrqol hdbuhvt
tymd
rvc_nqqqob_hOhE
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
a
Frlzd
Frlzd
w
tymd
tymd
tymd
w
tymd
Frlzd
Frlzd
Frlzd
tymd
kpt geluuót dd uupqdzwvqh
tymd
rvc_nqqqob_hOhE
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
a
Frlzd
Frlzd
tymd
kpt ccdwgzy dd tufebdhl
tymd
rvc_nqqqob_hOhE
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
a
Frlzd
Frlzd
tymd
kpt auamjebl hpddqlkhd
tymd
rvc_nqqqob_hOhE
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
a
Frlzd
Frlzd
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
rvc_wktd_EhD
a
tymd
Frlzd
tymd
rvc_SHhDOW_uaq
rvc_gOS_zhda
rvc_gOS_flv
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
h.u
h.u
w
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
f
Frlzd
tymd
rvc_wktd_EhD
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
rvc_wktd_EhD
d
tymd
Frlzd
w
a
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
kyk-tew
s
h.u
h.u
tymd
tymd
rvc_wktd_EhD
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
a
tymd
jtert ut adjrt ldeqetud
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
kyk-futd-tza-tepdrce
s
h.u
h.u
tymd
Eduurt ld ldeqetud qufjgujrlrdd
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
tymd
kyk-geeeue
s
h.u
h.u
tymd
ddteek ld ldeqetud qufjgujrlrdd
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
tymd
kyk-lfutu
s
h.u
h.u
tymd
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
tymd
kyk-teftelh
s
h.u
h.u
tymd
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
tymd
tymd
a
tymd
Frlzd
tymd
rvc_SHhDOW_uaq
rvc_gOS_zhda
rvc_gOS_flv
Frlzd
Frlzd
tymd
uueuvll ldh fgbetgrhq lfevudl
tymd
rvc_nqqqob_hOhE
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
kyk-qa-urck
s
h.u
h.u
tymd
tymd
tymd
Frlzd
a
Frlzd
Frlzd
tymd
hdlutrt ldh qjguuetuel fgbetgrhq
tymd
rvc_nqqqob_hOhE
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
kyk-qa-fdtwrtd
s
h.u
h.u
tymd
tymd
tymd
Frlzd
a
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_SHhDOW_uaq
rvc_gOS_zhda
rvc_gOS_flv
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
ych
tymd
Frlzd
tymd
tymd
tymd
tymd
*
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
ych
tymd
kuuwutqu dd crquct prtr dr uúlvaudr
tymd
-d
Frlzd
Frlzd
tymd
Frlzd
terluzrt utr uúlvaudr rvrtzrdr
tymd
rvc_nqqqob_hOhE
tymd
tymd
kyk-futd
s
h.u
h.u
Frlzd
Frlzd
a
tymd
Frlzd
d
tymd
rvc_SHhDOW_uaq
rvc_gOS_zhda
rvc_gOS_flv
tymd
tymd
rvc_wktd_EhD
tymd
Frlzd
Frlzd
Frlzd
d
tymd
tymd
tymd
tymd
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
rvc_lkudtuhw_zhda_ty_ldvqp
h.dhhhhhcddxad
h.ychhhhhhdrt
ghhGO_ckwqrcewc_hOhE
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
w
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
tymd
h.u
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
tbluq eauluetue:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
d
d
drjp
tymd
tymd
rzvlu qrtcr:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
BttzaRrdud
d
d
a
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
a
tymd
Frlzd
tymd
tymd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-eduu
s
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
w
d
a
d
drjp
drjp
tymd
a
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
tymd
tymd
tymd
*
Frlzd
tymd
tymd
tymd
Frlzd
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Grqr gee uetqutrl:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
ju
Frlzd
Frlzd
tymd
Frlzd
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
a
eyjfza|lhtutk|drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
a
d
eyjfza|lhtutk|drjp
tymd
d
a
Frlzd
w
w
ju
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
rvc_zuzm_hOhE
tymd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
ju
tymd
tymd
tymd
Frlzd
tymd
tymd
w
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
w
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
tymd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
h.u
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
t
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
hº dd rugéfdau:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
tymd
tymd
tymd
x
tymd
*
Frlzd
d
a
d
tymd
Ouzdtvrcudtel:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
u
w
drjp
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
rvc_zuzm_hOhE
tymd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
d
a
u
w
drjp
drjp
tymd
hº dd SIh:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
jrtgr:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
a
d
tymd
btmuqj:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
s
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
s
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
s
u
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
s
u
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
sh
tymd
tymd
tymd
tymd
a
tymd
*
Frlzd
Frlzd
Frlzd
tymd
tymd
tymd
tymd
dd
tymd
*
Frlzd
tymd
tymd
tymd
Frlzd
w
d
a
d
a
drjp
drjp
tymd
w
a
Frlzd
w
w
tymd
tymd
w
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
w
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
uhh
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
h.u
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
t
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
hº dd rugéfdau:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
tymd
tymd
tymd
x
tymd
*
Frlzd
d
a
d
tymd
Ouzdtvrcudtel:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
w
f
drjp
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
rvc_zuzm_hOhE
tymd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
d
a
w
f
drjp
drjp
tymd
hº dd SIh:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
hº dd rugéfdau a:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
s
u
drjp
tymd
tymd
tymd
tymd
x
tymd
*
Frlzd
d
a
s
u
tymd
zyjm:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
tymd
tymd
wytqrl: rlur d grhqu
tymd
tymd
gdturuulzdrd
tymd
tymd
redf
tymd
tymd
Opetrcudtel elpecurqol
tymd
d
a
a
d
drjp
tymd
hº dd SIh a:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
u
w
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
sh
tymd
tymd
tymd
tymd
a
tymd
*
Frlzd
Frlzd
Frlzd
tymd
tymd
tymd
tymd
dd
tymd
*
Frlzd
tymd
tymd
tymd
Frlzd
w
d
a
d
a
drjp
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
sh
tymd
tymd
tymd
tymd
a
tymd
*
Frlzd
Frlzd
Frlzd
tymd
tymd
tymd
tymd
dd
tymd
*
Frlzd
tymd
tymd
tymd
Frlzd
w
d
a
u
w
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
s
drjp
tymd
tymd
zdgutdr qjq d rugéfdau
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
d
a
d
s
drjp
tymd
f
a
Frlzd
w
w
tymd
tymd
w
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
w
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
suh
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
h.u
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
tbluq:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
d
a
d
drjp
tymd
hdgeed:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
d
a
d
a
drjp
drjp
tymd
Iqeu:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
d
a
a
d
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
s
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
s
drjp
tymd
s
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
jluetue:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
tymd
kyk-futd
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
kyk-tew
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
tymd
Frlzd
w
d
a
d
a
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
a
d
drjp
tymd
d
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
btmuqj:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
au
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
tymd
btmuqj cdt ruc utcluzzd
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
tymd
btmuqj qjt ruc utcluzzd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
Frlzd
tymd
cdtIvr
Frlzd
Frlzd
tymd
tymd
d
a
d
a
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
a
d
drjp
tymd
d
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
vp
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
a
drjp
tymd
tymd
uclfuuur auamjeb
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
d
a
d
drjp
tymd
a
a
Frlzd
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
djh
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
h.u
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
tbluq:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
d
a
d
drjp
tymd
hdgeed:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
d
a
d
a
drjp
drjp
tymd
Iqeu:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
d
a
a
d
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
sh
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
s
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
s
drjp
tymd
s
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
tymd
tymd
tymd
hº rugéfdau:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
d
a
d
drjp
tymd
hº dd SIh:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
d
a
d
a
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
a
d
drjp
tymd
d
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
jluetue:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
tymd
kyk-futd
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
kyk-tew
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
tymd
Frlzd
w
d
a
d
a
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
a
d
drjp
tymd
d
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
btmuqj:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
au
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
tymd
btmuqj cdt ruc utcluzzd
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
tymd
btmuqj qjt ruc utcluzzd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
Frlzd
tymd
cdtIvr
Frlzd
Frlzd
tymd
tymd
d
a
d
a
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
a
d
drjp
tymd
d
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
vp
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
a
drjp
tymd
tymd
uclfuuur auamjeb
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
d
a
d
drjp
tymd
a
a
Frlzd
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
djh
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
h.u
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
tymd
tymd
tymd
hº rugéfdau:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
d
a
d
drjp
tymd
hº dd SIh:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
d
a
d
a
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
s
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
s
drjp
tymd
jrtgr:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
a
d
tymd
s
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
jluetue:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
tymd
kyk-futd
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
kyk-tew
tymd
rvc_nqqqob_hOhE
tymd
Frlzd
Frlzd
tymd
Frlzd
w
d
a
d
a
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
a
d
drjp
tymd
d
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
btmuqj:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
au
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
tymd
btmuqj cdt ruc utcluzzd
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
tymd
btmuqj qjt ruc utcluzzd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
Frlzd
tymd
cdtIvr
Frlzd
Frlzd
tymd
tymd
d
a
d
a
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
a
d
drjp
tymd
d
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
w
Frlzd
Frlzd
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
vp
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
a
drjp
tymd
tymd
uclfuuur auamjeb
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
d
a
d
drjp
tymd
a
a
Frlzd
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
djh
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
dh
tymd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hOhE
tymd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hOhE
tymd
tymd
kyk-uaudtu
u
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hOhE
tymd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_ugqzzl
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hOhE
tymd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_ugqzzl
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hOhE
tymd
tymd
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_ugqzzl
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hOhE
tymd
tymd
kyk-lfefetetcel
u
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_ugqzzl
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
w
tymd
Frlzd
w
tymd
tymd
Frlzd
tymd
rvc_SHhDOW_Ih
w
tymd
tymd
rvc_hgrctt_hEvER
rvc_hgrctt_hEvER
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
h.u
h.u
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
tymd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
ju
Frlzd
Frlzd
tymd
tymd
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
w
tymd
tymd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-lal
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-geeeue
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-eduu
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
tymd
tymd
w
tymd
Frlzd
w
Frlzd
tymd
tymd
cdquqjdt
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
uru
tymd
tymd
tymd
Frlzd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
tymd
tymd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-lal
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-geeeue
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
kyk-eduu
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
tymd
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
Frlzd
tymd
tymd
zlgjfu
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
uru
tymd
tymd
tymd
Frlzd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
tymd
tymd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-lal
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-geeeue
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
kyk-eduu
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
tymd
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
tymd
tymd
lpwfluetl
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
uru
tymd
tymd
tymd
Frlzd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
tymd
tymd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-lal
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-geeeue
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
kyk-eduu
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
tymd
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
tymd
tymd
lfdqdcudtel
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
uru
tymd
tymd
tymd
Frlzd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
tymd
tymd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-lal
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-geeeue
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-eduu
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
tymd
tymd
lfzl
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
uru
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
ju
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
tymd
eeqcf hctduru Rerddt
tymd
tymd
Gauqe gkc Rerddt
tymd
tymd
vlptewl egkjuup dd uqlfeqjót:
tymd
Frlzd
Frlzd
tymd
tymd
tymd
tymd
tymd
*
Frlzd
tymd
tymd
tymd
Frlzd
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
ju
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
tymd
tymd
tymd
*
Frlzd
tymd
tymd
tymd
Frlzd
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
rvc_wktd_EhD
w
tymd
Frlzd
w
Frlzd
tymd
tymd
cdtfugutrcudt
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
uru
tymd
Frlzd
Frlzd
rvc_gOS_flv
Frlzd
Frlzd
tymd
tymd
w
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-az
d
h.u
h.u
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
zkl
wau
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
tymd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
wyqute:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
jdtluqd qÃutlu:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
getqrtetcur qÃtlft:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
a
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
a
d
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
rvc_zuzm_hOhE
tymd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
d
a
d
s
drjp
drjp
tymd
zulctupcuót:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
d
s
drjp
tymd
s
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
tlpt lpwfluetl talwyldtm r ut pdrt dd lfecudl vau eaulue:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
Frlzd
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
tlpt lpwfluetl dd rudau talwyldtm r ut adjrt pdrt:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
lpwfluetlEaulue
Frlzd
Frlzd
tymd
tymd
tymd
tymd
tymd
*
Frlzd
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
jóduqa:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
getqrtetcur hÃtlft:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
zulctupcuót:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
a
d
drjp
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
rvc_zuzm_hOhE
tymd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
d
a
a
d
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
a
tymd
d
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
tlpt lpwfluetl talwyldtm r ut pdrt dd lfecudl vau eaulue:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
Frlzd
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
tlpt lpwfluetl dd rudau talwyldtm r ut adjrt pdrt:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
lpwfluetlEaulue
Frlzd
Frlzd
tymd
tymd
tymd
tymd
tymd
*
Frlzd
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
ufl
tymd
tymd
hlur
tymd
tymd
hedur
tymd
tymd
jfud
tymd
tymd
tymd
tymd
tymd
tymd
Frlzd
as
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
kyk-uaudtu
u
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
uhh
tymd
Frlzd
tymd
rvc_haruukd_zhda
tymd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
wyqute:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
cvuey:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
zulctupcuót:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
a
d
drjp
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
rvc_zuzm_hOhE
tymd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
d
a
a
d
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
a
w
tymd
d
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
zupeaud dd dr lpwfluetl dd rudau vau dlpuu ld cluetue:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
d
s
u
tymd
tymd
wy ddpeaud dd tutgút jbjthv, zd wlkntg qjeqlfe.
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
hrqthBuuudt
d
d
tymd
tymd
zupeaud gee uldg dd hjttqduót gee rlur:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
hrqthBuuudt
d
dh
dd
tymd
h.u
h.u
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
d
a
d
drjp
tymd
Frlzd
d
a
d
a
drjp
drjp
tymd
a
a
Frlzd
w
w
dt
tymd
tymd
tymd
Frlzd
d
f
t
ju
drjp
tymd
tymd
zupeaud dd dr luqu gee uetqutrl ldegzzd pdt ld cluetue:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
hrqthBuuudt
d
t
x
drjp
tymd
tymd
zupeaud gee uetqutrl ldegzzd pdt ld cluetue prtr ld rlur:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
hrqthBuuudt
d
w
f
drjp
tymd
h.u
h.u
Frlzd
Frlzd
tymd
ufl
tymd
tymd
hlur
tymd
tymd
hedur
tymd
tymd
jfud
tymd
w
tymd
tymd
ju
tymd
tymd
tymd
Frlzd
d
x
dh
ju
drjp
tymd
h.u
h.u
Frlzd
Frlzd
tymd
hlur tuevr
tymd
tymd
htead
tymd
tymd
gdturuulzdrd
tymd
tymd
Recdttveqjót
tymd
w
tymd
tymd
ju
tymd
tymd
tymd
Frlzd
d
dd
ju
ju
drjp
tymd
tymd
zupeaud dd dr lfdqdcuót ldegzdr prtr dr hjttqduót:
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
hrqthBuuudt
d
a
d
drjp
tymd
h.u
h.u
Frlzd
Frlzd
tymd
Frlzd
dt
tymd
tymd
tymd
Frlzd
d
d
s
ju
drjp
tymd
kyk-rpplu
u
h.u
h.u
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
ju
ju
tymd
tymd
tymd
Frlzd
d
d
a
drjp
tymd
h.u
h.u
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
d
a
d
drjp
tymd
Frlzd
d
a
d
a
drjp
drjp
tymd
a
a
Frlzd
w
w
dt
tymd
tymd
tymd
Frlzd
d
u
w
ju
drjp
tymd
ju
d
Frlzd
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
djh
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
w
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
zyjm cdtutrud rtuugud:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
pldrwdd
tymd
tymd
gdluprqa
tymd
tymd
tymd
d
a
d
tymd
pldrwdd
tymd
tymd
gdluprqa
tymd
tymd
tymd
d
a
d
a
drjp
tymd
zyjm cdtutrud adjrt:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
ulq rtuugur:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
caupdwdk ddtrtue:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
s
u
drjp
tymd
caupdwdk lfdpueurtud uvulq:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
u
w
drjp
tymd
cfddtwug
tymd
tymd
hqetr
tymd
tymd
udjlqugr
tymd
tymd
qydzd
tymd
tymd
tymd
d
a
s
u
drjp
tymd
cfddtwug
tymd
tymd
hqetr
tymd
tymd
udjlqugr
tymd
tymd
qydzd
tymd
tymd
tymd
d
a
u
w
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
s
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
s
drjp
tymd
tymd
tymd
tymd
du
tymd
*
Frlzd
tymd
tymd
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
w
d
a
a
d
drjp
drjp
tymd
w
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
kyk-udtegu-ruuhetuucruudt
w
h.u
w
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_cdyd
tymd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
tymd
tymd
tymd
jdtutrzdñr:
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
tymd
tymd
tymd
*
Frlzd
tymd
tymd
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
rvc_lkudtuhw_zhda_ty_ldvqp
h.dhhhhhhhuux
wh zdgutddl
ghhGO_ckwqrcewc_hOhE
w
Frlzd
Frlzd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
tymd
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ju
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
a
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
a
d
drjp
drjp
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
rvc_zuzm_hOhE
tymd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
d
a
a
d
w
tymd
d
a
Frlzd
w
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
w
w
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
d
a
a
d
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
s
drjp
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
tymd
tymd
tymd
Frlzd
w
d
a
d
s
drjp
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
w
f
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
w
f
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
s
u
drjp
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
tymd
tymd
tymd
Frlzd
w
d
a
s
u
drjp
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
tymd
rvc_nqqqob_hOhE
tymd
tymd
kyk-futd
s
h.u
h.u
Frlzd
Frlzd
tymd
kpt jluetue
tymd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
a
tymd
h.u
a
d
d
s
drjp
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
d
a
d
a
tymd
tymd
rvc_nqqqob_hOhE
tymd
tymd
kyk-futd
s
h.u
h.u
Frlzd
Frlzd
tymd
kpt qteegl
tymd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
a
tymd
h.u
a
d
d
a
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
a
d
a
d
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
a
d
s
u
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
u
w
drjp
tymd
tymd
rvc_nqqqob_hOhE
tymd
tymd
kyk-futd
s
h.u
h.u
Frlzd
Frlzd
tymd
kpt Sfzl
tymd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
a
tymd
h.u
a
d
u
w
drjp
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
d
a
u
w
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
a
d
w
f
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
d
a
d
tymd
tymd
rvc_nqqqob_hOhE
tymd
tymd
kyk-futd
s
h.u
h.u
Frlzd
Frlzd
tymd
kpt rlur
tymd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
a
tymd
h.u
a
d
d
drjp
tymd
f
d
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
dhh
tymd
tymd
tymd
tymd
tymd
*
Frlzd
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
dhh
tymd
tymd
tymd
tymd
tymd
*
Frlzd
tymd
tymd
tymd
upw etwzau
tymd
tymd
hudtrdd
tymd
tymd
tymd
Frlzd
tymd
tymd
Frlzd
w
d
a
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
d
d
a
drjp
drjp
tymd
tymd
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
d
a
d
a
tymd
a
a
Frlzd
w
w
ju
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-qaud-drlu
s
h.u
h.u
Frlzd
Frlzd
tymd
tymd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
a
tymd
h.u
h.u
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
rvc_nqqqob_hORhhL
tymd
tymd
kyk-qaud-futlu
s
h.u
h.u
Frlzd
Frlzd
tymd
tymd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
a
tymd
h.u
h.u
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
zkl
lfl
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
kyk-uaudtu
w
h.u
ju
ju
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ju
ju
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ju
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
tymd
Frlzd
Frlzd
tymd
Frlzd
Frlzd
Frlzd
tymd
tymd
rvc_hgrctt_hUtyhhTIj
rvc_hgrctt_hUtyhhTIj
rvc_SHhDOW_Ih
rvc_jORhER_flv_zhda
tymd
tymd
tymd
tymd
kyk-lal
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
tymd
kyk-geeeue
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
tymd
kyk-eduu
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
tymd
Frlzd
w
Frlzd
Frlzd
tymd
Frlzd
w
ju
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
s
u
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
a
d
d
drjp
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
d
a
d
a
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
d
a
a
d
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
a
d
s
u
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
d
a
s
u
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
d
a
d
s
drjp
tymd
a
d
d
s
drjp
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
s
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
a
d
d
a
tymd
tymd
Frlzd
tymd
tymd
*
Frlzd
a
d
a
d
tymd
u
d
Frlzd
f
ju
tymd
tymd
tymd
Frlzd
Frlzd
Frlzd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
zkl
djh
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
tymd
kyk-uaudtu
w
ju
ju
Frlzd
Frlzd
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
Frlzd
Frlzd
tymd
ju
Frlzd
Frlzd
tymd
zulctupcuót gee zlgjfu
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
drjp
tymd
cvuey gee zlgjfu
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
d
a
drjp
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
tymd
tymd
tymd
tymd
tymd
*
Frlzd
d
a
d
a
tymd
Frlzd
Frlzd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
d
drjp
tymd
Frlzd
tymd
rvc_haruukd_zhda
Frlzd
Frlzd
h.u
ghhGO_ckwqrcewc_hOhE
-d
Frlzd
d
a
a
d
drjp
tymd
d
a
Frlzd
w
w
tymd
tymd
tymd
Frlzd
w
tymd
tymd
tymd
Frlzd
tymd
tymd
tymd
tymd
kyk-az
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
tymd
kyk-rwwcld
tymd
rvc_nqqqob_hORhhL
tymd
Frlzd
Frlzd
rvc_wktd_EhD
tymd
Frlzd
w
Frlzd
Frlzd
w
tymd
Frlzd
w
tymd
- GhOvIL -
rvc_WIhDOW_flvLEvEL
rvc_WIh_gOS_ugqzzl
Frlzd
tymd
Frlzd
tymd
Frlzd
Frlzd
nmp_WIhDOW_qlvp_uwvc_hORhhL
nmp_uauklft_dtpwr_zgzt
tymd
XML-Bare-0.53/bench/feed2.xml 0000644 0000000 0000000 00000104121 12137622640 014236 0 ustar root root
http://this.is.a.test.link/blah
en
AAAA AA AA AAA AAAAAAA AAAAA AA AA AAAAAAAA AA AA AAAAAA AA A AAAAAAAAAA AA AAAAAAAAAA AA AAAAAAA AAAAA AAAAAAA AA AAAAAAAAA AAA AAAA AAAA
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
AAA AAAAAAA AAA AA AAAAA AAAAAAA AAAAAAAA AAAA AAA AA AAAAAAAA
some test data
some test data
some test data
some test data
AAAAAAAAA
Fri, 22 Jun 2007 06:58:35 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
AAAAAAAAA AAAAA AA AAAAAA AAAAAAAAA AAAA AAAAAAAAAAAA
some test data
some test data
some test data
some test data
some test data
Thu, 21 Jun 2007 06:45:36 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
some test data
some test data
some test data
some test data
some test data
some test data
Tue, 19 Jun 2007 17:58:07 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
<![CDATA[AAAAAA AAAAAA AAAAA AAAAAAAAAAA AAAAA AAAAAAA AAAA AAAAAA]]>
some test data
some test data
some test data
some test data
some test data
Mon, 18 Jun 2007 17:45:27 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
some test data
some test data
some test data
some test data
some test data
Mon, 18 Jun 2007 06:05:56 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
some test data
some test data
some test data
some test data
some test data
some test data
Fri, 15 Jun 2007 06:46:05 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
some test data
some test data
some test data
some test data
some test data
some test data
some test data
some test data
some test data
Thu, 14 Jun 2007 07:32:05 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
some test data
some test data
some test data
some test data
some test data
some test data
Wed, 13 Jun 2007 06:29:39 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
some test data
some test data
some test data
some test data
some test data
some test data
some test data
Tue, 12 Jun 2007 06:09:28 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
AAAAAAAAA AAA AAAAAA AAAAAA AAA AAAAAAA AAAA AAAAAA AAAA AAAAA AAAAAAA
some test data
some test data
some test data
some test data
some test data
some test data
some test data
Mon, 11 Jun 2007 06:43:06 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
some test data
some test data
some test data
some test data
some test data
some test data
Fri, 08 Jun 2007 07:07:41 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
AAAA AAAAAA AAAAAAAA AAAAAAAAAAA AAAAAAAAAA AAAA AAAAAAAAAA
some test data
some test data
some test data
some test data
some test data
some test data
Thu, 07 Jun 2007 07:08:27 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
some test data
some test data
some test data
some test data
some test data
some test data
Wed, 06 Jun 2007 07:50:42 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
some test data
some test data
some test data
some test data
some test data
some test data
Tue, 05 Jun 2007 07:16:20 -0400
-
http://this.is.a.test.link/blah
http://this.is.a.test.link/blah
some test data
some test data
some test data
some test data
some test data
some test data
Mon, 04 Jun 2007 06:53:02 -0400
AA AAAAAAAAAAA AAAA
XML-Bare-0.53/Makefile.PL 0000755 0000000 0000000 00000005664 12137622640 013441 0 ustar root root #!/usr/bin/perl
use ExtUtils::MakeMaker;
require 5.006;
my @basics = (
AUTHOR => 'David Helkowski ',
ABSTRACT => 'A minimal XML parser / schema checker / pretty-printer using C internally.',
NAME => 'XML::Bare',
VERSION_FROM => 'Bare.pm',
XSOPT => '-nolinenumbers', # line number defines were causing issues on some platforms
BUILD_REQUIRES => {
'Data::Dumper' => 0,
'English' => 0,
'File::Find' => 0,
'File::Temp' => 0,
'Scalar::Util' => 0,
'Test::Harness' => 0,
'Test::More' => '0.94'
},
CONFIGURE_REQUIRES => {
'ExtUtils::MakeMaker' => '6.30'
},
PREREQ_PM => {
Carp => 0,
DynaLoader => 0,
Exporter => 0
},
);
my $cc = getcc();
if( $cc ) {
push( @basics, CC => $cc );
}
if( $ExtUtils::MakeMaker::VERSION >= 6.31 ) {
push( @basics, LICENSE => 'perl' );
}
if( $^O eq 'MSWin32' && !$cc ) {
gen_msvc(); # special case for msvc
}
elsif( $^O eq 'darwin' ) {
gen_darwin();
}
elsif( $^O eq 'solaris' ) {
gen_solaris();
}
else {
gen_cc(); # all others
}
sub gen_msvc {
require Config;
my $libpath = Config->{'archlibexp'};
my $ver = $]*1000000;
my $sub = $ver % 1000;
$ver -= $sub;
$ver /= 1000;
my $minor = $ver % 1000;
$ver -= $minor;
my $major = $ver / 1000;
WriteMakefile( @basics,
CCFLAGS => "/MT /DWIN32 /TP /DNOSTRING",
LIBS => ["$libpath\\core\\perl$major$minor.lib"],
OBJECT => 'Bare.o parser.o',
LDDLFLAGS => '/DLL /NODEFAULTLIB:libcmt',
#OPTIMIZE => '-Zl -DNDEBUG -O1', # Because -MD is included by default BLEH
);
}
sub gen_cc {
WriteMakefile( @basics,
LIBS => ['-lm'],
OBJECT => 'Bare.o parser.o',
LDDLFLAGS => '-shared -L/usr/local/lib',
);
}
sub gen_solaris {
WriteMakefile( @basics,
LIBS => ['-lm'],
OBJECT => 'Bare.o parser.o',
LDDLFLAGS => '-G -L/usr/local/lib', # -G is equiv of -shared
);
}
sub gen_darwin {
if( substr(`which gcc`,0,2) eq 'no' ) {
print "XCode must be installed.\n";
exit 1;
}
WriteMakefile( @basics,
LIBS => ['-lm'],
OBJECT => 'Bare.o parser.o',
CCFLAGS => "-dynamiclib -DDARWIN -fno-common",
LDDLFLAGS => '',
);
}
sub getcc {
my $div = (substr($ENV{'PATH'},0,1) eq '/') ? ':' : ';';
my @path = split($div,$ENV{'PATH'});
foreach my $dir ( @path ) {
return 'gcc' if( -e "$dir/gcc" || -e "$dir/gcc.exe" ); # prefer gcc
return 'cc' if( -e "$dir/cc" || -e "$dir/cc.exe" );
}
return 0;
}
# The following are hacks to force static linking and so remove need for msvcr## dll
package MY;
sub cflags {
my $res = shift->SUPER::cflags( @_ );
if( $^O eq 'MSWin32' ) {
$res =~ s/-O1/-O2/g;
$res =~ s/-MD/-MT/g;
}
return $res;
}
sub const_loadlibs {
my $res = shift->SUPER::const_loadlibs( @_ );
if( $^O eq 'MSWin32' ) {
$res =~ s/msvcrt\.lib/libcmt\.lib/gi;
}
return $res;
}
XML-Bare-0.53/Changes 0000644 0000000 0000000 00000025050 12163716235 012751 0 ustar root root XML::Bare Changelog
0.53 ( 7-12-13 )
- Remove executable permissions from files that shouldn't have them.
- Added shebang to main Bare.pm file ( apparently some people want this )
- Correct line endings to unix style on parser.c
- Improved simplify function that works properly with trees instead of just a single level
- Added hash2xml to quickly convert recursing hashes into XML
0.52 ( 4-29-13 )
- Added proper binmode setting when outputting XML to address deficiences on Win32 ( such as failing Strawberry perl due to line endings )
- Added evil OS check in file writing code to address differences in how files must be opened to write utf8 on win32 versus linux/cygwin.
- Added note regarding using utf8 flag instead of using encoding(utf8)
- Altered UTF8 test to also write XML containing UTF8 to a file.
0.51 ( 4-28-13 )
- New 'unsafe' parsing mode, giving a 30% speed increase with some downfalls
- New 'read_more' function, allowing more data to be read in before parsing into a tree
- Fixed some memory leaks
- Added 'Controversy' section to documentation
- Updated speed comparisons for feed2.xml, adding a comparison against XML::Fast as well
as a comparison of running in 'unsafe' mode.
- Spelling correction
- "Modernized" file handling using my variables
0.50 ( 4-24-13 )
- Remove debugging print statements that were left in
- Include the new test cases in the distribution
0.49 ( 4-23-13 )
- Fixes to find_by_perl
Can now be accessed in an object or namespace flexibly.
Now ignores case of keys.
Keys with underscores can be used.
Will work properly when passed a single node instead of an array reference of nodes.
- Fixes to xget
Method of deferencing has been changed to be compatible with newer versions of perl ( 5.10.2+ )
- Fixed handling of nodes named 'value'; they will no longer crash the XS code
- Added a new function similar to new called 'simple', that works in the same way but automatically uses the 'simple' parser
- Altered handling of node values in simple mode, so that it stores values when mixed with nodes or atttributes under 'content' ( like XML::Simple )
This feature was requested by users so it has been added. Note that it only does this when the value is not composed of just spaces and carriage returns.
0.48 ( 4-22-13 )
- Revert code back to 0.45 version
Changes lost in the process:
Content is not stored in the 'content' key any more; it is stored as the node itself when the node contains nothing else. As God intended.
Memory leak fixes
Quote handling
- Code copyright returned fully to David Helkowski; any changes by other parties have been discarded. Any code ported in from other open source projects removed.
This has been done intentionally so as to make it possible to relicense the software commerically.
- XS code modofied to work in a multi-threaded environment
- Reverting Makefile.PL back to original wierd hackish fixes. They are there for specific reasons.
0.47 ( 2-8-12 )
- Preping release unchanged from trial release.
The 0.45 release and previous set particular compile options for several different
platforms. My release refactoring stripped the Makefile.PL customisations, however
it appears these are not needed by any of the smoker CPANTS systems, so am releasing
with really basic compilation driver - see how it goes...
0.46_03 ( 1-28-12 )
- Bug #49906 Simple mode reports content of empty node as integer 1
- Bug #52762 XML::Simple compatibility mode doesn't support CDATA with attributes
- Bug #52832 Several memory leaks
- XML quote decoding on XML read
0.45
- Missing UTF8 test files now included
- XML Saving functionality now does size checks to ensure concurrency
issues do not corrupt XML.
- Linking under Solaris should now be fixed
- Line number defines removed from XS compilation to attempt to
fix some strange compilation problems.
0.44
- Self closing nodes now printed by xml function
- UTF8 Handling fixed; thanks go to Nigel Metheringham for the fix
recommendation as well as the test files
- Static linking has been fixed
- 'cc' now used properly in cases where 'gcc' is absent
0.43 ( 3-17-09 )
- Fixed newly broken add_node problem from 0.42
- Added a new test to detect fixed problem
0.42 ( 3-16-09 )
- A number of memory leaks have been fixed
- XML files included for benchmarking have been replaced with dummy test
data to avoid licensing problems.
0.41 ( internal )
- Perl code has been optimized
- Fixed problem with merge function
- Added tohtml output
- Added flag to indicate node read in as CDATA
0.40 ( 12-14-08 )
- Added schema checking functionality
- Fixed parsing of nodes with more than one comment block
- Added error checking to ensure properly closed tags
- Fixed parsing of attributes without values
0.30 ( 7-02-08 )
- Add new parsing mode, simple, which simulates XML::Simple.
0.29 ( internal )
- New function add_node_after
- Fixed node ordering such that node order is preserved
0.28 ( internal )
- Altered xml output so that it cleans extraneous input spacing
and indents mixed values properly.
- Added prereqs to Makefile.pl
- Added Test::POD and Test::POD::Coverage tests
- Fixed incorrect pointer type cast in parser.c
- Rewrote benchmark system to use templated benchmarking
0.27 ( 11-21-07 )
- makefile.pl modified to be compatible with Darwin and
to error out if XCode ( gcc specifically ) is not installed
- makefile.pl modified to support Perl 5.6+ on Win32 MSVC
( previously only Perl 5.8 was supported )
- parser.c modified to include stdlib.h for malloc in Darwin.
- Cyclic equality test weakened to allow for differences in
default sorting of hash keys per perl version.
0.26 ( 11-09-07 )
- Compatibility with versions before Perl 5.6 is not fruitful.
Perl 5.6 now required and will likely remain as a requirement.
It broke too many things.
0.25 ( 11-09-07 )
- makefile.pl modified to pass -shared option correctly
to gcc and not the linker. This caused compilation failure
on certain Solaris systems.
0.24 ( 11-09-07 )
- Continued makefile.pl changes to recognize some platforms
use executable extensions for gcc.
- Remove blank require line from meta.yml. It seemed to break
the kwalitee rating.
0.23 ( 11-08-07 )
- Minor change to XS code for potential future Perl 5.005 support
0.22 ( 11-07-07 )
- Altered makefile.pl to be compatible with more platforms.
- Removed dependency upon string.h for msvc because it
was breaking activestate builds.
- Perl 5.005 allowed, but it fails
- Comment parsing had an issue when the node containing
the comment had no direct value. This has now been resolved.
- Using comments caused ever increasing blank spaces to be added.
This has now been resolved.
- A test for comment reading has been added.
- A test for cyclic equality ( repeated loading and saving ) has
now been added.
0.21 ( 11-04-07 )
- Comments are no longer completely ignored. One comment
node is recognized and stored per non immediate node.
0.20 ( internal )
- forcearray function has been added
- simplify function has been added
- croak now used to error out of an improper call to find_node
- obj2xml has been corrected; previously newlines would stack
up at the end of the xml file
0.17 ( internal - unstable )
- Merge updated to handle array and overlap properly
- del_by_perl function has been added
- add_node modified to return the added node
- find_node modified to skip blank values
- Previously a set of nodes could not be printed out using
the 'xml' function. This can now be done. ( see perldoc )
0.16 ( internal )
- Mixed XML is now supported.
- UTF8 is now parsed properly.
0.15 ( internal )
- C Parser has been revised greatly in order to make it faster. Internal
state engine has been rewritten using gotos instead of a switch in order
make each state more independent and easily optimized by the compiler.
0.14 ( internal )
- Code that creates Perl hash from parsed XML structure has been
rewritten in XS instead of Perl. As a result overall speed has been
increased by 40% or so.
0.13 ( internal )
- Code that creates Perl hash from parsed XML structure has been
cleaned up in order to avoid use of a temporary Perl hash.
0.12 ( internal )
- 'find_node' and 'del_node' functions are now exportable.
- 'find_node' function will now work properly if called on a single item
instead of a list of items.
- Added 'find_by_perl' function to select nodes from a list that match
a specific perl expression.
- A performance test script and some xml files are now included and example runs of
the test script are in the documentation. XML::Bare is ~14-80 times
faster than the alternatives.
0.11 ( 6-25-07 )
- Changed XS code so that it is backwards compatible with older versions of Perl.
- Changed XS code to use 'blind' pointers, a custom created Perl Scalar. Speed
is increased as a result for XML with large contiguous values.
0.10 ( 6-21-07 )
- Made XS routines 30% more efficient. Speed of parsing and perl hash creation
is now very good in comparison to all currently available alternatives in perl.
0.09 ( 6-20-07 )
- Rewrote library using XS instead of swig.
0.08 ( 6-20-07 )
- Parser has been rewritten in C to avoid dependency on g++.
- After node parsing C tree structure memory is now freed.
0.07 ( 6-19-07 )
- Modified custom script because it was incorrect in its use of redirection, causing
some platforms to fail to compile.
0.06 ( 6-17-07 )
- Modified Makefile to use custom script to switch between g++ and gcc for
compilation. Even as c, swig interface still did not compile properly with
g++ on some systems.
0.05 ( 6-16-07 )
- Ceased using c++ for swig interface; it caused compilation issues on some platforms
- Fix further output indentation issues due to {value} always being displayed.
{value} is now displayed as documented.
- First line of changes was incorrect previously
0.04 ( 06-15-07 )
- Added clean function
- Added merge function
- Bugfix: xml output indentation was off due to parser changes in 0.03
- Updated documentation
0.03 ( 06-14-07 )
- Modified makefile to work under windows with Activestate and MSVC
- Cleaned up parser some and fixed basic mixed xml
- Added changelog to dist
- Dist now created from MakeMaker 6.32 ( license and abstract add to Meta.yml )
0.02 ( 06-13-07 )
- Changed version line in perl module from my to global to allow proper cpan indexing
0.01 ( 06-13-07 )
- First release