1 package DBIx::Class::ResultSet;
5 use base qw/DBIx::Class/;
7 use DBIx::Class::ResultSetColumn;
8 use Scalar::Util qw/blessed weaken reftype/;
9 use DBIx::Class::_Util 'fail_on_internal_wantarray';
11 use Data::Compare (); # no imports!!! guard against insane architecture
12 use Data::Query::Constants;
13 use Data::Query::ExprHelpers;
14 # not importing first() as it will clash with our own method
18 # De-duplication in _merge_attr() is disabled, but left in for reference
19 # (the merger is used for other things that ought not to be de-duped)
20 *__HM_DEDUP = sub () { 0 };
30 # this is real - CDBICompat overrides it with insanity
31 # yes, prototype won't matter, but that's for now ;)
34 __PACKAGE__->mk_group_accessors('simple' => qw/_result_class result_source/);
38 DBIx::Class::ResultSet - Represents a query used for fetching a set of results.
42 my $users_rs = $schema->resultset('User');
43 while( $user = $users_rs->next) {
44 print $user->username;
47 my $registered_users_rs = $schema->resultset('User')->search({ registered => 1 });
48 my @cds_in_2005 = $schema->resultset('CD')->search({ year => 2005 })->all();
52 A ResultSet is an object which stores a set of conditions representing
53 a query. It is the backbone of DBIx::Class (i.e. the really
54 important/useful bit).
56 No SQL is executed on the database when a ResultSet is created, it
57 just stores all the conditions needed to create the query.
59 A basic ResultSet representing the data of an entire table is returned
60 by calling C<resultset> on a L<DBIx::Class::Schema> and passing in a
61 L<Source|DBIx::Class::Manual::Glossary/Source> name.
63 my $users_rs = $schema->resultset('User');
65 A new ResultSet is returned from calling L</search> on an existing
66 ResultSet. The new one will contain all the conditions of the
67 original, plus any new conditions added in the C<search> call.
69 A ResultSet also incorporates an implicit iterator. L</next> and L</reset>
70 can be used to walk through all the L<DBIx::Class::Row>s the ResultSet
73 The query that the ResultSet represents is B<only> executed against
74 the database when these methods are called:
75 L</find>, L</next>, L</all>, L</first>, L</single>, L</count>.
77 If a resultset is used in a numeric context it returns the L</count>.
78 However, if it is used in a boolean context it is B<always> true. So if
79 you want to check if a resultset has any results, you must use C<if $rs
82 =head1 CUSTOM ResultSet CLASSES THAT USE Moose
84 If you want to make your custom ResultSet classes with L<Moose>, use a template
87 package MyApp::Schema::ResultSet::User;
90 use namespace::autoclean;
92 extends 'DBIx::Class::ResultSet';
94 sub BUILDARGS { $_[2] }
98 __PACKAGE__->meta->make_immutable;
102 The L<MooseX::NonMoose> is necessary so that the L<Moose> constructor does not
103 clash with the regular ResultSet constructor. Alternatively, you can use:
105 __PACKAGE__->meta->make_immutable(inline_constructor => 0);
107 The L<BUILDARGS|Moose::Manual::Construction/BUILDARGS> is necessary because the
108 signature of the ResultSet C<new> is C<< ->new($source, \%args) >>.
112 =head2 Chaining resultsets
114 Let's say you've got a query that needs to be run to return some data
115 to the user. But, you have an authorization system in place that
116 prevents certain users from seeing certain information. So, you want
117 to construct the basic query in one method, but add constraints to it in
122 my $request = $self->get_request; # Get a request object somehow.
123 my $schema = $self->result_source->schema;
125 my $cd_rs = $schema->resultset('CD')->search({
126 title => $request->param('title'),
127 year => $request->param('year'),
130 $cd_rs = $self->apply_security_policy( $cd_rs );
132 return $cd_rs->all();
135 sub apply_security_policy {
144 =head3 Resolving conditions and attributes
146 When a resultset is chained from another resultset (e.g.:
147 C<< my $new_rs = $old_rs->search(\%extra_cond, \%attrs) >>), conditions
148 and attributes with the same keys need resolving.
150 If any of L</columns>, L</select>, L</as> are present, they reset the
151 original selection, and start the selection "clean".
153 The L</join>, L</prefetch>, L</+columns>, L</+select>, L</+as> attributes
154 are merged into the existing ones from the original resultset.
156 The L</where> and L</having> attributes, and any search conditions, are
157 merged with an SQL C<AND> to the existing condition from the original
160 All other attributes are overridden by any new ones supplied in the
163 =head2 Multiple queries
165 Since a resultset just defines a query, you can do all sorts of
166 things with it with the same object.
168 # Don't hit the DB yet.
169 my $cd_rs = $schema->resultset('CD')->search({
170 title => 'something',
174 # Each of these hits the DB individually.
175 my $count = $cd_rs->count;
176 my $most_recent = $cd_rs->get_column('date_released')->max();
177 my @records = $cd_rs->all;
179 And it's not just limited to SELECT statements.
185 $cd_rs->create({ artist => 'Fred' });
187 Which is the same as:
189 $schema->resultset('CD')->create({
190 title => 'something',
195 See: L</search>, L</count>, L</get_column>, L</all>, L</create>.
203 =item Arguments: L<$source|DBIx::Class::ResultSource>, L<\%attrs?|/ATTRIBUTES>
205 =item Return Value: L<$resultset|/search>
209 The resultset constructor. Takes a source object (usually a
210 L<DBIx::Class::ResultSourceProxy::Table>) and an attribute hash (see
211 L</ATTRIBUTES> below). Does not perform any queries -- these are
212 executed as needed by the other methods.
214 Generally you never construct a resultset manually. Instead you get one
216 C<< $schema->L<resultset|DBIx::Class::Schema/resultset>('$source_name') >>
217 or C<< $another_resultset->L<search|/search>(...) >> (the later called in
220 my $rs = $schema->resultset('CD')->search({ title => '100th Window' });
226 If called on an object, proxies to L</new_result> instead, so
228 my $cd = $schema->resultset('CD')->new({ title => 'Spoon' });
230 will return a CD object, not a ResultSet, and is equivalent to:
232 my $cd = $schema->resultset('CD')->new_result({ title => 'Spoon' });
234 Please also keep in mind that many internals call L</new_result> directly,
235 so overloading this method with the idea of intercepting new result object
236 creation B<will not work>. See also warning pertaining to L</create>.
244 return $class->new_result(@_) if ref $class;
246 my ($source, $attrs) = @_;
247 $source = $source->resolve
248 if $source->isa('DBIx::Class::ResultSourceHandle');
250 $attrs = { %{$attrs||{}} };
251 delete @{$attrs}{qw(_sqlmaker_select_args _related_results_construction)};
253 if ($attrs->{page}) {
254 $attrs->{rows} ||= 10;
257 $attrs->{alias} ||= 'me';
260 result_source => $source,
261 cond => $attrs->{where},
266 # if there is a dark selector, this means we are already in a
267 # chain and the cleanup/sanification was taken care of by
269 $self->_normalize_selection($attrs)
270 unless $attrs->{_dark_selector};
273 $attrs->{result_class} || $source->result_class
283 =item Arguments: L<$cond|DBIx::Class::SQLMaker> | undef, L<\%attrs?|/ATTRIBUTES>
285 =item Return Value: $resultset (scalar context) | L<@result_objs|DBIx::Class::Manual::ResultClass> (list context)
289 my @cds = $cd_rs->search({ year => 2001 }); # "... WHERE year = 2001"
290 my $new_rs = $cd_rs->search({ year => 2005 });
292 my $new_rs = $cd_rs->search([ { year => 2005 }, { year => 2004 } ]);
293 # year = 2005 OR year = 2004
295 In list context, C<< ->all() >> is called implicitly on the resultset, thus
296 returning a list of L<result|DBIx::Class::Manual::ResultClass> objects instead.
297 To avoid that, use L</search_rs>.
299 If you need to pass in additional attributes but no additional condition,
300 call it as C<search(undef, \%attrs)>.
302 # "SELECT name, artistid FROM $artist_table"
303 my @all_artists = $schema->resultset('Artist')->search(undef, {
304 columns => [qw/name artistid/],
307 For a list of attributes that can be passed to C<search>, see
308 L</ATTRIBUTES>. For more examples of using this function, see
309 L<Searching|DBIx::Class::Manual::Cookbook/SEARCHING>. For a complete
310 documentation for the first argument, see L<SQL::Abstract/"WHERE CLAUSES">
311 and its extension L<DBIx::Class::SQLMaker>.
313 For more help on using joins with search, see L<DBIx::Class::Manual::Joining>.
317 Note that L</search> does not process/deflate any of the values passed in the
318 L<SQL::Abstract>-compatible search condition structure. This is unlike other
319 condition-bound methods L</new_result>, L</create> and L</find>. The user must ensure
320 manually that any value passed to this method will stringify to something the
321 RDBMS knows how to deal with. A notable example is the handling of L<DateTime>
322 objects, for more info see:
323 L<DBIx::Class::Manual::Cookbook/Formatting DateTime objects in queries>.
329 my $rs = $self->search_rs( @_ );
332 DBIx::Class::_ENV_::ASSERT_NO_INTERNAL_WANTARRAY and my $sog = fail_on_internal_wantarray($rs);
335 elsif (defined wantarray) {
339 # we can be called by a relationship helper, which in
340 # turn may be called in void context due to some braindead
341 # overload or whatever else the user decided to be clever
342 # at this particular day. Thus limit the exception to
343 # external code calls only
344 $self->throw_exception ('->search is *not* a mutator, calling it in void context makes no sense')
345 if (caller)[0] !~ /^\QDBIx::Class::/;
355 =item Arguments: L<$cond|DBIx::Class::SQLMaker>, L<\%attrs?|/ATTRIBUTES>
357 =item Return Value: L<$resultset|/search>
361 This method does the same exact thing as search() except it will
362 always return a resultset, even in list context.
369 my $rsrc = $self->result_source;
370 my ($call_cond, $call_attrs);
372 # Special-case handling for (undef, undef) or (undef)
373 # Note that (foo => undef) is valid deprecated syntax
374 @_ = () if not scalar grep { defined $_ } @_;
380 # fish out attrs in the ($condref, $attr) case
381 elsif (@_ == 2 and ( ! defined $_[0] or (ref $_[0]) ne '') ) {
382 ($call_cond, $call_attrs) = @_;
385 $self->throw_exception('Odd number of arguments to search')
389 carp_unique 'search( %condition ) is deprecated, use search( \%condition ) instead'
390 unless $rsrc->result_class->isa('DBIx::Class::CDBICompat');
392 for my $i (0 .. $#_) {
394 $self->throw_exception ('All keys in condition key/value pairs must be plain scalars')
395 if (! defined $_[$i] or ref $_[$i] ne '');
401 if (blessed($call_cond) and $call_cond->isa('Data::Query::ExprBuilder')) {
402 $call_cond = \$call_cond->{expr};
405 # see if we can keep the cache (no $rs changes)
407 my %safe = (alias => 1, cache => 1);
408 if ( ! List::Util::first { !$safe{$_} } keys %$call_attrs and (
411 ref $call_cond eq 'HASH' && ! keys %$call_cond
413 ref $call_cond eq 'ARRAY' && ! @$call_cond
415 $cache = $self->get_cache;
418 my $old_attrs = { %{$self->{attrs}} };
419 my ($old_having, $old_where) = delete @{$old_attrs}{qw(having where)};
421 my $new_attrs = { %$old_attrs };
423 # take care of call attrs (only if anything is changing)
424 if ($call_attrs and keys %$call_attrs) {
426 # copy for _normalize_selection
427 $call_attrs = { %$call_attrs };
429 my @selector_attrs = qw/select as columns cols +select +as +columns include_columns/;
431 # reset the current selector list if new selectors are supplied
432 if (List::Util::first { exists $call_attrs->{$_} } qw/columns cols select as/) {
433 delete @{$old_attrs}{(@selector_attrs, '_dark_selector')};
436 # Normalize the new selector list (operates on the passed-in attr structure)
437 # Need to do it on every chain instead of only once on _resolved_attrs, in
438 # order to allow detection of empty vs partial 'as'
439 $call_attrs->{_dark_selector} = $old_attrs->{_dark_selector}
440 if $old_attrs->{_dark_selector};
441 $self->_normalize_selection ($call_attrs);
443 # start with blind overwriting merge, exclude selector attrs
444 $new_attrs = { %{$old_attrs}, %{$call_attrs} };
445 delete @{$new_attrs}{@selector_attrs};
447 for (@selector_attrs) {
448 $new_attrs->{$_} = $self->_merge_attr($old_attrs->{$_}, $call_attrs->{$_})
449 if ( exists $old_attrs->{$_} or exists $call_attrs->{$_} );
452 # older deprecated name, use only if {columns} is not there
453 if (my $c = delete $new_attrs->{cols}) {
454 carp_unique( "Resultset attribute 'cols' is deprecated, use 'columns' instead" );
455 if ($new_attrs->{columns}) {
456 carp "Resultset specifies both the 'columns' and the legacy 'cols' attributes - ignoring 'cols'";
459 $new_attrs->{columns} = $c;
464 # join/prefetch use their own crazy merging heuristics
465 foreach my $key (qw/join prefetch/) {
466 $new_attrs->{$key} = $self->_merge_joinpref_attr($old_attrs->{$key}, $call_attrs->{$key})
467 if exists $call_attrs->{$key};
470 # stack binds together
471 $new_attrs->{bind} = [ @{ $old_attrs->{bind} || [] }, @{ $call_attrs->{bind} || [] } ];
475 for ($old_where, $call_cond) {
477 $new_attrs->{where} = $self->_stack_cond (
478 $_, $new_attrs->{where}
483 if (defined $old_having) {
484 $new_attrs->{having} = $self->_stack_cond (
485 $old_having, $new_attrs->{having}
489 my $rs = (ref $self)->new($rsrc, $new_attrs);
491 $rs->set_cache($cache) if ($cache);
497 sub _normalize_selection {
498 my ($self, $attrs) = @_;
501 if ( exists $attrs->{include_columns} ) {
502 carp_unique( "Resultset attribute 'include_columns' is deprecated, use '+columns' instead" );
503 $attrs->{'+columns'} = $self->_merge_attr(
504 $attrs->{'+columns'}, delete $attrs->{include_columns}
508 # columns are always placed first, however
510 # Keep the X vs +X separation until _resolved_attrs time - this allows to
511 # delay the decision on whether to use a default select list ($rsrc->columns)
512 # allowing stuff like the remove_columns helper to work
514 # select/as +select/+as pairs need special handling - the amount of select/as
515 # elements in each pair does *not* have to be equal (think multicolumn
516 # selectors like distinct(foo, bar) ). If the selector is bare (no 'as'
517 # supplied at all) - try to infer the alias, either from the -as parameter
518 # of the selector spec, or use the parameter whole if it looks like a column
519 # name (ugly legacy heuristic). If all fails - leave the selector bare (which
520 # is ok as well), but make sure no more additions to the 'as' chain take place
521 for my $pref ('', '+') {
523 my ($sel, $as) = map {
524 my $key = "${pref}${_}";
526 my $val = [ ref $attrs->{$key} eq 'ARRAY'
528 : $attrs->{$key} || ()
530 delete $attrs->{$key};
534 if (! @$as and ! @$sel ) {
537 elsif (@$as and ! @$sel) {
538 $self->throw_exception(
539 "Unable to handle ${pref}as specification (@$as) without a corresponding ${pref}select"
543 # no as part supplied at all - try to deduce (unless explicit end of named selection is declared)
544 # if any @$as has been supplied we assume the user knows what (s)he is doing
545 # and blindly keep stacking up pieces
546 unless ($attrs->{_dark_selector}) {
549 if ( ref $_ eq 'HASH' and exists $_->{-as} ) {
550 push @$as, $_->{-as};
552 # assume any plain no-space, no-parenthesis string to be a column spec
553 # FIXME - this is retarded but is necessary to support shit like 'count(foo)'
554 elsif ( ! ref $_ and $_ =~ /^ [^\s\(\)]+ $/x) {
557 # if all else fails - raise a flag that no more aliasing will be allowed
559 $attrs->{_dark_selector} = {
561 string => ($dark_sel_dumper ||= do {
562 require Data::Dumper::Concise;
563 Data::Dumper::Concise::DumperObject()->Indent(0);
564 })->Values([$_])->Dump
572 elsif (@$as < @$sel) {
573 $self->throw_exception(
574 "Unable to handle an ${pref}as specification (@$as) with less elements than the corresponding ${pref}select"
577 elsif ($pref and $attrs->{_dark_selector}) {
578 $self->throw_exception(
579 "Unable to process named '+select', resultset contains an unnamed selector $attrs->{_dark_selector}{string}"
585 $attrs->{"${pref}select"} = $self->_merge_attr($attrs->{"${pref}select"}, $sel);
586 $attrs->{"${pref}as"} = $self->_merge_attr($attrs->{"${pref}as"}, $as);
591 my ($self, $left, $right) = @_;
593 # collapse single element top-level conditions
594 # (single pass only, unlikely to need recursion)
595 for ($left, $right) {
596 if (ref $_ eq 'ARRAY') {
604 elsif (ref $_ eq 'HASH') {
605 my ($first, $more) = keys %$_;
608 if (! defined $first) {
612 elsif (! defined $more) {
613 if ($first eq '-and' and ref $_->{'-and'} eq 'HASH') {
616 elsif ($first eq '-or' and ref $_->{'-or'} eq 'ARRAY') {
623 # merge hashes with weeding out of duplicates (simple cases only)
624 if (ref $left eq 'HASH' and ref $right eq 'HASH') {
626 # shallow copy to destroy
627 $right = { %$right };
628 for (grep { exists $right->{$_} } keys %$left) {
629 # the use of eq_deeply here is justified - the rhs of an
630 # expression can contain a lot of twisted weird stuff
631 delete $right->{$_} if Data::Compare::Compare( $left->{$_}, $right->{$_} );
634 $right = undef unless keys %$right;
638 if (defined $left xor defined $right) {
639 return defined $left ? $left : $right;
641 elsif (! defined $left) {
645 return { -and => [ $left, $right ] };
649 =head2 search_literal
651 B<CAVEAT>: C<search_literal> is provided for Class::DBI compatibility and
652 should only be used in that context. C<search_literal> is a convenience
653 method. It is equivalent to calling C<< $schema->search(\[]) >>, but if you
654 want to ensure columns are bound correctly, use L</search>.
656 See L<DBIx::Class::Manual::Cookbook/SEARCHING> and
657 L<DBIx::Class::Manual::FAQ/Searching> for searching techniques that do not
658 require C<search_literal>.
662 =item Arguments: $sql_fragment, @standalone_bind_values
664 =item Return Value: L<$resultset|/search> (scalar context) | L<@result_objs|DBIx::Class::Manual::ResultClass> (list context)
668 my @cds = $cd_rs->search_literal('year = ? AND title = ?', qw/2001 Reload/);
669 my $newrs = $artist_rs->search_literal('name = ?', 'Metallica');
671 Pass a literal chunk of SQL to be added to the conditional part of the
674 Example of how to use C<search> instead of C<search_literal>
676 my @cds = $cd_rs->search_literal('cdid = ? AND (artist = ? OR artist = ?)', (2, 1, 2));
677 my @cds = $cd_rs->search(\[ 'cdid = ? AND (artist = ? OR artist = ?)', [ 'cdid', 2 ], [ 'artist', 1 ], [ 'artist', 2 ] ]);
682 my ($self, $sql, @bind) = @_;
684 if ( @bind && ref($bind[-1]) eq 'HASH' ) {
687 return $self->search(\[ $sql, map [ {} => $_ ], @bind ], ($attr || () ));
694 =item Arguments: \%columns_values | @pk_values, { key => $unique_constraint, L<%attrs|/ATTRIBUTES> }?
696 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass> | undef
700 Finds and returns a single row based on supplied criteria. Takes either a
701 hashref with the same format as L</create> (including inference of foreign
702 keys from related objects), or a list of primary key values in the same
703 order as the L<primary columns|DBIx::Class::ResultSource/primary_columns>
704 declaration on the L</result_source>.
706 In either case an attempt is made to combine conditions already existing on
707 the resultset with the condition passed to this method.
709 To aid with preparing the correct query for the storage you may supply the
710 C<key> attribute, which is the name of a
711 L<unique constraint|DBIx::Class::ResultSource/add_unique_constraint> (the
712 unique constraint corresponding to the
713 L<primary columns|DBIx::Class::ResultSource/primary_columns> is always named
714 C<primary>). If the C<key> attribute has been supplied, and DBIC is unable
715 to construct a query that satisfies the named unique constraint fully (
716 non-NULL values for each column member of the constraint) an exception is
719 If no C<key> is specified, the search is carried over all unique constraints
720 which are fully defined by the available condition.
722 If no such constraint is found, C<find> currently defaults to a simple
723 C<< search->(\%column_values) >> which may or may not do what you expect.
724 Note that this fallback behavior may be deprecated in further versions. If
725 you need to search with arbitrary conditions - use L</search>. If the query
726 resulting from this fallback produces more than one row, a warning to the
727 effect is issued, though only the first row is constructed and returned as
730 In addition to C<key>, L</find> recognizes and applies standard
731 L<resultset attributes|/ATTRIBUTES> in the same way as L</search> does.
733 Note that if you have extra concerns about the correctness of the resulting
734 query you need to specify the C<key> attribute and supply the entire condition
735 as an argument to find (since it is not always possible to perform the
736 combination of the resultset condition with the supplied one, especially if
737 the resultset condition contains literal sql).
739 For example, to find a row by its primary key:
741 my $cd = $schema->resultset('CD')->find(5);
743 You can also find a row by a specific unique constraint:
745 my $cd = $schema->resultset('CD')->find(
747 artist => 'Massive Attack',
748 title => 'Mezzanine',
750 { key => 'cd_artist_title' }
753 See also L</find_or_create> and L</update_or_create>.
759 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
761 my $rsrc = $self->result_source;
764 if (exists $attrs->{key}) {
765 $constraint_name = defined $attrs->{key}
767 : $self->throw_exception("An undefined 'key' resultset attribute makes no sense")
771 # Parse out the condition from input
774 if (ref $_[0] eq 'HASH') {
775 $call_cond = { %{$_[0]} };
778 # if only values are supplied we need to default to 'primary'
779 $constraint_name = 'primary' unless defined $constraint_name;
781 my @c_cols = $rsrc->unique_constraint_columns($constraint_name);
783 $self->throw_exception(
784 "No constraint columns, maybe a malformed '$constraint_name' constraint?"
787 $self->throw_exception (
788 'find() expects either a column/value hashref, or a list of values '
789 . "corresponding to the columns of the specified unique constraint '$constraint_name'"
790 ) unless @c_cols == @_;
793 @{$call_cond}{@c_cols} = @_;
797 for my $key (keys %$call_cond) {
799 my $keyref = ref($call_cond->{$key})
801 my $relinfo = $rsrc->relationship_info($key)
803 my $val = delete $call_cond->{$key};
805 next if $keyref eq 'ARRAY'; # has_many for multi_create
807 my $rel_q = $rsrc->_resolve_condition(
808 $relinfo->{cond}, $val, $key, $key
810 die "Can't handle complex relationship conditions in find" if ref($rel_q) ne 'HASH';
811 @related{keys %$rel_q} = values %$rel_q;
815 # relationship conditions take precedence (?)
816 @{$call_cond}{keys %related} = values %related;
818 my $alias = exists $attrs->{alias} ? $attrs->{alias} : $self->{attrs}{alias};
820 if (defined $constraint_name) {
821 $final_cond = $self->_qualify_cond_columns (
823 $self->_build_unique_cond (
831 elsif ($self->{attrs}{accessor} and $self->{attrs}{accessor} eq 'single') {
832 # This means that we got here after a merger of relationship conditions
833 # in ::Relationship::Base::search_related (the row method), and furthermore
834 # the relationship is of the 'single' type. This means that the condition
835 # provided by the relationship (already attached to $self) is sufficient,
836 # as there can be only one row in the database that would satisfy the
840 # no key was specified - fall down to heuristics mode:
841 # run through all unique queries registered on the resultset, and
842 # 'OR' all qualifying queries together
843 my (@unique_queries, %seen_column_combinations);
844 for my $c_name ($rsrc->unique_constraint_names) {
845 next if $seen_column_combinations{
846 join "\x00", sort $rsrc->unique_constraint_columns($c_name)
849 push @unique_queries, try {
850 $self->_build_unique_cond ($c_name, $call_cond, 'croak_on_nulls')
854 $final_cond = @unique_queries
855 ? [ map { $self->_qualify_cond_columns($_, $alias) } @unique_queries ]
856 : $self->_non_unique_find_fallback ($call_cond, $attrs)
860 # Run the query, passing the result_class since it should propagate for find
861 my $rs = $self->search ($final_cond, {result_class => $self->result_class, %$attrs});
862 if ($rs->_resolved_attrs->{collapse}) {
864 carp "Query returned more than one row" if $rs->next;
872 # This is a stop-gap method as agreed during the discussion on find() cleanup:
873 # http://lists.scsys.co.uk/pipermail/dbix-class/2010-October/009535.html
875 # It is invoked when find() is called in legacy-mode with insufficiently-unique
876 # condition. It is provided for overrides until a saner way forward is devised
878 # *NOTE* This is not a public method, and it's *GUARANTEED* to disappear down
879 # the road. Please adjust your tests accordingly to catch this situation early
880 # DBIx::Class::ResultSet->can('_non_unique_find_fallback') is reasonable
882 # The method will not be removed without an adequately complete replacement
883 # for strict-mode enforcement
884 sub _non_unique_find_fallback {
885 my ($self, $cond, $attrs) = @_;
887 return $self->_qualify_cond_columns(
889 exists $attrs->{alias}
891 : $self->{attrs}{alias}
896 sub _qualify_cond_columns {
897 my ($self, $cond, $alias) = @_;
899 my %aliased = %$cond;
900 for (keys %aliased) {
901 $aliased{"$alias.$_"} = delete $aliased{$_}
908 sub _build_unique_cond {
909 my ($self, $constraint_name, $extra_cond, $croak_on_null) = @_;
911 my @c_cols = $self->result_source->unique_constraint_columns($constraint_name);
913 # combination may fail if $self->{cond} is non-trivial
914 my ($final_cond) = try {
915 $self->_merge_with_rscond ($extra_cond)
920 # trim out everything not in $columns
921 $final_cond = { map {
922 exists $final_cond->{$_}
923 ? ( $_ => $final_cond->{$_} )
927 if (my @missing = grep
928 { ! ($croak_on_null ? defined $final_cond->{$_} : exists $final_cond->{$_}) }
931 $self->throw_exception( sprintf ( "Unable to satisfy requested constraint '%s', no values for column(s): %s",
933 join (', ', map { "'$_'" } @missing),
940 !$ENV{DBIC_NULLABLE_KEY_NOWARN}
942 my @undefs = sort grep { ! defined $final_cond->{$_} } (keys %$final_cond)
944 carp_unique ( sprintf (
945 "NULL/undef values supplied for requested unique constraint '%s' (NULL "
946 . 'values in column(s): %s). This is almost certainly not what you wanted, '
947 . 'though you can set DBIC_NULLABLE_KEY_NOWARN to disable this warning.',
949 join (', ', map { "'$_'" } @undefs),
956 =head2 search_related
960 =item Arguments: $rel_name, $cond?, L<\%attrs?|/ATTRIBUTES>
962 =item Return Value: L<$resultset|/search> (scalar context) | L<@result_objs|DBIx::Class::Manual::ResultClass> (list context)
966 $new_rs = $cd_rs->search_related('artist', {
970 Searches the specified relationship, optionally specifying a condition and
971 attributes for matching records. See L</ATTRIBUTES> for more information.
973 In list context, C<< ->all() >> is called implicitly on the resultset, thus
974 returning a list of result objects instead. To avoid that, use L</search_related_rs>.
976 See also L</search_related_rs>.
981 return shift->related_resultset(shift)->search(@_);
984 =head2 search_related_rs
986 This method works exactly the same as search_related, except that
987 it guarantees a resultset, even in list context.
991 sub search_related_rs {
992 return shift->related_resultset(shift)->search_rs(@_);
999 =item Arguments: none
1001 =item Return Value: L<$cursor|DBIx::Class::Cursor>
1005 Returns a storage-driven cursor to the given resultset. See
1006 L<DBIx::Class::Cursor> for more information.
1013 return $self->{cursor} ||= do {
1014 my $attrs = $self->_resolved_attrs;
1015 $self->result_source->storage->select(
1016 $attrs->{from}, $attrs->{select}, $attrs->{where}, $attrs
1025 =item Arguments: L<$cond?|DBIx::Class::SQLMaker>
1027 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass> | undef
1031 my $cd = $schema->resultset('CD')->single({ year => 2001 });
1033 Inflates the first result without creating a cursor if the resultset has
1034 any records in it; if not returns C<undef>. Used by L</find> as a lean version
1037 While this method can take an optional search condition (just like L</search>)
1038 being a fast-code-path it does not recognize search attributes. If you need to
1039 add extra joins or similar, call L</search> and then chain-call L</single> on the
1040 L<DBIx::Class::ResultSet> returned.
1046 As of 0.08100, this method enforces the assumption that the preceding
1047 query returns only one row. If more than one row is returned, you will receive
1050 Query returned more than one row
1052 In this case, you should be using L</next> or L</find> instead, or if you really
1053 know what you are doing, use the L</rows> attribute to explicitly limit the size
1056 This method will also throw an exception if it is called on a resultset prefetching
1057 has_many, as such a prefetch implies fetching multiple rows from the database in
1058 order to assemble the resulting object.
1065 my ($self, $where) = @_;
1067 $self->throw_exception('single() only takes search conditions, no attributes. You want ->search( $cond, $attrs )->single()');
1070 my $attrs = { %{$self->_resolved_attrs} };
1072 $self->throw_exception(
1073 'single() can not be used on resultsets collapsing a has_many. Use find( \%cond ) or next() instead'
1074 ) if $attrs->{collapse};
1077 if (defined $attrs->{where}) {
1080 [ map { ref $_ eq 'ARRAY' ? [ -or => $_ ] : $_ }
1081 $where, delete $attrs->{where} ]
1084 $attrs->{where} = $where;
1088 my $data = [ $self->result_source->storage->select_single(
1089 $attrs->{from}, $attrs->{select},
1090 $attrs->{where}, $attrs
1093 return undef unless @$data;
1094 $self->{_stashed_rows} = [ $data ];
1095 $self->_construct_results->[0];
1101 # Recursively collapse the query, accumulating values for each column.
1103 sub _collapse_query {
1104 my ($self, $query, $collapsed) = @_;
1108 if (ref $query eq 'ARRAY') {
1109 foreach my $subquery (@$query) {
1110 next unless ref $subquery; # -or
1111 $collapsed = $self->_collapse_query($subquery, $collapsed);
1114 elsif (ref $query eq 'HASH') {
1115 if (keys %$query and (keys %$query)[0] eq '-and') {
1116 foreach my $subquery (@{$query->{-and}}) {
1117 $collapsed = $self->_collapse_query($subquery, $collapsed);
1121 foreach my $col (keys %$query) {
1122 my $value = $query->{$col};
1123 $collapsed->{$col}{$value}++;
1135 =item Arguments: L<$cond?|DBIx::Class::SQLMaker>
1137 =item Return Value: L<$resultsetcolumn|DBIx::Class::ResultSetColumn>
1141 my $max_length = $rs->get_column('length')->max;
1143 Returns a L<DBIx::Class::ResultSetColumn> instance for a column of the ResultSet.
1148 my ($self, $column) = @_;
1149 my $new = DBIx::Class::ResultSetColumn->new($self, $column);
1157 =item Arguments: L<$cond|DBIx::Class::SQLMaker>, L<\%attrs?|/ATTRIBUTES>
1159 =item Return Value: L<$resultset|/search> (scalar context) | L<@result_objs|DBIx::Class::Manual::ResultClass> (list context)
1163 # WHERE title LIKE '%blue%'
1164 $cd_rs = $rs->search_like({ title => '%blue%'});
1166 Performs a search, but uses C<LIKE> instead of C<=> as the condition. Note
1167 that this is simply a convenience method retained for ex Class::DBI users.
1168 You most likely want to use L</search> with specific operators.
1170 For more information, see L<DBIx::Class::Manual::Cookbook>.
1172 This method is deprecated and will be removed in 0.09. Use L</search()>
1173 instead. An example conversion is:
1175 ->search_like({ foo => 'bar' });
1179 ->search({ foo => { like => 'bar' } });
1186 'search_like() is deprecated and will be removed in DBIC version 0.09.'
1187 .' Instead use ->search({ x => { -like => "y%" } })'
1188 .' (note the outer pair of {}s - they are important!)'
1190 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
1191 my $query = ref $_[0] eq 'HASH' ? { %{shift()} }: {@_};
1192 $query->{$_} = { 'like' => $query->{$_} } for keys %$query;
1193 return $class->search($query, { %$attrs });
1200 =item Arguments: $first, $last
1202 =item Return Value: L<$resultset|/search> (scalar context) | L<@result_objs|DBIx::Class::Manual::ResultClass> (list context)
1206 Returns a resultset or object list representing a subset of elements from the
1207 resultset slice is called on. Indexes are from 0, i.e., to get the first
1208 three records, call:
1210 my ($one, $two, $three) = $rs->slice(0, 2);
1215 my ($self, $min, $max) = @_;
1216 my $attrs = {}; # = { %{ $self->{attrs} || {} } };
1217 $attrs->{offset} = $self->{attrs}{offset} || 0;
1218 $attrs->{offset} += $min;
1219 $attrs->{rows} = ($max ? ($max - $min + 1) : 1);
1220 return $self->search(undef, $attrs);
1227 =item Arguments: none
1229 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass> | undef
1233 Returns the next element in the resultset (C<undef> is there is none).
1235 Can be used to efficiently iterate over records in the resultset:
1237 my $rs = $schema->resultset('CD')->search;
1238 while (my $cd = $rs->next) {
1242 Note that you need to store the resultset object, and call C<next> on it.
1243 Calling C<< resultset('Table')->next >> repeatedly will always return the
1244 first record from the resultset.
1251 if (my $cache = $self->get_cache) {
1252 $self->{all_cache_position} ||= 0;
1253 return $cache->[$self->{all_cache_position}++];
1256 if ($self->{attrs}{cache}) {
1257 delete $self->{pager};
1258 $self->{all_cache_position} = 1;
1259 return ($self->all)[0];
1262 return shift(@{$self->{_stashed_results}}) if @{ $self->{_stashed_results}||[] };
1264 $self->{_stashed_results} = $self->_construct_results
1267 return shift @{$self->{_stashed_results}};
1270 # Constructs as many results as it can in one pass while respecting
1271 # cursor laziness. Several modes of operation:
1273 # * Always builds everything present in @{$self->{_stashed_rows}}
1274 # * If called with $fetch_all true - pulls everything off the cursor and
1275 # builds all result structures (or objects) in one pass
1276 # * If $self->_resolved_attrs->{collapse} is true, checks the order_by
1277 # and if the resultset is ordered properly by the left side:
1278 # * Fetches stuff off the cursor until the "master object" changes,
1279 # and saves the last extra row (if any) in @{$self->{_stashed_rows}}
1281 # * Just fetches, and collapses/constructs everything as if $fetch_all
1282 # was requested (there is no other way to collapse except for an
1284 # * If no collapse is requested - just get the next row, construct and
1286 sub _construct_results {
1287 my ($self, $fetch_all) = @_;
1289 my $rsrc = $self->result_source;
1290 my $attrs = $self->_resolved_attrs;
1295 ! $attrs->{order_by}
1299 my @pcols = $rsrc->primary_columns
1301 # default order for collapsing unless the user asked for something
1302 $attrs->{order_by} = [ map { join '.', $attrs->{alias}, $_} @pcols ];
1303 $attrs->{_ordered_for_collapse} = 1;
1304 $attrs->{_order_is_artificial} = 1;
1307 # this will be used as both initial raw-row collector AND as a RV of
1308 # _construct_results. Not regrowing the array twice matters a lot...
1309 # a surprising amount actually
1310 my $rows = delete $self->{_stashed_rows};
1312 my $cursor; # we may not need one at all
1314 my $did_fetch_all = $fetch_all;
1317 # FIXME SUBOPTIMAL - we can do better, cursor->next/all (well diff. methods) should return a ref
1318 $rows = [ ($rows ? @$rows : ()), $self->cursor->all ];
1320 elsif( $attrs->{collapse} ) {
1322 # a cursor will need to be closed over in case of collapse
1323 $cursor = $self->cursor;
1325 $attrs->{_ordered_for_collapse} = (
1331 ->_main_source_order_by_portion_is_stable($rsrc, $attrs->{order_by}, $attrs->{where})
1333 ) unless defined $attrs->{_ordered_for_collapse};
1335 if (! $attrs->{_ordered_for_collapse}) {
1338 # instead of looping over ->next, use ->all in stealth mode
1339 # *without* calling a ->reset afterwards
1340 # FIXME ENCAPSULATION - encapsulation breach, cursor method additions pending
1341 if (! $cursor->{_done}) {
1342 $rows = [ ($rows ? @$rows : ()), $cursor->all ];
1343 $cursor->{_done} = 1;
1348 if (! $did_fetch_all and ! @{$rows||[]} ) {
1349 # FIXME SUBOPTIMAL - we can do better, cursor->next/all (well diff. methods) should return a ref
1350 $cursor ||= $self->cursor;
1351 if (scalar (my @r = $cursor->next) ) {
1356 return undef unless @{$rows||[]};
1358 # sanity check - people are too clever for their own good
1359 if ($attrs->{collapse} and my $aliastypes = $attrs->{_sqlmaker_select_args}[3]{_aliastypes} ) {
1361 my $multiplied_selectors;
1362 for my $sel_alias ( grep { $_ ne $attrs->{alias} } keys %{ $aliastypes->{selecting} } ) {
1364 $aliastypes->{multiplying}{$sel_alias}
1366 $aliastypes->{premultiplied}{$sel_alias}
1368 $multiplied_selectors->{$_} = 1 for values %{$aliastypes->{selecting}{$sel_alias}{-seen_columns}}
1372 for my $i (0 .. $#{$attrs->{as}} ) {
1373 my $sel = $attrs->{select}[$i];
1375 if (ref $sel eq 'SCALAR') {
1378 elsif( ref $sel eq 'REF' and ref $$sel eq 'ARRAY' ) {
1382 $self->throw_exception(
1383 'Result collapse not possible - selection from a has_many source redirected to the main object'
1384 ) if ($multiplied_selectors->{$sel} and $attrs->{as}[$i] !~ /\./);
1388 # hotspot - skip the setter
1389 my $res_class = $self->_result_class;
1391 my $inflator_cref = $self->{_result_inflator}{cref} ||= do {
1392 $res_class->can ('inflate_result')
1393 or $self->throw_exception("Inflator $res_class does not provide an inflate_result() method");
1396 my $infmap = $attrs->{as};
1398 $self->{_result_inflator}{is_core_row} = ( (
1401 ( \&DBIx::Class::Row::inflate_result || die "No ::Row::inflate_result() - can't happen" )
1402 ) ? 1 : 0 ) unless defined $self->{_result_inflator}{is_core_row};
1404 $self->{_result_inflator}{is_hri} = ( (
1405 ! $self->{_result_inflator}{is_core_row}
1408 require DBIx::Class::ResultClass::HashRefInflator
1410 DBIx::Class::ResultClass::HashRefInflator->can('inflate_result')
1412 ) ? 1 : 0 ) unless defined $self->{_result_inflator}{is_hri};
1415 if (! $attrs->{_related_results_construction}) {
1416 # construct a much simpler array->hash folder for the one-table cases right here
1417 if ($self->{_result_inflator}{is_hri}) {
1418 for my $r (@$rows) {
1419 $r = { map { $infmap->[$_] => $r->[$_] } 0..$#$infmap };
1422 # FIXME SUBOPTIMAL this is a very very very hot spot
1423 # while rather optimal we can *still* do much better, by
1424 # building a smarter Row::inflate_result(), and
1425 # switch to feeding it data via a much leaner interface
1427 # crude unscientific benchmarking indicated the shortcut eval is not worth it for
1428 # this particular resultset size
1429 elsif (@$rows < 60) {
1430 for my $r (@$rows) {
1431 $r = $inflator_cref->($res_class, $rsrc, { map { $infmap->[$_] => $r->[$_] } (0..$#$infmap) } );
1436 '$_ = $inflator_cref->($res_class, $rsrc, { %s }) for @$rows',
1437 join (', ', map { "\$infmap->[$_] => \$_->[$_]" } 0..$#$infmap )
1443 $self->{_result_inflator}{is_hri} ? 'hri'
1444 : $self->{_result_inflator}{is_core_row} ? 'classic_pruning'
1445 : 'classic_nonpruning'
1448 # $args and $attrs to _mk_row_parser are separated to delineate what is
1449 # core collapser stuff and what is dbic $rs specific
1450 @{$self->{_row_parser}{$parser_type}}{qw(cref nullcheck)} = $rsrc->_mk_row_parser({
1452 inflate_map => $infmap,
1453 collapse => $attrs->{collapse},
1454 premultiplied => $attrs->{_main_source_premultiplied},
1455 hri_style => $self->{_result_inflator}{is_hri},
1456 prune_null_branches => $self->{_result_inflator}{is_hri} || $self->{_result_inflator}{is_core_row},
1457 }, $attrs) unless $self->{_row_parser}{$parser_type}{cref};
1459 # column_info metadata historically hasn't been too reliable.
1460 # We need to start fixing this somehow (the collapse resolver
1461 # can't work without it). Add an explicit check for the *main*
1462 # result, hopefully this will gradually weed out such errors
1464 # FIXME - this is a temporary kludge that reduces performance
1465 # It is however necessary for the time being
1466 my ($unrolled_non_null_cols_to_check, $err);
1468 if (my $check_non_null_cols = $self->{_row_parser}{$parser_type}{nullcheck} ) {
1471 'Collapse aborted due to invalid ResultSource metadata - the following '
1472 . 'selections are declared non-nullable but NULLs were retrieved: '
1476 COL: for my $i (@$check_non_null_cols) {
1477 ! defined $_->[$i] and push @violating_idx, $i and next COL for @$rows;
1480 $self->throw_exception( $err . join (', ', map { "'$infmap->[$_]'" } @violating_idx ) )
1483 $unrolled_non_null_cols_to_check = join (',', @$check_non_null_cols);
1487 ($did_fetch_all or ! $attrs->{collapse}) ? undef
1488 : defined $unrolled_non_null_cols_to_check ? eval sprintf <<'EOS', $unrolled_non_null_cols_to_check
1490 # FIXME SUBOPTIMAL - we can do better, cursor->next/all (well diff. methods) should return a ref
1491 my @r = $cursor->next or return;
1492 if (my @violating_idx = grep { ! defined $r[$_] } (%s) ) {
1493 $self->throw_exception( $err . join (', ', map { "'$infmap->[$_]'" } @violating_idx ) )
1499 # FIXME SUBOPTIMAL - we can do better, cursor->next/all (well diff. methods) should return a ref
1500 my @r = $cursor->next or return;
1505 $self->{_row_parser}{$parser_type}{cref}->(
1507 $next_cref ? ( $next_cref, $self->{_stashed_rows} = [] ) : (),
1510 # Special-case multi-object HRI - there is no $inflator_cref pass
1511 unless ($self->{_result_inflator}{is_hri}) {
1512 $_ = $inflator_cref->($res_class, $rsrc, @$_) for @$rows
1516 # The @$rows check seems odd at first - why wouldn't we want to warn
1517 # regardless? The issue is things like find() etc, where the user
1518 # *knows* only one result will come back. In these cases the ->all
1519 # is not a pessimization, but rather something we actually want
1521 'Unable to properly collapse has_many results in iterator mode due '
1522 . 'to order criteria - performed an eager cursor slurp underneath. '
1523 . 'Consider using ->all() instead'
1524 ) if ( ! $fetch_all and @$rows > 1 );
1529 =head2 result_source
1533 =item Arguments: L<$result_source?|DBIx::Class::ResultSource>
1535 =item Return Value: L<$result_source|DBIx::Class::ResultSource>
1539 An accessor for the primary ResultSource object from which this ResultSet
1546 =item Arguments: $result_class?
1548 =item Return Value: $result_class
1552 An accessor for the class to use when creating result objects. Defaults to
1553 C<< result_source->result_class >> - which in most cases is the name of the
1554 L<"table"|DBIx::Class::Manual::Glossary/"ResultSource"> class.
1556 Note that changing the result_class will also remove any components
1557 that were originally loaded in the source class via
1558 L<DBIx::Class::ResultSource/load_components>. Any overloaded methods
1559 in the original source class will not run.
1564 my ($self, $result_class) = @_;
1565 if ($result_class) {
1567 # don't fire this for an object
1568 $self->ensure_class_loaded($result_class)
1569 unless ref($result_class);
1571 if ($self->get_cache) {
1572 carp_unique('Changing the result_class of a ResultSet instance with cached results is a noop - the cache contents will not be altered');
1574 # FIXME ENCAPSULATION - encapsulation breach, cursor method additions pending
1575 elsif ($self->{cursor} && $self->{cursor}{_pos}) {
1576 $self->throw_exception('Changing the result_class of a ResultSet instance with an active cursor is not supported');
1579 $self->_result_class($result_class);
1581 delete $self->{_result_inflator};
1583 $self->_result_class;
1590 =item Arguments: L<$cond|DBIx::Class::SQLMaker>, L<\%attrs?|/ATTRIBUTES>
1592 =item Return Value: $count
1596 Performs an SQL C<COUNT> with the same query as the resultset was built
1597 with to find the number of elements. Passing arguments is equivalent to
1598 C<< $rs->search ($cond, \%attrs)->count >>
1604 return $self->search(@_)->count if @_ and defined $_[0];
1605 return scalar @{ $self->get_cache } if $self->get_cache;
1607 my $attrs = { %{ $self->_resolved_attrs } };
1609 # this is a little optimization - it is faster to do the limit
1610 # adjustments in software, instead of a subquery
1611 my ($rows, $offset) = delete @{$attrs}{qw/rows offset/};
1614 if ($self->_has_resolved_attr (qw/collapse group_by/)) {
1615 $crs = $self->_count_subq_rs ($attrs);
1618 $crs = $self->_count_rs ($attrs);
1620 my $count = $crs->next;
1622 $count -= $offset if $offset;
1623 $count = $rows if $rows and $rows < $count;
1624 $count = 0 if ($count < 0);
1633 =item Arguments: L<$cond|DBIx::Class::SQLMaker>, L<\%attrs?|/ATTRIBUTES>
1635 =item Return Value: L<$count_rs|DBIx::Class::ResultSetColumn>
1639 Same as L</count> but returns a L<DBIx::Class::ResultSetColumn> object.
1640 This can be very handy for subqueries:
1642 ->search( { amount => $some_rs->count_rs->as_query } )
1644 As with regular resultsets the SQL query will be executed only after
1645 the resultset is accessed via L</next> or L</all>. That would return
1646 the same single value obtainable via L</count>.
1652 return $self->search(@_)->count_rs if @_;
1654 # this may look like a lack of abstraction (count() does about the same)
1655 # but in fact an _rs *must* use a subquery for the limits, as the
1656 # software based limiting can not be ported if this $rs is to be used
1657 # in a subquery itself (i.e. ->as_query)
1658 if ($self->_has_resolved_attr (qw/collapse group_by offset rows/)) {
1659 return $self->_count_subq_rs($self->{_attrs});
1662 return $self->_count_rs($self->{_attrs});
1667 # returns a ResultSetColumn object tied to the count query
1670 my ($self, $attrs) = @_;
1672 my $rsrc = $self->result_source;
1674 my $tmp_attrs = { %$attrs };
1675 # take off any limits, record_filter is cdbi, and no point of ordering nor locking a count
1676 delete @{$tmp_attrs}{qw/rows offset order_by record_filter for/};
1678 # overwrite the selector (supplied by the storage)
1679 $rsrc->resultset_class->new($rsrc, {
1681 select => $rsrc->storage->_count_select ($rsrc, $attrs),
1683 })->get_column ('count');
1687 # same as above but uses a subquery
1689 sub _count_subq_rs {
1690 my ($self, $attrs) = @_;
1692 my $rsrc = $self->result_source;
1694 my $sub_attrs = { %$attrs };
1695 # extra selectors do not go in the subquery and there is no point of ordering it, nor locking it
1696 delete @{$sub_attrs}{qw/collapse columns as select order_by for/};
1698 # if we multi-prefetch we group_by something unique, as this is what we would
1699 # get out of the rs via ->next/->all. We *DO WANT* to clobber old group_by regardless
1700 if ( $attrs->{collapse} ) {
1701 $sub_attrs->{group_by} = [ map { "$attrs->{alias}.$_" } @{
1702 $rsrc->_identifying_column_set || $self->throw_exception(
1703 'Unable to construct a unique group_by criteria properly collapsing the '
1704 . 'has_many prefetch before count()'
1709 # Calculate subquery selector
1710 if (my $g = $sub_attrs->{group_by}) {
1712 my $sql_maker = $rsrc->storage->sql_maker;
1714 # necessary as the group_by may refer to aliased functions
1716 for my $sel (@{$attrs->{select}}) {
1717 $sel_index->{$sel->{-as}} = $sel
1718 if (ref $sel eq 'HASH' and $sel->{-as});
1721 # anything from the original select mentioned on the group-by needs to make it to the inner selector
1722 # also look for named aggregates referred in the having clause
1723 # having often contains scalarrefs - thus parse it out entirely
1725 if ($attrs->{having}) {
1726 local $sql_maker->{having_bind};
1727 local $sql_maker->{quote_char} = $sql_maker->{quote_char};
1728 local $sql_maker->{name_sep} = $sql_maker->{name_sep};
1729 unless (defined $sql_maker->{quote_char} and length $sql_maker->{quote_char}) {
1730 $sql_maker->{quote_char} = [ "\x00", "\xFF" ];
1731 # if we don't unset it we screw up retarded but unfortunately working
1732 # 'MAX(foo.bar)' => { '>', 3 }
1733 $sql_maker->{name_sep} = '';
1736 $sql_maker->clear_renderer;
1737 $sql_maker->clear_converter;
1739 my ($lquote, $rquote, $sep) = map { quotemeta $_ } ($sql_maker->_quote_chars, $sql_maker->name_sep);
1741 my $having_sql = $sql_maker->_render_sqla(where => $attrs->{having});
1743 $sql_maker->clear_renderer;
1744 $sql_maker->clear_converter;
1748 # search for both a proper quoted qualified string, for a naive unquoted scalarref
1749 # and if all fails for an utterly naive quoted scalar-with-function
1750 while ($having_sql =~ /
1751 (?: $rquote $sep)? $lquote (.+?) $rquote
1753 [\s,] \w+ \. (\w+) [\s,]
1755 [\s,] $lquote (.+?) $rquote [\s,]
1757 my $part = $1 || $2 || $3; # one of them matched if we got here
1758 unless ($seen_having{$part}++) {
1765 my $colpiece = $sel_index->{$_} || $_;
1767 # unqualify join-based group_by's. Arcane but possible query
1768 # also horrible horrible hack to alias a column (not a func.)
1769 # (probably need to introduce SQLA syntax)
1770 if ($colpiece =~ /\./ && $colpiece !~ /^$attrs->{alias}\./) {
1773 $colpiece = \ sprintf ('%s AS %s', map { $sql_maker->_quote ($_) } ($colpiece, $as) );
1775 push @{$sub_attrs->{select}}, $colpiece;
1779 my @pcols = map { "$attrs->{alias}.$_" } ($rsrc->primary_columns);
1780 $sub_attrs->{select} = @pcols ? \@pcols : [ 1 ];
1783 return $rsrc->resultset_class
1784 ->new ($rsrc, $sub_attrs)
1786 ->search ({}, { columns => { count => $rsrc->storage->_count_select ($rsrc, $attrs) } })
1787 ->get_column ('count');
1791 =head2 count_literal
1793 B<CAVEAT>: C<count_literal> is provided for Class::DBI compatibility and
1794 should only be used in that context. See L</search_literal> for further info.
1798 =item Arguments: $sql_fragment, @standalone_bind_values
1800 =item Return Value: $count
1804 Counts the results in a literal query. Equivalent to calling L</search_literal>
1805 with the passed arguments, then L</count>.
1809 sub count_literal { shift->search_literal(@_)->count; }
1815 =item Arguments: none
1817 =item Return Value: L<@result_objs|DBIx::Class::Manual::ResultClass>
1821 Returns all elements in the resultset.
1828 $self->throw_exception("all() doesn't take any arguments, you probably wanted ->search(...)->all()");
1831 delete @{$self}{qw/_stashed_rows _stashed_results/};
1833 if (my $c = $self->get_cache) {
1837 $self->cursor->reset;
1839 my $objs = $self->_construct_results('fetch_all') || [];
1841 $self->set_cache($objs) if $self->{attrs}{cache};
1850 =item Arguments: none
1852 =item Return Value: $self
1856 Resets the resultset's cursor, so you can iterate through the elements again.
1857 Implicitly resets the storage cursor, so a subsequent L</next> will trigger
1865 delete @{$self}{qw/_stashed_rows _stashed_results/};
1866 $self->{all_cache_position} = 0;
1867 $self->cursor->reset;
1875 =item Arguments: none
1877 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass> | undef
1881 L<Resets|/reset> the resultset (causing a fresh query to storage) and returns
1882 an object for the first result (or C<undef> if the resultset is empty).
1887 return $_[0]->reset->next;
1893 # Determines whether and what type of subquery is required for the $rs operation.
1894 # If grouping is necessary either supplies its own, or verifies the current one
1895 # After all is done delegates to the proper storage method.
1897 sub _rs_update_delete {
1898 my ($self, $op, $values) = @_;
1900 my $rsrc = $self->result_source;
1901 my $storage = $rsrc->schema->storage;
1903 my $attrs = { %{$self->_resolved_attrs} };
1905 my $join_classifications;
1906 my ($existing_group_by) = delete @{$attrs}{qw(group_by _grouped_by_distinct)};
1908 # do we need a subquery for any reason?
1910 defined $existing_group_by
1912 # if {from} is unparseable wrap a subq
1913 ref($attrs->{from}) ne 'ARRAY'
1915 # limits call for a subq
1916 $self->_has_resolved_attr(qw/rows offset/)
1919 # simplify the joinmap, so we can further decide if a subq is necessary
1920 if (!$needs_subq and @{$attrs->{from}} > 1) {
1922 ($attrs->{from}, $join_classifications) =
1923 $storage->_prune_unused_joins ($attrs);
1925 # any non-pruneable non-local restricting joins imply subq
1926 $needs_subq = defined List::Util::first { $_ ne $attrs->{alias} } keys %{ $join_classifications->{restricting} || {} };
1929 # check if the head is composite (by now all joins are thrown out unless $needs_subq)
1931 (ref $attrs->{from}[0]) ne 'HASH'
1933 ref $attrs->{from}[0]{ $attrs->{from}[0]{-alias} }
1937 # do we need anything like a subquery?
1938 if (! $needs_subq) {
1939 # Most databases do not allow aliasing of tables in UPDATE/DELETE. Thus
1940 # a condition containing 'me' or other table prefixes will not work
1941 # at all - so we convert the WHERE to a dq tree now, dequalify all
1942 # identifiers found therein via a scan across the tree, and then use
1943 # \{} style to pass the result onwards for use in the final query
1944 if ($self->{cond}) {
1946 my $converter = $rsrc->storage->sql_maker->converter;
1948 DQ_IDENTIFIER ,=> sub { $_ = [ $_->[-1] ] for $_[0]->{elements} }
1949 }, my $where_dq = $converter->_where_to_dq($self->{cond}));
1955 # we got this far - means it is time to wrap a subquery
1956 my $idcols = $rsrc->_identifying_column_set || $self->throw_exception(
1958 "Unable to perform complex resultset %s() without an identifying set of columns on source '%s'",
1964 # make a new $rs selecting only the PKs (that's all we really need for the subq)
1965 delete $attrs->{$_} for qw/select as collapse/;
1966 $attrs->{columns} = [ map { "$attrs->{alias}.$_" } @$idcols ];
1968 # this will be consumed by the pruner waaaaay down the stack
1969 $attrs->{_force_prune_multiplying_joins} = 1;
1971 my $subrs = (ref $self)->new($rsrc, $attrs);
1973 if (@$idcols == 1) {
1974 $cond = { $idcols->[0] => { -in => \$subrs->_as_select_dq } };
1976 elsif ($storage->_use_multicolumn_in) {
1977 # no syntax for calling this properly yet
1978 # !!! EXPERIMENTAL API !!! WILL CHANGE !!!
1979 my $left = $storage->sql_maker->_render_sqla(select_select => $idcols);
1980 $left =~ s/^SELECT //i;
1981 my $right = $storage->sql_maker
1983 ->_literal_to_dq(${$subrs->as_query});
1985 { 'SQL.Naive' => 'in' },
1986 [ Literal(SQL => "( $left )"), $right ],
1990 # if all else fails - get all primary keys and operate over a ORed set
1991 # wrap in a transaction for consistency
1992 # this is where the group_by/multiplication starts to matter
1996 # we do not need to check pre-multipliers, since if the premulti is there, its
1997 # parent (who is multi) will be there too
1998 keys %{ $join_classifications->{multiplying} || {} }
2000 # make sure if there is a supplied group_by it matches the columns compiled above
2001 # perfectly. Anything else can not be sanely executed on most databases so croak
2002 # right then and there
2003 if ($existing_group_by) {
2004 my @current_group_by = map
2005 { $_ =~ /\./ ? $_ : "$attrs->{alias}.$_" }
2010 join ("\x00", sort @current_group_by)
2012 join ("\x00", sort @{$attrs->{columns}} )
2014 $self->throw_exception (
2015 "You have just attempted a $op operation on a resultset which does group_by"
2016 . ' on columns other than the primary keys, while DBIC internally needs to retrieve'
2017 . ' the primary keys in a subselect. All sane RDBMS engines do not support this'
2018 . ' kind of queries. Please retry the operation with a modified group_by or'
2019 . ' without using one at all.'
2024 $subrs = $subrs->search({}, { group_by => $attrs->{columns} });
2027 $guard = $storage->txn_scope_guard;
2030 for my $row ($subrs->cursor->all) {
2032 { $idcols->[$_] => $row->[$_] }
2039 my $res = $storage->$op (
2041 $op eq 'update' ? $values : (),
2045 $guard->commit if $guard;
2054 =item Arguments: \%values
2056 =item Return Value: $underlying_storage_rv
2060 Sets the specified columns in the resultset to the supplied values in a
2061 single query. Note that this will not run any accessor/set_column/update
2062 triggers, nor will it update any result object instances derived from this
2063 resultset (this includes the contents of the L<resultset cache|/set_cache>
2064 if any). See L</update_all> if you need to execute any on-update
2065 triggers or cascades defined either by you or a
2066 L<result component|DBIx::Class::Manual::Component/WHAT IS A COMPONENT>.
2068 The return value is a pass through of what the underlying
2069 storage backend returned, and may vary. See L<DBI/execute> for the most
2074 Note that L</update> does not process/deflate any of the values passed in.
2075 This is unlike the corresponding L<DBIx::Class::Row/update>. The user must
2076 ensure manually that any value passed to this method will stringify to
2077 something the RDBMS knows how to deal with. A notable example is the
2078 handling of L<DateTime> objects, for more info see:
2079 L<DBIx::Class::Manual::Cookbook/Formatting DateTime objects in queries>.
2084 my ($self, $values) = @_;
2085 $self->throw_exception('Values for update must be a hash')
2086 unless ref $values eq 'HASH';
2088 return $self->_rs_update_delete ('update', $values);
2095 =item Arguments: \%values
2097 =item Return Value: 1
2101 Fetches all objects and updates them one at a time via
2102 L<DBIx::Class::Row/update>. Note that C<update_all> will run DBIC defined
2103 triggers, while L</update> will not.
2108 my ($self, $values) = @_;
2109 $self->throw_exception('Values for update_all must be a hash')
2110 unless ref $values eq 'HASH';
2112 my $guard = $self->result_source->schema->txn_scope_guard;
2113 $_->update({%$values}) for $self->all; # shallow copy - update will mangle it
2122 =item Arguments: none
2124 =item Return Value: $underlying_storage_rv
2128 Deletes the rows matching this resultset in a single query. Note that this
2129 will not run any delete triggers, nor will it alter the
2130 L<in_storage|DBIx::Class::Row/in_storage> status of any result object instances
2131 derived from this resultset (this includes the contents of the
2132 L<resultset cache|/set_cache> if any). See L</delete_all> if you need to
2133 execute any on-delete triggers or cascades defined either by you or a
2134 L<result component|DBIx::Class::Manual::Component/WHAT IS A COMPONENT>.
2136 The return value is a pass through of what the underlying storage backend
2137 returned, and may vary. See L<DBI/execute> for the most common case.
2143 $self->throw_exception('delete does not accept any arguments')
2146 return $self->_rs_update_delete ('delete');
2153 =item Arguments: none
2155 =item Return Value: 1
2159 Fetches all objects and deletes them one at a time via
2160 L<DBIx::Class::Row/delete>. Note that C<delete_all> will run DBIC defined
2161 triggers, while L</delete> will not.
2167 $self->throw_exception('delete_all does not accept any arguments')
2170 my $guard = $self->result_source->schema->txn_scope_guard;
2171 $_->delete for $self->all;
2180 =item Arguments: [ \@column_list, \@row_values+ ] | [ \%col_data+ ]
2182 =item Return Value: L<\@result_objects|DBIx::Class::Manual::ResultClass> (scalar context) | L<@result_objects|DBIx::Class::Manual::ResultClass> (list context)
2186 Accepts either an arrayref of hashrefs or alternatively an arrayref of
2193 The context of this method call has an important effect on what is
2194 submitted to storage. In void context data is fed directly to fastpath
2195 insertion routines provided by the underlying storage (most often
2196 L<DBI/execute_for_fetch>), bypassing the L<new|DBIx::Class::Row/new> and
2197 L<insert|DBIx::Class::Row/insert> calls on the
2198 L<Result|DBIx::Class::Manual::ResultClass> class, including any
2199 augmentation of these methods provided by components. For example if you
2200 are using something like L<DBIx::Class::UUIDColumns> to create primary
2201 keys for you, you will find that your PKs are empty. In this case you
2202 will have to explicitly force scalar or list context in order to create
2207 In non-void (scalar or list) context, this method is simply a wrapper
2208 for L</create>. Depending on list or scalar context either a list of
2209 L<Result|DBIx::Class::Manual::ResultClass> objects or an arrayref
2210 containing these objects is returned.
2212 When supplying data in "arrayref of arrayrefs" invocation style, the
2213 first element should be a list of column names and each subsequent
2214 element should be a data value in the earlier specified column order.
2217 $schema->resultset("Artist")->populate([
2218 [ qw( artistid name ) ],
2219 [ 100, 'A Formally Unknown Singer' ],
2220 [ 101, 'A singer that jumped the shark two albums ago' ],
2221 [ 102, 'An actually cool singer' ],
2224 For the arrayref of hashrefs style each hashref should be a structure
2225 suitable for passing to L</create>. Multi-create is also permitted with
2228 $schema->resultset("Artist")->populate([
2229 { artistid => 4, name => 'Manufactured Crap', cds => [
2230 { title => 'My First CD', year => 2006 },
2231 { title => 'Yet More Tweeny-Pop crap', year => 2007 },
2234 { artistid => 5, name => 'Angsty-Whiny Girl', cds => [
2235 { title => 'My parents sold me to a record company', year => 2005 },
2236 { title => 'Why Am I So Ugly?', year => 2006 },
2237 { title => 'I Got Surgery and am now Popular', year => 2007 }
2242 If you attempt a void-context multi-create as in the example above (each
2243 Artist also has the related list of CDs), and B<do not> supply the
2244 necessary autoinc foreign key information, this method will proxy to the
2245 less efficient L</create>, and then throw the Result objects away. In this
2246 case there are obviously no benefits to using this method over L</create>.
2253 # cruft placed in standalone method
2254 my $data = $self->_normalize_populate_args(@_);
2256 return unless @$data;
2258 if(defined wantarray) {
2259 my @created = map { $self->create($_) } @$data;
2260 return wantarray ? @created : \@created;
2263 my $first = $data->[0];
2265 # if a column is a registered relationship, and is a non-blessed hash/array, consider
2266 # it relationship data
2267 my (@rels, @columns);
2268 my $rsrc = $self->result_source;
2269 my $rels = { map { $_ => $rsrc->relationship_info($_) } $rsrc->relationships };
2270 for (keys %$first) {
2271 my $ref = ref $first->{$_};
2272 $rels->{$_} && ($ref eq 'ARRAY' or $ref eq 'HASH')
2278 my @pks = $rsrc->primary_columns;
2280 ## do the belongs_to relationships
2281 foreach my $index (0..$#$data) {
2283 # delegate to create() for any dataset without primary keys with specified relationships
2284 if (grep { !defined $data->[$index]->{$_} } @pks ) {
2286 if (grep { ref $data->[$index]{$r} eq $_ } qw/HASH ARRAY/) { # a related set must be a HASH or AoH
2287 my @ret = $self->populate($data);
2293 foreach my $rel (@rels) {
2294 next unless ref $data->[$index]->{$rel} eq "HASH";
2295 my $result = $self->related_resultset($rel)->create($data->[$index]->{$rel});
2296 my ($reverse_relname, $reverse_relinfo) = %{$rsrc->reverse_relationship_info($rel)};
2297 my $related = $result->result_source->_resolve_condition(
2298 $reverse_relinfo->{cond},
2304 delete $data->[$index]->{$rel};
2305 $data->[$index] = {%{$data->[$index]}, %$related};
2307 push @columns, keys %$related if $index == 0;
2311 ## inherit the data locked in the conditions of the resultset
2312 my ($rs_data) = $self->_merge_with_rscond({});
2313 delete @{$rs_data}{@columns};
2315 ## do bulk insert on current row
2316 $rsrc->storage->insert_bulk(
2318 [@columns, keys %$rs_data],
2319 [ map { [ @$_{@columns}, values %$rs_data ] } @$data ],
2322 ## do the has_many relationships
2323 foreach my $item (@$data) {
2327 foreach my $rel (@rels) {
2328 next unless ref $item->{$rel} eq "ARRAY" && @{ $item->{$rel} };
2330 $main_row ||= $self->new_result({map { $_ => $item->{$_} } @pks});
2332 my $child = $main_row->$rel;
2334 my $related = $child->result_source->_resolve_condition(
2335 $rels->{$rel}{cond},
2341 if (ref($related) eq 'REF' and ref($$related) eq 'HASH') {
2342 $related = $self->_extract_fixed_values_for($$related, $rel);
2345 my @rows_to_add = ref $item->{$rel} eq 'ARRAY' ? @{$item->{$rel}} : ($item->{$rel});
2346 my @populate = map { {%$_, %$related} } @rows_to_add;
2348 $child->populate( \@populate );
2354 sub _extract_fixed_values_for {
2355 my ($self, $dq, $alias) = @_;
2356 my $fixed = $self->_extract_fixed_conditions_for($dq, $alias);
2358 is_Value($fixed->{$_})
2359 ? ($_ => $fixed->{$_}{value})
2364 sub _extract_fixed_conditions_for {
2365 my ($self, $dq, $alias) = @_;
2366 my (@q, %found) = ($dq);
2367 while (my $n = shift @q) {
2368 if (is_Operator($n)) {
2369 if (($n->{operator}{Perl}||'') =~ /^(?:==|eq)$/) {
2370 my ($l, $r) = @{$n->{args}};
2372 is_Identifier($r) and @{$r->{elements}} == 2
2373 and $r->{elements}[0] eq $alias
2375 ($l, $r) = ($r, $l);
2378 is_Identifier($l) and @{$l->{elements}} == 2
2379 and $l->{elements}[0] eq $alias
2381 $found{$l->{elements}[1]} = $r;
2382 } elsif (($n->{operator}{Perl}||'') eq 'and') {
2383 push @q, @{$n->{args}};
2391 # populate() arguments went over several incarnations
2392 # What we ultimately support is AoH
2393 sub _normalize_populate_args {
2394 my ($self, $arg) = @_;
2396 if (ref $arg eq 'ARRAY') {
2400 elsif (ref $arg->[0] eq 'HASH') {
2403 elsif (ref $arg->[0] eq 'ARRAY') {
2405 my @colnames = @{$arg->[0]};
2406 foreach my $values (@{$arg}[1 .. $#$arg]) {
2407 push @ret, { map { $colnames[$_] => $values->[$_] } (0 .. $#colnames) };
2413 $self->throw_exception('Populate expects an arrayref of hashrefs or arrayref of arrayrefs');
2420 =item Arguments: none
2422 =item Return Value: L<$pager|Data::Page>
2426 Returns a L<Data::Page> object for the current resultset. Only makes
2427 sense for queries with a C<page> attribute.
2429 To get the full count of entries for a paged resultset, call
2430 C<total_entries> on the L<Data::Page> object.
2437 return $self->{pager} if $self->{pager};
2439 my $attrs = $self->{attrs};
2440 if (!defined $attrs->{page}) {
2441 $self->throw_exception("Can't create pager for non-paged rs");
2443 elsif ($attrs->{page} <= 0) {
2444 $self->throw_exception('Invalid page number (page-numbers are 1-based)');
2446 $attrs->{rows} ||= 10;
2448 # throw away the paging flags and re-run the count (possibly
2449 # with a subselect) to get the real total count
2450 my $count_attrs = { %$attrs };
2451 delete @{$count_attrs}{qw/rows offset page pager/};
2453 my $total_rs = (ref $self)->new($self->result_source, $count_attrs);
2455 require DBIx::Class::ResultSet::Pager;
2456 return $self->{pager} = DBIx::Class::ResultSet::Pager->new(
2457 sub { $total_rs->count }, #lazy-get the total
2459 $self->{attrs}{page},
2467 =item Arguments: $page_number
2469 =item Return Value: L<$resultset|/search>
2473 Returns a resultset for the $page_number page of the resultset on which page
2474 is called, where each page contains a number of rows equal to the 'rows'
2475 attribute set on the resultset (10 by default).
2480 my ($self, $page) = @_;
2481 return (ref $self)->new($self->result_source, { %{$self->{attrs}}, page => $page });
2488 =item Arguments: \%col_data
2490 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2494 Creates a new result object in the resultset's result class and returns
2495 it. The row is not inserted into the database at this point, call
2496 L<DBIx::Class::Row/insert> to do that. Calling L<DBIx::Class::Row/in_storage>
2497 will tell you whether the result object has been inserted or not.
2499 Passes the hashref of input on to L<DBIx::Class::Row/new>.
2504 my ($self, $values) = @_;
2506 $self->throw_exception( "new_result takes only one argument - a hashref of values" )
2509 $self->throw_exception( "new_result expects a hashref" )
2510 unless (ref $values eq 'HASH');
2512 my ($merged_cond, $cols_from_relations) = $self->_merge_with_rscond($values);
2514 my $new = $self->result_class->new({
2516 ( @$cols_from_relations
2517 ? (-cols_from_relations => $cols_from_relations)
2520 -result_source => $self->result_source, # DO NOT REMOVE THIS, REQUIRED
2524 reftype($new) eq 'HASH'
2530 carp_unique (sprintf (
2531 "%s->new returned a blessed empty hashref - a strong indicator something is wrong with its inheritance chain",
2532 $self->result_class,
2539 # _merge_with_rscond
2541 # Takes a simple hash of K/V data and returns its copy merged with the
2542 # condition already present on the resultset. Additionally returns an
2543 # arrayref of value/condition names, which were inferred from related
2544 # objects (this is needed for in-memory related objects)
2545 sub _merge_with_rscond {
2546 my ($self, $data) = @_;
2548 my (%new_data, @cols_from_relations);
2550 my $alias = $self->{attrs}{alias};
2552 if (! defined $self->{cond}) {
2553 # just massage $data below
2555 elsif ($self->{cond} eq $DBIx::Class::ResultSource::UNRESOLVABLE_CONDITION) {
2556 %new_data = %{ $self->{attrs}{related_objects} || {} }; # nothing might have been inserted yet
2557 @cols_from_relations = keys %new_data;
2559 elsif (ref $self->{cond} eq 'HASH') {
2560 # precedence must be given to passed values over values inherited from
2561 # the cond, so the order here is important.
2562 my $collapsed_cond = $self->_collapse_cond($self->{cond});
2563 my %implied = %{$self->_remove_alias($collapsed_cond, $alias)};
2565 while ( my($col, $value) = each %implied ) {
2566 my $vref = ref $value;
2572 (keys %$value)[0] eq '='
2574 $new_data{$col} = $value->{'='};
2576 elsif( !$vref or $vref eq 'SCALAR' or blessed($value) ) {
2577 $new_data{$col} = $value;
2581 elsif (ref $self->{cond} eq 'REF' and ref ${$self->{cond}} eq 'HASH') {
2582 %new_data = %{$self->_extract_fixed_values_for(${$self->{cond}}, $alias)};
2585 $self->throw_exception(
2586 "Can't abstract implicit construct, resultset condition not a hash"
2592 %{ $self->_remove_alias($data, $alias) },
2595 return (\%new_data, \@cols_from_relations);
2598 # _has_resolved_attr
2600 # determines if the resultset defines at least one
2601 # of the attributes supplied
2603 # used to determine if a subquery is necessary
2605 # supports some virtual attributes:
2607 # This will scan for any joins being present on the resultset.
2608 # It is not a mere key-search but a deep inspection of {from}
2611 sub _has_resolved_attr {
2612 my ($self, @attr_names) = @_;
2614 my $attrs = $self->_resolved_attrs;
2618 for my $n (@attr_names) {
2619 if (grep { $n eq $_ } (qw/-join/) ) {
2620 $extra_checks{$n}++;
2624 my $attr = $attrs->{$n};
2626 next if not defined $attr;
2628 if (ref $attr eq 'HASH') {
2629 return 1 if keys %$attr;
2631 elsif (ref $attr eq 'ARRAY') {
2639 # a resolved join is expressed as a multi-level from
2641 $extra_checks{-join}
2643 ref $attrs->{from} eq 'ARRAY'
2645 @{$attrs->{from}} > 1
2653 # Recursively collapse the condition.
2655 sub _collapse_cond {
2656 my ($self, $cond, $collapsed) = @_;
2660 if (ref $cond eq 'ARRAY') {
2661 foreach my $subcond (@$cond) {
2662 next unless ref $subcond; # -or
2663 $collapsed = $self->_collapse_cond($subcond, $collapsed);
2666 elsif (ref $cond eq 'HASH') {
2667 if (keys %$cond and (keys %$cond)[0] eq '-and') {
2668 foreach my $subcond (@{$cond->{-and}}) {
2669 $collapsed = $self->_collapse_cond($subcond, $collapsed);
2673 foreach my $col (keys %$cond) {
2674 my $value = $cond->{$col};
2675 $collapsed->{$col} = $value;
2685 # Remove the specified alias from the specified query hash. A copy is made so
2686 # the original query is not modified.
2689 my ($self, $query, $alias) = @_;
2691 my %orig = %{ $query || {} };
2694 foreach my $key (keys %orig) {
2696 $unaliased{$key} = $orig{$key};
2699 $unaliased{$1} = $orig{$key}
2700 if $key =~ m/^(?:\Q$alias\E\.)?([^.]+)$/;
2710 =item Arguments: none
2712 =item Return Value: \[ $sql, L<@bind_values|/DBIC BIND VALUES> ]
2716 Returns the SQL query and bind vars associated with the invocant.
2718 This is generally used as the RHS for a subquery.
2725 my $attrs = { %{ $self->_resolved_attrs } };
2727 my $aq = $self->result_source->storage->_select_args_to_query (
2728 $attrs->{from}, $attrs->{select}, $attrs->{where}, $attrs
2731 $self->{_attrs}{_sqlmaker_select_args} = $attrs->{_sqlmaker_select_args};
2738 my $attrs = { %{ $self->_resolved_attrs } };
2739 my $storage = $self->result_source->storage;
2740 my (undef, $ident, @args) = $storage->_select_args(
2741 $attrs->{from}, $attrs->{select}, $attrs->{where}, $attrs
2743 $ident = $ident->from if blessed($ident);
2744 $storage->sql_maker->converter->_select_to_dq(
2753 =item Arguments: \%col_data, { key => $unique_constraint, L<%attrs|/ATTRIBUTES> }?
2755 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2759 my $artist = $schema->resultset('Artist')->find_or_new(
2760 { artist => 'fred' }, { key => 'artists' });
2762 $cd->cd_to_producer->find_or_new({ producer => $producer },
2763 { key => 'primary' });
2765 Find an existing record from this resultset using L</find>. if none exists,
2766 instantiate a new result object and return it. The object will not be saved
2767 into your storage until you call L<DBIx::Class::Row/insert> on it.
2769 You most likely want this method when looking for existing rows using a unique
2770 constraint that is not the primary key, or looking for related rows.
2772 If you want objects to be saved immediately, use L</find_or_create> instead.
2774 B<Note>: Make sure to read the documentation of L</find> and understand the
2775 significance of the C<key> attribute, as its lack may skew your search, and
2776 subsequently result in spurious new objects.
2778 B<Note>: Take care when using C<find_or_new> with a table having
2779 columns with default values that you intend to be automatically
2780 supplied by the database (e.g. an auto_increment primary key column).
2781 In normal usage, the value of such columns should NOT be included at
2782 all in the call to C<find_or_new>, even when set to C<undef>.
2788 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
2789 my $hash = ref $_[0] eq 'HASH' ? shift : {@_};
2790 if (keys %$hash and my $row = $self->find($hash, $attrs) ) {
2793 return $self->new_result($hash);
2800 =item Arguments: \%col_data
2802 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2806 Attempt to create a single new row or a row with multiple related rows
2807 in the table represented by the resultset (and related tables). This
2808 will not check for duplicate rows before inserting, use
2809 L</find_or_create> to do that.
2811 To create one row for this resultset, pass a hashref of key/value
2812 pairs representing the columns of the table and the values you wish to
2813 store. If the appropriate relationships are set up, foreign key fields
2814 can also be passed an object representing the foreign row, and the
2815 value will be set to its primary key.
2817 To create related objects, pass a hashref of related-object column values
2818 B<keyed on the relationship name>. If the relationship is of type C<multi>
2819 (L<DBIx::Class::Relationship/has_many>) - pass an arrayref of hashrefs.
2820 The process will correctly identify columns holding foreign keys, and will
2821 transparently populate them from the keys of the corresponding relation.
2822 This can be applied recursively, and will work correctly for a structure
2823 with an arbitrary depth and width, as long as the relationships actually
2824 exists and the correct column data has been supplied.
2826 Instead of hashrefs of plain related data (key/value pairs), you may
2827 also pass new or inserted objects. New objects (not inserted yet, see
2828 L</new_result>), will be inserted into their appropriate tables.
2830 Effectively a shortcut for C<< ->new_result(\%col_data)->insert >>.
2832 Example of creating a new row.
2834 $person_rs->create({
2835 name=>"Some Person",
2836 email=>"somebody@someplace.com"
2839 Example of creating a new row and also creating rows in a related C<has_many>
2840 or C<has_one> resultset. Note Arrayref.
2843 { artistid => 4, name => 'Manufactured Crap', cds => [
2844 { title => 'My First CD', year => 2006 },
2845 { title => 'Yet More Tweeny-Pop crap', year => 2007 },
2850 Example of creating a new row and also creating a row in a related
2851 C<belongs_to> resultset. Note Hashref.
2854 title=>"Music for Silly Walks",
2857 name=>"Silly Musician",
2865 When subclassing ResultSet never attempt to override this method. Since
2866 it is a simple shortcut for C<< $self->new_result($attrs)->insert >>, a
2867 lot of the internals simply never call it, so your override will be
2868 bypassed more often than not. Override either L<DBIx::Class::Row/new>
2869 or L<DBIx::Class::Row/insert> depending on how early in the
2870 L</create> process you need to intervene. See also warning pertaining to
2878 my ($self, $col_data) = @_;
2879 $self->throw_exception( "create needs a hashref" )
2880 unless ref $col_data eq 'HASH';
2881 return $self->new_result($col_data)->insert;
2884 =head2 find_or_create
2888 =item Arguments: \%col_data, { key => $unique_constraint, L<%attrs|/ATTRIBUTES> }?
2890 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2894 $cd->cd_to_producer->find_or_create({ producer => $producer },
2895 { key => 'primary' });
2897 Tries to find a record based on its primary key or unique constraints; if none
2898 is found, creates one and returns that instead.
2900 my $cd = $schema->resultset('CD')->find_or_create({
2902 artist => 'Massive Attack',
2903 title => 'Mezzanine',
2907 Also takes an optional C<key> attribute, to search by a specific key or unique
2908 constraint. For example:
2910 my $cd = $schema->resultset('CD')->find_or_create(
2912 artist => 'Massive Attack',
2913 title => 'Mezzanine',
2915 { key => 'cd_artist_title' }
2918 B<Note>: Make sure to read the documentation of L</find> and understand the
2919 significance of the C<key> attribute, as its lack may skew your search, and
2920 subsequently result in spurious row creation.
2922 B<Note>: Because find_or_create() reads from the database and then
2923 possibly inserts based on the result, this method is subject to a race
2924 condition. Another process could create a record in the table after
2925 the find has completed and before the create has started. To avoid
2926 this problem, use find_or_create() inside a transaction.
2928 B<Note>: Take care when using C<find_or_create> with a table having
2929 columns with default values that you intend to be automatically
2930 supplied by the database (e.g. an auto_increment primary key column).
2931 In normal usage, the value of such columns should NOT be included at
2932 all in the call to C<find_or_create>, even when set to C<undef>.
2934 See also L</find> and L</update_or_create>. For information on how to declare
2935 unique constraints, see L<DBIx::Class::ResultSource/add_unique_constraint>.
2937 If you need to know if an existing row was found or a new one created use
2938 L</find_or_new> and L<DBIx::Class::Row/in_storage> instead. Don't forget
2939 to call L<DBIx::Class::Row/insert> to save the newly created row to the
2942 my $cd = $schema->resultset('CD')->find_or_new({
2944 artist => 'Massive Attack',
2945 title => 'Mezzanine',
2949 if( !$cd->in_storage ) {
2956 sub find_or_create {
2958 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
2959 my $hash = ref $_[0] eq 'HASH' ? shift : {@_};
2960 if (keys %$hash and my $row = $self->find($hash, $attrs) ) {
2963 return $self->create($hash);
2966 =head2 update_or_create
2970 =item Arguments: \%col_data, { key => $unique_constraint, L<%attrs|/ATTRIBUTES> }?
2972 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
2976 $resultset->update_or_create({ col => $val, ... });
2978 Like L</find_or_create>, but if a row is found it is immediately updated via
2979 C<< $found_row->update (\%col_data) >>.
2982 Takes an optional C<key> attribute to search on a specific unique constraint.
2985 # In your application
2986 my $cd = $schema->resultset('CD')->update_or_create(
2988 artist => 'Massive Attack',
2989 title => 'Mezzanine',
2992 { key => 'cd_artist_title' }
2995 $cd->cd_to_producer->update_or_create({
2996 producer => $producer,
3002 B<Note>: Make sure to read the documentation of L</find> and understand the
3003 significance of the C<key> attribute, as its lack may skew your search, and
3004 subsequently result in spurious row creation.
3006 B<Note>: Take care when using C<update_or_create> with a table having
3007 columns with default values that you intend to be automatically
3008 supplied by the database (e.g. an auto_increment primary key column).
3009 In normal usage, the value of such columns should NOT be included at
3010 all in the call to C<update_or_create>, even when set to C<undef>.
3012 See also L</find> and L</find_or_create>. For information on how to declare
3013 unique constraints, see L<DBIx::Class::ResultSource/add_unique_constraint>.
3015 If you need to know if an existing row was updated or a new one created use
3016 L</update_or_new> and L<DBIx::Class::Row/in_storage> instead. Don't forget
3017 to call L<DBIx::Class::Row/insert> to save the newly created row to the
3022 sub update_or_create {
3024 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
3025 my $cond = ref $_[0] eq 'HASH' ? shift : {@_};
3027 my $row = $self->find($cond, $attrs);
3029 $row->update($cond);
3033 return $self->create($cond);
3036 =head2 update_or_new
3040 =item Arguments: \%col_data, { key => $unique_constraint, L<%attrs|/ATTRIBUTES> }?
3042 =item Return Value: L<$result|DBIx::Class::Manual::ResultClass>
3046 $resultset->update_or_new({ col => $val, ... });
3048 Like L</find_or_new> but if a row is found it is immediately updated via
3049 C<< $found_row->update (\%col_data) >>.
3053 # In your application
3054 my $cd = $schema->resultset('CD')->update_or_new(
3056 artist => 'Massive Attack',
3057 title => 'Mezzanine',
3060 { key => 'cd_artist_title' }
3063 if ($cd->in_storage) {
3064 # the cd was updated
3067 # the cd is not yet in the database, let's insert it
3071 B<Note>: Make sure to read the documentation of L</find> and understand the
3072 significance of the C<key> attribute, as its lack may skew your search, and
3073 subsequently result in spurious new objects.
3075 B<Note>: Take care when using C<update_or_new> with a table having
3076 columns with default values that you intend to be automatically
3077 supplied by the database (e.g. an auto_increment primary key column).
3078 In normal usage, the value of such columns should NOT be included at
3079 all in the call to C<update_or_new>, even when set to C<undef>.
3081 See also L</find>, L</find_or_create> and L</find_or_new>.
3087 my $attrs = ( @_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {} );
3088 my $cond = ref $_[0] eq 'HASH' ? shift : {@_};
3090 my $row = $self->find( $cond, $attrs );
3091 if ( defined $row ) {
3092 $row->update($cond);
3096 return $self->new_result($cond);
3103 =item Arguments: none
3105 =item Return Value: L<\@result_objs|DBIx::Class::Manual::ResultClass> | undef
3109 Gets the contents of the cache for the resultset, if the cache is set.
3111 The cache is populated either by using the L</prefetch> attribute to
3112 L</search> or by calling L</set_cache>.
3124 =item Arguments: L<\@result_objs|DBIx::Class::Manual::ResultClass>
3126 =item Return Value: L<\@result_objs|DBIx::Class::Manual::ResultClass>
3130 Sets the contents of the cache for the resultset. Expects an arrayref
3131 of objects of the same class as those produced by the resultset. Note that
3132 if the cache is set, the resultset will return the cached objects rather
3133 than re-querying the database even if the cache attr is not set.
3135 The contents of the cache can also be populated by using the
3136 L</prefetch> attribute to L</search>.
3141 my ( $self, $data ) = @_;
3142 $self->throw_exception("set_cache requires an arrayref")
3143 if defined($data) && (ref $data ne 'ARRAY');
3144 $self->{all_cache} = $data;
3151 =item Arguments: none
3153 =item Return Value: undef
3157 Clears the cache for the resultset.
3162 shift->set_cache(undef);
3169 =item Arguments: none
3171 =item Return Value: true, if the resultset has been paginated
3179 return !!$self->{attrs}{page};
3186 =item Arguments: none
3188 =item Return Value: true, if the resultset has been ordered with C<order_by>.
3196 return scalar $self->result_source->storage->_extract_order_criteria($self->{attrs}{order_by});
3199 =head2 related_resultset
3203 =item Arguments: $rel_name
3205 =item Return Value: L<$resultset|/search>
3209 Returns a related resultset for the supplied relationship name.
3211 $artist_rs = $schema->resultset('CD')->related_resultset('Artist');
3215 sub related_resultset {
3216 my ($self, $rel) = @_;
3218 return $self->{related_resultsets}{$rel}
3219 if defined $self->{related_resultsets}{$rel};
3221 return $self->{related_resultsets}{$rel} = do {
3222 my $rsrc = $self->result_source;
3223 my $rel_info = $rsrc->relationship_info($rel);
3225 $self->throw_exception(
3226 "search_related: result source '" . $rsrc->source_name .
3227 "' has no such relationship $rel")
3230 my $attrs = $self->_chain_relationship($rel);
3232 my $join_count = $attrs->{seen_join}{$rel};
3234 my $alias = $self->result_source->storage
3235 ->relname_to_table_alias($rel, $join_count);
3237 # since this is search_related, and we already slid the select window inwards
3238 # (the select/as attrs were deleted in the beginning), we need to flip all
3239 # left joins to inner, so we get the expected results
3240 # read the comment on top of the actual function to see what this does
3241 $attrs->{from} = $rsrc->schema->storage->_inner_join_to_node ($attrs->{from}, $alias);
3244 #XXX - temp fix for result_class bug. There likely is a more elegant fix -groditi
3245 delete @{$attrs}{qw(result_class alias)};
3247 my $rel_source = $rsrc->related_source($rel);
3251 # The reason we do this now instead of passing the alias to the
3252 # search_rs below is that if you wrap/overload resultset on the
3253 # source you need to know what alias it's -going- to have for things
3254 # to work sanely (e.g. RestrictWithObject wants to be able to add
3255 # extra query restrictions, and these may need to be $alias.)
3257 my $rel_attrs = $rel_source->resultset_attributes;
3258 local $rel_attrs->{alias} = $alias;
3260 $rel_source->resultset
3264 where => $attrs->{where},
3268 if (my $cache = $self->get_cache) {
3269 my @related_cache = map
3270 { @{$_->related_resultset($rel)->get_cache||[]} }
3274 $new->set_cache(\@related_cache) if @related_cache;
3281 =head2 current_source_alias
3285 =item Arguments: none
3287 =item Return Value: $source_alias
3291 Returns the current table alias for the result source this resultset is built
3292 on, that will be used in the SQL query. Usually it is C<me>.
3294 Currently the source alias that refers to the result set returned by a
3295 L</search>/L</find> family method depends on how you got to the resultset: it's
3296 C<me> by default, but eg. L</search_related> aliases it to the related result
3297 source name (and keeps C<me> referring to the original result set). The long
3298 term goal is to make L<DBIx::Class> always alias the current resultset as C<me>
3299 (and make this method unnecessary).
3301 Thus it's currently necessary to use this method in predefined queries (see
3302 L<DBIx::Class::Manual::Cookbook/Predefined searches>) when referring to the
3303 source alias of the current result set:
3305 # in a result set class
3307 my ($self, $user) = @_;
3309 my $me = $self->current_source_alias;
3311 return $self->search({
3312 "$me.modified" => $user->id,
3318 sub current_source_alias {
3319 return (shift->{attrs} || {})->{alias} || 'me';
3322 =head2 as_subselect_rs
3326 =item Arguments: none
3328 =item Return Value: L<$resultset|/search>
3332 Act as a barrier to SQL symbols. The resultset provided will be made into a
3333 "virtual view" by including it as a subquery within the from clause. From this
3334 point on, any joined tables are inaccessible to ->search on the resultset (as if
3335 it were simply where-filtered without joins). For example:
3337 my $rs = $schema->resultset('Bar')->search({'x.name' => 'abc'},{ join => 'x' });
3339 # 'x' now pollutes the query namespace
3341 # So the following works as expected
3342 my $ok_rs = $rs->search({'x.other' => 1});
3344 # But this doesn't: instead of finding a 'Bar' related to two x rows (abc and
3345 # def) we look for one row with contradictory terms and join in another table
3346 # (aliased 'x_2') which we never use
3347 my $broken_rs = $rs->search({'x.name' => 'def'});
3349 my $rs2 = $rs->as_subselect_rs;
3351 # doesn't work - 'x' is no longer accessible in $rs2, having been sealed away
3352 my $not_joined_rs = $rs2->search({'x.other' => 1});
3354 # works as expected: finds a 'table' row related to two x rows (abc and def)
3355 my $correctly_joined_rs = $rs2->search({'x.name' => 'def'});
3357 Another example of when one might use this would be to select a subset of
3358 columns in a group by clause:
3360 my $rs = $schema->resultset('Bar')->search(undef, {
3361 group_by => [qw{ id foo_id baz_id }],
3362 })->as_subselect_rs->search(undef, {
3363 columns => [qw{ id foo_id }]
3366 In the above example normally columns would have to be equal to the group by,
3367 but because we isolated the group by into a subselect the above works.
3371 sub as_subselect_rs {
3374 my $attrs = $self->_resolved_attrs;
3376 my $fresh_rs = (ref $self)->new (
3377 $self->result_source
3380 # these pieces will be locked in the subquery
3381 delete $fresh_rs->{cond};
3382 delete @{$fresh_rs->{attrs}}{qw/where bind/};
3384 return $fresh_rs->search( {}, {
3386 $attrs->{alias} => $self->as_query,
3387 -alias => $attrs->{alias},
3388 -rsrc => $self->result_source,
3390 alias => $attrs->{alias},
3394 # This code is called by search_related, and makes sure there
3395 # is clear separation between the joins before, during, and
3396 # after the relationship. This information is needed later
3397 # in order to properly resolve prefetch aliases (any alias
3398 # with a relation_chain_depth less than the depth of the
3399 # current prefetch is not considered)
3401 # The increments happen twice per join. An even number means a
3402 # relationship specified via a search_related, whereas an odd
3403 # number indicates a join/prefetch added via attributes
3405 # Also this code will wrap the current resultset (the one we
3406 # chain to) in a subselect IFF it contains limiting attributes
3407 sub _chain_relationship {
3408 my ($self, $rel) = @_;
3409 my $source = $self->result_source;
3410 my $attrs = { %{$self->{attrs}||{}} };
3412 # we need to take the prefetch the attrs into account before we
3413 # ->_resolve_join as otherwise they get lost - captainL
3414 my $join = $self->_merge_joinpref_attr( $attrs->{join}, $attrs->{prefetch} );
3416 delete @{$attrs}{qw/join prefetch collapse group_by distinct _grouped_by_distinct select as columns +select +as +columns/};
3418 my $seen = { %{ (delete $attrs->{seen_join}) || {} } };
3421 my @force_subq_attrs = qw/offset rows group_by having/;
3424 ($attrs->{from} && ref $attrs->{from} ne 'ARRAY')
3426 $self->_has_resolved_attr (@force_subq_attrs)
3428 # Nuke the prefetch (if any) before the new $rs attrs
3429 # are resolved (prefetch is useless - we are wrapping
3430 # a subquery anyway).
3431 my $rs_copy = $self->search;
3432 $rs_copy->{attrs}{join} = $self->_merge_joinpref_attr (
3433 $rs_copy->{attrs}{join},
3434 delete $rs_copy->{attrs}{prefetch},
3439 -alias => $attrs->{alias},
3440 $attrs->{alias} => $rs_copy->as_query,
3442 delete @{$attrs}{@force_subq_attrs, qw/where bind/};
3443 $seen->{-relation_chain_depth} = 0;
3445 elsif ($attrs->{from}) { #shallow copy suffices
3446 $from = [ @{$attrs->{from}} ];
3451 -alias => $attrs->{alias},
3452 $attrs->{alias} => $source->from,
3456 my $jpath = ($seen->{-relation_chain_depth})
3457 ? $from->[-1][0]{-join_path}
3460 my @requested_joins = $source->_resolve_join(
3467 push @$from, @requested_joins;
3469 $seen->{-relation_chain_depth}++;
3471 # if $self already had a join/prefetch specified on it, the requested
3472 # $rel might very well be already included. What we do in this case
3473 # is effectively a no-op (except that we bump up the chain_depth on
3474 # the join in question so we could tell it *is* the search_related)
3477 # we consider the last one thus reverse
3478 for my $j (reverse @requested_joins) {
3479 my ($last_j) = keys %{$j->[0]{-join_path}[-1]};
3480 if ($rel eq $last_j) {
3481 $j->[0]{-relation_chain_depth}++;
3487 unless ($already_joined) {
3488 push @$from, $source->_resolve_join(
3496 $seen->{-relation_chain_depth}++;
3498 return {%$attrs, from => $from, seen_join => $seen};
3501 sub _resolved_attrs {
3503 return $self->{_attrs} if $self->{_attrs};
3505 my $attrs = { %{ $self->{attrs} || {} } };
3506 my $source = $self->result_source;
3507 my $alias = $attrs->{alias};
3509 $self->throw_exception("Specifying distinct => 1 in conjunction with collapse => 1 is unsupported")
3510 if $attrs->{collapse} and $attrs->{distinct};
3512 # default selection list
3513 $attrs->{columns} = [ $source->columns ]
3514 unless List::Util::first { exists $attrs->{$_} } qw/columns cols select as/;
3516 # merge selectors together
3517 for (qw/columns select as/) {
3518 $attrs->{$_} = $self->_merge_attr($attrs->{$_}, delete $attrs->{"+$_"})
3519 if $attrs->{$_} or $attrs->{"+$_"};
3522 # disassemble columns
3524 if (my $cols = delete $attrs->{columns}) {
3525 for my $c (ref $cols eq 'ARRAY' ? @$cols : $cols) {
3526 if (ref $c eq 'HASH') {
3527 for my $as (sort keys %$c) {
3528 push @sel, $c->{$as};
3539 # when trying to weed off duplicates later do not go past this point -
3540 # everything added from here on is unbalanced "anyone's guess" stuff
3541 my $dedup_stop_idx = $#as;
3543 push @as, @{ ref $attrs->{as} eq 'ARRAY' ? $attrs->{as} : [ $attrs->{as} ] }
3545 push @sel, @{ ref $attrs->{select} eq 'ARRAY' ? $attrs->{select} : [ $attrs->{select} ] }
3546 if $attrs->{select};
3548 # assume all unqualified selectors to apply to the current alias (legacy stuff)
3549 $_ = (ref $_ or $_ =~ /\./) ? $_ : "$alias.$_" for @sel;
3551 # disqualify all $alias.col as-bits (inflate-map mandated)
3552 $_ = ($_ =~ /^\Q$alias.\E(.+)$/) ? $1 : $_ for @as;
3554 # de-duplicate the result (remove *identical* select/as pairs)
3555 # and also die on duplicate {as} pointing to different {select}s
3556 # not using a c-style for as the condition is prone to shrinkage
3559 while ($i <= $dedup_stop_idx) {
3560 if ($seen->{"$sel[$i] \x00\x00 $as[$i]"}++) {
3565 elsif ($seen->{$as[$i]}++) {
3566 $self->throw_exception(
3567 "inflate_result() alias '$as[$i]' specified twice with different SQL-side {select}-ors"
3575 $attrs->{select} = \@sel;
3576 $attrs->{as} = \@as;
3578 $attrs->{from} ||= [{
3580 -alias => $self->{attrs}{alias},
3581 $self->{attrs}{alias} => $source->from,
3584 if ( $attrs->{join} || $attrs->{prefetch} ) {
3586 $self->throw_exception ('join/prefetch can not be used with a custom {from}')
3587 if ref $attrs->{from} ne 'ARRAY';
3589 my $join = (delete $attrs->{join}) || {};
3591 if ( defined $attrs->{prefetch} ) {
3592 $join = $self->_merge_joinpref_attr( $join, $attrs->{prefetch} );
3595 $attrs->{from} = # have to copy here to avoid corrupting the original
3597 @{ $attrs->{from} },
3598 $source->_resolve_join(
3601 { %{ $attrs->{seen_join} || {} } },
3602 ( $attrs->{seen_join} && keys %{$attrs->{seen_join}})
3603 ? $attrs->{from}[-1][0]{-join_path}
3610 if ( defined $attrs->{order_by} ) {
3611 $attrs->{order_by} = (
3612 ref( $attrs->{order_by} ) eq 'ARRAY'
3613 ? [ @{ $attrs->{order_by} } ]
3614 : [ $attrs->{order_by} || () ]
3618 if ($attrs->{group_by} and ref $attrs->{group_by} ne 'ARRAY') {
3619 $attrs->{group_by} = [ $attrs->{group_by} ];
3623 # generate selections based on the prefetch helper
3624 my ($prefetch, @prefetch_select, @prefetch_as);
3625 $prefetch = $self->_merge_joinpref_attr( {}, delete $attrs->{prefetch} )
3626 if defined $attrs->{prefetch};
3630 $self->throw_exception("Unable to prefetch, resultset contains an unnamed selector $attrs->{_dark_selector}{string}")
3631 if $attrs->{_dark_selector};
3633 $self->throw_exception("Specifying prefetch in conjunction with an explicit collapse => 0 is unsupported")
3634 if defined $attrs->{collapse} and ! $attrs->{collapse};
3636 $attrs->{collapse} = 1;
3638 # this is a separate structure (we don't look in {from} directly)
3639 # as the resolver needs to shift things off the lists to work
3640 # properly (identical-prefetches on different branches)
3642 if (ref $attrs->{from} eq 'ARRAY') {
3644 my $start_depth = $attrs->{seen_join}{-relation_chain_depth} || 0;
3646 for my $j ( @{$attrs->{from}}[1 .. $#{$attrs->{from}} ] ) {
3647 next unless $j->[0]{-alias};
3648 next unless $j->[0]{-join_path};
3649 next if ($j->[0]{-relation_chain_depth} || 0) < $start_depth;
3651 my @jpath = map { keys %$_ } @{$j->[0]{-join_path}};
3654 $p = $p->{$_} ||= {} for @jpath[ ($start_depth/2) .. $#jpath]; #only even depths are actual jpath boundaries
3655 push @{$p->{-join_aliases} }, $j->[0]{-alias};
3659 my @prefetch = $source->_resolve_prefetch( $prefetch, $alias, $join_map );
3661 # save these for after distinct resolution
3662 @prefetch_select = map { $_->[0] } @prefetch;
3663 @prefetch_as = map { $_->[1] } @prefetch;
3666 # run through the resulting joinstructure (starting from our current slot)
3667 # and unset collapse if proven unnecessary
3669 # also while we are at it find out if the current root source has
3670 # been premultiplied by previous related_source chaining
3672 # this allows to predict whether a root object with all other relation
3673 # data set to NULL is in fact unique
3674 if ($attrs->{collapse}) {
3676 if (ref $attrs->{from} eq 'ARRAY') {
3678 if (@{$attrs->{from}} == 1) {
3679 # no joins - no collapse
3680 $attrs->{collapse} = 0;
3683 # find where our table-spec starts
3684 my @fromlist = @{$attrs->{from}};
3686 my $t = shift @fromlist;
3689 # me vs join from-spec distinction - a ref means non-root
3690 if (ref $t eq 'ARRAY') {
3692 $is_multi ||= ! $t->{-is_single};
3694 last if ($t->{-alias} && $t->{-alias} eq $alias);
3695 $attrs->{_main_source_premultiplied} ||= $is_multi;
3698 # no non-singles remaining, nor any premultiplication - nothing to collapse
3700 ! $attrs->{_main_source_premultiplied}
3702 ! List::Util::first { ! $_->[0]{-is_single} } @fromlist
3704 $attrs->{collapse} = 0;
3710 # if we can not analyze the from - err on the side of safety
3711 $attrs->{_main_source_premultiplied} = 1;
3715 # generate the distinct induced group_by before injecting the prefetched select/as parts
3716 if (delete $attrs->{distinct}) {
3717 if ($attrs->{group_by}) {
3718 carp_unique ("Useless use of distinct on a grouped resultset ('distinct' is ignored when a 'group_by' is present)");
3721 $attrs->{_grouped_by_distinct} = 1;
3722 # distinct affects only the main selection part, not what prefetch may add below
3723 ($attrs->{group_by}, my $new_order) = $source->storage->_group_over_selection($attrs);
3725 # FIXME possibly ignore a rewritten order_by (may turn out to be an issue)
3726 # The thinking is: if we are collapsing the subquerying prefetch engine will
3727 # rip stuff apart for us anyway, and we do not want to have a potentially
3728 # function-converted external order_by
3729 # ( there is an explicit if ( collapse && _grouped_by_distinct ) check in DBIHacks )
3730 $attrs->{order_by} = $new_order unless $attrs->{collapse};
3734 # inject prefetch-bound selection (if any)
3735 push @{$attrs->{select}}, @prefetch_select;
3736 push @{$attrs->{as}}, @prefetch_as;
3738 # whether we can get away with the dumbest (possibly DBI-internal) collapser
3739 if ( List::Util::first { $_ =~ /\./ } @{$attrs->{as}} ) {
3740 $attrs->{_related_results_construction} = 1;
3743 # if both page and offset are specified, produce a combined offset
3744 # even though it doesn't make much sense, this is what pre 081xx has
3746 if (my $page = delete $attrs->{page}) {
3748 ($attrs->{rows} * ($page - 1))
3750 ($attrs->{offset} || 0)
3754 return $self->{_attrs} = $attrs;
3758 my ($self, $attr) = @_;
3760 if (ref $attr eq 'HASH') {
3761 return $self->_rollout_hash($attr);
3762 } elsif (ref $attr eq 'ARRAY') {
3763 return $self->_rollout_array($attr);
3769 sub _rollout_array {
3770 my ($self, $attr) = @_;
3773 foreach my $element (@{$attr}) {
3774 if (ref $element eq 'HASH') {
3775 push( @rolled_array, @{ $self->_rollout_hash( $element ) } );
3776 } elsif (ref $element eq 'ARRAY') {
3777 # XXX - should probably recurse here
3778 push( @rolled_array, @{$self->_rollout_array($element)} );
3780 push( @rolled_array, $element );
3783 return \@rolled_array;
3787 my ($self, $attr) = @_;
3790 foreach my $key (keys %{$attr}) {
3791 push( @rolled_array, { $key => $attr->{$key} } );
3793 return \@rolled_array;
3796 sub _calculate_score {
3797 my ($self, $a, $b) = @_;
3799 if (defined $a xor defined $b) {
3802 elsif (not defined $a) {
3806 if (ref $b eq 'HASH') {
3807 my ($b_key) = keys %{$b};
3808 if (ref $a eq 'HASH') {
3809 my ($a_key) = keys %{$a};
3810 if ($a_key eq $b_key) {
3811 return (1 + $self->_calculate_score( $a->{$a_key}, $b->{$b_key} ));
3816 return ($a eq $b_key) ? 1 : 0;
3819 if (ref $a eq 'HASH') {
3820 my ($a_key) = keys %{$a};
3821 return ($b eq $a_key) ? 1 : 0;
3823 return ($b eq $a) ? 1 : 0;
3828 sub _merge_joinpref_attr {
3829 my ($self, $orig, $import) = @_;
3831 return $import unless defined($orig);
3832 return $orig unless defined($import);
3834 $orig = $self->_rollout_attr($orig);
3835 $import = $self->_rollout_attr($import);
3838 foreach my $import_element ( @{$import} ) {
3839 # find best candidate from $orig to merge $b_element into
3840 my $best_candidate = { position => undef, score => 0 }; my $position = 0;
3841 foreach my $orig_element ( @{$orig} ) {
3842 my $score = $self->_calculate_score( $orig_element, $import_element );
3843 if ($score > $best_candidate->{score}) {
3844 $best_candidate->{position} = $position;
3845 $best_candidate->{score} = $score;
3849 my ($import_key) = ( ref $import_element eq 'HASH' ) ? keys %{$import_element} : ($import_element);
3850 $import_key = '' if not defined $import_key;
3852 if ($best_candidate->{score} == 0 || exists $seen_keys->{$import_key}) {
3853 push( @{$orig}, $import_element );
3855 my $orig_best = $orig->[$best_candidate->{position}];
3856 # merge orig_best and b_element together and replace original with merged
3857 if (ref $orig_best ne 'HASH') {
3858 $orig->[$best_candidate->{position}] = $import_element;
3859 } elsif (ref $import_element eq 'HASH') {
3860 my ($key) = keys %{$orig_best};
3861 $orig->[$best_candidate->{position}] = { $key => $self->_merge_joinpref_attr($orig_best->{$key}, $import_element->{$key}) };
3864 $seen_keys->{$import_key} = 1; # don't merge the same key twice
3867 return @$orig ? $orig : ();
3875 require Hash::Merge;
3876 my $hm = Hash::Merge->new;
3878 $hm->specify_behavior({
3881 my ($defl, $defr) = map { defined $_ } (@_[0,1]);
3883 if ($defl xor $defr) {
3884 return [ $defl ? $_[0] : $_[1] ];
3889 elsif (__HM_DEDUP and $_[0] eq $_[1]) {
3893 return [$_[0], $_[1]];
3897 return $_[1] if !defined $_[0];
3898 return $_[1] if __HM_DEDUP and List::Util::first { $_ eq $_[0] } @{$_[1]};
3899 return [$_[0], @{$_[1]}]
3902 return [] if !defined $_[0] and !keys %{$_[1]};
3903 return [ $_[1] ] if !defined $_[0];
3904 return [ $_[0] ] if !keys %{$_[1]};
3905 return [$_[0], $_[1]]
3910 return $_[0] if !defined $_[1];
3911 return $_[0] if __HM_DEDUP and List::Util::first { $_ eq $_[1] } @{$_[0]};
3912 return [@{$_[0]}, $_[1]]
3915 my @ret = @{$_[0]} or return $_[1];
3916 return [ @ret, @{$_[1]} ] unless __HM_DEDUP;
3917 my %idx = map { $_ => 1 } @ret;
3918 push @ret, grep { ! defined $idx{$_} } (@{$_[1]});
3922 return [ $_[1] ] if ! @{$_[0]};
3923 return $_[0] if !keys %{$_[1]};
3924 return $_[0] if __HM_DEDUP and List::Util::first { $_ eq $_[1] } @{$_[0]};
3925 return [ @{$_[0]}, $_[1] ];
3930 return [] if !keys %{$_[0]} and !defined $_[1];
3931 return [ $_[0] ] if !defined $_[1];
3932 return [ $_[1] ] if !keys %{$_[0]};
3933 return [$_[0], $_[1]]
3936 return [] if !keys %{$_[0]} and !@{$_[1]};
3937 return [ $_[0] ] if !@{$_[1]};
3938 return $_[1] if !keys %{$_[0]};
3939 return $_[1] if __HM_DEDUP and List::Util::first { $_ eq $_[0] } @{$_[1]};
3940 return [ $_[0], @{$_[1]} ];
3943 return [] if !keys %{$_[0]} and !keys %{$_[1]};
3944 return [ $_[0] ] if !keys %{$_[1]};
3945 return [ $_[1] ] if !keys %{$_[0]};
3946 return [ $_[0] ] if $_[0] eq $_[1];
3947 return [ $_[0], $_[1] ];
3950 } => 'DBIC_RS_ATTR_MERGER');
3954 return $hm->merge ($_[1], $_[2]);
3958 sub STORABLE_freeze {
3959 my ($self, $cloning) = @_;
3960 my $to_serialize = { %$self };
3962 # A cursor in progress can't be serialized (and would make little sense anyway)
3963 # the parser can be regenerated (and can't be serialized)
3964 delete @{$to_serialize}{qw/cursor _row_parser _result_inflator/};
3966 # nor is it sensical to store a not-yet-fired-count pager
3967 if ($to_serialize->{pager} and ref $to_serialize->{pager}{total_entries} eq 'CODE') {
3968 delete $to_serialize->{pager};
3971 Storable::nfreeze($to_serialize);
3974 # need this hook for symmetry
3976 my ($self, $cloning, $serialized) = @_;
3978 %$self = %{ Storable::thaw($serialized) };
3984 =head2 throw_exception
3986 See L<DBIx::Class::Schema/throw_exception> for details.
3990 sub throw_exception {
3993 if (ref $self and my $rsrc = $self->result_source) {
3994 $rsrc->throw_exception(@_)
3997 DBIx::Class::Exception->throw(@_);
4005 # XXX: FIXME: Attributes docs need clearing up
4009 Attributes are used to refine a ResultSet in various ways when
4010 searching for data. They can be passed to any method which takes an
4011 C<\%attrs> argument. See L</search>, L</search_rs>, L</find>,
4014 Default attributes can be set on the result class using
4015 L<DBIx::Class::ResultSource/resultset_attributes>. (Please read
4016 the CAVEATS on that feature before using it!)
4018 These are in no particular order:
4024 =item Value: ( $order_by | \@order_by | \%order_by )
4028 Which column(s) to order the results by.
4030 [The full list of suitable values is documented in
4031 L<SQL::Abstract/"ORDER BY CLAUSES">; the following is a summary of
4034 If a single column name, or an arrayref of names is supplied, the
4035 argument is passed through directly to SQL. The hashref syntax allows
4036 for connection-agnostic specification of ordering direction:
4038 For descending order:
4040 order_by => { -desc => [qw/col1 col2 col3/] }
4042 For explicit ascending order:
4044 order_by => { -asc => 'col' }
4046 The old scalarref syntax (i.e. order_by => \'year DESC') is still
4047 supported, although you are strongly encouraged to use the hashref
4048 syntax as outlined above.
4054 =item Value: \@columns | \%columns | $column
4058 Shortcut to request a particular set of columns to be retrieved. Each
4059 column spec may be a string (a table column name), or a hash (in which
4060 case the key is the C<as> value, and the value is used as the C<select>
4061 expression). Adds C<me.> onto the start of any column without a C<.> in
4062 it and sets C<select> from that, then auto-populates C<as> from
4063 C<select> as normal. (You may also use the C<cols> attribute, as in
4064 earlier versions of DBIC, but this is deprecated.)
4066 Essentially C<columns> does the same as L</select> and L</as>.
4068 columns => [ 'foo', { bar => 'baz' } ]
4072 select => [qw/foo baz/],
4079 =item Value: \@columns
4083 Indicates additional columns to be selected from storage. Works the same as
4084 L</columns> but adds columns to the selection. (You may also use the
4085 C<include_columns> attribute, as in earlier versions of DBIC, but this is
4086 deprecated). For example:-
4088 $schema->resultset('CD')->search(undef, {
4089 '+columns' => ['artist.name'],
4093 would return all CDs and include a 'name' column to the information
4094 passed to object inflation. Note that the 'artist' is the name of the
4095 column (or relationship) accessor, and 'name' is the name of the column
4096 accessor in the related table.
4098 B<NOTE:> You need to explicitly quote '+columns' when defining the attribute.
4099 Not doing so causes Perl to incorrectly interpret +columns as a bareword with a
4100 unary plus operator before it.
4102 =head2 include_columns
4106 =item Value: \@columns
4110 Deprecated. Acts as a synonym for L</+columns> for backward compatibility.
4116 =item Value: \@select_columns
4120 Indicates which columns should be selected from the storage. You can use
4121 column names, or in the case of RDBMS back ends, function or stored procedure
4124 $rs = $schema->resultset('Employee')->search(undef, {
4127 { count => 'employeeid' },
4128 { max => { length => 'name' }, -as => 'longest_name' }
4133 SELECT name, COUNT( employeeid ), MAX( LENGTH( name ) ) AS longest_name FROM employee
4135 B<NOTE:> You will almost always need a corresponding L</as> attribute when you
4136 use L</select>, to instruct DBIx::Class how to store the result of the column.
4137 Also note that the L</as> attribute has nothing to do with the SQL-side 'AS'
4138 identifier aliasing. You can however alias a function, so you can use it in
4139 e.g. an C<ORDER BY> clause. This is done via the C<-as> B<select function
4140 attribute> supplied as shown in the example above.
4142 B<NOTE:> You need to explicitly quote '+select'/'+as' when defining the attributes.
4143 Not doing so causes Perl to incorrectly interpret them as a bareword with a
4144 unary plus operator before it.
4150 Indicates additional columns to be selected from storage. Works the same as
4151 L</select> but adds columns to the default selection, instead of specifying
4160 =item Value: \@inflation_names
4164 Indicates column names for object inflation. That is L</as> indicates the
4165 slot name in which the column value will be stored within the
4166 L<Row|DBIx::Class::Row> object. The value will then be accessible via this
4167 identifier by the C<get_column> method (or via the object accessor B<if one
4168 with the same name already exists>) as shown below. The L</as> attribute has
4169 B<nothing to do> with the SQL-side C<AS>. See L</select> for details.
4171 $rs = $schema->resultset('Employee')->search(undef, {
4174 { count => 'employeeid' },
4175 { max => { length => 'name' }, -as => 'longest_name' }
4184 If the object against which the search is performed already has an accessor
4185 matching a column name specified in C<as>, the value can be retrieved using
4186 the accessor as normal:
4188 my $name = $employee->name();
4190 If on the other hand an accessor does not exist in the object, you need to
4191 use C<get_column> instead:
4193 my $employee_count = $employee->get_column('employee_count');
4195 You can create your own accessors if required - see
4196 L<DBIx::Class::Manual::Cookbook> for details.
4202 Indicates additional column names for those added via L</+select>. See L</as>.
4210 =item Value: ($rel_name | \@rel_names | \%rel_names)
4214 Contains a list of relationships that should be joined for this query. For
4217 # Get CDs by Nine Inch Nails
4218 my $rs = $schema->resultset('CD')->search(
4219 { 'artist.name' => 'Nine Inch Nails' },
4220 { join => 'artist' }
4223 Can also contain a hash reference to refer to the other relation's relations.
4226 package MyApp::Schema::Track;
4227 use base qw/DBIx::Class/;
4228 __PACKAGE__->table('track');
4229 __PACKAGE__->add_columns(qw/trackid cd position title/);
4230 __PACKAGE__->set_primary_key('trackid');
4231 __PACKAGE__->belongs_to(cd => 'MyApp::Schema::CD');
4234 # In your application
4235 my $rs = $schema->resultset('Artist')->search(
4236 { 'track.title' => 'Teardrop' },
4238 join => { cd => 'track' },
4239 order_by => 'artist.name',
4243 You need to use the relationship (not the table) name in conditions,
4244 because they are aliased as such. The current table is aliased as "me", so
4245 you need to use me.column_name in order to avoid ambiguity. For example:
4247 # Get CDs from 1984 with a 'Foo' track
4248 my $rs = $schema->resultset('CD')->search(
4251 'tracks.name' => 'Foo'
4253 { join => 'tracks' }
4256 If the same join is supplied twice, it will be aliased to <rel>_2 (and
4257 similarly for a third time). For e.g.
4259 my $rs = $schema->resultset('Artist')->search({
4260 'cds.title' => 'Down to Earth',
4261 'cds_2.title' => 'Popular',
4263 join => [ qw/cds cds/ ],
4266 will return a set of all artists that have both a cd with title 'Down
4267 to Earth' and a cd with title 'Popular'.
4269 If you want to fetch related objects from other tables as well, see L</prefetch>
4272 NOTE: An internal join-chain pruner will discard certain joins while
4273 constructing the actual SQL query, as long as the joins in question do not
4274 affect the retrieved result. This for example includes 1:1 left joins
4275 that are not part of the restriction specification (WHERE/HAVING) nor are
4276 a part of the query selection.
4278 For more help on using joins with search, see L<DBIx::Class::Manual::Joining>.
4284 =item Value: (0 | 1)
4288 When set to a true value, indicates that any rows fetched from joined has_many
4289 relationships are to be aggregated into the corresponding "parent" object. For
4290 example, the resultset:
4292 my $rs = $schema->resultset('CD')->search({}, {
4293 '+columns' => [ qw/ tracks.title tracks.position / ],
4298 While executing the following query:
4300 SELECT me.*, tracks.title, tracks.position
4302 LEFT JOIN track tracks
4303 ON tracks.cdid = me.cdid
4305 Will return only as many objects as there are rows in the CD source, even
4306 though the result of the query may span many rows. Each of these CD objects
4307 will in turn have multiple "Track" objects hidden behind the has_many
4308 generated accessor C<tracks>. Without C<< collapse => 1 >>, the return values
4309 of this resultset would be as many CD objects as there are tracks (a "Cartesian
4310 product"), with each CD object containing exactly one of all fetched Track data.
4312 When a collapse is requested on a non-ordered resultset, an order by some
4313 unique part of the main source (the left-most table) is inserted automatically.
4314 This is done so that the resultset is allowed to be "lazy" - calling
4315 L<< $rs->next|/next >> will fetch only as many rows as it needs to build the next
4316 object with all of its related data.
4318 If an L</order_by> is already declared, and orders the resultset in a way that
4319 makes collapsing as described above impossible (e.g. C<< ORDER BY
4320 has_many_rel.column >> or C<ORDER BY RANDOM()>), DBIC will automatically
4321 switch to "eager" mode and slurp the entire resultset before constructing the
4322 first object returned by L</next>.
4324 Setting this attribute on a resultset that does not join any has_many
4325 relations is a no-op.
4327 For a more in-depth discussion, see L</PREFETCHING>.
4333 =item Value: ($rel_name | \@rel_names | \%rel_names)
4337 This attribute is a shorthand for specifying a L</join> spec, adding all
4338 columns from the joined related sources as L</+columns> and setting
4339 L</collapse> to a true value. For example, the following two queries are
4342 my $rs = $schema->resultset('Artist')->search({}, {
4343 prefetch => { cds => ['genre', 'tracks' ] },
4348 my $rs = $schema->resultset('Artist')->search({}, {
4349 join => { cds => ['genre', 'tracks' ] },
4353 { +{ "cds.$_" => "cds.$_" } }
4354 $schema->source('Artist')->related_source('cds')->columns
4357 { +{ "cds.genre.$_" => "genre.$_" } }
4358 $schema->source('Artist')->related_source('cds')->related_source('genre')->columns
4361 { +{ "cds.tracks.$_" => "tracks.$_" } }
4362 $schema->source('Artist')->related_source('cds')->related_source('tracks')->columns
4367 Both producing the following SQL:
4369 SELECT me.artistid, me.name, me.rank, me.charfield,
4370 cds.cdid, cds.artist, cds.title, cds.year, cds.genreid, cds.single_track,
4371 genre.genreid, genre.name,
4372 tracks.trackid, tracks.cd, tracks.position, tracks.title, tracks.last_updated_on, tracks.last_updated_at
4375 ON cds.artist = me.artistid
4376 LEFT JOIN genre genre
4377 ON genre.genreid = cds.genreid
4378 LEFT JOIN track tracks
4379 ON tracks.cd = cds.cdid
4380 ORDER BY me.artistid
4382 While L</prefetch> implies a L</join>, it is ok to mix the two together, as
4383 the arguments are properly merged and generally do the right thing. For
4384 example, you may want to do the following:
4386 my $artists_and_cds_without_genre = $schema->resultset('Artist')->search(
4387 { 'genre.genreid' => undef },
4389 join => { cds => 'genre' },
4394 Which generates the following SQL:
4396 SELECT me.artistid, me.name, me.rank, me.charfield,
4397 cds.cdid, cds.artist, cds.title, cds.year, cds.genreid, cds.single_track
4400 ON cds.artist = me.artistid
4401 LEFT JOIN genre genre
4402 ON genre.genreid = cds.genreid
4403 WHERE genre.genreid IS NULL
4404 ORDER BY me.artistid
4406 For a more in-depth discussion, see L</PREFETCHING>.
4412 =item Value: $source_alias
4416 Sets the source alias for the query. Normally, this defaults to C<me>, but
4417 nested search queries (sub-SELECTs) might need specific aliases set to
4418 reference inner queries. For example:
4421 ->related_resultset('CDs')
4422 ->related_resultset('Tracks')
4424 'track.id' => { -ident => 'none_search.id' },
4428 my $ids = $self->search({
4431 alias => 'none_search',
4432 group_by => 'none_search.id',
4433 })->get_column('id')->as_query;
4435 $self->search({ id => { -in => $ids } })
4437 This attribute is directly tied to L</current_source_alias>.
4447 Makes the resultset paged and specifies the page to retrieve. Effectively
4448 identical to creating a non-pages resultset and then calling ->page($page)
4451 If L</rows> attribute is not specified it defaults to 10 rows per page.
4453 When you have a paged resultset, L</count> will only return the number
4454 of rows in the page. To get the total, use the L</pager> and call
4455 C<total_entries> on it.
4465 Specifies the maximum number of rows for direct retrieval or the number of
4466 rows per page if the page attribute or method is used.
4472 =item Value: $offset
4476 Specifies the (zero-based) row number for the first row to be returned, or the
4477 of the first row of the first page if paging is used.
4479 =head2 software_limit
4483 =item Value: (0 | 1)
4487 When combined with L</rows> and/or L</offset> the generated SQL will not
4488 include any limit dialect stanzas. Instead the entire result will be selected
4489 as if no limits were specified, and DBIC will perform the limit locally, by
4490 artificially advancing and finishing the resulting L</cursor>.
4492 This is the recommended way of performing resultset limiting when no sane RDBMS
4493 implementation is available (e.g.
4494 L<Sybase ASE|DBIx::Class::Storage::DBI::Sybase::ASE> using the
4495 L<Generic Sub Query|DBIx::Class::SQLMaker::LimitDialects/GenericSubQ> hack)
4501 =item Value: \@columns
4505 A arrayref of columns to group by. Can include columns of joined tables.
4507 group_by => [qw/ column1 column2 ... /]
4513 =item Value: $condition
4517 HAVING is a select statement attribute that is applied between GROUP BY and
4518 ORDER BY. It is applied to the after the grouping calculations have been
4521 having => { 'count_employee' => { '>=', 100 } }
4523 or with an in-place function in which case literal SQL is required:
4525 having => \[ 'count(employee) >= ?', [ count => 100 ] ]
4531 =item Value: (0 | 1)
4535 Set to 1 to automatically generate a L</group_by> clause based on the selection
4536 (including intelligent handling of L</order_by> contents). Note that the group
4537 criteria calculation takes place over the B<final> selection. This includes
4538 any L</+columns>, L</+select> or L</order_by> additions in subsequent
4539 L</search> calls, and standalone columns selected via
4540 L<DBIx::Class::ResultSetColumn> (L</get_column>). A notable exception are the
4541 extra selections specified via L</prefetch> - such selections are explicitly
4542 excluded from group criteria calculations.
4544 If the final ResultSet also explicitly defines a L</group_by> attribute, this
4545 setting is ignored and an appropriate warning is issued.
4551 Adds to the WHERE clause.
4553 # only return rows WHERE deleted IS NULL for all searches
4554 __PACKAGE__->resultset_attributes({ where => { deleted => undef } });
4556 Can be overridden by passing C<< { where => undef } >> as an attribute
4559 For more complicated where clauses see L<SQL::Abstract/WHERE CLAUSES>.
4565 Set to 1 to cache search results. This prevents extra SQL queries if you
4566 revisit rows in your ResultSet:
4568 my $resultset = $schema->resultset('Artist')->search( undef, { cache => 1 } );
4570 while( my $artist = $resultset->next ) {
4574 $rs->first; # without cache, this would issue a query
4576 By default, searches are not cached.
4578 For more examples of using these attributes, see
4579 L<DBIx::Class::Manual::Cookbook>.
4585 =item Value: ( 'update' | 'shared' | \$scalar )
4589 Set to 'update' for a SELECT ... FOR UPDATE or 'shared' for a SELECT
4590 ... FOR SHARED. If \$scalar is passed, this is taken directly and embedded in the
4595 DBIx::Class supports arbitrary related data prefetching from multiple related
4596 sources. Any combination of relationship types and column sets are supported.
4597 If L<collapsing|/collapse> is requested, there is an additional requirement of
4598 selecting enough data to make every individual object uniquely identifiable.
4600 Here are some more involved examples, based on the following relationship map:
4603 My::Schema::CD->belongs_to( artist => 'My::Schema::Artist' );
4604 My::Schema::CD->might_have( liner_note => 'My::Schema::LinerNotes' );
4605 My::Schema::CD->has_many( tracks => 'My::Schema::Track' );
4607 My::Schema::Artist->belongs_to( record_label => 'My::Schema::RecordLabel' );
4609 My::Schema::Track->has_many( guests => 'My::Schema::Guest' );
4613 my $rs = $schema->resultset('Tag')->search(
4622 The initial search results in SQL like the following:
4624 SELECT tag.*, cd.*, artist.* FROM tag
4625 JOIN cd ON tag.cd = cd.cdid
4626 JOIN artist ON cd.artist = artist.artistid
4628 L<DBIx::Class> has no need to go back to the database when we access the
4629 C<cd> or C<artist> relationships, which saves us two SQL statements in this
4632 Simple prefetches will be joined automatically, so there is no need
4633 for a C<join> attribute in the above search.
4635 The L</prefetch> attribute can be used with any of the relationship types
4636 and multiple prefetches can be specified together. Below is a more complex
4637 example that prefetches a CD's artist, its liner notes (if present),
4638 the cover image, the tracks on that CD, and the guests on those
4641 my $rs = $schema->resultset('CD')->search(
4645 { artist => 'record_label'}, # belongs_to => belongs_to
4646 'liner_note', # might_have
4647 'cover_image', # has_one
4648 { tracks => 'guests' }, # has_many => has_many
4653 This will produce SQL like the following:
4655 SELECT cd.*, artist.*, record_label.*, liner_note.*, cover_image.*,
4659 ON artist.artistid = me.artistid
4660 JOIN record_label record_label
4661 ON record_label.labelid = artist.labelid
4662 LEFT JOIN track tracks
4663 ON tracks.cdid = me.cdid
4664 LEFT JOIN guest guests
4665 ON guests.trackid = track.trackid
4666 LEFT JOIN liner_notes liner_note
4667 ON liner_note.cdid = me.cdid
4668 JOIN cd_artwork cover_image
4669 ON cover_image.cdid = me.cdid
4672 Now the C<artist>, C<record_label>, C<liner_note>, C<cover_image>,
4673 C<tracks>, and C<guests> of the CD will all be available through the
4674 relationship accessors without the need for additional queries to the
4679 Prefetch does a lot of deep magic. As such, it may not behave exactly
4680 as you might expect.
4686 Prefetch uses the L</cache> to populate the prefetched relationships. This
4687 may or may not be what you want.
4691 If you specify a condition on a prefetched relationship, ONLY those
4692 rows that match the prefetched condition will be fetched into that relationship.
4693 This means that adding prefetch to a search() B<may alter> what is returned by
4694 traversing a relationship. So, if you have C<< Artist->has_many(CDs) >> and you do
4696 my $artist_rs = $schema->resultset('Artist')->search({
4702 my $count = $artist_rs->first->cds->count;
4704 my $artist_rs_prefetch = $artist_rs->search( {}, { prefetch => 'cds' } );
4706 my $prefetch_count = $artist_rs_prefetch->first->cds->count;
4708 cmp_ok( $count, '==', $prefetch_count, "Counts should be the same" );
4710 That cmp_ok() may or may not pass depending on the datasets involved. In other
4711 words the C<WHERE> condition would apply to the entire dataset, just like
4712 it would in regular SQL. If you want to add a condition only to the "right side"
4713 of a C<LEFT JOIN> - consider declaring and using a L<relationship with a custom
4714 condition|DBIx::Class::Relationship::Base/condition>
4718 =head1 DBIC BIND VALUES
4720 Because DBIC may need more information to bind values than just the column name
4721 and value itself, it uses a special format for both passing and receiving bind
4722 values. Each bind value should be composed of an arrayref of
4723 C<< [ \%args => $val ] >>. The format of C<< \%args >> is currently:
4729 If present (in any form), this is what is being passed directly to bind_param.
4730 Note that different DBD's expect different bind args. (e.g. DBD::SQLite takes
4731 a single numerical type, while DBD::Pg takes a hashref if bind options.)
4733 If this is specified, all other bind options described below are ignored.
4737 If present, this is used to infer the actual bind attribute by passing to
4738 C<< $resolved_storage->bind_attribute_by_data_type() >>. Defaults to the
4739 "data_type" from the L<add_columns column info|DBIx::Class::ResultSource/add_columns>.
4741 Note that the data type is somewhat freeform (hence the sqlt_ prefix);
4742 currently drivers are expected to "Do the Right Thing" when given a common
4743 datatype name. (Not ideal, but that's what we got at this point.)
4747 Currently used to correctly allocate buffers for bind_param_inout().
4748 Defaults to "size" from the L<add_columns column info|DBIx::Class::ResultSource/add_columns>,
4749 or to a sensible value based on the "data_type".
4753 Used to fill in missing sqlt_datatype and sqlt_size attributes (if they are
4754 explicitly specified they are never overridden). Also used by some weird DBDs,
4755 where the column name should be available at bind_param time (e.g. Oracle).
4759 For backwards compatibility and convenience, the following shortcuts are
4762 [ $name => $val ] === [ { dbic_colname => $name }, $val ]
4763 [ \$dt => $val ] === [ { sqlt_datatype => $dt }, $val ]
4764 [ undef, $val ] === [ {}, $val ]
4765 $val === [ {}, $val ]
4767 =head1 AUTHOR AND CONTRIBUTORS
4769 See L<AUTHOR|DBIx::Class/AUTHOR> and L<CONTRIBUTORS|DBIx::Class/CONTRIBUTORS> in DBIx::Class
4773 You may distribute this code under the same terms as Perl itself.