/usr/share/perl5/RDF/Trine/Iterator/SAXHandler.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 | # RDF::Trine::Iterator::SAXHandler
# -----------------------------------------------------------------------------
=head1 NAME
RDF::Trine::Iterator::SAXHandler - SAX Handler for parsing SPARQL XML Results format
=head1 VERSION
This document describes RDF::Trine::Iterator::SAXHandler 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 SYNOPSIS
use RDF::Trine::Iterator::SAXHandler;
my $handler = RDF::Trine::Iterator::SAXHandler->new();
my $p = XML::SAX::ParserFactory->parser(Handler => $handler);
$p->parse_file( $string );
my $iter = $handler->iterator;
=head1 METHODS
Beyond the methods documented below, this class inherits methods from the
L<XML::SAX::Base> class.
=over 4
=cut
package RDF::Trine::Iterator::SAXHandler;
use strict;
use warnings;
use Scalar::Util qw(refaddr);
use base qw(XML::SAX::Base);
use Data::Dumper;
use RDF::Trine::VariableBindings;
our ($VERSION);
BEGIN {
$VERSION = '1.014';
}
my %strings;
my %tagstack;
my %results;
my %values;
my %bindings;
my %booleans;
my %variables;
my %has_head;
my %has_end;
my %result_count;
my %result_handlers;
my %config;
my %expecting_string = map { $_ => 1 } qw(boolean bnode uri literal);
=item C<< new ( [ \&handler ] ) >>
Returns a new XML::SAX handler object. If C<< &handler >> is supplied, it will
be called with a variable bindings object as each is parsed, bypassing the
normal process of collecting the results for retrieval via an iterator object.
=cut
sub new {
my $class = shift;
my $self = $class->SUPER::new();
if (@_) {
my $addr = refaddr( $self );
my $code = shift;
my $args = shift || {};
$result_handlers{ $addr } = $code;
$config{ $addr } = { %$args };
}
return $self;
}
=item C<< iterator >>
Returns the RDF::Trine::Iterator object after parsing is complete.
=cut
sub iterator {
my $self = shift;
my $addr = refaddr( $self );
if (exists( $booleans{ $addr })) {
return $self->iterator_class->new( [$booleans{ $addr }] );
} else {
my $vars = delete $variables{ $addr };
my $results = delete $results{ $addr };
return $self->iterator_class->new( $results, $vars );
}
}
# =item C<< has_head >>
#
# Returns true if the <head/> element has been completely parsed, false otherwise.
#
# =cut
#
# sub has_head {
# my $self = shift;
# my $addr = refaddr( $self );
# return ($has_head{ $addr }) ? 1 : 0;
# }
#
# =item C<< has_end >>
#
# Returns true if the <sparql/> element (the entire iterator) has been completely
# parsed, false otherwise.
#
# =cut
#
# sub has_end {
# my $self = shift;
# my $addr = refaddr( $self );
# return ($has_end{ $addr }) ? 1 : 0;
# }
=item C<< iterator_class >>
Returns the iterator class appropriate for the parsed results (either
::Iterator::Boolean or ::Iterator::Bindings).
=cut
sub iterator_class {
my $self = shift;
my $addr = refaddr( $self );
if (exists( $booleans{ $addr })) {
return 'RDF::Trine::Iterator::Boolean';
} else {
return 'RDF::Trine::Iterator::Bindings';
}
}
=item C<< iterator_args >>
Returns the arguments suitable for passing to the iterator constructor after
the iterator data.
=cut
sub iterator_args {
my $self = shift;
my $addr = refaddr( $self );
if (exists( $booleans{ $addr })) {
return;
} else {
my $vars = $variables{ $addr };
return ($vars);
}
}
=item C<< pull_result >>
Returns the next result from the iterator, if available (if it has been parsed yet).
Otherwise, returns the empty list.
=cut
sub pull_result {
my $self = shift;
my $addr = refaddr( $self );
if (exists( $booleans{ $addr })) {
if (exists($booleans{ $addr })) {
return [$booleans{ $addr }];
}
} else {
if (scalar(@{ $results{ $addr } || [] })) {
my $result = shift( @{ $results{ $addr } } );
return $result;
}
}
return;
}
=begin private
=item C<< start_element >>
=cut
sub start_element {
my $self = shift;
my $el = shift;
my $tag = $el->{LocalName};
my $addr = refaddr( $self );
unshift( @{ $tagstack{ $addr } }, [$tag, $el] );
if ($expecting_string{ $tag }) {
$strings{ $addr } = '';
}
}
=item C<< end_element >>
=cut
sub end_element {
my $self = shift;
my $class = ref($self);
my $eel = shift;
my $addr = refaddr( $self );
my $string = $strings{ $addr };
my $taginfo = shift( @{ $tagstack{ $addr } } );
my ($tag, $el) = @$taginfo;
if ($tag eq 'head') {
$has_head{ $addr } = 1;
if (my $code = $result_handlers{ $addr }) {
if ($config{ $addr }{ variables }) {
$code->( $variables{ $addr } );
}
}
} elsif ($tag eq 'sparql') {
$has_end{ $addr } = 1;
} elsif ($tag eq 'variable') {
push( @{ $variables{ $addr } }, $el->{Attributes}{'{}name'}{Value});
} elsif ($tag eq 'boolean') {
$booleans{ $addr } = ($string eq 'true') ? 1 : 0;
} elsif ($tag eq 'binding') {
my $name = $el->{Attributes}{'{}name'}{Value};
my $value = delete( $values{ $addr } );
$bindings{ $addr }{ $name } = $value;
} elsif ($tag eq 'result') {
my $result = delete( $bindings{ $addr } ) || {};
$result_count{ $addr }++;
my $vb = RDF::Trine::VariableBindings->new( $result );
if (my $code = $result_handlers{ $addr }) {
$code->( $vb );
} else {
push( @{ $results{ $addr } }, $vb );
}
} elsif ($tag eq 'bnode') {
$values{ $addr } = RDF::Trine::Node::Blank->new( $string );
} elsif ($tag eq 'uri') {
$values{ $addr } = RDF::Trine::Node::Resource->new( $string );
} elsif ($tag eq 'literal') {
my ($lang, $dt);
if (my $dtinf = $el->{Attributes}{'{}datatype'}) {
$dt = $dtinf->{Value};
} elsif (my $langinf = $el->{Attributes}{'{http://www.w3.org/XML/1998/namespace}lang'}) {
$lang = $langinf->{Value};
}
$values{ $addr } = RDF::Trine::Node::Literal->new( $string, $lang, $dt );
}
}
=item C<< characters >>
=cut
sub characters {
my $self = shift;
my $data = shift;
my $addr = refaddr( $self );
my $tag = $self->_current_tag;
if ($expecting_string{ $tag }) {
my $chars = $data->{Data};
$strings{ $addr } .= $chars;
}
}
sub _current_tag {
my $self = shift;
my $addr = refaddr( $self );
return $tagstack{ $addr }[0][0];
}
sub DESTROY {
my $self = shift;
my $addr = refaddr( $self );
delete $strings{ $addr };
delete $results{ $addr };
delete $tagstack{ $addr };
delete $values{ $addr };
delete $bindings{ $addr };
delete $booleans{ $addr };
delete $variables{ $addr };
delete $has_head{ $addr };
delete $has_end{ $addr };
delete $result_count{ $addr };
delete $result_handlers{ $addr };
delete $config{ $addr };
}
1;
__END__
=end private
=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
|