1 package DBIx::Class::ResultSet;
5 use base qw/DBIx::Class/;
7 use DBIx::Class::Exception;
8 use DBIx::Class::ResultSetColumn;
9 use Scalar::Util qw/blessed weaken/;
11 use Data::Compare (); # no imports!!! guard against insane architecture
13 # not importing first() as it will clash with our own method
17 # De-duplication in _merge_attr() is disabled, but left in for reference
18 # (the merger is used for other things that ought not to be de-duped)
19 *__HM_DEDUP = sub () { 0 };
29 __PACKAGE__->mk_group_accessors('simple' => qw/_result_class result_source/);
33 DBIx::Class::ResultSet - Represents a query used for fetching a set of results.
37 my $users_rs = $schema->resultset('User');
38 while( $user = $users_rs->next) {
39 print $user->username;
42 my $registered_users_rs = $schema->resultset('User')->search({ registered => 1 });
43 my @cds_in_2005 = $schema->resultset('CD')->search({ year => 2005 })->all();
47 A ResultSet is an object which stores a set of conditions representing
48 a query. It is the backbone of DBIx::Class (i.e. the really
49 important/useful bit).
51 No SQL is executed on the database when a ResultSet is created, it
52 just stores all the conditions needed to create the query.
54 A basic ResultSet representing the data of an entire table is returned
55 by calling C<resultset> on a L<DBIx::Class::Schema> and passing in a
56 L<Source|DBIx::Class::Manual::Glossary/Source> name.
58 my $users_rs = $schema->resultset('User');
60 A new ResultSet is returned from calling L</search> on an existing
61 ResultSet. The new one will contain all the conditions of the
62 original, plus any new conditions added in the C<search> call.
64 A ResultSet also incorporates an implicit iterator. L</next> and L</reset>
65 can be used to walk through all the L<DBIx::Class::Row>s the ResultSet
68 The query that the ResultSet represents is B<only> executed against
69 the database when these methods are called:
70 L</find>, L</next>, L</all>, L</first>, L</single>, L</count>.
72 If a resultset is used in a numeric context it returns the L</count>.
73 However, if it is used in a boolean context it is B<always> true. So if
74 you want to check if a resultset has any results, you must use C<if $rs
77 =head1 CUSTOM ResultSet CLASSES THAT USE Moose
79 If you want to make your custom ResultSet classes with L<Moose>, use a template
82 package MyApp::Schema::ResultSet::User;
85 use namespace::autoclean;
87 extends 'DBIx::Class::ResultSet';
89 sub BUILDARGS { $_[2] }
93 __PACKAGE__->meta->make_immutable;
97 The L<MooseX::NonMoose> is necessary so that the L<Moose> constructor does not
98 clash with the regular ResultSet constructor. Alternatively, you can use:
100 __PACKAGE__->meta->make_immutable(inline_constructor => 0);
102 The L<BUILDARGS|Moose::Manual::Construction/BUILDARGS> is necessary because the
103 signature of the ResultSet C<new> is C<< ->new($source, \%args) >>.
107 =head2 Chaining resultsets
109 Let's say you've got a query that needs to be run to return some data
110 to the user. But, you have an authorization system in place that
111 prevents certain users from seeing certain information. So, you want
112 to construct the basic query in one method, but add constraints to it in
117 my $request = $self->get_request; # Get a request object somehow.
118 my $schema = $self->result_source->schema;
120 my $cd_rs = $schema->resultset('CD')->search({
121 title => $request->param('title'),
122 year => $request->param('year'),
125 $cd_rs = $self->apply_security_policy( $cd_rs );
127 return $cd_rs->all();
130 sub apply_security_policy {
139 =head3 Resolving conditions and attributes
141 When a resultset is chained from another resultset, conditions and
142 attributes with the same keys need resolving.
144 L</join>, L</prefetch>, L</+select>, L</+as> attributes are merged
145 into the existing ones from the original resultset.
147 The L</where> and L</having> attributes, and any search conditions, are
148 merged with an SQL C<AND> to the existing condition from the original
151 All other attributes are overridden by any new ones supplied in the
154 =head2 Multiple queries
156 Since a resultset just defines a query, you can do all sorts of
157 things with it with the same object.
159 # Don't hit the DB yet.
160 my $cd_rs = $schema->resultset('CD')->search({
161 title => 'something',
165 # Each of these hits the DB individually.
166 my $count = $cd_rs->count;
167 my $most_recent = $cd_rs->get_column('date_released')->max();
168 my @records = $cd_rs->all;
170 And it's not just limited to SELECT statements.
176 $cd_rs->create({ artist => 'Fred' });
178 Which is the same as:
180 $schema->resultset('CD')->create({
181 title => 'something',
186 See: L</search>, L</count>, L</get_column>, L</all>, L</create>.
194 =item Arguments: L<$source|DBIx::Class::ResultSource>, L<\%attrs?|/ATTRIBUTES>
196 =item Return Value: L<$resultset|/search>
200 The resultset constructor. Takes a source object (usually a
201 L<DBIx::Class::ResultSourceProxy::Table>) and an attribute hash (see
202 L</ATTRIBUTES> below). Does not perform any queries -- these are
203 executed as needed by the other methods.
205 Generally you never construct a resultset manually. Instead you get one
207 C<< $schema->L<resultset|DBIx::Class::Schema/resultset>('$source_name') >>
208 or C<< $another_resultset->L<search|/search>(...) >> (the later called in
211 my $rs = $schema->resultset('CD')->search({ title => '100th Window' });
217 If called on an object, proxies to L</new_result> instead, so
219 my $cd = $schema->resultset('CD')->new({ title => 'Spoon' });
221 will return a CD object, not a ResultSet, and is equivalent to:
223 my $cd = $schema->resultset('CD')->new_result({ title => 'Spoon' });
225 Please also keep in mind that many internals call L</new_result> directly,
226 so overloading this method with the idea of intercepting new result object
227 creation B<will not work>. See also warning pertaining to L</create>.
235 return $class->new_result(@_) if ref $class;
237 my ($source, $attrs) = @_;
238 $source = $source->resolve
239 if $source->isa('DBIx::Class::ResultSourceHandle');
240 $attrs = { %{$attrs||{}} };
242 if ($attrs->{page}) {
243 $attrs->{rows} ||= 10;
246 $attrs->{alias} ||= 'me';
249 result_source => $source,
250 cond => $attrs->{where},
255 # if there is a dark selector, this means we are already in a
256 # chain and the cleanup/sanification was taken care of by
258 $self->_normalize_selection($attrs)
259 unless $attrs->{_dark_selector};
262 $attrs->{result_class} || $source->result_class
272 =item Arguments: L<$cond|DBIx::Class::SQLMaker> | undef, L<\%attrs?|/ATTRIBUTES>
274 =item Return Value: $resultset (scalar context) | L<@result_objs|DBIx::Class::Manual::ResultClass> (list context)
278 my @cds = $cd_rs->search({ year => 2001 }); # "... WHERE year = 2001"
279 my $new_rs = $cd_rs->search({ year => 2005 });
281 my $new_rs = $cd_rs->search([ { year => 2005 }, { year => 2004 } ]);
282 # year = 2005 OR year = 2004
284 In list context, C<< ->all() >> is called implicitly on the resultset, thus
285 returning a list of L<result|DBIx::Class::Manual::ResultClass> objects instead.
286 To avoid that, use L</search_rs>.
288 If you need to pass in additional attributes but no additional condition,
289 call it as C<search(undef, \%attrs)>.
291 # "SELECT name, artistid FROM $artist_table"
292 my @all_artists = $schema->resultset('Artist')->search(undef, {
293 columns => [qw/name artistid/],
296 For a list of attributes that can be passed to C<search>, see
297 L</ATTRIBUTES>. For more examples of using this function, see
298 L<Searching|DBIx::Class::Manual::Cookbook/Searching>. For a complete
299 documentation for the first argument, see L<SQL::Abstract>
300 and its extension L<DBIx::Class::SQLMaker>.
302 For more help on using joins with search, see L<DBIx::Class::Manual::Joining>.
306 Note that L</search> does not process/deflate any of the values passed in the
307 L<SQL::Abstract>-compatible search condition structure. This is unlike other
308 condition-bound methods L</new_result>, L</create> and L</find>. The user must ensure
309 manually that any value passed to this method will stringify to something the
310 RDBMS knows how to deal with. A notable example is the handling of L<DateTime>
311 objects, for more info see:
312 L<DBIx::Class::Manual::Cookbook/Formatting DateTime objects in queries>.
318 my $rs = $self->search_rs( @_ );
323 elsif (defined wantarray) {
327 # we can be called by a relationship helper, which in
328 # turn may be called in void context due to some braindead
329 # overload or whatever else the user decided to be clever
330 # at this particular day. Thus limit the exception to
331 # external code calls only
332 $self->throw_exception ('->search is *not* a mutator, calling it in void context makes no sense')
333 if (caller)[0] !~ /^\QDBIx::Class::/;
343 =item Arguments: L<$cond|DBIx::Class::SQLMaker>, L<\%attrs?|/ATTRIBUTES>
345 =item Return Value: L<$resultset|/search>
349 This method does the same exact thing as search() except it will
350 always return a resultset, even in list context.
357 my $rsrc = $self->result_source;
358 my ($call_cond, $call_attrs);
360 # Special-case handling for (undef, undef) or (undef)
361 # Note that (foo => undef) is valid deprecated syntax
362 @_ = () if not scalar grep { defined $_ } @_;
368 # fish out attrs in the ($condref, $attr) case
369 elsif (@_ == 2 and ( ! defined $_[0] or (ref $_[0]) ne '') ) {
370 ($call_cond, $call_attrs) = @_;
373 $self->throw_exception('Odd number of arguments to search')
377 carp_unique 'search( %condition ) is deprecated, use search( \%condition ) instead'
378 unless $rsrc->result_class->isa('DBIx::Class::CDBICompat');
380 for my $i (0 .. $#_) {
382 $self->throw_exception ('All keys in condition key/value pairs must be plain scalars')
383 if (! defined $_[$i] or ref $_[$i] ne '');
389 # see if we can keep the cache (no $rs changes)
391 my %safe = (alias => 1, cache => 1);
392 if ( ! List::Util::first { !$safe{$_} } keys %$call_attrs and (
395 ref $_[0] eq 'HASH' && ! keys %{$_[0]}
397 ref $_[0] eq 'ARRAY' && ! @{$_[0]}
399 $cache = $self->get_cache;
402 my $old_attrs = { %{$self->{attrs}} };
403 my $old_having = delete $old_attrs->{having};
404 my $old_where = delete $old_attrs->{where};
406 my $new_attrs = { %$old_attrs };
408 # take care of call attrs (only if anything is changing)
409 if ($call_attrs and keys %$call_attrs) {
411 # copy for _normalize_selection
412 $call_attrs = { %$call_attrs };
414 my @selector_attrs = qw/select as columns cols +select +as +columns include_columns/;
416 # reset the current selector list if new selectors are supplied
417 if (List::Util::first { exists $call_attrs->{$_} } qw/columns cols select as/) {
418 delete @{$old_attrs}{(@selector_attrs, '_dark_selector')};
421 # Normalize the new selector list (operates on the passed-in attr structure)
422 # Need to do it on every chain instead of only once on _resolved_attrs, in
423 # order to allow detection of empty vs partial 'as'
424 $call_attrs->{_dark_selector} = $old_attrs->{_dark_selector}
425 if $old_attrs->{_dark_selector};
426 $self->_normalize_selection ($call_attrs);
428 # start with blind overwriting merge, exclude selector attrs
429 $new_attrs = { %{$old_attrs}, %{$call_attrs} };
430 delete @{$new_attrs}{@selector_attrs};
432 for (@selector_attrs) {
433 $new_attrs->{$_} = $self->_merge_attr($old_attrs->{$_}, $call_attrs->{$_})
434 if ( exists $old_attrs->{$_} or exists $call_attrs->{$_} );
437 # older deprecated name, use only if {columns} is not there
438 if (my $c = delete $new_attrs->{cols}) {
439 if ($new_attrs->{columns}) {
440 carp "Resultset specifies both the 'columns' and the legacy 'cols' attributes - ignoring 'cols'";
443 $new_attrs->{columns} = $c;
448 # join/prefetch use their own crazy merging heuristics
449 foreach my $key (qw/join prefetch/) {
450 $new_attrs->{$key} = $self->_merge_joinpref_attr($old_attrs->{$key}, $call_attrs->{$key})
451 if exists $call_attrs->{$key};
454 # stack binds together
455 $new_attrs->{bind} = [ @{ $old_attrs->{bind} || [] }, @{ $call_attrs->{bind} || [] } ];
459 for ($old_where, $call_cond) {
461 $new_attrs->{where} = $self->_stack_cond (
462 $_, $new_attrs->{where}
467 if (defined $old_having) {
468 $new_attrs->{having} = $self->_stack_cond (
469 $old_having, $new_attrs->{having}
473 my $rs = (ref $self)->new($rsrc, $new_attrs);
475 $rs->set_cache($cache) if ($cache);
481 sub _normalize_selection {
482 my ($self, $attrs) = @_;
485 $attrs->{'+columns'} = $self->_merge_attr($attrs->{'+columns'}, delete $attrs->{include_columns})
486 if exists $attrs->{include_columns};
488 # columns are always placed first, however
490 # Keep the X vs +X separation until _resolved_attrs time - this allows to
491 # delay the decision on whether to use a default select list ($rsrc->columns)
492 # allowing stuff like the remove_columns helper to work
494 # select/as +select/+as pairs need special handling - the amount of select/as
495 # elements in each pair does *not* have to be equal (think multicolumn
496 # selectors like distinct(foo, bar) ). If the selector is bare (no 'as'
497 # supplied at all) - try to infer the alias, either from the -as parameter
498 # of the selector spec, or use the parameter whole if it looks like a column
499 # name (ugly legacy heuristic). If all fails - leave the selector bare (which
500 # is ok as well), but make sure no more additions to the 'as' chain take place
501 for my $pref ('', '+') {
503 my ($sel, $as) = map {
504 my $key = "${pref}${_}";
506 my $val = [ ref $attrs->{$key} eq 'ARRAY'
508 : $attrs->{$key} || ()
510 delete $attrs->{$key};
514 if (! @$as and ! @$sel ) {
517 elsif (@$as and ! @$sel) {
518 $self->throw_exception(
519 "Unable to handle ${pref}as specification (@$as) without a corresponding ${pref}select"
523 # no as part supplied at all - try to deduce (unless explicit end of named selection is declared)
524 # if any @$as has been supplied we assume the user knows what (s)he is doing
525 # and blindly keep stacking up pieces
526 unless ($attrs->{_dark_selector}) {
529 if ( ref $_ eq 'HASH' and exists $_->{-as} ) {
530 push @$as, $_->{-as};
532 # assume any plain no-space, no-parenthesis string to be a column spec
533 # FIXME - this is retarded but is necessary to support shit like 'count(foo)'
534 elsif ( ! ref $_ and $_ =~ /^ [^\s\(\)]+ $/x) {
537 # if all else fails - raise a flag that no more aliasing will be allowed
539 $attrs->{_dark_selector} = {
541 string => ($dark_sel_dumper ||= do {
542 require Data::Dumper::Concise;
543 Data::Dumper::Concise::DumperObject()->Indent(0);
544 })->Values([$_])->Dump
552 elsif (@$as < @$sel) {
553 $self->throw_exception(
554 "Unable to handle an ${pref}as specification (@$as) with less elements than the corresponding ${pref}select"
557 elsif ($pref and $attrs->{_dark_selector}) {
558 $self->throw_exception(
559 "Unable to process named '+select', resultset contains an unnamed selector $attrs->{_dark_selector}{string}"
565 $attrs->{"${pref}select"} = $self->_merge_attr($attrs->{"${pref}select"}, $sel);
566 $attrs->{"${pref}as"} = $self->_merge_attr($attrs->{"${pref}as"}, $as);
571 my ($self, $left, $right) = @_;
573 # collapse single element top-level conditions
574 # (single pass only, unlikely to need recursion)
575 for ($left, $right) {
576 if (ref $_ eq 'ARRAY') {
584 elsif (ref $_ eq 'HASH') {
585 my ($first, $more) = keys %$_;
588 if (! defined $first) {
592 elsif (! defined $more) {
593 if ($first eq '-and' and ref $_->{'-and'} eq 'HASH') {
596 elsif ($first eq '-or' and ref $_->{'-or'} eq 'ARRAY') {
603 # merge hashes with weeding out of duplicates (simple cases only)
604 if (ref $left eq 'HASH' and ref $right eq 'HASH') {
606 # shallow copy to destroy
607 $right = { %$right };
608 for (grep { exists $right->{$_} } keys %$left) {
609 # the use of eq_deeply here is justified - the rhs of an
610 # expression can contain a lot of twisted weird stuff
611 delete $right->{$_} if Data::Compare::Compare( $left->{$_}, $right->{$_} );
614 $right = undef unless keys %$right;
618 if (defined $left xor defined $right) {
619 return defined $left ? $left : $right;
621 elsif (! defined $left) {
625 return { -and => [ $left, $right ] };
629 =head2 search_literal
631 B<CAVEAT>: C<search_literal> is provided for Class::DBI compatibility and
632 should only be used in that context. C<search_literal> is a convenience
633 method. It is equivalent to calling C<< $schema->search(\[]) >>, but if you
634 want to ensure columns are bound correctly, use L</search>.
636 See L<DBIx::Class::Manual::Cookbook/Searching> and
637 L<DBIx::Class::Manual::FAQ/Searching> for searching techniques that do not
638 require C<search_literal>.
642 =item Arguments: $sql_fragment, @standalone_bind_values
644 =item Return Value: L<$resultset|/search> (scalar context) | L<@result_objs|DBIx::Class::Manual::ResultClass> (list context)
648 my @cds = $cd_rs->search_literal('year = ? AND title = ?', qw/2001 Reload/);
649 my $newrs = $artist_rs->search_literal('name = ?', 'Metallica');
651 Pass a literal chunk of SQL to be added to the conditional part of the
654 Example of how to use C<search> instead of C<search_literal>
656 my @cds = $cd_rs->search_literal('cdid = ? AND (artist = ? OR artist = ?)', (2, 1, 2));
657 my @cds = $cd_rs->search(\[ 'cdid = ? AND (artist = ? OR artist = ?)', [ 'cdid', 2 ], [ 'artist', 1 ], [ 'artist', 2 ] ]);
662 my ($self, $sql, @bind) = @_;
664 if ( @bind && ref($bind[-1]) eq 'HASH' ) {
667 return $self->search(\[ $sql, map [ {} => $_ ], @bind ], ($attr || () ));
674 =item Arguments: \%columns_values | @pk_values, { key => $unique_constraint, L<%attrs|/ATTRIBUTES> }?
676 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass> | undef
680 Finds and returns a single row based on supplied criteria. Takes either a
681 hashref with the same format as L</create> (including inference of foreign
682 keys from related objects), or a list of primary key values in the same
683 order as the L<primary columns|DBIx::Class::ResultSource/primary_columns>
684 declaration on the L</result_source>.
686 In either case an attempt is made to combine conditions already existing on
687 the resultset with the condition passed to this method.
689 To aid with preparing the correct query for the storage you may supply the
690 C<key> attribute, which is the name of a
691 L<unique constraint|DBIx::Class::ResultSource/add_unique_constraint> (the
692 unique constraint corresponding to the
693 L<primary columns|DBIx::Class::ResultSource/primary_columns> is always named
694 C<primary>). If the C<key> attribute has been supplied, and DBIC is unable
695 to construct a query that satisfies the named unique constraint fully (
696 non-NULL values for each column member of the constraint) an exception is
699 If no C<key> is specified, the search is carried over all unique constraints
700 which are fully defined by the available condition.
702 If no such constraint is found, C<find> currently defaults to a simple
703 C<< search->(\%column_values) >> which may or may not do what you expect.
704 Note that this fallback behavior may be deprecated in further versions. If
705 you need to search with arbitrary conditions - use L</search>. If the query
706 resulting from this fallback produces more than one row, a warning to the
707 effect is issued, though only the first row is constructed and returned as
710 In addition to C<key>, L</find> recognizes and applies standard
711 L<resultset attributes|/ATTRIBUTES> in the same way as L</search> does.
713 Note that if you have extra concerns about the correctness of the resulting
714 query you need to specify the C<key> attribute and supply the entire condition
715 as an argument to find (since it is not always possible to perform the
716 combination of the resultset condition with the supplied one, especially if
717 the resultset condition contains literal sql).
719 For example, to find a row by its primary key:
721 my $cd = $schema->resultset('CD')->find(5);
723 You can also find a row by a specific unique constraint:
725 my $cd = $schema->resultset('CD')->find(
727 artist => 'Massive Attack',
728 title => 'Mezzanine',
730 { key => 'cd_artist_title' }
733 See also L</find_or_create> and L</update_or_create>.
739 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
741 my $rsrc = $self->result_source;
744 if (exists $attrs->{key}) {
745 $constraint_name = defined $attrs->{key}
747 : $self->throw_exception("An undefined 'key' resultset attribute makes no sense")
751 # Parse out the condition from input
754 if (ref $_[0] eq 'HASH') {
755 $call_cond = { %{$_[0]} };
758 # if only values are supplied we need to default to 'primary'
759 $constraint_name = 'primary' unless defined $constraint_name;
761 my @c_cols = $rsrc->unique_constraint_columns($constraint_name);
763 $self->throw_exception(
764 "No constraint columns, maybe a malformed '$constraint_name' constraint?"
767 $self->throw_exception (
768 'find() expects either a column/value hashref, or a list of values '
769 . "corresponding to the columns of the specified unique constraint '$constraint_name'"
770 ) unless @c_cols == @_;
773 @{$call_cond}{@c_cols} = @_;
777 for my $key (keys %$call_cond) {
779 my $keyref = ref($call_cond->{$key})
781 my $relinfo = $rsrc->relationship_info($key)
783 my $val = delete $call_cond->{$key};
785 next if $keyref eq 'ARRAY'; # has_many for multi_create
787 my $rel_q = $rsrc->_resolve_condition(
788 $relinfo->{cond}, $val, $key, $key
790 die "Can't handle complex relationship conditions in find" if ref($rel_q) ne 'HASH';
791 @related{keys %$rel_q} = values %$rel_q;
795 # relationship conditions take precedence (?)
796 @{$call_cond}{keys %related} = values %related;
798 my $alias = exists $attrs->{alias} ? $attrs->{alias} : $self->{attrs}{alias};
800 if (defined $constraint_name) {
801 $final_cond = $self->_qualify_cond_columns (
803 $self->_build_unique_cond (
811 elsif ($self->{attrs}{accessor} and $self->{attrs}{accessor} eq 'single') {
812 # This means that we got here after a merger of relationship conditions
813 # in ::Relationship::Base::search_related (the row method), and furthermore
814 # the relationship is of the 'single' type. This means that the condition
815 # provided by the relationship (already attached to $self) is sufficient,
816 # as there can be only one row in the database that would satisfy the
820 # no key was specified - fall down to heuristics mode:
821 # run through all unique queries registered on the resultset, and
822 # 'OR' all qualifying queries together
823 my (@unique_queries, %seen_column_combinations);
824 for my $c_name ($rsrc->unique_constraint_names) {
825 next if $seen_column_combinations{
826 join "\x00", sort $rsrc->unique_constraint_columns($c_name)
829 push @unique_queries, try {
830 $self->_build_unique_cond ($c_name, $call_cond, 'croak_on_nulls')
834 $final_cond = @unique_queries
835 ? [ map { $self->_qualify_cond_columns($_, $alias) } @unique_queries ]
836 : $self->_non_unique_find_fallback ($call_cond, $attrs)
840 # Run the query, passing the result_class since it should propagate for find
841 my $rs = $self->search ($final_cond, {result_class => $self->result_class, %$attrs});
842 if (keys %{$rs->_resolved_attrs->{collapse}}) {
844 carp "Query returned more than one row" if $rs->next;
852 # This is a stop-gap method as agreed during the discussion on find() cleanup:
853 # http://lists.scsys.co.uk/pipermail/dbix-class/2010-October/009535.html
855 # It is invoked when find() is called in legacy-mode with insufficiently-unique
856 # condition. It is provided for overrides until a saner way forward is devised
858 # *NOTE* This is not a public method, and it's *GUARANTEED* to disappear down
859 # the road. Please adjust your tests accordingly to catch this situation early
860 # DBIx::Class::ResultSet->can('_non_unique_find_fallback') is reasonable
862 # The method will not be removed without an adequately complete replacement
863 # for strict-mode enforcement
864 sub _non_unique_find_fallback {
865 my ($self, $cond, $attrs) = @_;
867 return $self->_qualify_cond_columns(
869 exists $attrs->{alias}
871 : $self->{attrs}{alias}
876 sub _qualify_cond_columns {
877 my ($self, $cond, $alias) = @_;
879 my %aliased = %$cond;
880 for (keys %aliased) {
881 $aliased{"$alias.$_"} = delete $aliased{$_}
888 sub _build_unique_cond {
889 my ($self, $constraint_name, $extra_cond, $croak_on_null) = @_;
891 my @c_cols = $self->result_source->unique_constraint_columns($constraint_name);
893 # combination may fail if $self->{cond} is non-trivial
894 my ($final_cond) = try {
895 $self->_merge_with_rscond ($extra_cond)
900 # trim out everything not in $columns
901 $final_cond = { map {
902 exists $final_cond->{$_}
903 ? ( $_ => $final_cond->{$_} )
907 if (my @missing = grep
908 { ! ($croak_on_null ? defined $final_cond->{$_} : exists $final_cond->{$_}) }
911 $self->throw_exception( sprintf ( "Unable to satisfy requested constraint '%s', no values for column(s): %s",
913 join (', ', map { "'$_'" } @missing),
920 !$ENV{DBIC_NULLABLE_KEY_NOWARN}
922 my @undefs = sort grep { ! defined $final_cond->{$_} } (keys %$final_cond)
924 carp_unique ( sprintf (
925 "NULL/undef values supplied for requested unique constraint '%s' (NULL "
926 . 'values in column(s): %s). This is almost certainly not what you wanted, '
927 . 'though you can set DBIC_NULLABLE_KEY_NOWARN to disable this warning.',
929 join (', ', map { "'$_'" } @undefs),
936 =head2 search_related
940 =item Arguments: $rel_name, $cond?, L<\%attrs?|/ATTRIBUTES>
942 =item Return Value: L<$resultset|/search> (scalar context) | L<@result_objs|DBIx::Class::Manual::ResultClass> (list context)
946 $new_rs = $cd_rs->search_related('artist', {
950 Searches the specified relationship, optionally specifying a condition and
951 attributes for matching records. See L</ATTRIBUTES> for more information.
953 In list context, C<< ->all() >> is called implicitly on the resultset, thus
954 returning a list of result objects instead. To avoid that, use L</search_related_rs>.
956 See also L</search_related_rs>.
961 return shift->related_resultset(shift)->search(@_);
964 =head2 search_related_rs
966 This method works exactly the same as search_related, except that
967 it guarantees a resultset, even in list context.
971 sub search_related_rs {
972 return shift->related_resultset(shift)->search_rs(@_);
979 =item Arguments: none
981 =item Return Value: L<$cursor|DBIx::Class::Cursor>
985 Returns a storage-driven cursor to the given resultset. See
986 L<DBIx::Class::Cursor> for more information.
993 my $attrs = $self->_resolved_attrs_copy;
995 return $self->{cursor}
996 ||= $self->result_source->storage->select($attrs->{from}, $attrs->{select},
997 $attrs->{where},$attrs);
1004 =item Arguments: L<$cond?|DBIx::Class::SQLMaker>
1006 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass> | undef
1010 my $cd = $schema->resultset('CD')->single({ year => 2001 });
1012 Inflates the first result without creating a cursor if the resultset has
1013 any records in it; if not returns C<undef>. Used by L</find> as a lean version
1016 While this method can take an optional search condition (just like L</search>)
1017 being a fast-code-path it does not recognize search attributes. If you need to
1018 add extra joins or similar, call L</search> and then chain-call L</single> on the
1019 L<DBIx::Class::ResultSet> returned.
1025 As of 0.08100, this method enforces the assumption that the preceding
1026 query returns only one row. If more than one row is returned, you will receive
1029 Query returned more than one row
1031 In this case, you should be using L</next> or L</find> instead, or if you really
1032 know what you are doing, use the L</rows> attribute to explicitly limit the size
1035 This method will also throw an exception if it is called on a resultset prefetching
1036 has_many, as such a prefetch implies fetching multiple rows from the database in
1037 order to assemble the resulting object.
1044 my ($self, $where) = @_;
1046 $self->throw_exception('single() only takes search conditions, no attributes. You want ->search( $cond, $attrs )->single()');
1049 my $attrs = $self->_resolved_attrs_copy;
1051 if (keys %{$attrs->{collapse}}) {
1052 $self->throw_exception(
1053 'single() can not be used on resultsets prefetching has_many. Use find( \%cond ) or next() instead'
1058 if (defined $attrs->{where}) {
1061 [ map { ref $_ eq 'ARRAY' ? [ -or => $_ ] : $_ }
1062 $where, delete $attrs->{where} ]
1065 $attrs->{where} = $where;
1069 my @data = $self->result_source->storage->select_single(
1070 $attrs->{from}, $attrs->{select},
1071 $attrs->{where}, $attrs
1074 return (@data ? ($self->_construct_object(@data))[0] : undef);
1080 # Recursively collapse the query, accumulating values for each column.
1082 sub _collapse_query {
1083 my ($self, $query, $collapsed) = @_;
1087 if (ref $query eq 'ARRAY') {
1088 foreach my $subquery (@$query) {
1089 next unless ref $subquery; # -or
1090 $collapsed = $self->_collapse_query($subquery, $collapsed);
1093 elsif (ref $query eq 'HASH') {
1094 if (keys %$query and (keys %$query)[0] eq '-and') {
1095 foreach my $subquery (@{$query->{-and}}) {
1096 $collapsed = $self->_collapse_query($subquery, $collapsed);
1100 foreach my $col (keys %$query) {
1101 my $value = $query->{$col};
1102 $collapsed->{$col}{$value}++;
1114 =item Arguments: L<$cond?|DBIx::Class::SQLMaker>
1116 =item Return Value: L<$resultsetcolumn|DBIx::Class::ResultSetColumn>
1120 my $max_length = $rs->get_column('length')->max;
1122 Returns a L<DBIx::Class::ResultSetColumn> instance for a column of the ResultSet.
1127 my ($self, $column) = @_;
1128 my $new = DBIx::Class::ResultSetColumn->new($self, $column);
1136 =item Arguments: L<$cond|DBIx::Class::SQLMaker>, L<\%attrs?|/ATTRIBUTES>
1138 =item Return Value: L<$resultset|/search> (scalar context) | L<@result_objs|DBIx::Class::Manual::ResultClass> (list context)
1142 # WHERE title LIKE '%blue%'
1143 $cd_rs = $rs->search_like({ title => '%blue%'});
1145 Performs a search, but uses C<LIKE> instead of C<=> as the condition. Note
1146 that this is simply a convenience method retained for ex Class::DBI users.
1147 You most likely want to use L</search> with specific operators.
1149 For more information, see L<DBIx::Class::Manual::Cookbook>.
1151 This method is deprecated and will be removed in 0.09. Use L</search()>
1152 instead. An example conversion is:
1154 ->search_like({ foo => 'bar' });
1158 ->search({ foo => { like => 'bar' } });
1165 'search_like() is deprecated and will be removed in DBIC version 0.09.'
1166 .' Instead use ->search({ x => { -like => "y%" } })'
1167 .' (note the outer pair of {}s - they are important!)'
1169 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
1170 my $query = ref $_[0] eq 'HASH' ? { %{shift()} }: {@_};
1171 $query->{$_} = { 'like' => $query->{$_} } for keys %$query;
1172 return $class->search($query, { %$attrs });
1179 =item Arguments: $first, $last
1181 =item Return Value: L<$resultset|/search> (scalar context) | L<@result_objs|DBIx::Class::Manual::ResultClass> (list context)
1185 Returns a resultset or object list representing a subset of elements from the
1186 resultset slice is called on. Indexes are from 0, i.e., to get the first
1187 three records, call:
1189 my ($one, $two, $three) = $rs->slice(0, 2);
1194 my ($self, $min, $max) = @_;
1195 my $attrs = {}; # = { %{ $self->{attrs} || {} } };
1196 $attrs->{offset} = $self->{attrs}{offset} || 0;
1197 $attrs->{offset} += $min;
1198 $attrs->{rows} = ($max ? ($max - $min + 1) : 1);
1199 return $self->search(undef, $attrs);
1200 #my $slice = (ref $self)->new($self->result_source, $attrs);
1201 #return (wantarray ? $slice->all : $slice);
1208 =item Arguments: none
1210 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass> | undef
1214 Returns the next element in the resultset (C<undef> is there is none).
1216 Can be used to efficiently iterate over records in the resultset:
1218 my $rs = $schema->resultset('CD')->search;
1219 while (my $cd = $rs->next) {
1223 Note that you need to store the resultset object, and call C<next> on it.
1224 Calling C<< resultset('Table')->next >> repeatedly will always return the
1225 first record from the resultset.
1231 if (my $cache = $self->get_cache) {
1232 $self->{all_cache_position} ||= 0;
1233 return $cache->[$self->{all_cache_position}++];
1235 if ($self->{attrs}{cache}) {
1236 delete $self->{pager};
1237 $self->{all_cache_position} = 1;
1238 return ($self->all)[0];
1240 if ($self->{stashed_objects}) {
1241 my $obj = shift(@{$self->{stashed_objects}});
1242 delete $self->{stashed_objects} unless @{$self->{stashed_objects}};
1246 exists $self->{stashed_row}
1247 ? @{delete $self->{stashed_row}}
1248 : $self->cursor->next
1250 return undef unless (@row);
1251 my ($row, @more) = $self->_construct_object(@row);
1252 $self->{stashed_objects} = \@more if @more;
1256 sub _construct_object {
1257 my ($self, @row) = @_;
1259 my $info = $self->_collapse_result($self->{_attrs}{as}, \@row)
1261 my @new = $self->result_class->inflate_result($self->result_source, @$info);
1262 @new = $self->{_attrs}{record_filter}->(@new)
1263 if exists $self->{_attrs}{record_filter};
1267 sub _collapse_result {
1268 my ($self, $as_proto, $row) = @_;
1272 # 'foo' => [ undef, 'foo' ]
1273 # 'foo.bar' => [ 'foo', 'bar' ]
1274 # 'foo.bar.baz' => [ 'foo.bar', 'baz' ]
1276 my @construct_as = map { [ (/^(?:(.*)\.)?([^.]+)$/) ] } @$as_proto;
1278 my %collapse = %{$self->{_attrs}{collapse}||{}};
1282 # if we're doing collapsing (has_many prefetch) we need to grab records
1283 # until the PK changes, so fill @pri_index. if not, we leave it empty so
1284 # we know we don't have to bother.
1286 # the reason for not using the collapse stuff directly is because if you
1287 # had for e.g. two artists in a row with no cds, the collapse info for
1288 # both would be NULL (undef) so you'd lose the second artist
1290 # store just the index so we can check the array positions from the row
1291 # without having to contruct the full hash
1293 if (keys %collapse) {
1294 my %pri = map { ($_ => 1) } $self->result_source->_pri_cols;
1295 foreach my $i (0 .. $#construct_as) {
1296 next if defined($construct_as[$i][0]); # only self table
1297 if (delete $pri{$construct_as[$i][1]}) {
1298 push(@pri_index, $i);
1300 last unless keys %pri; # short circuit (Johnny Five Is Alive!)
1304 # no need to do an if, it'll be empty if @pri_index is empty anyway
1306 my %pri_vals = map { ($_ => $copy[$_]) } @pri_index;
1310 do { # no need to check anything at the front, we always want the first row
1314 foreach my $this_as (@construct_as) {
1315 $const{$this_as->[0]||''}{$this_as->[1]} = shift(@copy);
1318 push(@const_rows, \%const);
1320 } until ( # no pri_index => no collapse => drop straight out
1323 do { # get another row, stash it, drop out if different PK
1325 @copy = $self->cursor->next;
1326 $self->{stashed_row} = \@copy;
1328 # last thing in do block, counts as true if anything doesn't match
1330 # check xor defined first for NULL vs. NOT NULL then if one is
1331 # defined the other must be so check string equality
1334 (defined $pri_vals{$_} ^ defined $copy[$_])
1335 || (defined $pri_vals{$_} && ($pri_vals{$_} ne $copy[$_]))
1340 my $alias = $self->{attrs}{alias};
1347 foreach my $const (@const_rows) {
1348 scalar @const_keys or do {
1349 @const_keys = sort { length($a) <=> length($b) } keys %$const;
1351 foreach my $key (@const_keys) {
1354 my @parts = split(/\./, $key);
1356 my $data = $const->{$key};
1357 foreach my $p (@parts) {
1358 $target = $target->[1]->{$p} ||= [];
1360 if ($cur eq ".${key}" && (my @ckey = @{$collapse{$cur}||[]})) {
1361 # collapsing at this point and on final part
1362 my $pos = $collapse_pos{$cur};
1363 CK: foreach my $ck (@ckey) {
1364 if (!defined $pos->{$ck} || $pos->{$ck} ne $data->{$ck}) {
1365 $collapse_pos{$cur} = $data;
1366 delete @collapse_pos{ # clear all positioning for sub-entries
1367 grep { m/^\Q${cur}.\E/ } keys %collapse_pos
1374 if (exists $collapse{$cur}) {
1375 $target = $target->[-1];
1378 $target->[0] = $data;
1380 $info->[0] = $const->{$key};
1388 =head2 result_source
1392 =item Arguments: L<$result_source?|DBIx::Class::ResultSource>
1394 =item Return Value: L<$result_source|DBIx::Class::ResultSource>
1398 An accessor for the primary ResultSource object from which this ResultSet
1405 =item Arguments: $result_class?
1407 =item Return Value: $result_class
1411 An accessor for the class to use when creating result objects. Defaults to
1412 C<< result_source->result_class >> - which in most cases is the name of the
1413 L<"table"|DBIx::Class::Manual::Glossary/"ResultSource"> class.
1415 Note that changing the result_class will also remove any components
1416 that were originally loaded in the source class via
1417 L<DBIx::Class::ResultSource/load_components>. Any overloaded methods
1418 in the original source class will not run.
1423 my ($self, $result_class) = @_;
1424 if ($result_class) {
1425 unless (ref $result_class) { # don't fire this for an object
1426 $self->ensure_class_loaded($result_class);
1428 $self->_result_class($result_class);
1429 # THIS LINE WOULD BE A BUG - this accessor specifically exists to
1430 # permit the user to set result class on one result set only; it only
1431 # chains if provided to search()
1432 #$self->{attrs}{result_class} = $result_class if ref $self;
1434 $self->_result_class;
1441 =item Arguments: L<$cond|DBIx::Class::SQLMaker>, L<\%attrs?|/ATTRIBUTES>
1443 =item Return Value: $count
1447 Performs an SQL C<COUNT> with the same query as the resultset was built
1448 with to find the number of elements. Passing arguments is equivalent to
1449 C<< $rs->search ($cond, \%attrs)->count >>
1455 return $self->search(@_)->count if @_ and defined $_[0];
1456 return scalar @{ $self->get_cache } if $self->get_cache;
1458 my $attrs = $self->_resolved_attrs_copy;
1460 # this is a little optimization - it is faster to do the limit
1461 # adjustments in software, instead of a subquery
1462 my $rows = delete $attrs->{rows};
1463 my $offset = delete $attrs->{offset};
1466 if ($self->_has_resolved_attr (qw/collapse group_by/)) {
1467 $crs = $self->_count_subq_rs ($attrs);
1470 $crs = $self->_count_rs ($attrs);
1472 my $count = $crs->next;
1474 $count -= $offset if $offset;
1475 $count = $rows if $rows and $rows < $count;
1476 $count = 0 if ($count < 0);
1485 =item Arguments: L<$cond|DBIx::Class::SQLMaker>, L<\%attrs?|/ATTRIBUTES>
1487 =item Return Value: L<$count_rs|DBIx::Class::ResultSetColumn>
1491 Same as L</count> but returns a L<DBIx::Class::ResultSetColumn> object.
1492 This can be very handy for subqueries:
1494 ->search( { amount => $some_rs->count_rs->as_query } )
1496 As with regular resultsets the SQL query will be executed only after
1497 the resultset is accessed via L</next> or L</all>. That would return
1498 the same single value obtainable via L</count>.
1504 return $self->search(@_)->count_rs if @_;
1506 # this may look like a lack of abstraction (count() does about the same)
1507 # but in fact an _rs *must* use a subquery for the limits, as the
1508 # software based limiting can not be ported if this $rs is to be used
1509 # in a subquery itself (i.e. ->as_query)
1510 if ($self->_has_resolved_attr (qw/collapse group_by offset rows/)) {
1511 return $self->_count_subq_rs;
1514 return $self->_count_rs;
1519 # returns a ResultSetColumn object tied to the count query
1522 my ($self, $attrs) = @_;
1524 my $rsrc = $self->result_source;
1525 $attrs ||= $self->_resolved_attrs;
1527 my $tmp_attrs = { %$attrs };
1528 # take off any limits, record_filter is cdbi, and no point of ordering nor locking a count
1529 delete @{$tmp_attrs}{qw/rows offset order_by record_filter for/};
1531 # overwrite the selector (supplied by the storage)
1532 $tmp_attrs->{select} = $rsrc->storage->_count_select ($rsrc, $attrs);
1533 $tmp_attrs->{as} = 'count';
1534 delete @{$tmp_attrs}{qw/columns/};
1536 my $tmp_rs = $rsrc->resultset_class->new($rsrc, $tmp_attrs)->get_column ('count');
1542 # same as above but uses a subquery
1544 sub _count_subq_rs {
1545 my ($self, $attrs) = @_;
1547 my $rsrc = $self->result_source;
1548 $attrs ||= $self->_resolved_attrs;
1550 my $sub_attrs = { %$attrs };
1551 # extra selectors do not go in the subquery and there is no point of ordering it, nor locking it
1552 delete @{$sub_attrs}{qw/collapse columns as select _prefetch_selector_range order_by for/};
1554 # if we multi-prefetch we group_by something unique, as this is what we would
1555 # get out of the rs via ->next/->all. We *DO WANT* to clobber old group_by regardless
1556 if ( keys %{$attrs->{collapse}} ) {
1557 $sub_attrs->{group_by} = [ map { "$attrs->{alias}.$_" } @{
1558 $rsrc->_identifying_column_set || $self->throw_exception(
1559 'Unable to construct a unique group_by criteria properly collapsing the '
1560 . 'has_many prefetch before count()'
1565 # Calculate subquery selector
1566 if (my $g = $sub_attrs->{group_by}) {
1568 my $sql_maker = $rsrc->storage->sql_maker;
1570 # necessary as the group_by may refer to aliased functions
1572 for my $sel (@{$attrs->{select}}) {
1573 $sel_index->{$sel->{-as}} = $sel
1574 if (ref $sel eq 'HASH' and $sel->{-as});
1577 # anything from the original select mentioned on the group-by needs to make it to the inner selector
1578 # also look for named aggregates referred in the having clause
1579 # having often contains scalarrefs - thus parse it out entirely
1581 if ($attrs->{having}) {
1582 local $sql_maker->{having_bind};
1583 local $sql_maker->{quote_char} = $sql_maker->{quote_char};
1584 local $sql_maker->{name_sep} = $sql_maker->{name_sep};
1585 unless (defined $sql_maker->{quote_char} and length $sql_maker->{quote_char}) {
1586 $sql_maker->{quote_char} = [ "\x00", "\xFF" ];
1587 # if we don't unset it we screw up retarded but unfortunately working
1588 # 'MAX(foo.bar)' => { '>', 3 }
1589 $sql_maker->{name_sep} = '';
1592 my ($lquote, $rquote, $sep) = map { quotemeta $_ } ($sql_maker->_quote_chars, $sql_maker->name_sep);
1594 my $sql = $sql_maker->_parse_rs_attrs ({ having => $attrs->{having} });
1596 # search for both a proper quoted qualified string, for a naive unquoted scalarref
1597 # and if all fails for an utterly naive quoted scalar-with-function
1599 $rquote $sep $lquote (.+?) $rquote
1601 [\s,] \w+ \. (\w+) [\s,]
1603 [\s,] $lquote (.+?) $rquote [\s,]
1605 push @parts, ($1 || $2 || $3); # one of them matched if we got here
1610 my $colpiece = $sel_index->{$_} || $_;
1612 # unqualify join-based group_by's. Arcane but possible query
1613 # also horrible horrible hack to alias a column (not a func.)
1614 # (probably need to introduce SQLA syntax)
1615 if ($colpiece =~ /\./ && $colpiece !~ /^$attrs->{alias}\./) {
1618 $colpiece = \ sprintf ('%s AS %s', map { $sql_maker->_quote ($_) } ($colpiece, $as) );
1620 push @{$sub_attrs->{select}}, $colpiece;
1624 my @pcols = map { "$attrs->{alias}.$_" } ($rsrc->primary_columns);
1625 $sub_attrs->{select} = @pcols ? \@pcols : [ 1 ];
1628 return $rsrc->resultset_class
1629 ->new ($rsrc, $sub_attrs)
1631 ->search ({}, { columns => { count => $rsrc->storage->_count_select ($rsrc, $attrs) } })
1632 ->get_column ('count');
1639 =head2 count_literal
1641 B<CAVEAT>: C<count_literal> is provided for Class::DBI compatibility and
1642 should only be used in that context. See L</search_literal> for further info.
1646 =item Arguments: $sql_fragment, @standalone_bind_values
1648 =item Return Value: $count
1652 Counts the results in a literal query. Equivalent to calling L</search_literal>
1653 with the passed arguments, then L</count>.
1657 sub count_literal { shift->search_literal(@_)->count; }
1663 =item Arguments: none
1665 =item Return Value: L<@result_objs|DBIx::Class::Manual::ResultClass>
1669 Returns all elements in the resultset.
1676 $self->throw_exception("all() doesn't take any arguments, you probably wanted ->search(...)->all()");
1679 return @{ $self->get_cache } if $self->get_cache;
1683 if (keys %{$self->_resolved_attrs->{collapse}}) {
1684 # Using $self->cursor->all is really just an optimisation.
1685 # If we're collapsing has_many prefetches it probably makes
1686 # very little difference, and this is cleaner than hacking
1687 # _construct_object to survive the approach
1688 $self->cursor->reset;
1689 my @row = $self->cursor->next;
1691 push(@obj, $self->_construct_object(@row));
1692 @row = (exists $self->{stashed_row}
1693 ? @{delete $self->{stashed_row}}
1694 : $self->cursor->next);
1697 @obj = map { $self->_construct_object(@$_) } $self->cursor->all;
1700 $self->set_cache(\@obj) if $self->{attrs}{cache};
1709 =item Arguments: none
1711 =item Return Value: $self
1715 Resets the resultset's cursor, so you can iterate through the elements again.
1716 Implicitly resets the storage cursor, so a subsequent L</next> will trigger
1723 $self->{all_cache_position} = 0;
1724 $self->cursor->reset;
1732 =item Arguments: none
1734 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass> | undef
1738 L<Resets|/reset> the resultset (causing a fresh query to storage) and returns
1739 an object for the first result (or C<undef> if the resultset is empty).
1744 return $_[0]->reset->next;
1750 # Determines whether and what type of subquery is required for the $rs operation.
1751 # If grouping is necessary either supplies its own, or verifies the current one
1752 # After all is done delegates to the proper storage method.
1754 sub _rs_update_delete {
1755 my ($self, $op, $values) = @_;
1757 my $cond = $self->{cond};
1758 my $rsrc = $self->result_source;
1759 my $storage = $rsrc->schema->storage;
1761 my $attrs = { %{$self->_resolved_attrs} };
1763 my $existing_group_by = delete $attrs->{group_by};
1764 my $needs_subq = defined $existing_group_by;
1766 # simplify the joinmap and maybe decide if a subquery is necessary
1767 my $relation_classifications = {};
1769 if (ref($attrs->{from}) eq 'ARRAY') {
1770 # if we already know we need a subq, no point of classifying relations
1771 if (!$needs_subq and @{$attrs->{from}} > 1) {
1772 $attrs->{from} = $storage->_prune_unused_joins ($attrs->{from}, $attrs->{select}, $cond, $attrs);
1774 $relation_classifications = $storage->_resolve_aliastypes_from_select_args (
1775 [ @{$attrs->{from}}[1 .. $#{$attrs->{from}}] ],
1783 $needs_subq ||= 1; # if {from} is unparseable assume the worst
1786 # do we need anything like a subquery?
1790 ! keys %{ $relation_classifications->{restricting} || {} }
1792 ! $self->_has_resolved_attr(qw/rows offset/) # limits call for a subq
1794 # Most databases do not allow aliasing of tables in UPDATE/DELETE. Thus
1795 # a condition containing 'me' or other table prefixes will not work
1796 # at all. Tell SQLMaker to dequalify idents via a gross hack.
1798 my $sqla = $rsrc->storage->sql_maker;
1799 local $sqla->{_dequalify_idents} = 1;
1800 \[ $sqla->_recurse_where($self->{cond}) ];
1802 return $rsrc->storage->$op(
1804 $op eq 'update' ? $values : (),
1809 # we got this far - means it is time to wrap a subquery
1810 my $idcols = $rsrc->_identifying_column_set || $self->throw_exception(
1812 "Unable to perform complex resultset %s() without an identifying set of columns on source '%s'",
1818 # make a new $rs selecting only the PKs (that's all we really need for the subq)
1819 delete $attrs->{$_} for qw/collapse _collapse_order_by select _prefetch_selector_range as/;
1820 $attrs->{columns} = [ map { "$attrs->{alias}.$_" } @$idcols ];
1821 $attrs->{group_by} = \ ''; # FIXME - this is an evil hack, it causes the optimiser to kick in and throw away the LEFT joins
1822 my $subrs = (ref $self)->new($rsrc, $attrs);
1824 if (@$idcols == 1) {
1825 return $storage->$op (
1827 $op eq 'update' ? $values : (),
1828 { $idcols->[0] => { -in => $subrs->as_query } },
1831 elsif ($storage->_use_multicolumn_in) {
1832 # This is hideously ugly, but SQLA does not understand multicol IN expressions
1833 my $sql_maker = $storage->sql_maker;
1834 my ($sql, @bind) = @${$subrs->as_query};
1835 $sql = sprintf ('(%s) IN %s', # the as_query already comes with a set of parenthesis
1836 join (', ', map { $sql_maker->_quote ($_) } @$idcols),
1840 return $storage->$op (
1842 $op eq 'update' ? $values : (),
1848 # if all else fails - get all primary keys and operate over a ORed set
1849 # wrap in a transaction for consistency
1850 # this is where the group_by starts to matter
1854 keys %{ $relation_classifications->{multiplying} || {} }
1856 # make sure if there is a supplied group_by it matches the columns compiled above
1857 # perfectly. Anything else can not be sanely executed on most databases so croak
1858 # right then and there
1859 if ($existing_group_by) {
1860 my @current_group_by = map
1861 { $_ =~ /\./ ? $_ : "$attrs->{alias}.$_" }
1866 join ("\x00", sort @current_group_by)
1868 join ("\x00", sort @{$attrs->{columns}} )
1870 $self->throw_exception (
1871 "You have just attempted a $op operation on a resultset which does group_by"
1872 . ' on columns other than the primary keys, while DBIC internally needs to retrieve'
1873 . ' the primary keys in a subselect. All sane RDBMS engines do not support this'
1874 . ' kind of queries. Please retry the operation with a modified group_by or'
1875 . ' without using one at all.'
1880 $subrs = $subrs->search({}, { group_by => $attrs->{columns} });
1883 my $guard = $storage->txn_scope_guard;
1886 for my $row ($subrs->cursor->all) {
1887 push @op_condition, { map
1888 { $idcols->[$_] => $row->[$_] }
1893 my $res = $storage->$op (
1895 $op eq 'update' ? $values : (),
1909 =item Arguments: \%values
1911 =item Return Value: $underlying_storage_rv
1915 Sets the specified columns in the resultset to the supplied values in a
1916 single query. Note that this will not run any accessor/set_column/update
1917 triggers, nor will it update any result object instances derived from this
1918 resultset (this includes the contents of the L<resultset cache|/set_cache>
1919 if any). See L</update_all> if you need to execute any on-update
1920 triggers or cascades defined either by you or a
1921 L<result component|DBIx::Class::Manual::Component/WHAT IS A COMPONENT>.
1923 The return value is a pass through of what the underlying
1924 storage backend returned, and may vary. See L<DBI/execute> for the most
1929 Note that L</update> does not process/deflate any of the values passed in.
1930 This is unlike the corresponding L<DBIx::Class::Row/update>. The user must
1931 ensure manually that any value passed to this method will stringify to
1932 something the RDBMS knows how to deal with. A notable example is the
1933 handling of L<DateTime> objects, for more info see:
1934 L<DBIx::Class::Manual::Cookbook/Formatting DateTime objects in queries>.
1939 my ($self, $values) = @_;
1940 $self->throw_exception('Values for update must be a hash')
1941 unless ref $values eq 'HASH';
1943 return $self->_rs_update_delete ('update', $values);
1950 =item Arguments: \%values
1952 =item Return Value: 1
1956 Fetches all objects and updates them one at a time via
1957 L<DBIx::Class::Row/update>. Note that C<update_all> will run DBIC defined
1958 triggers, while L</update> will not.
1963 my ($self, $values) = @_;
1964 $self->throw_exception('Values for update_all must be a hash')
1965 unless ref $values eq 'HASH';
1967 my $guard = $self->result_source->schema->txn_scope_guard;
1968 $_->update({%$values}) for $self->all; # shallow copy - update will mangle it
1977 =item Arguments: none
1979 =item Return Value: $underlying_storage_rv
1983 Deletes the rows matching this resultset in a single query. Note that this
1984 will not run any delete triggers, nor will it alter the
1985 L<in_storage|DBIx::Class::Row/in_storage> status of any result object instances
1986 derived from this resultset (this includes the contents of the
1987 L<resultset cache|/set_cache> if any). See L</delete_all> if you need to
1988 execute any on-delete triggers or cascades defined either by you or a
1989 L<result component|DBIx::Class::Manual::Component/WHAT IS A COMPONENT>.
1991 The return value is a pass through of what the underlying storage backend
1992 returned, and may vary. See L<DBI/execute> for the most common case.
1998 $self->throw_exception('delete does not accept any arguments')
2001 return $self->_rs_update_delete ('delete');
2008 =item Arguments: none
2010 =item Return Value: 1
2014 Fetches all objects and deletes them one at a time via
2015 L<DBIx::Class::Row/delete>. Note that C<delete_all> will run DBIC defined
2016 triggers, while L</delete> will not.
2022 $self->throw_exception('delete_all does not accept any arguments')
2025 my $guard = $self->result_source->schema->txn_scope_guard;
2026 $_->delete for $self->all;
2035 =item Arguments: [ \@column_list, \@row_values+ ] | [ \%col_data+ ]
2037 =item Return Value: L<\@result_objects|DBIx::Class::Manual::ResultClass> (scalar context) | L<@result_objects|DBIx::Class::Manual::ResultClass> (list context)
2041 Accepts either an arrayref of hashrefs or alternatively an arrayref of
2048 The context of this method call has an important effect on what is
2049 submitted to storage. In void context data is fed directly to fastpath
2050 insertion routines provided by the underlying storage (most often
2051 L<DBI/execute_for_fetch>), bypassing the L<new|DBIx::Class::Row/new> and
2052 L<insert|DBIx::Class::Row/insert> calls on the
2053 L<Result|DBIx::Class::Manual::ResultClass> class, including any
2054 augmentation of these methods provided by components. For example if you
2055 are using something like L<DBIx::Class::UUIDColumns> to create primary
2056 keys for you, you will find that your PKs are empty. In this case you
2057 will have to explicitly force scalar or list context in order to create
2062 In non-void (scalar or list) context, this method is simply a wrapper
2063 for L</create>. Depending on list or scalar context either a list of
2064 L<Result|DBIx::Class::Manual::ResultClass> objects or an arrayref
2065 containing these objects is returned.
2067 When supplying data in "arrayref of arrayrefs" invocation style, the
2068 first element should be a list of column names and each subsequent
2069 element should be a data value in the earlier specified column order.
2072 $Arstist_rs->populate([
2073 [ qw( artistid name ) ],
2074 [ 100, 'A Formally Unknown Singer' ],
2075 [ 101, 'A singer that jumped the shark two albums ago' ],
2076 [ 102, 'An actually cool singer' ],
2079 For the arrayref of hashrefs style each hashref should be a structure
2080 suitable for passing to L</create>. Multi-create is also permitted with
2083 $schema->resultset("Artist")->populate([
2084 { artistid => 4, name => 'Manufactured Crap', cds => [
2085 { title => 'My First CD', year => 2006 },
2086 { title => 'Yet More Tweeny-Pop crap', year => 2007 },
2089 { artistid => 5, name => 'Angsty-Whiny Girl', cds => [
2090 { title => 'My parents sold me to a record company', year => 2005 },
2091 { title => 'Why Am I So Ugly?', year => 2006 },
2092 { title => 'I Got Surgery and am now Popular', year => 2007 }
2097 If you attempt a void-context multi-create as in the example above (each
2098 Artist also has the related list of CDs), and B<do not> supply the
2099 necessary autoinc foreign key information, this method will proxy to the
2100 less efficient L</create>, and then throw the Result objects away. In this
2101 case there are obviously no benefits to using this method over L</create>.
2108 # cruft placed in standalone method
2109 my $data = $self->_normalize_populate_args(@_);
2111 return unless @$data;
2113 if(defined wantarray) {
2115 foreach my $item (@$data) {
2116 push(@created, $self->create($item));
2118 return wantarray ? @created : \@created;
2121 my $first = $data->[0];
2123 # if a column is a registered relationship, and is a non-blessed hash/array, consider
2124 # it relationship data
2125 my (@rels, @columns);
2126 my $rsrc = $self->result_source;
2127 my $rels = { map { $_ => $rsrc->relationship_info($_) } $rsrc->relationships };
2128 for (keys %$first) {
2129 my $ref = ref $first->{$_};
2130 $rels->{$_} && ($ref eq 'ARRAY' or $ref eq 'HASH')
2136 my @pks = $rsrc->primary_columns;
2138 ## do the belongs_to relationships
2139 foreach my $index (0..$#$data) {
2141 # delegate to create() for any dataset without primary keys with specified relationships
2142 if (grep { !defined $data->[$index]->{$_} } @pks ) {
2144 if (grep { ref $data->[$index]{$r} eq $_ } qw/HASH ARRAY/) { # a related set must be a HASH or AoH
2145 my @ret = $self->populate($data);
2151 foreach my $rel (@rels) {
2152 next unless ref $data->[$index]->{$rel} eq "HASH";
2153 my $result = $self->related_resultset($rel)->create($data->[$index]->{$rel});
2154 my ($reverse_relname, $reverse_relinfo) = %{$rsrc->reverse_relationship_info($rel)};
2155 my $related = $result->result_source->_resolve_condition(
2156 $reverse_relinfo->{cond},
2162 delete $data->[$index]->{$rel};
2163 $data->[$index] = {%{$data->[$index]}, %$related};
2165 push @columns, keys %$related if $index == 0;
2169 ## inherit the data locked in the conditions of the resultset
2170 my ($rs_data) = $self->_merge_with_rscond({});
2171 delete @{$rs_data}{@columns};
2173 ## do bulk insert on current row
2174 $rsrc->storage->insert_bulk(
2176 [@columns, keys %$rs_data],
2177 [ map { [ @$_{@columns}, values %$rs_data ] } @$data ],
2180 ## do the has_many relationships
2181 foreach my $item (@$data) {
2185 foreach my $rel (@rels) {
2186 next unless ref $item->{$rel} eq "ARRAY" && @{ $item->{$rel} };
2188 $main_row ||= $self->new_result({map { $_ => $item->{$_} } @pks});
2190 my $child = $main_row->$rel;
2192 my $related = $child->result_source->_resolve_condition(
2193 $rels->{$rel}{cond},
2199 my @rows_to_add = ref $item->{$rel} eq 'ARRAY' ? @{$item->{$rel}} : ($item->{$rel});
2200 my @populate = map { {%$_, %$related} } @rows_to_add;
2202 $child->populate( \@populate );
2209 # populate() argumnets went over several incarnations
2210 # What we ultimately support is AoH
2211 sub _normalize_populate_args {
2212 my ($self, $arg) = @_;
2214 if (ref $arg eq 'ARRAY') {
2218 elsif (ref $arg->[0] eq 'HASH') {
2221 elsif (ref $arg->[0] eq 'ARRAY') {
2223 my @colnames = @{$arg->[0]};
2224 foreach my $values (@{$arg}[1 .. $#$arg]) {
2225 push @ret, { map { $colnames[$_] => $values->[$_] } (0 .. $#colnames) };
2231 $self->throw_exception('Populate expects an arrayref of hashrefs or arrayref of arrayrefs');
2238 =item Arguments: none
2240 =item Return Value: L<$pager|Data::Page>
2244 Returns a L<Data::Page> object for the current resultset. Only makes
2245 sense for queries with a C<page> attribute.
2247 To get the full count of entries for a paged resultset, call
2248 C<total_entries> on the L<Data::Page> object.
2255 return $self->{pager} if $self->{pager};
2257 my $attrs = $self->{attrs};
2258 if (!defined $attrs->{page}) {
2259 $self->throw_exception("Can't create pager for non-paged rs");
2261 elsif ($attrs->{page} <= 0) {
2262 $self->throw_exception('Invalid page number (page-numbers are 1-based)');
2264 $attrs->{rows} ||= 10;
2266 # throw away the paging flags and re-run the count (possibly
2267 # with a subselect) to get the real total count
2268 my $count_attrs = { %$attrs };
2269 delete $count_attrs->{$_} for qw/rows offset page pager/;
2271 my $total_rs = (ref $self)->new($self->result_source, $count_attrs);
2273 require DBIx::Class::ResultSet::Pager;
2274 return $self->{pager} = DBIx::Class::ResultSet::Pager->new(
2275 sub { $total_rs->count }, #lazy-get the total
2277 $self->{attrs}{page},
2285 =item Arguments: $page_number
2287 =item Return Value: L<$resultset|/search>
2291 Returns a resultset for the $page_number page of the resultset on which page
2292 is called, where each page contains a number of rows equal to the 'rows'
2293 attribute set on the resultset (10 by default).
2298 my ($self, $page) = @_;
2299 return (ref $self)->new($self->result_source, { %{$self->{attrs}}, page => $page });
2306 =item Arguments: \%col_data
2308 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2312 Creates a new result object in the resultset's result class and returns
2313 it. The row is not inserted into the database at this point, call
2314 L<DBIx::Class::Row/insert> to do that. Calling L<DBIx::Class::Row/in_storage>
2315 will tell you whether the result object has been inserted or not.
2317 Passes the hashref of input on to L<DBIx::Class::Row/new>.
2322 my ($self, $values) = @_;
2324 $self->throw_exception( "new_result takes only one argument - a hashref of values" )
2327 $self->throw_exception( "new_result expects a hashref" )
2328 unless (ref $values eq 'HASH');
2330 my ($merged_cond, $cols_from_relations) = $self->_merge_with_rscond($values);
2334 @$cols_from_relations
2335 ? (-cols_from_relations => $cols_from_relations)
2337 -result_source => $self->result_source, # DO NOT REMOVE THIS, REQUIRED
2340 return $self->result_class->new(\%new);
2343 # _merge_with_rscond
2345 # Takes a simple hash of K/V data and returns its copy merged with the
2346 # condition already present on the resultset. Additionally returns an
2347 # arrayref of value/condition names, which were inferred from related
2348 # objects (this is needed for in-memory related objects)
2349 sub _merge_with_rscond {
2350 my ($self, $data) = @_;
2352 my (%new_data, @cols_from_relations);
2354 my $alias = $self->{attrs}{alias};
2356 if (! defined $self->{cond}) {
2357 # just massage $data below
2359 elsif ($self->{cond} eq $DBIx::Class::ResultSource::UNRESOLVABLE_CONDITION) {
2360 %new_data = %{ $self->{attrs}{related_objects} || {} }; # nothing might have been inserted yet
2361 @cols_from_relations = keys %new_data;
2363 elsif (ref $self->{cond} ne 'HASH') {
2364 $self->throw_exception(
2365 "Can't abstract implicit construct, resultset condition not a hash"
2369 # precendence must be given to passed values over values inherited from
2370 # the cond, so the order here is important.
2371 my $collapsed_cond = $self->_collapse_cond($self->{cond});
2372 my %implied = %{$self->_remove_alias($collapsed_cond, $alias)};
2374 while ( my($col, $value) = each %implied ) {
2375 my $vref = ref $value;
2381 (keys %$value)[0] eq '='
2383 $new_data{$col} = $value->{'='};
2385 elsif( !$vref or $vref eq 'SCALAR' or blessed($value) ) {
2386 $new_data{$col} = $value;
2393 %{ $self->_remove_alias($data, $alias) },
2396 return (\%new_data, \@cols_from_relations);
2399 # _has_resolved_attr
2401 # determines if the resultset defines at least one
2402 # of the attributes supplied
2404 # used to determine if a subquery is neccessary
2406 # supports some virtual attributes:
2408 # This will scan for any joins being present on the resultset.
2409 # It is not a mere key-search but a deep inspection of {from}
2412 sub _has_resolved_attr {
2413 my ($self, @attr_names) = @_;
2415 my $attrs = $self->_resolved_attrs;
2419 for my $n (@attr_names) {
2420 if (grep { $n eq $_ } (qw/-join/) ) {
2421 $extra_checks{$n}++;
2425 my $attr = $attrs->{$n};
2427 next if not defined $attr;
2429 if (ref $attr eq 'HASH') {
2430 return 1 if keys %$attr;
2432 elsif (ref $attr eq 'ARRAY') {
2440 # a resolved join is expressed as a multi-level from
2442 $extra_checks{-join}
2444 ref $attrs->{from} eq 'ARRAY'
2446 @{$attrs->{from}} > 1
2454 # Recursively collapse the condition.
2456 sub _collapse_cond {
2457 my ($self, $cond, $collapsed) = @_;
2461 if (ref $cond eq 'ARRAY') {
2462 foreach my $subcond (@$cond) {
2463 next unless ref $subcond; # -or
2464 $collapsed = $self->_collapse_cond($subcond, $collapsed);
2467 elsif (ref $cond eq 'HASH') {
2468 if (keys %$cond and (keys %$cond)[0] eq '-and') {
2469 foreach my $subcond (@{$cond->{-and}}) {
2470 $collapsed = $self->_collapse_cond($subcond, $collapsed);
2474 foreach my $col (keys %$cond) {
2475 my $value = $cond->{$col};
2476 $collapsed->{$col} = $value;
2486 # Remove the specified alias from the specified query hash. A copy is made so
2487 # the original query is not modified.
2490 my ($self, $query, $alias) = @_;
2492 my %orig = %{ $query || {} };
2495 foreach my $key (keys %orig) {
2497 $unaliased{$key} = $orig{$key};
2500 $unaliased{$1} = $orig{$key}
2501 if $key =~ m/^(?:\Q$alias\E\.)?([^.]+)$/;
2511 =item Arguments: none
2513 =item Return Value: \[ $sql, L<@bind_values|/DBIC BIND VALUES> ]
2517 Returns the SQL query and bind vars associated with the invocant.
2519 This is generally used as the RHS for a subquery.
2526 my $attrs = $self->_resolved_attrs_copy;
2531 # my ($sql, \@bind, \%dbi_bind_attrs) = _select_args_to_query (...)
2532 # $sql also has no wrapping parenthesis in list ctx
2534 my $sqlbind = $self->result_source->storage
2535 ->_select_args_to_query ($attrs->{from}, $attrs->{select}, $attrs->{where}, $attrs);
2544 =item Arguments: \%col_data, { key => $unique_constraint, L<%attrs|/ATTRIBUTES> }?
2546 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2550 my $artist = $schema->resultset('Artist')->find_or_new(
2551 { artist => 'fred' }, { key => 'artists' });
2553 $cd->cd_to_producer->find_or_new({ producer => $producer },
2554 { key => 'primary });
2556 Find an existing record from this resultset using L</find>. if none exists,
2557 instantiate a new result object and return it. The object will not be saved
2558 into your storage until you call L<DBIx::Class::Row/insert> on it.
2560 You most likely want this method when looking for existing rows using a unique
2561 constraint that is not the primary key, or looking for related rows.
2563 If you want objects to be saved immediately, use L</find_or_create> instead.
2565 B<Note>: Make sure to read the documentation of L</find> and understand the
2566 significance of the C<key> attribute, as its lack may skew your search, and
2567 subsequently result in spurious new objects.
2569 B<Note>: Take care when using C<find_or_new> with a table having
2570 columns with default values that you intend to be automatically
2571 supplied by the database (e.g. an auto_increment primary key column).
2572 In normal usage, the value of such columns should NOT be included at
2573 all in the call to C<find_or_new>, even when set to C<undef>.
2579 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
2580 my $hash = ref $_[0] eq 'HASH' ? shift : {@_};
2581 if (keys %$hash and my $row = $self->find($hash, $attrs) ) {
2584 return $self->new_result($hash);
2591 =item Arguments: \%col_data
2593 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2597 Attempt to create a single new row or a row with multiple related rows
2598 in the table represented by the resultset (and related tables). This
2599 will not check for duplicate rows before inserting, use
2600 L</find_or_create> to do that.
2602 To create one row for this resultset, pass a hashref of key/value
2603 pairs representing the columns of the table and the values you wish to
2604 store. If the appropriate relationships are set up, foreign key fields
2605 can also be passed an object representing the foreign row, and the
2606 value will be set to its primary key.
2608 To create related objects, pass a hashref of related-object column values
2609 B<keyed on the relationship name>. If the relationship is of type C<multi>
2610 (L<DBIx::Class::Relationship/has_many>) - pass an arrayref of hashrefs.
2611 The process will correctly identify columns holding foreign keys, and will
2612 transparently populate them from the keys of the corresponding relation.
2613 This can be applied recursively, and will work correctly for a structure
2614 with an arbitrary depth and width, as long as the relationships actually
2615 exists and the correct column data has been supplied.
2617 Instead of hashrefs of plain related data (key/value pairs), you may
2618 also pass new or inserted objects. New objects (not inserted yet, see
2619 L</new_result>), will be inserted into their appropriate tables.
2621 Effectively a shortcut for C<< ->new_result(\%col_data)->insert >>.
2623 Example of creating a new row.
2625 $person_rs->create({
2626 name=>"Some Person",
2627 email=>"somebody@someplace.com"
2630 Example of creating a new row and also creating rows in a related C<has_many>
2631 or C<has_one> resultset. Note Arrayref.
2634 { artistid => 4, name => 'Manufactured Crap', cds => [
2635 { title => 'My First CD', year => 2006 },
2636 { title => 'Yet More Tweeny-Pop crap', year => 2007 },
2641 Example of creating a new row and also creating a row in a related
2642 C<belongs_to> resultset. Note Hashref.
2645 title=>"Music for Silly Walks",
2648 name=>"Silly Musician",
2656 When subclassing ResultSet never attempt to override this method. Since
2657 it is a simple shortcut for C<< $self->new_result($attrs)->insert >>, a
2658 lot of the internals simply never call it, so your override will be
2659 bypassed more often than not. Override either L<DBIx::Class::Row/new>
2660 or L<DBIx::Class::Row/insert> depending on how early in the
2661 L</create> process you need to intervene. See also warning pertaining to
2669 my ($self, $attrs) = @_;
2670 $self->throw_exception( "create needs a hashref" )
2671 unless ref $attrs eq 'HASH';
2672 return $self->new_result($attrs)->insert;
2675 =head2 find_or_create
2679 =item Arguments: \%col_data, { key => $unique_constraint, L<%attrs|/ATTRIBUTES> }?
2681 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2685 $cd->cd_to_producer->find_or_create({ producer => $producer },
2686 { key => 'primary' });
2688 Tries to find a record based on its primary key or unique constraints; if none
2689 is found, creates one and returns that instead.
2691 my $cd = $schema->resultset('CD')->find_or_create({
2693 artist => 'Massive Attack',
2694 title => 'Mezzanine',
2698 Also takes an optional C<key> attribute, to search by a specific key or unique
2699 constraint. For example:
2701 my $cd = $schema->resultset('CD')->find_or_create(
2703 artist => 'Massive Attack',
2704 title => 'Mezzanine',
2706 { key => 'cd_artist_title' }
2709 B<Note>: Make sure to read the documentation of L</find> and understand the
2710 significance of the C<key> attribute, as its lack may skew your search, and
2711 subsequently result in spurious row creation.
2713 B<Note>: Because find_or_create() reads from the database and then
2714 possibly inserts based on the result, this method is subject to a race
2715 condition. Another process could create a record in the table after
2716 the find has completed and before the create has started. To avoid
2717 this problem, use find_or_create() inside a transaction.
2719 B<Note>: Take care when using C<find_or_create> with a table having
2720 columns with default values that you intend to be automatically
2721 supplied by the database (e.g. an auto_increment primary key column).
2722 In normal usage, the value of such columns should NOT be included at
2723 all in the call to C<find_or_create>, even when set to C<undef>.
2725 See also L</find> and L</update_or_create>. For information on how to declare
2726 unique constraints, see L<DBIx::Class::ResultSource/add_unique_constraint>.
2728 If you need to know if an existing row was found or a new one created use
2729 L</find_or_new> and L<DBIx::Class::Row/in_storage> instead. Don't forget
2730 to call L<DBIx::Class::Row/insert> to save the newly created row to the
2733 my $cd = $schema->resultset('CD')->find_or_new({
2735 artist => 'Massive Attack',
2736 title => 'Mezzanine',
2740 if( !$cd->in_storage ) {
2747 sub find_or_create {
2749 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
2750 my $hash = ref $_[0] eq 'HASH' ? shift : {@_};
2751 if (keys %$hash and my $row = $self->find($hash, $attrs) ) {
2754 return $self->create($hash);
2757 =head2 update_or_create
2761 =item Arguments: \%col_data, { key => $unique_constraint, L<%attrs|/ATTRIBUTES> }?
2763 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2767 $resultset->update_or_create({ col => $val, ... });
2769 Like L</find_or_create>, but if a row is found it is immediately updated via
2770 C<< $found_row->update (\%col_data) >>.
2773 Takes an optional C<key> attribute to search on a specific unique constraint.
2776 # In your application
2777 my $cd = $schema->resultset('CD')->update_or_create(
2779 artist => 'Massive Attack',
2780 title => 'Mezzanine',
2783 { key => 'cd_artist_title' }
2786 $cd->cd_to_producer->update_or_create({
2787 producer => $producer,
2793 B<Note>: Make sure to read the documentation of L</find> and understand the
2794 significance of the C<key> attribute, as its lack may skew your search, and
2795 subsequently result in spurious row creation.
2797 B<Note>: Take care when using C<update_or_create> with a table having
2798 columns with default values that you intend to be automatically
2799 supplied by the database (e.g. an auto_increment primary key column).
2800 In normal usage, the value of such columns should NOT be included at
2801 all in the call to C<update_or_create>, even when set to C<undef>.
2803 See also L</find> and L</find_or_create>. For information on how to declare
2804 unique constraints, see L<DBIx::Class::ResultSource/add_unique_constraint>.
2806 If you need to know if an existing row was updated or a new one created use
2807 L</update_or_new> and L<DBIx::Class::Row/in_storage> instead. Don't forget
2808 to call L<DBIx::Class::Row/insert> to save the newly created row to the
2813 sub update_or_create {
2815 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
2816 my $cond = ref $_[0] eq 'HASH' ? shift : {@_};
2818 my $row = $self->find($cond, $attrs);
2820 $row->update($cond);
2824 return $self->create($cond);
2827 =head2 update_or_new
2831 =item Arguments: \%col_data, { key => $unique_constraint, L<%attrs|/ATTRIBUTES> }?
2833 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2837 $resultset->update_or_new({ col => $val, ... });
2839 Like L</find_or_new> but if a row is found it is immediately updated via
2840 C<< $found_row->update (\%col_data) >>.
2844 # In your application
2845 my $cd = $schema->resultset('CD')->update_or_new(
2847 artist => 'Massive Attack',
2848 title => 'Mezzanine',
2851 { key => 'cd_artist_title' }
2854 if ($cd->in_storage) {
2855 # the cd was updated
2858 # the cd is not yet in the database, let's insert it
2862 B<Note>: Make sure to read the documentation of L</find> and understand the
2863 significance of the C<key> attribute, as its lack may skew your search, and
2864 subsequently result in spurious new objects.
2866 B<Note>: Take care when using C<update_or_new> with a table having
2867 columns with default values that you intend to be automatically
2868 supplied by the database (e.g. an auto_increment primary key column).
2869 In normal usage, the value of such columns should NOT be included at
2870 all in the call to C<update_or_new>, even when set to C<undef>.
2872 See also L</find>, L</find_or_create> and L</find_or_new>.
2878 my $attrs = ( @_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {} );
2879 my $cond = ref $_[0] eq 'HASH' ? shift : {@_};
2881 my $row = $self->find( $cond, $attrs );
2882 if ( defined $row ) {
2883 $row->update($cond);
2887 return $self->new_result($cond);
2894 =item Arguments: none
2896 =item Return Value: L<\@result_objs|DBIx::Class::Manual::ResultClass> | undef
2900 Gets the contents of the cache for the resultset, if the cache is set.
2902 The cache is populated either by using the L</prefetch> attribute to
2903 L</search> or by calling L</set_cache>.
2915 =item Arguments: L<\@result_objs|DBIx::Class::Manual::ResultClass>
2917 =item Return Value: L<\@result_objs|DBIx::Class::Manual::ResultClass>
2921 Sets the contents of the cache for the resultset. Expects an arrayref
2922 of objects of the same class as those produced by the resultset. Note that
2923 if the cache is set, the resultset will return the cached objects rather
2924 than re-querying the database even if the cache attr is not set.
2926 The contents of the cache can also be populated by using the
2927 L</prefetch> attribute to L</search>.
2932 my ( $self, $data ) = @_;
2933 $self->throw_exception("set_cache requires an arrayref")
2934 if defined($data) && (ref $data ne 'ARRAY');
2935 $self->{all_cache} = $data;
2942 =item Arguments: none
2944 =item Return Value: undef
2948 Clears the cache for the resultset.
2953 shift->set_cache(undef);
2960 =item Arguments: none
2962 =item Return Value: true, if the resultset has been paginated
2970 return !!$self->{attrs}{page};
2977 =item Arguments: none
2979 =item Return Value: true, if the resultset has been ordered with C<order_by>.
2987 return scalar $self->result_source->storage->_extract_order_criteria($self->{attrs}{order_by});
2990 =head2 related_resultset
2994 =item Arguments: $rel_name
2996 =item Return Value: L<$resultset|/search>
3000 Returns a related resultset for the supplied relationship name.
3002 $artist_rs = $schema->resultset('CD')->related_resultset('Artist');
3006 sub related_resultset {
3007 my ($self, $rel) = @_;
3009 $self->{related_resultsets} ||= {};
3010 return $self->{related_resultsets}{$rel} ||= do {
3011 my $rsrc = $self->result_source;
3012 my $rel_info = $rsrc->relationship_info($rel);
3014 $self->throw_exception(
3015 "search_related: result source '" . $rsrc->source_name .
3016 "' has no such relationship $rel")
3019 my $attrs = $self->_chain_relationship($rel);
3021 my $join_count = $attrs->{seen_join}{$rel};
3023 my $alias = $self->result_source->storage
3024 ->relname_to_table_alias($rel, $join_count);
3026 # since this is search_related, and we already slid the select window inwards
3027 # (the select/as attrs were deleted in the beginning), we need to flip all
3028 # left joins to inner, so we get the expected results
3029 # read the comment on top of the actual function to see what this does
3030 $attrs->{from} = $rsrc->schema->storage->_inner_join_to_node ($attrs->{from}, $alias);
3033 #XXX - temp fix for result_class bug. There likely is a more elegant fix -groditi
3034 delete @{$attrs}{qw(result_class alias)};
3038 if (my $cache = $self->get_cache) {
3039 if ($cache->[0] && $cache->[0]->related_resultset($rel)->get_cache) {
3040 $new_cache = [ map { @{$_->related_resultset($rel)->get_cache} }
3045 my $rel_source = $rsrc->related_source($rel);
3049 # The reason we do this now instead of passing the alias to the
3050 # search_rs below is that if you wrap/overload resultset on the
3051 # source you need to know what alias it's -going- to have for things
3052 # to work sanely (e.g. RestrictWithObject wants to be able to add
3053 # extra query restrictions, and these may need to be $alias.)
3055 my $rel_attrs = $rel_source->resultset_attributes;
3056 local $rel_attrs->{alias} = $alias;
3058 $rel_source->resultset
3062 where => $attrs->{where},
3065 $new->set_cache($new_cache) if $new_cache;
3070 =head2 current_source_alias
3074 =item Arguments: none
3076 =item Return Value: $source_alias
3080 Returns the current table alias for the result source this resultset is built
3081 on, that will be used in the SQL query. Usually it is C<me>.
3083 Currently the source alias that refers to the result set returned by a
3084 L</search>/L</find> family method depends on how you got to the resultset: it's
3085 C<me> by default, but eg. L</search_related> aliases it to the related result
3086 source name (and keeps C<me> referring to the original result set). The long
3087 term goal is to make L<DBIx::Class> always alias the current resultset as C<me>
3088 (and make this method unnecessary).
3090 Thus it's currently necessary to use this method in predefined queries (see
3091 L<DBIx::Class::Manual::Cookbook/Predefined searches>) when referring to the
3092 source alias of the current result set:
3094 # in a result set class
3096 my ($self, $user) = @_;
3098 my $me = $self->current_source_alias;
3100 return $self->search({
3101 "$me.modified" => $user->id,
3107 sub current_source_alias {
3110 return ($self->{attrs} || {})->{alias} || 'me';
3113 =head2 as_subselect_rs
3117 =item Arguments: none
3119 =item Return Value: L<$resultset|/search>
3123 Act as a barrier to SQL symbols. The resultset provided will be made into a
3124 "virtual view" by including it as a subquery within the from clause. From this
3125 point on, any joined tables are inaccessible to ->search on the resultset (as if
3126 it were simply where-filtered without joins). For example:
3128 my $rs = $schema->resultset('Bar')->search({'x.name' => 'abc'},{ join => 'x' });
3130 # 'x' now pollutes the query namespace
3132 # So the following works as expected
3133 my $ok_rs = $rs->search({'x.other' => 1});
3135 # But this doesn't: instead of finding a 'Bar' related to two x rows (abc and
3136 # def) we look for one row with contradictory terms and join in another table
3137 # (aliased 'x_2') which we never use
3138 my $broken_rs = $rs->search({'x.name' => 'def'});
3140 my $rs2 = $rs->as_subselect_rs;
3142 # doesn't work - 'x' is no longer accessible in $rs2, having been sealed away
3143 my $not_joined_rs = $rs2->search({'x.other' => 1});
3145 # works as expected: finds a 'table' row related to two x rows (abc and def)
3146 my $correctly_joined_rs = $rs2->search({'x.name' => 'def'});
3148 Another example of when one might use this would be to select a subset of
3149 columns in a group by clause:
3151 my $rs = $schema->resultset('Bar')->search(undef, {
3152 group_by => [qw{ id foo_id baz_id }],
3153 })->as_subselect_rs->search(undef, {
3154 columns => [qw{ id foo_id }]
3157 In the above example normally columns would have to be equal to the group by,
3158 but because we isolated the group by into a subselect the above works.
3162 sub as_subselect_rs {
3165 my $attrs = $self->_resolved_attrs;
3167 my $fresh_rs = (ref $self)->new (
3168 $self->result_source
3171 # these pieces will be locked in the subquery
3172 delete $fresh_rs->{cond};
3173 delete @{$fresh_rs->{attrs}}{qw/where bind/};
3175 return $fresh_rs->search( {}, {
3177 $attrs->{alias} => $self->as_query,
3178 -alias => $attrs->{alias},
3179 -rsrc => $self->result_source,
3181 alias => $attrs->{alias},
3185 # This code is called by search_related, and makes sure there
3186 # is clear separation between the joins before, during, and
3187 # after the relationship. This information is needed later
3188 # in order to properly resolve prefetch aliases (any alias
3189 # with a relation_chain_depth less than the depth of the
3190 # current prefetch is not considered)
3192 # The increments happen twice per join. An even number means a
3193 # relationship specified via a search_related, whereas an odd
3194 # number indicates a join/prefetch added via attributes
3196 # Also this code will wrap the current resultset (the one we
3197 # chain to) in a subselect IFF it contains limiting attributes
3198 sub _chain_relationship {
3199 my ($self, $rel) = @_;
3200 my $source = $self->result_source;
3201 my $attrs = { %{$self->{attrs}||{}} };
3203 # we need to take the prefetch the attrs into account before we
3204 # ->_resolve_join as otherwise they get lost - captainL
3205 my $join = $self->_merge_joinpref_attr( $attrs->{join}, $attrs->{prefetch} );
3207 delete @{$attrs}{qw/join prefetch collapse group_by distinct select as columns +select +as +columns/};
3209 my $seen = { %{ (delete $attrs->{seen_join}) || {} } };
3212 my @force_subq_attrs = qw/offset rows group_by having/;
3215 ($attrs->{from} && ref $attrs->{from} ne 'ARRAY')
3217 $self->_has_resolved_attr (@force_subq_attrs)
3219 # Nuke the prefetch (if any) before the new $rs attrs
3220 # are resolved (prefetch is useless - we are wrapping
3221 # a subquery anyway).
3222 my $rs_copy = $self->search;
3223 $rs_copy->{attrs}{join} = $self->_merge_joinpref_attr (
3224 $rs_copy->{attrs}{join},
3225 delete $rs_copy->{attrs}{prefetch},
3230 -alias => $attrs->{alias},
3231 $attrs->{alias} => $rs_copy->as_query,
3233 delete @{$attrs}{@force_subq_attrs, qw/where bind/};
3234 $seen->{-relation_chain_depth} = 0;
3236 elsif ($attrs->{from}) { #shallow copy suffices
3237 $from = [ @{$attrs->{from}} ];
3242 -alias => $attrs->{alias},
3243 $attrs->{alias} => $source->from,
3247 my $jpath = ($seen->{-relation_chain_depth})
3248 ? $from->[-1][0]{-join_path}
3251 my @requested_joins = $source->_resolve_join(
3258 push @$from, @requested_joins;
3260 $seen->{-relation_chain_depth}++;
3262 # if $self already had a join/prefetch specified on it, the requested
3263 # $rel might very well be already included. What we do in this case
3264 # is effectively a no-op (except that we bump up the chain_depth on
3265 # the join in question so we could tell it *is* the search_related)
3268 # we consider the last one thus reverse
3269 for my $j (reverse @requested_joins) {
3270 my ($last_j) = keys %{$j->[0]{-join_path}[-1]};
3271 if ($rel eq $last_j) {
3272 $j->[0]{-relation_chain_depth}++;
3278 unless ($already_joined) {
3279 push @$from, $source->_resolve_join(
3287 $seen->{-relation_chain_depth}++;
3289 return {%$attrs, from => $from, seen_join => $seen};
3292 # too many times we have to do $attrs = { %{$self->_resolved_attrs} }
3293 sub _resolved_attrs_copy {
3295 return { %{$self->_resolved_attrs (@_)} };
3298 sub _resolved_attrs {
3300 return $self->{_attrs} if $self->{_attrs};
3302 my $attrs = { %{ $self->{attrs} || {} } };
3303 my $source = $self->result_source;
3304 my $alias = $attrs->{alias};
3306 # default selection list
3307 $attrs->{columns} = [ $source->columns ]
3308 unless List::Util::first { exists $attrs->{$_} } qw/columns cols select as/;
3310 # merge selectors together
3311 for (qw/columns select as/) {
3312 $attrs->{$_} = $self->_merge_attr($attrs->{$_}, delete $attrs->{"+$_"})
3313 if $attrs->{$_} or $attrs->{"+$_"};
3316 # disassemble columns
3318 if (my $cols = delete $attrs->{columns}) {
3319 for my $c (ref $cols eq 'ARRAY' ? @$cols : $cols) {
3320 if (ref $c eq 'HASH') {
3321 for my $as (sort keys %$c) {
3322 push @sel, $c->{$as};
3333 # when trying to weed off duplicates later do not go past this point -
3334 # everything added from here on is unbalanced "anyone's guess" stuff
3335 my $dedup_stop_idx = $#as;
3337 push @as, @{ ref $attrs->{as} eq 'ARRAY' ? $attrs->{as} : [ $attrs->{as} ] }
3339 push @sel, @{ ref $attrs->{select} eq 'ARRAY' ? $attrs->{select} : [ $attrs->{select} ] }
3340 if $attrs->{select};
3342 # assume all unqualified selectors to apply to the current alias (legacy stuff)
3344 $_ = (ref $_ or $_ =~ /\./) ? $_ : "$alias.$_";
3347 # disqualify all $alias.col as-bits (collapser mandated)
3349 $_ = ($_ =~ /^\Q$alias.\E(.+)$/) ? $1 : $_;
3352 # de-duplicate the result (remove *identical* select/as pairs)
3353 # and also die on duplicate {as} pointing to different {select}s
3354 # not using a c-style for as the condition is prone to shrinkage
3357 while ($i <= $dedup_stop_idx) {
3358 if ($seen->{"$sel[$i] \x00\x00 $as[$i]"}++) {
3363 elsif ($seen->{$as[$i]}++) {
3364 $self->throw_exception(
3365 "inflate_result() alias '$as[$i]' specified twice with different SQL-side {select}-ors"
3373 $attrs->{select} = \@sel;
3374 $attrs->{as} = \@as;
3376 $attrs->{from} ||= [{
3378 -alias => $self->{attrs}{alias},
3379 $self->{attrs}{alias} => $source->from,
3382 if ( $attrs->{join} || $attrs->{prefetch} ) {
3384 $self->throw_exception ('join/prefetch can not be used with a custom {from}')
3385 if ref $attrs->{from} ne 'ARRAY';
3387 my $join = (delete $attrs->{join}) || {};
3389 if ( defined $attrs->{prefetch} ) {
3390 $join = $self->_merge_joinpref_attr( $join, $attrs->{prefetch} );
3393 $attrs->{from} = # have to copy here to avoid corrupting the original
3395 @{ $attrs->{from} },
3396 $source->_resolve_join(
3399 { %{ $attrs->{seen_join} || {} } },
3400 ( $attrs->{seen_join} && keys %{$attrs->{seen_join}})
3401 ? $attrs->{from}[-1][0]{-join_path}
3408 if ( defined $attrs->{order_by} ) {
3409 $attrs->{order_by} = (
3410 ref( $attrs->{order_by} ) eq 'ARRAY'
3411 ? [ @{ $attrs->{order_by} } ]
3412 : [ $attrs->{order_by} || () ]
3416 if ($attrs->{group_by} and ref $attrs->{group_by} ne 'ARRAY') {
3417 $attrs->{group_by} = [ $attrs->{group_by} ];
3420 # generate the distinct induced group_by early, as prefetch will be carried via a
3421 # subquery (since a group_by is present)
3422 if (delete $attrs->{distinct}) {
3423 if ($attrs->{group_by}) {
3424 carp_unique ("Useless use of distinct on a grouped resultset ('distinct' is ignored when a 'group_by' is present)");
3427 # distinct affects only the main selection part, not what prefetch may
3429 $attrs->{group_by} = $source->storage->_group_over_selection (
3437 $attrs->{collapse} ||= {};
3438 if ($attrs->{prefetch}) {
3440 $self->throw_exception("Unable to prefetch, resultset contains an unnamed selector $attrs->{_dark_selector}{string}")
3441 if $attrs->{_dark_selector};
3443 my $prefetch = $self->_merge_joinpref_attr( {}, delete $attrs->{prefetch} );
3445 my $prefetch_ordering = [];
3447 # this is a separate structure (we don't look in {from} directly)
3448 # as the resolver needs to shift things off the lists to work
3449 # properly (identical-prefetches on different branches)
3451 if (ref $attrs->{from} eq 'ARRAY') {
3453 my $start_depth = $attrs->{seen_join}{-relation_chain_depth} || 0;
3455 for my $j ( @{$attrs->{from}}[1 .. $#{$attrs->{from}} ] ) {
3456 next unless $j->[0]{-alias};
3457 next unless $j->[0]{-join_path};
3458 next if ($j->[0]{-relation_chain_depth} || 0) < $start_depth;
3460 my @jpath = map { keys %$_ } @{$j->[0]{-join_path}};
3463 $p = $p->{$_} ||= {} for @jpath[ ($start_depth/2) .. $#jpath]; #only even depths are actual jpath boundaries
3464 push @{$p->{-join_aliases} }, $j->[0]{-alias};
3469 $source->_resolve_prefetch( $prefetch, $alias, $join_map, $prefetch_ordering, $attrs->{collapse} );
3471 # we need to somehow mark which columns came from prefetch
3473 my $sel_end = $#{$attrs->{select}};
3474 $attrs->{_prefetch_selector_range} = [ $sel_end + 1, $sel_end + @prefetch ];
3477 push @{ $attrs->{select} }, (map { $_->[0] } @prefetch);
3478 push @{ $attrs->{as} }, (map { $_->[1] } @prefetch);
3480 push( @{$attrs->{order_by}}, @$prefetch_ordering );
3481 $attrs->{_collapse_order_by} = \@$prefetch_ordering;
3484 # if both page and offset are specified, produce a combined offset
3485 # even though it doesn't make much sense, this is what pre 081xx has
3487 if (my $page = delete $attrs->{page}) {
3489 ($attrs->{rows} * ($page - 1))
3491 ($attrs->{offset} || 0)
3495 return $self->{_attrs} = $attrs;
3499 my ($self, $attr) = @_;
3501 if (ref $attr eq 'HASH') {
3502 return $self->_rollout_hash($attr);
3503 } elsif (ref $attr eq 'ARRAY') {
3504 return $self->_rollout_array($attr);
3510 sub _rollout_array {
3511 my ($self, $attr) = @_;
3514 foreach my $element (@{$attr}) {
3515 if (ref $element eq 'HASH') {
3516 push( @rolled_array, @{ $self->_rollout_hash( $element ) } );
3517 } elsif (ref $element eq 'ARRAY') {
3518 # XXX - should probably recurse here
3519 push( @rolled_array, @{$self->_rollout_array($element)} );
3521 push( @rolled_array, $element );
3524 return \@rolled_array;
3528 my ($self, $attr) = @_;
3531 foreach my $key (keys %{$attr}) {
3532 push( @rolled_array, { $key => $attr->{$key} } );
3534 return \@rolled_array;
3537 sub _calculate_score {
3538 my ($self, $a, $b) = @_;
3540 if (defined $a xor defined $b) {
3543 elsif (not defined $a) {
3547 if (ref $b eq 'HASH') {
3548 my ($b_key) = keys %{$b};
3549 if (ref $a eq 'HASH') {
3550 my ($a_key) = keys %{$a};
3551 if ($a_key eq $b_key) {
3552 return (1 + $self->_calculate_score( $a->{$a_key}, $b->{$b_key} ));
3557 return ($a eq $b_key) ? 1 : 0;
3560 if (ref $a eq 'HASH') {
3561 my ($a_key) = keys %{$a};
3562 return ($b eq $a_key) ? 1 : 0;
3564 return ($b eq $a) ? 1 : 0;
3569 sub _merge_joinpref_attr {
3570 my ($self, $orig, $import) = @_;
3572 return $import unless defined($orig);
3573 return $orig unless defined($import);
3575 $orig = $self->_rollout_attr($orig);
3576 $import = $self->_rollout_attr($import);
3579 foreach my $import_element ( @{$import} ) {
3580 # find best candidate from $orig to merge $b_element into
3581 my $best_candidate = { position => undef, score => 0 }; my $position = 0;
3582 foreach my $orig_element ( @{$orig} ) {
3583 my $score = $self->_calculate_score( $orig_element, $import_element );
3584 if ($score > $best_candidate->{score}) {
3585 $best_candidate->{position} = $position;
3586 $best_candidate->{score} = $score;
3590 my ($import_key) = ( ref $import_element eq 'HASH' ) ? keys %{$import_element} : ($import_element);
3591 $import_key = '' if not defined $import_key;
3593 if ($best_candidate->{score} == 0 || exists $seen_keys->{$import_key}) {
3594 push( @{$orig}, $import_element );
3596 my $orig_best = $orig->[$best_candidate->{position}];
3597 # merge orig_best and b_element together and replace original with merged
3598 if (ref $orig_best ne 'HASH') {
3599 $orig->[$best_candidate->{position}] = $import_element;
3600 } elsif (ref $import_element eq 'HASH') {
3601 my ($key) = keys %{$orig_best};
3602 $orig->[$best_candidate->{position}] = { $key => $self->_merge_joinpref_attr($orig_best->{$key}, $import_element->{$key}) };
3605 $seen_keys->{$import_key} = 1; # don't merge the same key twice
3616 require Hash::Merge;
3617 my $hm = Hash::Merge->new;
3619 $hm->specify_behavior({
3622 my ($defl, $defr) = map { defined $_ } (@_[0,1]);
3624 if ($defl xor $defr) {
3625 return [ $defl ? $_[0] : $_[1] ];
3630 elsif (__HM_DEDUP and $_[0] eq $_[1]) {
3634 return [$_[0], $_[1]];
3638 return $_[1] if !defined $_[0];
3639 return $_[1] if __HM_DEDUP and List::Util::first { $_ eq $_[0] } @{$_[1]};
3640 return [$_[0], @{$_[1]}]
3643 return [] if !defined $_[0] and !keys %{$_[1]};
3644 return [ $_[1] ] if !defined $_[0];
3645 return [ $_[0] ] if !keys %{$_[1]};
3646 return [$_[0], $_[1]]
3651 return $_[0] if !defined $_[1];
3652 return $_[0] if __HM_DEDUP and List::Util::first { $_ eq $_[1] } @{$_[0]};
3653 return [@{$_[0]}, $_[1]]
3656 my @ret = @{$_[0]} or return $_[1];
3657 return [ @ret, @{$_[1]} ] unless __HM_DEDUP;
3658 my %idx = map { $_ => 1 } @ret;
3659 push @ret, grep { ! defined $idx{$_} } (@{$_[1]});
3663 return [ $_[1] ] if ! @{$_[0]};
3664 return $_[0] if !keys %{$_[1]};
3665 return $_[0] if __HM_DEDUP and List::Util::first { $_ eq $_[1] } @{$_[0]};
3666 return [ @{$_[0]}, $_[1] ];
3671 return [] if !keys %{$_[0]} and !defined $_[1];
3672 return [ $_[0] ] if !defined $_[1];
3673 return [ $_[1] ] if !keys %{$_[0]};
3674 return [$_[0], $_[1]]
3677 return [] if !keys %{$_[0]} and !@{$_[1]};
3678 return [ $_[0] ] if !@{$_[1]};
3679 return $_[1] if !keys %{$_[0]};
3680 return $_[1] if __HM_DEDUP and List::Util::first { $_ eq $_[0] } @{$_[1]};
3681 return [ $_[0], @{$_[1]} ];
3684 return [] if !keys %{$_[0]} and !keys %{$_[1]};
3685 return [ $_[0] ] if !keys %{$_[1]};
3686 return [ $_[1] ] if !keys %{$_[0]};
3687 return [ $_[0] ] if $_[0] eq $_[1];
3688 return [ $_[0], $_[1] ];
3691 } => 'DBIC_RS_ATTR_MERGER');
3695 return $hm->merge ($_[1], $_[2]);
3699 sub STORABLE_freeze {
3700 my ($self, $cloning) = @_;
3701 my $to_serialize = { %$self };
3703 # A cursor in progress can't be serialized (and would make little sense anyway)
3704 delete $to_serialize->{cursor};
3706 # nor is it sensical to store a not-yet-fired-count pager
3707 if ($to_serialize->{pager} and ref $to_serialize->{pager}{total_entries} eq 'CODE') {
3708 delete $to_serialize->{pager};
3711 Storable::nfreeze($to_serialize);
3714 # need this hook for symmetry
3716 my ($self, $cloning, $serialized) = @_;
3718 %$self = %{ Storable::thaw($serialized) };
3724 =head2 throw_exception
3726 See L<DBIx::Class::Schema/throw_exception> for details.
3730 sub throw_exception {
3733 if (ref $self and my $rsrc = $self->result_source) {
3734 $rsrc->throw_exception(@_)
3737 DBIx::Class::Exception->throw(@_);
3741 # XXX: FIXME: Attributes docs need clearing up
3745 Attributes are used to refine a ResultSet in various ways when
3746 searching for data. They can be passed to any method which takes an
3747 C<\%attrs> argument. See L</search>, L</search_rs>, L</find>,
3750 Default attributes can be set on the result class using
3751 L<DBIx::Class::ResultSource/resultset_attributes>. (Please read
3752 the CAVEATS on that feature before using it!)
3754 These are in no particular order:
3760 =item Value: ( $order_by | \@order_by | \%order_by )
3764 Which column(s) to order the results by.
3766 [The full list of suitable values is documented in
3767 L<SQL::Abstract/"ORDER BY CLAUSES">; the following is a summary of
3770 If a single column name, or an arrayref of names is supplied, the
3771 argument is passed through directly to SQL. The hashref syntax allows
3772 for connection-agnostic specification of ordering direction:
3774 For descending order:
3776 order_by => { -desc => [qw/col1 col2 col3/] }
3778 For explicit ascending order:
3780 order_by => { -asc => 'col' }
3782 The old scalarref syntax (i.e. order_by => \'year DESC') is still
3783 supported, although you are strongly encouraged to use the hashref
3784 syntax as outlined above.
3790 =item Value: \@columns
3794 Shortcut to request a particular set of columns to be retrieved. Each
3795 column spec may be a string (a table column name), or a hash (in which
3796 case the key is the C<as> value, and the value is used as the C<select>
3797 expression). Adds C<me.> onto the start of any column without a C<.> in
3798 it and sets C<select> from that, then auto-populates C<as> from
3799 C<select> as normal. (You may also use the C<cols> attribute, as in
3800 earlier versions of DBIC.)
3802 Essentially C<columns> does the same as L</select> and L</as>.
3804 columns => [ 'foo', { bar => 'baz' } ]
3808 select => [qw/foo baz/],
3815 =item Value: \@columns
3819 Indicates additional columns to be selected from storage. Works the same
3820 as L</columns> but adds columns to the selection. (You may also use the
3821 C<include_columns> attribute, as in earlier versions of DBIC). For
3824 $schema->resultset('CD')->search(undef, {
3825 '+columns' => ['artist.name'],
3829 would return all CDs and include a 'name' column to the information
3830 passed to object inflation. Note that the 'artist' is the name of the
3831 column (or relationship) accessor, and 'name' is the name of the column
3832 accessor in the related table.
3834 B<NOTE:> You need to explicitly quote '+columns' when defining the attribute.
3835 Not doing so causes Perl to incorrectly interpret +columns as a bareword with a
3836 unary plus operator before it.
3838 =head2 include_columns
3842 =item Value: \@columns
3846 Deprecated. Acts as a synonym for L</+columns> for backward compatibility.
3852 =item Value: \@select_columns
3856 Indicates which columns should be selected from the storage. You can use
3857 column names, or in the case of RDBMS back ends, function or stored procedure
3860 $rs = $schema->resultset('Employee')->search(undef, {
3863 { count => 'employeeid' },
3864 { max => { length => 'name' }, -as => 'longest_name' }
3869 SELECT name, COUNT( employeeid ), MAX( LENGTH( name ) ) AS longest_name FROM employee
3871 B<NOTE:> You will almost always need a corresponding L</as> attribute when you
3872 use L</select>, to instruct DBIx::Class how to store the result of the column.
3873 Also note that the L</as> attribute has nothing to do with the SQL-side 'AS'
3874 identifier aliasing. You can however alias a function, so you can use it in
3875 e.g. an C<ORDER BY> clause. This is done via the C<-as> B<select function
3876 attribute> supplied as shown in the example above.
3878 B<NOTE:> You need to explicitly quote '+select'/'+as' when defining the attributes.
3879 Not doing so causes Perl to incorrectly interpret them as a bareword with a
3880 unary plus operator before it.
3886 Indicates additional columns to be selected from storage. Works the same as
3887 L</select> but adds columns to the default selection, instead of specifying
3896 Indicates additional column names for those added via L</+select>. See L</as>.
3904 =item Value: \@inflation_names
3908 Indicates column names for object inflation. That is L</as> indicates the
3909 slot name in which the column value will be stored within the
3910 L<Row|DBIx::Class::Row> object. The value will then be accessible via this
3911 identifier by the C<get_column> method (or via the object accessor B<if one
3912 with the same name already exists>) as shown below. The L</as> attribute has
3913 B<nothing to do> with the SQL-side C<AS>. See L</select> for details.
3915 $rs = $schema->resultset('Employee')->search(undef, {
3918 { count => 'employeeid' },
3919 { max => { length => 'name' }, -as => 'longest_name' }
3928 If the object against which the search is performed already has an accessor
3929 matching a column name specified in C<as>, the value can be retrieved using
3930 the accessor as normal:
3932 my $name = $employee->name();
3934 If on the other hand an accessor does not exist in the object, you need to
3935 use C<get_column> instead:
3937 my $employee_count = $employee->get_column('employee_count');
3939 You can create your own accessors if required - see
3940 L<DBIx::Class::Manual::Cookbook> for details.
3946 =item Value: ($rel_name | \@rel_names | \%rel_names)
3950 Contains a list of relationships that should be joined for this query. For
3953 # Get CDs by Nine Inch Nails
3954 my $rs = $schema->resultset('CD')->search(
3955 { 'artist.name' => 'Nine Inch Nails' },
3956 { join => 'artist' }
3959 Can also contain a hash reference to refer to the other relation's relations.
3962 package MyApp::Schema::Track;
3963 use base qw/DBIx::Class/;
3964 __PACKAGE__->table('track');
3965 __PACKAGE__->add_columns(qw/trackid cd position title/);
3966 __PACKAGE__->set_primary_key('trackid');
3967 __PACKAGE__->belongs_to(cd => 'MyApp::Schema::CD');
3970 # In your application
3971 my $rs = $schema->resultset('Artist')->search(
3972 { 'track.title' => 'Teardrop' },
3974 join => { cd => 'track' },
3975 order_by => 'artist.name',
3979 You need to use the relationship (not the table) name in conditions,
3980 because they are aliased as such. The current table is aliased as "me", so
3981 you need to use me.column_name in order to avoid ambiguity. For example:
3983 # Get CDs from 1984 with a 'Foo' track
3984 my $rs = $schema->resultset('CD')->search(
3987 'tracks.name' => 'Foo'
3989 { join => 'tracks' }
3992 If the same join is supplied twice, it will be aliased to <rel>_2 (and
3993 similarly for a third time). For e.g.
3995 my $rs = $schema->resultset('Artist')->search({
3996 'cds.title' => 'Down to Earth',
3997 'cds_2.title' => 'Popular',
3999 join => [ qw/cds cds/ ],
4002 will return a set of all artists that have both a cd with title 'Down
4003 to Earth' and a cd with title 'Popular'.
4005 If you want to fetch related objects from other tables as well, see C<prefetch>
4008 NOTE: An internal join-chain pruner will discard certain joins while
4009 constructing the actual SQL query, as long as the joins in question do not
4010 affect the retrieved result. This for example includes 1:1 left joins
4011 that are not part of the restriction specification (WHERE/HAVING) nor are
4012 a part of the query selection.
4014 For more help on using joins with search, see L<DBIx::Class::Manual::Joining>.
4020 =item Value: ($rel_name | \@rel_names | \%rel_names)
4024 Contains one or more relationships that should be fetched along with
4025 the main query (when they are accessed afterwards the data will
4026 already be available, without extra queries to the database). This is
4027 useful for when you know you will need the related objects, because it
4028 saves at least one query:
4030 my $rs = $schema->resultset('Tag')->search(
4039 The initial search results in SQL like the following:
4041 SELECT tag.*, cd.*, artist.* FROM tag
4042 JOIN cd ON tag.cd = cd.cdid
4043 JOIN artist ON cd.artist = artist.artistid
4045 L<DBIx::Class> has no need to go back to the database when we access the
4046 C<cd> or C<artist> relationships, which saves us two SQL statements in this
4049 Simple prefetches will be joined automatically, so there is no need
4050 for a C<join> attribute in the above search.
4052 L</prefetch> can be used with the any of the relationship types and
4053 multiple prefetches can be specified together. Below is a more complex
4054 example that prefetches a CD's artist, its liner notes (if present),
4055 the cover image, the tracks on that cd, and the guests on those
4059 My::Schema::CD->belongs_to( artist => 'My::Schema::Artist' );
4060 My::Schema::CD->might_have( liner_note => 'My::Schema::LinerNotes' );
4061 My::Schema::CD->has_one( cover_image => 'My::Schema::Artwork' );
4062 My::Schema::CD->has_many( tracks => 'My::Schema::Track' );
4064 My::Schema::Artist->belongs_to( record_label => 'My::Schema::RecordLabel' );
4066 My::Schema::Track->has_many( guests => 'My::Schema::Guest' );
4069 my $rs = $schema->resultset('CD')->search(
4073 { artist => 'record_label'}, # belongs_to => belongs_to
4074 'liner_note', # might_have
4075 'cover_image', # has_one
4076 { tracks => 'guests' }, # has_many => has_many
4081 This will produce SQL like the following:
4083 SELECT cd.*, artist.*, record_label.*, liner_note.*, cover_image.*,
4087 ON artist.artistid = me.artistid
4088 JOIN record_label record_label
4089 ON record_label.labelid = artist.labelid
4090 LEFT JOIN track tracks
4091 ON tracks.cdid = me.cdid
4092 LEFT JOIN guest guests
4093 ON guests.trackid = track.trackid
4094 LEFT JOIN liner_notes liner_note
4095 ON liner_note.cdid = me.cdid
4096 JOIN cd_artwork cover_image
4097 ON cover_image.cdid = me.cdid
4100 Now the C<artist>, C<record_label>, C<liner_note>, C<cover_image>,
4101 C<tracks>, and C<guests> of the CD will all be available through the
4102 relationship accessors without the need for additional queries to the
4105 However, there is one caveat to be observed: it can be dangerous to
4106 prefetch more than one L<has_many|DBIx::Class::Relationship/has_many>
4107 relationship on a given level. e.g.:
4109 my $rs = $schema->resultset('CD')->search(
4113 'tracks', # has_many
4114 { cd_to_producer => 'producer' }, # has_many => belongs_to (i.e. m2m)
4119 The collapser currently can't identify duplicate tuples for multiple
4120 L<has_many|DBIx::Class::Relationship/has_many> relationships and as a
4121 result the second L<has_many|DBIx::Class::Relationship/has_many>
4122 relation could contain redundant objects.
4124 =head3 Using L</prefetch> with L</join>
4126 L</prefetch> implies a L</join> with the equivalent argument, and is
4127 properly merged with any existing L</join> specification. So the
4130 my $rs = $schema->resultset('CD')->search(
4131 {'record_label.name' => 'Music Product Ltd.'},
4133 join => {artist => 'record_label'},
4134 prefetch => 'artist',
4138 ... will work, searching on the record label's name, but only
4139 prefetching the C<artist>.
4141 =head3 Using L</prefetch> with L</select> / L</+select> / L</as> / L</+as>
4143 L</prefetch> implies a L</+select>/L</+as> with the fields of the
4144 prefetched relations. So given:
4146 my $rs = $schema->resultset('CD')->search(
4149 select => ['cd.title'],
4151 prefetch => 'artist',
4155 The L</select> becomes: C<'cd.title', 'artist.*'> and the L</as>
4156 becomes: C<'cd_title', 'artist.*'>.
4160 Prefetch does a lot of deep magic. As such, it may not behave exactly
4161 as you might expect.
4167 Prefetch uses the L</cache> to populate the prefetched relationships. This
4168 may or may not be what you want.
4172 If you specify a condition on a prefetched relationship, ONLY those
4173 rows that match the prefetched condition will be fetched into that relationship.
4174 This means that adding prefetch to a search() B<may alter> what is returned by
4175 traversing a relationship. So, if you have C<< Artist->has_many(CDs) >> and you do
4177 my $artist_rs = $schema->resultset('Artist')->search({
4183 my $count = $artist_rs->first->cds->count;
4185 my $artist_rs_prefetch = $artist_rs->search( {}, { prefetch => 'cds' } );
4187 my $prefetch_count = $artist_rs_prefetch->first->cds->count;
4189 cmp_ok( $count, '==', $prefetch_count, "Counts should be the same" );
4191 that cmp_ok() may or may not pass depending on the datasets involved. This
4192 behavior may or may not survive the 0.09 transition.
4200 =item Value: $source_alias
4204 Sets the source alias for the query. Normally, this defaults to C<me>, but
4205 nested search queries (sub-SELECTs) might need specific aliases set to
4206 reference inner queries. For example:
4209 ->related_resultset('CDs')
4210 ->related_resultset('Tracks')
4212 'track.id' => { -ident => 'none_search.id' },
4216 my $ids = $self->search({
4219 alias => 'none_search',
4220 group_by => 'none_search.id',
4221 })->get_column('id')->as_query;
4223 $self->search({ id => { -in => $ids } })
4225 This attribute is directly tied to L</current_source_alias>.
4235 Makes the resultset paged and specifies the page to retrieve. Effectively
4236 identical to creating a non-pages resultset and then calling ->page($page)
4239 If L</rows> attribute is not specified it defaults to 10 rows per page.
4241 When you have a paged resultset, L</count> will only return the number
4242 of rows in the page. To get the total, use the L</pager> and call
4243 C<total_entries> on it.
4253 Specifies the maximum number of rows for direct retrieval or the number of
4254 rows per page if the page attribute or method is used.
4260 =item Value: $offset
4264 Specifies the (zero-based) row number for the first row to be returned, or the
4265 of the first row of the first page if paging is used.
4267 =head2 software_limit
4271 =item Value: (0 | 1)
4275 When combined with L</rows> and/or L</offset> the generated SQL will not
4276 include any limit dialect stanzas. Instead the entire result will be selected
4277 as if no limits were specified, and DBIC will perform the limit locally, by
4278 artificially advancing and finishing the resulting L</cursor>.
4280 This is the recommended way of performing resultset limiting when no sane RDBMS
4281 implementation is available (e.g.
4282 L<Sybase ASE|DBIx::Class::Storage::DBI::Sybase::ASE> using the
4283 L<Generic Sub Query|DBIx::Class::SQLMaker::LimitDialects/GenericSubQ> hack)
4289 =item Value: \@columns
4293 A arrayref of columns to group by. Can include columns of joined tables.
4295 group_by => [qw/ column1 column2 ... /]
4301 =item Value: $condition
4305 HAVING is a select statement attribute that is applied between GROUP BY and
4306 ORDER BY. It is applied to the after the grouping calculations have been
4309 having => { 'count_employee' => { '>=', 100 } }
4311 or with an in-place function in which case literal SQL is required:
4313 having => \[ 'count(employee) >= ?', [ count => 100 ] ]
4319 =item Value: (0 | 1)
4323 Set to 1 to group by all columns. If the resultset already has a group_by
4324 attribute, this setting is ignored and an appropriate warning is issued.
4330 Adds to the WHERE clause.
4332 # only return rows WHERE deleted IS NULL for all searches
4333 __PACKAGE__->resultset_attributes({ where => { deleted => undef } });
4335 Can be overridden by passing C<< { where => undef } >> as an attribute
4338 For more complicated where clauses see L<SQL::Abstract/WHERE CLAUSES>.
4344 Set to 1 to cache search results. This prevents extra SQL queries if you
4345 revisit rows in your ResultSet:
4347 my $resultset = $schema->resultset('Artist')->search( undef, { cache => 1 } );
4349 while( my $artist = $resultset->next ) {
4353 $rs->first; # without cache, this would issue a query
4355 By default, searches are not cached.
4357 For more examples of using these attributes, see
4358 L<DBIx::Class::Manual::Cookbook>.
4364 =item Value: ( 'update' | 'shared' | \$scalar )
4368 Set to 'update' for a SELECT ... FOR UPDATE or 'shared' for a SELECT
4369 ... FOR SHARED. If \$scalar is passed, this is taken directly and embedded in the
4372 =head1 DBIC BIND VALUES
4374 Because DBIC may need more information to bind values than just the column name
4375 and value itself, it uses a special format for both passing and receiving bind
4376 values. Each bind value should be composed of an arrayref of
4377 C<< [ \%args => $val ] >>. The format of C<< \%args >> is currently:
4383 If present (in any form), this is what is being passed directly to bind_param.
4384 Note that different DBD's expect different bind args. (e.g. DBD::SQLite takes
4385 a single numerical type, while DBD::Pg takes a hashref if bind options.)
4387 If this is specified, all other bind options described below are ignored.
4391 If present, this is used to infer the actual bind attribute by passing to
4392 C<< $resolved_storage->bind_attribute_by_data_type() >>. Defaults to the
4393 "data_type" from the L<add_columns column info|DBIx::Class::ResultSource/add_columns>.
4395 Note that the data type is somewhat freeform (hence the sqlt_ prefix);
4396 currently drivers are expected to "Do the Right Thing" when given a common
4397 datatype name. (Not ideal, but that's what we got at this point.)
4401 Currently used to correctly allocate buffers for bind_param_inout().
4402 Defaults to "size" from the L<add_columns column info|DBIx::Class::ResultSource/add_columns>,
4403 or to a sensible value based on the "data_type".
4407 Used to fill in missing sqlt_datatype and sqlt_size attributes (if they are
4408 explicitly specified they are never overriden). Also used by some weird DBDs,
4409 where the column name should be available at bind_param time (e.g. Oracle).
4413 For backwards compatibility and convenience, the following shortcuts are
4416 [ $name => $val ] === [ { dbic_colname => $name }, $val ]
4417 [ \$dt => $val ] === [ { sqlt_datatype => $dt }, $val ]
4418 [ undef, $val ] === [ {}, $val ]
4420 =head1 AUTHOR AND CONTRIBUTORS
4422 See L<AUTHOR|DBIx::Class/AUTHOR> and L<CONTRIBUTORS|DBIx::Class/CONTRIBUTORS> in DBIx::Class
4426 You may distribute this code under the same terms as Perl itself.