/usr/share/perl5/RDF/Trine/Model/Dataset.pm is in librdf-trine-perl 1.014-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 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 | # RDF::Trine::Model::Dataset
# -----------------------------------------------------------------------------
=head1 NAME
RDF::Trine::Model::Dataset - Model for SPARQL datasets
=head1 VERSION
This document describes RDF::Trine::Model::Dataset version 1.014
=head1 STATUS
This module's API and functionality should be considered unstable.
In the future, this module may change in backwards-incompatible ways,
or be removed entirely. If you need functionality that this module provides,
please L<get in touch|http://www.perlrdf.org/>.
=head1 METHODS
Beyond the methods documented below, this class inherits methods from the
L<RDF::Trine::Model> class.
=over 4
=cut
package RDF::Trine::Model::Dataset;
use strict;
use warnings;
no warnings 'redefine';
use base qw(RDF::Trine::Model);
use Scalar::Util qw(blessed);
use RDF::Trine::Model;
our ($VERSION);
BEGIN {
$VERSION = '1.014';
}
################################################################################
=item C<< new ( $model ) >>
Returns a new dataset-model over the supplied model.
=cut
sub new {
my $class = shift;
my $model = shift;
my $self = bless({ model => $model, stack => [] }, $class);
}
=item C<< push_dataset ( default => \@graphs, named => \@graphs ) >>
Creates a new dataset view over the underlying model.
=cut
sub push_dataset {
my $self = shift;
my %dataset = @_;
my @dgraphs = @{ $dataset{ default } || [] };
unshift(@{ $self->{ stack } }, { default => {}, named => {} });
foreach my $graph (@dgraphs) {
my $name = blessed($graph) ? $graph->uri_value : $graph;
$graph = blessed($graph) ? $graph : RDF::Trine::Node::Resource->new( $graph );
$self->{stack}[0]{default}{$name} = $graph;
}
my @ngraphs = @{ $dataset{ named } || [] };
foreach my $graph (@ngraphs) {
my $name = blessed($graph) ? $graph->uri_value : $graph;
$graph = blessed($graph) ? $graph : RDF::Trine::Node::Resource->new( $graph );
$self->{stack}[0]{named}{$name} = $graph;
}
return 1;
}
=item C<< pop_dataset >>
Removes the last pushed dataset view.
=cut
sub pop_dataset {
my $self = shift;
shift(@{ $self->{ stack } });
return 1;
}
=item C<< temporary_model >>
Returns a new temporary (non-persistent) model.
=cut
sub temporary_model {
my $class = shift;
my $model = RDF::Trine::Model->temporary_model;
return $class->new( $model );
}
=item C<< add_hashref ( $hashref [, $context] ) >>
Add triples represented in an RDF/JSON-like manner to the model.
=cut
sub add_hashref {
my $self = shift;
return $self->model->add_hashref( @_ );
}
=item C<< size >>
Returns the number of statements in the model.
=cut
sub size {
my $self = shift;
return $self->count_statements( undef, undef, undef, undef );
}
=item C<< supports ( [ $feature ] ) >>
If C<< $feature >> is specified, returns true if the feature is supported by the
underlying store, false otherwise. If C<< $feature >> is not specified, returns
a list of supported features.
=cut
sub supports {
my $self = shift;
my $store = $self->_store;
if ($store) {
return $store->supports( @_ );
}
return;
}
=item C<< count_statements ( $subject, $predicate, $object ) >>
Returns a count of all the statements matching the specified subject,
predicate and objects. Any of the arguments may be undef to match any value.
=cut
sub count_statements {
my $self = shift;
return $self->model->count_statements( @_ ) unless (scalar(@{ $self->{stack} }));
my $use_quad = (scalar(@_) >= 4);
if ($use_quad) {
# warn "counting quads with dataset";
my $quad = $_[3];
if (blessed($quad) and $quad->isa('RDF::Trine::Node::Nil')) {
# warn "- default graph query";
# warn "- " . join(', ', keys %{ $self->{stack}[0] });
my $count = 0;
foreach my $g (values %{ $self->{stack}[0]{default} }) {
$count += $self->model->count_statements( @_[0..2], $g );
# warn "$count statments in graph " . $g->uri_value;
}
return $count;
} elsif (not(defined($quad)) or (blessed($quad) and $quad->isa('RDF::Trine::Node::Variable'))) {
my $iter = $self->get_contexts;
my $count = 0;
while (my $g = $iter->next) {
$count += $self->model->count_statements( @_[0..2], $g );
}
return $count;
} else {
my $name = blessed($quad) ? $quad->uri_value : $quad;
if ($self->{stack}[0]{named}{ $name }) {
return $self->model->count_statements( @_[0..2], $quad );
} else {
return 0;
}
}
} else {
my %seen;
my $count = 0;
my $iter = $self->get_statements( @_[0..2], undef );
while (my $st = $iter->next) {
warn 'counting triples in dataset: ' . $st->as_string;
$count++ unless ($seen{ join(' ', map { $_->as_string } (map { $st->$_() } qw(subject predicate object)) ) }++);
}
return $count;
}
}
=item C<< add_statement ( $statement [, $context] ) >>
Adds the specified C<< $statement >> to the rdf store.
=cut
sub add_statement {
my $self = shift;
return $self->model->add_statement( @_ );
}
=item C<< remove_statement ( $statement [, $context]) >>
Removes the specified C<< $statement >> from the rdf store.
=cut
sub remove_statement {
my $self = shift;
return $self->model->remove_statement( @_ );
}
=item C<< remove_statements ( $subject, $predicate, $object [, $context] ) >>
Removes all statements matching the supplied C<< $statement >> pattern from the rdf store.
=cut
sub remove_statements {
my $self = shift;
return $self->model->remove_statements( @_ );
}
=item C<< get_statements ($subject, $predicate, $object [, $context] ) >>
Returns an iterator of all statements matching the specified subject,
predicate and objects from the rdf store. Any of the arguments may be undef to
match any value.
If three or fewer arguments are given, the statements returned will be matched
based on triple semantics (the graph union of triples from all the named
graphs). If four arguments are given (even if C<< $context >> is undef),
statements will be matched based on quad semantics (the union of all quads in
the underlying store).
=cut
sub get_statements {
my $self = shift;
return $self->model->get_statements( @_ ) unless (scalar(@{ $self->{stack} }));
my $bound = 0;
my $use_quad = (scalar(@_) >= 4);
my $nil = RDF::Trine::Node::Nil->new();
if ($use_quad) {
my $quad = $_[3];
if (blessed($quad) and not($quad->isa('RDF::Trine::Node::Variable')) and not($quad->isa('RDF::Trine::Node::Nil'))) {
if (exists($self->{stack}[0]{named}{$quad->uri_value})) {
return $self->model->get_statements( @_ );
} else {
return RDF::Trine::Iterator::Graph->new([]);
}
} else {
my @iters;
foreach my $g (values %{ $self->{stack}[0]{default} }) {
my $iter = $self->model->get_statements( @_[0..2], $g );
my $code = sub {
my $st = $iter->next;
return unless $st;
my @nodes = $st->nodes;
$nodes[3] = $nil;
my $quad = RDF::Trine::Statement::Quad->new( @nodes );
return $quad;
};
push(@iters, RDF::Trine::Iterator::Graph->new( $code ));
}
if (not(defined($quad)) or $quad->isa('RDF::Trine::Node::Variable')) {
my $graphs = $self->get_contexts;
while (my $g = $graphs->next) {
next if ($g->isa('RDF::Trine::Node::Nil'));
push(@iters, $self->model->get_statements( @_[0..2], $g ));
}
}
my %seen;
my $code = sub {
while (1) {
return unless scalar(@iters);
my $st = $iters[0]->next;
if ($st) {
if ($seen{ $st->as_string }++) {
next;
}
return $st;
} else {
shift(@iters);
}
}
};
my $iter = RDF::Trine::Iterator::Graph->new( $code );
return $iter;
}
} else {
my %seen;
my @iters;
my $iter = $self->get_statements( @_[0..2], $nil );
push(@iters, $iter);
my $giter = $self->get_contexts;
while (my $g = $giter->next) {
my $iter = $self->get_statements( @_[0..2], $g );
push(@iters, $iter);
}
my $code = sub {
while (1) {
return unless scalar(@iters);
my $st = $iters[0]->next;
if ($st) {
my @nodes = (map { $st->$_() } qw(subject predicate object));
next if ($seen{ join(' ', map { $_->as_string } @nodes ) }++);
return RDF::Trine::Statement->new( @nodes );
} else {
shift(@iters);
}
}
};
return RDF::Trine::Iterator::Graph->new( $code );
}
}
=item C<< get_pattern ( $bgp [, $context] [, %args ] ) >>
Returns a stream object of all bindings matching the specified graph pattern.
=cut
sub get_pattern {
my $self = shift;
return $self->model->get_pattern( @_ ) unless (scalar(@{ $self->{stack} }));
my $use_quad = (scalar(@_) >= 4);
if ($use_quad) {
my $quad = $_[3];
if (blessed($quad) and not($quad->isa('RDF::Trine::Node::Variable')) and not($quad->isa('RDF::Trine::Node::Nil'))) {
return $self->model->get_pattern( @_ );
} else {
return $self->SUPER::get_pattern( @_ );
}
} else {
return $self->model->get_pattern( @_ );
}
}
=item C<< get_sparql ( $sparql ) >>
Returns a stream object of all bindings matching the specified graph pattern.
=cut
sub get_sparql {
my $self = shift;
return $self->model->get_sparql( @_ ) unless (scalar(@{ $self->{stack} }));
throw RDF::Trine::Error::UnimplementedError -text => "Cannot execute SPARQL queries against a complex dataset model";
}
=item C<< get_graphs >>
=item C<< get_contexts >>
Returns an iterator containing the nodes representing the named graphs in the
model.
=cut
sub get_contexts {
my $self = shift;
return $self->model->get_contexts unless (scalar(@{ $self->{stack} }));
my @nodes = values %{ $self->{stack}[0]{named} };
if (wantarray) {
return @nodes;
} else {
return RDF::Trine::Iterator->new( \@nodes );
}
}
*get_graphs = \&get_contexts;
=item C<< model >>
Returns the underlying model object.
=cut
sub model {
my $self = shift;
return $self->{model};
}
sub _store {
my $self = shift;
return $self->model->_store;
}
1;
__END__
=back
=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
|