/usr/share/perl5/RDF/Trine/Node/Formula.pm is in librdf-trin3-perl 0.204-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 | package RDF::Trine::Node::Formula;
use 5.010;
use strict;
use warnings;
no warnings 'redefine';
use parent qw(RDF::Trine::Node::Literal);
use RDF::Trine::Error;
use RDF::Trine::Pattern;
use RDF::Trine::Parser::Notation3;
use Scalar::Util qw(blessed);
our ($VERSION);
BEGIN {
$VERSION = '0.204';
}
sub new {
my $class = shift;
my $pattern = shift;
if (blessed($pattern) && $pattern->isa('RDF::Trine::Pattern')) {
return bless [$pattern, undef, undef, undef, undef], $class;
} else {
my $p = RDF::Trine::Parser::Notation3->new;
my $base = shift;
my $r = $p->parse_formula($base, $pattern);
return $r;
}
}
sub literal_value {
my $self = shift;
if (@_) {
$self->from_literal_notation( shift );
}
return $self->as_literal_notation;
}
sub pattern {
my $self = shift;
if (@_) {
$self->[0] = shift;
}
return $self->[0];
}
sub forAll {
my $self = shift;
if (@_) {
$self->[3] = \@_;
}
return unless $self->[3];
return @{ $self->[3] };
}
sub forSome {
my $self = shift;
if (@_) {
$self->[4] = \@_;
}
return unless $self->[4];
return @{ $self->[4] };
}
sub literal_value_language {
return undef;
}
sub literal_datatype {
return 'http://open.vocab.org/terms/Formula';
}
sub as_ntriples {
my $self = shift;
my $literal = $self->literal_value;
my $escaped = $self->_unicode_escape( $literal );
$literal = $escaped;
if ($self->has_language) {
my $lang = $self->literal_value_language;
return qq("${literal}"\@${lang});
} elsif ($self->has_datatype) {
my $dt = $self->literal_datatype;
return qq("${literal}"^^<${dt}>);
} else {
return qq("${literal}");
}
}
sub has_language {
return 0;
}
sub has_datatype {
return 1;
}
sub as_literal_notation {
my $self = shift;
my $n3 = '';
if ($self->forAll) {
$n3 .= '@forAll ' . join ', ', map {$_->is_variable?$_->as_string:$_->as_ntriples} $self->forAll;
$n3 .= " .\n";
}
if ($self->forSome) {
$n3 .= '@forSome ' . join ', ', map {$_->is_variable?$_->as_string:$_->as_ntriples} $self->forSome;
$n3 .= " .\n";
}
foreach my $st ($self->pattern->triples) {
$n3 .= join ' ', map {$_->is_variable?$_->as_string:$_->as_ntriples} $st->nodes;
$n3 .= " .\n";
}
return $n3;
}
sub from_literal_notation {
my $self = shift;
my $new = __PACKAGE__->new(@_);
$self->[0] = $new->pattern->clone;
$self->[3] = [ $new->forAll ];
$self->[4] = [ $new->forSome ];
return $self;
}
sub equal {
my ($a, $b) = @_;
return 0 unless $b->isa(__PACKAGE__);
return $a->as_literal_notation eq $b->as_literal_notation;
}
sub _compare {
my ($a, $b) = @_;
return 1 unless $b->isa(__PACKAGE__);
return (scalar $a->pattern->triples) <=> (scalar $b->pattern->triples);
}
1;
__END__
=head1 NAME
RDF::Trine::Node::Formula - RDF Node class for formulae / graph literals
=head1 DESCRIPTION
Formulae are implemented as a subclass of literals. Parts of Trine that have no special
knowledge about formulae (e.g. the Turtle serialiser) will just see them as literals
with a particular datatype URI (http://open.vocab.org/terms/Formula).
If your code needs to detect formulae nodes, try:
use Scalar::Util qw[blessed];
if (blessed($node) && $node->isa('RDF::Trine::Node::Formula'))
{ ... do stuff to formulae ... }
or perhaps
use Scalar::Util qw[blessed];
if (blessed($node) && $node->can('pattern'))
{ ... do stuff to formulae ... }
=head1 Constructor
=over
=item C<new ( $pattern )>
Returns a new Formula structure. This is a subclass of RDF::Trine::Node::Literal.
$pattern is an RDF::Trine::Pattern or a string capable of being parsed with
RDF::Trine::Parser::Notation3->parse_formula.
=back
=head1 Methods
=over
=item C<< pattern ( $node ) >>
Returns the formula as an RDF::Trine::Pattern.
=item C<< forAll >>
Returns the a list of nodes with the @forAll quantifier.
This is a fairly obscure bit of N3 semantics.
=item C<< forSome >>
Returns the a list of nodes with the @forSome quantifier.
This is a fairly obscure bit of N3 semantics.
=item C<< as_literal_notation >>
Returns the formula in Notation-3-like syntax, excluding the wrapping "{"..."}".
Uses absolute URIs whenever possible, avoiding relative URI references,
QNames and keywords.
=item C<< from_literal_notation ( $string, $base ) >>
Modifies the formula's value using Notation 3 syntax, excluding the wrapping "{"..."}".
=item C<< equal ( $node ) >>
Returns true if the two nodes are equal, false otherwise.
TODO - really need a "not equal, but equivalent" method.
=back
=head1 BUGS
Please report any bugs to
L<http://rt.cpan.org/Dist/Display.html?Queue=RDF-TriN3>.
=head1 SEE ALSO
L<RDF::Trine::Node>,
L<RDF::Trine::Pattern>.
=head1 AUTHOR
Toby Inkster C<< <tobyink@cpan.org> >>
Based on RDF::Trine::Node::Literal by Gregory Todd Williams.
=head1 COPYRIGHT AND LICENCE
Copyright (c) 2006-2010 Gregory Todd Williams.
Copyright (c) 2010-2012 Toby Inkster.
This library is free software; you can redistribute it and/or modify it
under the same terms as Perl itself.
=head1 DISCLAIMER OF WARRANTIES
THIS PACKAGE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR IMPLIED
WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
=cut
|