/usr/share/perl5/RDF/Trine/Iterator/Graph.pm is in librdf-trine-perl 1.019-1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 | # RDF::Trine::Iterator::Graph
# -----------------------------------------------------------------------------
=head1 NAME
RDF::Trine::Iterator::Graph - Iterator class for graph query results
=head1 VERSION
This document describes RDF::Trine::Iterator::Graph version 1.019
=head1 SYNOPSIS
use RDF::Trine::Iterator::Graph;
my $iterator = RDF::Trine::Iterator::Graph->new( \&data );
while (my $st = $iterator->next) {
# $st is a RDF::Trine::Statement object
print $st->as_string;
}
=head1 METHODS
Beyond the methods documented below, this class inherits methods from the
L<RDF::Trine::Iterator> class.
=over 4
=cut
package RDF::Trine::Iterator::Graph;
use strict;
use warnings;
no warnings 'redefine';
use JSON;
use List::Util qw(max);
use Scalar::Util qw(blessed);
use RDF::Trine::Iterator qw(sgrep);
use RDF::Trine::Iterator::Graph::Materialized;
use base qw(RDF::Trine::Iterator);
######################################################################
our ($VERSION);
BEGIN {
$VERSION = '1.019';
}
######################################################################
=item C<new ( \@results, %args )>
=item C<new ( \&results, %args )>
Returns a new SPARQL Result interator object. Results must be either
an reference to an array containing results or a CODE reference that
acts as an iterator, returning successive items when called, and
returning undef when the iterator is exhausted.
$type should be one of: bindings, boolean, graph.
=cut
sub new {
my $class = shift;
my $stream = shift || sub { undef };
# Carp::confess unless (scalar(@_) % 2 == 0);
my %args = @_;
my $type = 'graph';
return $class->SUPER::new( $stream, $type, [], %args );
}
sub _new {
my $class = shift;
my $stream = shift;
my $type = shift;
my $names = shift;
my %args = @_;
return $class->new( $stream, %args );
}
=item C<< as_bindings ( $s, $p, $o ) >>
Returns the iterator as a Bindings iterator, using the supplied triple nodes to
determine the variable bindings.
=cut
sub as_bindings {
my $self = shift;
my @nodes = @_;
my @names = qw(subject predicate object context);
my %bindings;
foreach my $i (0 .. $#names) {
if (not($nodes[ $i ]) or not($nodes[ $i ]->isa('RDF::Trine::Node::Variable'))) {
$nodes[ $i ] = RDF::Trine::Node::Variable->new( $names[ $i ] );
}
}
foreach my $i (0 .. $#nodes) {
my $n = $nodes[ $i ];
$bindings{ $n->name } = $names[ $i ];
}
my $context = $nodes[ 3 ]->name;
my $sub = sub {
my $statement = $self->next;
return unless ($statement);
my %values = map {
my $method = $bindings{ $_ };
$_ => $statement->$method()
} grep { ($statement->isa('RDF::Trine::Statement::Quad')) ? 1 : ($_ ne $context) } (keys %bindings);
return \%values;
};
return RDF::Trine::Iterator::Bindings->new( $sub, [ keys %bindings ] );
}
=item C<< materialize >>
Returns a materialized version of the current graph iterator.
The materialization process will leave this iterator empty. The materialized
iterator that is returned should be used for any future need for the iterator's
data.
=cut
sub materialize {
my $self = shift;
my @data = $self->get_all;
my @args = $self->construct_args;
return $self->_mclass->_new( \@data, @args );
}
sub _mclass {
return 'RDF::Trine::Iterator::Graph::Materialized';
}
=item C<< unique >>
Returns a Graph iterator that ensures the returned statements are unique. While
the underlying RDF graph is the same regardless of uniqueness, the iterator's
serialization methods assume the results are unique, and so use this method
before serialization.
Uniqueness is opt-in for efficiency concerns -- this method requires O(n) memory,
and so may have noticeable effects on large graphs.
=cut
sub unique {
my $self = shift;
my %seen;
no warnings 'uninitialized';
my $stream = sgrep( sub {
my $s = $_;
my $str = $s->as_string;
not($seen{ $str }++)
}, $self);
return $stream;
}
=item C<is_graph>
Returns true if the underlying result is an RDF graph.
=cut
sub is_graph {
my $self = shift;
return 1;
}
=item C<as_string ( $max_size [, \$count] )>
Returns a string table serialization of the stream data.
=cut
sub as_string {
my $self = shift;
my $max_result_size = shift || 0;
my $rescount = shift;
my @names = qw(subject predicate object);
my $headers = \@names;
my @rows;
my $count = 0;
while (my $row = $self->next) {
push(@rows, [ map { blessed($_) ? $_->as_string : '' } map { $row->$_() } qw(subject predicate object) ]);
last if ($max_result_size and ++$count >= $max_result_size);
}
# my $rows = [ map { [ map { blessed($_) ? $_->as_string : '' } @{$_}{ @names } ] } @nodes ];
if (ref($rescount)) {
$$rescount = scalar(@rows);
}
my @rule = qw(- +);
my @headers = (\q"| ");
push(@headers, map { $_ => \q" | " } @$headers);
pop @headers;
push @headers => (\q" |");
if ('ARRAY' eq ref $rows[0]) {
if (@$headers == @{ $rows[0] }) {
my $table = Text::Table->new(@headers);
$table->rule(@rule);
$table->body_rule(@rule);
$table->load(@rows);
return join('',
$table->rule(@rule),
$table->title,
$table->rule(@rule),
map({ $table->body($_) } 0 .. @rows),
$table->rule(@rule)
);
} else {
die("make_table() rows must be an AoA with rows being same size as headers");
}
} else {
return '';
}
}
=item C<as_xml ( $max_size )>
Returns an XML serialization of the stream data.
=cut
sub as_xml {
my $self = shift;
my $max_result_size = shift || 0;
my $string = '';
open( my $fh, '>', \$string );
$self->print_xml( $fh, $max_result_size );
return $string;
}
=item C<< print_xml ( $fh, $max_size ) >>
Prints an XML serialization of the stream data to the filehandle $fh.
=cut
sub print_xml {
my $self = shift;
my $fh = shift;
my $max_result_size = shift || 0;
my $graph = $self->unique();
my $count = 0;
print {$fh} <<"END";
<?xml version="1.0" encoding="utf-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#">
END
while (my $stmt = $graph->next) {
if ($max_result_size) {
last if ($count++ >= $max_result_size);
}
my $p = $stmt->predicate->uri_value;
my $pos = max( rindex( $p, '/' ), rindex( $p, '#' ) );
my $ns = substr($p,0,$pos+1);
my $local = substr($p, $pos+1);
my $subject = $stmt->subject;
my $subjstr = ($subject->is_resource)
? 'rdf:about="' . $subject->uri_value . '"'
: 'rdf:nodeID="' . $subject->blank_identifier . '"';
my $object = $stmt->object;
print {$fh} qq[<rdf:Description $subjstr>\n];
if ($object->is_resource) {
my $uri = $object->uri_value;
print {$fh} qq[\t<${local} xmlns="${ns}" rdf:resource="$uri"/>\n];
} elsif ($object->isa('RDF::Trine::Node::Blank')) {
my $id = $object->blank_identifier;
print {$fh} qq[\t<${local} xmlns="${ns}" rdf:nodeID="$id"/>\n];
} else {
my $value = $object->literal_value;
# escape < and & and ' and " and >
$value =~ s/&/&/g;
$value =~ s/'/'/g;
$value =~ s/"/"/g;
$value =~ s/</</g;
$value =~ s/>/>/g;
my $tag = qq[${local} xmlns="${ns}"];
if (defined($object->literal_value_language)) {
my $lang = $object->literal_value_language;
$tag .= qq[ xml:lang="${lang}"];
} elsif (defined($object->literal_datatype)) {
my $dt = $object->literal_datatype;
$tag .= qq[ rdf:datatype="${dt}"];
}
print {$fh} qq[\t<${tag}>${value}</${local}>\n];
}
print {$fh} qq[</rdf:Description>\n];
}
print {$fh} "</rdf:RDF>\n";
}
=item C<as_json ( $max_size )>
Returns a JSON serialization of the stream data.
=cut
sub as_json {
my $self = shift;
my $max_result_size = shift;
throw RDF::Trine::Error::SerializationError ( -text => 'There is no JSON serialization specified for graph query results' );
}
=item C<< as_hashref >>
Returns a hashref representing the model in an RDF/JSON-like manner.
See C<< as_hashref >> at L<RDF::Trine::Model> for full documentation of the
hashref format.
=cut
sub as_hashref {
my $self = shift;
my $index = {};
while (my $statement = $self->next) {
my $s = $statement->subject->isa('RDF::Trine::Node::Blank') ?
('_:'.$statement->subject->blank_identifier) :
$statement->subject->uri ;
my $p = $statement->predicate->uri ;
push @{ $index->{$s}->{$p} }, $statement->object->as_hashref;
}
return $index;
}
=item C<< construct_args >>
Returns the arguments necessary to pass to the stream constructor _new
to re-create this stream (assuming the same closure as the first
=cut
sub construct_args {
my $self = shift;
my $type = $self->type;
my $args = $self->_args || {};
return ($type, [], %{ $args });
}
1;
__END__
=back
=head1 DEPENDENCIES
L<JSON|JSON>
L<Scalar::Util|Scalar::Util>
=head1 BUGS
Please report any bugs or feature requests to through the GitHub web interface
at L<https://github.com/kasei/perlrdf/issues>.
=head1 AUTHOR
Gregory Todd Williams C<< <gwilliams@cpan.org> >>
=head1 COPYRIGHT
Copyright (c) 2006-2012 Gregory Todd Williams. This
program is free software; you can redistribute it and/or modify it under
the same terms as Perl itself.
=cut
|