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
|
use utf8;
use strict;
use warnings;
=head1 NAME
DR::Tarantool::Tuple - tuple container for L<DR::Tarantool>
=head1 SYNOPSIS
my $tuple = new DR::Tarantool::Tuple([ 1, 2, 3]);
my $tuple = new DR::Tarantool::Tuple([ 1, 2, 3], $space);
my $tuple = unpack DR::Tarantool::Tuple([ 1, 2, 3], $space);
$tuple->next( $other_tuple );
$f = $tuple->raw(0);
$f = $tuple->name_field;
=head1 DESCRIPTION
Tuple contains normalized (unpacked) fields. You can access the fields
by their indexes (see L<raw> function) or by their names (if they are
described in space).
Each tuple can contain references to L<next> tuple and L<iter>ator.
So If You extract more than one tuple, You can access them.
=head1 METHODS
=cut
package DR::Tarantool::Tuple;
use Scalar::Util 'weaken', 'blessed';
use Carp;
$Carp::Internal{ (__PACKAGE__) }++;
=head2 new
Constructor.
my $t = DR::Tarantool::Tuple->new([1, 2, 3]);
my $t = DR::Tarantool::Tuple->new([1, 2, 3], $space);
=cut
sub new :method {
my ($class, $tuple, $space) = @_;
if (defined $space) {
croak 'wrong space' unless blessed $space;
}
croak 'tuple must be ARRAYREF [of ARRAYREF]' unless 'ARRAY' eq ref $tuple;
croak "tuple can't be empty" unless @$tuple;
if ('ARRAY' eq ref $tuple->[0]) {
my $self = $class->new( $tuple->[0], $space );
for (my $i = 1; $i < @$tuple; $i++) {
$self->next( $tuple->[ $i ] );
}
return $self;
}
my $self = bless {
tuple => [ @$tuple ],
space => $space,
} => ref($class) || $class;
# weaken $self->{space} if defined $self->{space};
return $self;
}
=head2 unpack
Constructor.
my $t = DR::Tarantool::Tuple->unpack([1, 2, 3], $space);
=cut
sub unpack :method {
my ($class, $tuple, $space) = @_;
croak 'wrong space' unless blessed $space;
return undef unless defined $tuple;
croak 'tuple must be ARRAYREF [of ARRAYREF]' unless 'ARRAY' eq ref $tuple;
return undef unless @$tuple;
if ('ARRAY' eq ref $tuple->[0]) {
my @tu;
push @tu => $space->unpack_tuple($_) for @$tuple;
return $class->new(\@tu, $space);
}
return $class->new($space->unpack_tuple($tuple), $space);
}
=head2 raw
Returns raw data from tuple.
my $array = $tuple->raw;
my $field = $tuple->raw(0);
=cut
sub raw :method {
my ($self, $fno) = @_;
return $self->{tuple} unless @_ > 1;
croak 'wrong field_no: ' . ($fno // 'undef')
unless defined $fno and $fno =~ /^\d+$/;
return undef if $fno > $#{ $self->{tuple} };
return $self->{tuple}[ $fno ];
}
=head2 next
Appends or returns the following tuple.
my $next_tuple = $tuple->next;
=cut
sub next :method {
my ($self, $tuple) = @_;
return $self->{tail} if @_ == 1;
$tuple = $self->new($tuple, $self->{space});
my $o = $self;
$o = $o->{tail} while defined $o->{tail};
$o->{tail} = $tuple;
$tuple;
}
=head2 iter
Returns iterator linked with the tuple.
my $iterator = $tuple->iter;
my $iterator = $tuple->iter('MyTupleClass', 'new');
while(my $t = $iterator->next) {
# the first value of $t and $tuple are the same
...
}
=head3 Arguments
=over
=item package (optional)
=item method (optional, default: B<new>)
if 'package' and 'method' are present, $iterator->L<next> method will
construct objects using C<< $package->$method( $next_tuple ) >>
=back
=cut
sub iter :method {
my ($self, $class, $method) = @_;
return DR::Tarantool::Tuple::Iterator->new( $self, $class, $method );
}
=head2 AUTOLOAD
Each tuple autoloads fields by their names that defined in space.
my $name = $tuple->password; # space contains field with name 'password'
my $name = $tuple->login;
...
=cut
sub AUTOLOAD :method {
our $AUTOLOAD;
my ($foo) = $AUTOLOAD =~ /.*::(.*)$/;
return if $foo eq 'DESTROY';
my ($self) = @_;
croak "Can't find field '$foo' in the tuple" unless $self->{space};
return $self->raw( $self->{space}->_field( $foo )->{idx} );
}
sub DESTROY { }
package DR::Tarantool::Tuple::Iterator;
use Carp;
$Carp::Internal{ (__PACKAGE__) }++;
use Scalar::Util 'weaken', 'blessed';
=head1 tuple iterators
=head2 new
my $iter = DR::Tarantool::Tuple::Iterator->new( $tuple );
my $iter = $tuple->iter; # the same
=head3 Arguments
=over
=item tuple
=item package (optional)
=item method (optional, default: new)
if 'package' and 'method' are present, L<next> method will construct
objects using C<< $package->$method( $next_tuple ) >>
=back
=cut
sub new {
my ($class, $t, $iclass, $imethod) = @_;
if ($iclass) {
$imethod ||= 'new';
croak "Can't locate method '$imethod' via package '$iclass'"
unless $iclass->can($imethod);
}
return bless {
head => $t,
class => $iclass,
method => $imethod
} => ref($class) || $class;
}
=head2 count
Returns count of tuples in the iterator.
my $count = $iter->count;
=cut
sub count {
my ($self) = @_;
unless (exists $self->{count}) {
my $o = $self->{head};
$self->{count} = 0;
return $self->{count} unless $o;
$self->{count}++;
while($o->{tail}) {
$o = $o->{tail};
$self->{count}++;
}
}
$self->{count};
}
=head2 reset
Resets iterator (see L<next> method).
$iter->reset;
=cut
sub reset {
my ($self) = @_;
delete $self->{cur};
}
=head2 next
Returns next element from the iterator.
my $iter = $tuple->iter;
while(my $tuple = $iter->next) {
...
}
=cut
sub next :method {
my ($self) = @_;
if (defined $self->{cur}) {
$self->{cur} = $self->{cur}->next;
} else {
$self->{cur} = $self->{head}
}
return undef unless defined $self->{cur};
weaken $self->{cur};
if ($self->{class}) {
my ($c, $m) = ($self->{class}, $self->{method});
$m ||= 'new';
return $c->$m( $self->{cur} );
}
return $self->{cur};
}
=head1 COPYRIGHT AND LICENSE
Copyright (C) 2011 Dmitry E. Oboukhov <unera@debian.org>
Copyright (C) 2011 Roman V. Nikolaev <rshadow@rambler.ru>
This program is free software, you can redistribute it and/or
modify it under the terms of the Artistic License.
=head1 VCS
The project is placed git repo on github:
L<https://github.com/unera/dr-tarantool/>.
=cut
1;
|