1 package DBIx::Class::ResultSet;
9 use Carp::Clan qw/^DBIx::Class/;
12 use DBIx::Class::ResultSetColumn;
13 use DBIx::Class::ResultSourceHandle;
16 use base qw/DBIx::Class/;
18 __PACKAGE__->mk_group_accessors('simple' => qw/_result_class _source_handle/);
22 DBIx::Class::ResultSet - Represents a query used for fetching a set of results.
26 my $users_rs = $schema->resultset('User');
27 my $registered_users_rs = $schema->resultset('User')->search({ registered => 1 });
28 my @cds_in_2005 = $schema->resultset('CD')->search({ year => 2005 })->all();
32 A ResultSet is an object which stores a set of conditions representing
33 a query. It is the backbone of DBIx::Class (i.e. the really
34 important/useful bit).
36 No SQL is executed on the database when a ResultSet is created, it
37 just stores all the conditions needed to create the query.
39 A basic ResultSet representing the data of an entire table is returned
40 by calling C<resultset> on a L<DBIx::Class::Schema> and passing in a
41 L<Source|DBIx::Class::Manual::Glossary/Source> name.
43 my $users_rs = $schema->resultset('User');
45 A new ResultSet is returned from calling L</search> on an existing
46 ResultSet. The new one will contain all the conditions of the
47 original, plus any new conditions added in the C<search> call.
49 A ResultSet also incorporates an implicit iterator. L</next> and L</reset>
50 can be used to walk through all the L<DBIx::Class::Row>s the ResultSet
53 The query that the ResultSet represents is B<only> executed against
54 the database when these methods are called:
55 L</find> L</next> L</all> L</first> L</single> L</count>
59 =head2 Chaining resultsets
61 Let's say you've got a query that needs to be run to return some data
62 to the user. But, you have an authorization system in place that
63 prevents certain users from seeing certain information. So, you want
64 to construct the basic query in one method, but add constraints to it in
69 my $request = $self->get_request; # Get a request object somehow.
70 my $schema = $self->get_schema; # Get the DBIC schema object somehow.
72 my $cd_rs = $schema->resultset('CD')->search({
73 title => $request->param('title'),
74 year => $request->param('year'),
77 $self->apply_security_policy( $cd_rs );
82 sub apply_security_policy {
91 =head3 Resolving conditions and attributes
93 When a resultset is chained from another resultset, conditions and
94 attributes with the same keys need resolving.
96 L</join>, L</prefetch>, L</+select>, L</+as> attributes are merged
97 into the existing ones from the original resultset.
99 The L</where>, L</having> attribute, and any search conditions are
100 merged with an SQL C<AND> to the existing condition from the original
103 All other attributes are overridden by any new ones supplied in the
106 =head2 Multiple queries
108 Since a resultset just defines a query, you can do all sorts of
109 things with it with the same object.
111 # Don't hit the DB yet.
112 my $cd_rs = $schema->resultset('CD')->search({
113 title => 'something',
117 # Each of these hits the DB individually.
118 my $count = $cd_rs->count;
119 my $most_recent = $cd_rs->get_column('date_released')->max();
120 my @records = $cd_rs->all;
122 And it's not just limited to SELECT statements.
128 $cd_rs->create({ artist => 'Fred' });
130 Which is the same as:
132 $schema->resultset('CD')->create({
133 title => 'something',
138 See: L</search>, L</count>, L</get_column>, L</all>, L</create>.
142 If a resultset is used in a numeric context it returns the L</count>.
143 However, if it is used in a booleand context it is always true. So if
144 you want to check if a resultset has any results use C<if $rs != 0>.
145 C<if $rs> will always be true.
153 =item Arguments: $source, \%$attrs
155 =item Return Value: $rs
159 The resultset constructor. Takes a source object (usually a
160 L<DBIx::Class::ResultSourceProxy::Table>) and an attribute hash (see
161 L</ATTRIBUTES> below). Does not perform any queries -- these are
162 executed as needed by the other methods.
164 Generally you won't need to construct a resultset manually. You'll
165 automatically get one from e.g. a L</search> called in scalar context:
167 my $rs = $schema->resultset('CD')->search({ title => '100th Window' });
169 IMPORTANT: If called on an object, proxies to new_result instead so
171 my $cd = $schema->resultset('CD')->new({ title => 'Spoon' });
173 will return a CD object, not a ResultSet.
179 return $class->new_result(@_) if ref $class;
181 my ($source, $attrs) = @_;
182 $source = $source->handle
183 unless $source->isa('DBIx::Class::ResultSourceHandle');
184 $attrs = { %{$attrs||{}} };
186 if ($attrs->{page}) {
187 $attrs->{rows} ||= 10;
190 $attrs->{alias} ||= 'me';
192 # Creation of {} and bless separated to mitigate RH perl bug
193 # see https://bugzilla.redhat.com/show_bug.cgi?id=196836
195 _source_handle => $source,
196 cond => $attrs->{where},
205 $attrs->{result_class} || $source->resolve->result_class
215 =item Arguments: $cond, \%attrs?
217 =item Return Value: $resultset (scalar context), @row_objs (list context)
221 my @cds = $cd_rs->search({ year => 2001 }); # "... WHERE year = 2001"
222 my $new_rs = $cd_rs->search({ year => 2005 });
224 my $new_rs = $cd_rs->search([ { year => 2005 }, { year => 2004 } ]);
225 # year = 2005 OR year = 2004
227 If you need to pass in additional attributes but no additional condition,
228 call it as C<search(undef, \%attrs)>.
230 # "SELECT name, artistid FROM $artist_table"
231 my @all_artists = $schema->resultset('Artist')->search(undef, {
232 columns => [qw/name artistid/],
235 For a list of attributes that can be passed to C<search>, see
236 L</ATTRIBUTES>. For more examples of using this function, see
237 L<Searching|DBIx::Class::Manual::Cookbook/Searching>. For a complete
238 documentation for the first argument, see L<SQL::Abstract>.
240 For more help on using joins with search, see L<DBIx::Class::Manual::Joining>.
246 my $rs = $self->search_rs( @_ );
247 return (wantarray ? $rs->all : $rs);
254 =item Arguments: $cond, \%attrs?
256 =item Return Value: $resultset
260 This method does the same exact thing as search() except it will
261 always return a resultset, even in list context.
268 # Special-case handling for (undef, undef).
269 if ( @_ == 2 && !defined $_[1] && !defined $_[0] ) {
274 $attrs = pop(@_) if @_ > 1 and ref $_[$#_] eq 'HASH';
275 my $our_attrs = { %{$self->{attrs}} };
276 my $having = delete $our_attrs->{having};
277 my $where = delete $our_attrs->{where};
281 my %safe = (alias => 1, cache => 1);
284 (@_ && defined($_[0])) # @_ == () or (undef)
286 (keys %$attrs # empty attrs or only 'safe' attrs
287 && List::Util::first { !$safe{$_} } keys %$attrs)
289 # no search, effectively just a clone
290 $rows = $self->get_cache;
293 my $new_attrs = { %{$our_attrs}, %{$attrs} };
295 # merge new attrs into inherited
296 foreach my $key (qw/join prefetch +select +as bind/) {
297 next unless exists $attrs->{$key};
298 $new_attrs->{$key} = $self->_merge_attr($our_attrs->{$key}, $attrs->{$key});
303 (@_ == 1 || ref $_[0] eq "HASH")
305 (ref $_[0] eq 'HASH')
307 (keys %{ $_[0] } > 0)
315 ? $self->throw_exception("Odd number of arguments to search")
322 if (defined $where) {
323 $new_attrs->{where} = (
324 defined $new_attrs->{where}
327 ref $_ eq 'ARRAY' ? [ -or => $_ ] : $_
328 } $where, $new_attrs->{where}
335 $new_attrs->{where} = (
336 defined $new_attrs->{where}
339 ref $_ eq 'ARRAY' ? [ -or => $_ ] : $_
340 } $cond, $new_attrs->{where}
346 if (defined $having) {
347 $new_attrs->{having} = (
348 defined $new_attrs->{having}
351 ref $_ eq 'ARRAY' ? [ -or => $_ ] : $_
352 } $having, $new_attrs->{having}
358 my $rs = (ref $self)->new($self->result_source, $new_attrs);
360 $rs->set_cache($rows);
365 =head2 search_literal
369 =item Arguments: $sql_fragment, @bind_values
371 =item Return Value: $resultset (scalar context), @row_objs (list context)
375 my @cds = $cd_rs->search_literal('year = ? AND title = ?', qw/2001 Reload/);
376 my $newrs = $artist_rs->search_literal('name = ?', 'Metallica');
378 Pass a literal chunk of SQL to be added to the conditional part of the
381 CAVEAT: C<search_literal> is provided for Class::DBI compatibility and should
382 only be used in that context. C<search_literal> is a convenience method.
383 It is equivalent to calling $schema->search(\[]), but if you want to ensure
384 columns are bound correctly, use C<search>.
386 Example of how to use C<search> instead of C<search_literal>
388 my @cds = $cd_rs->search_literal('cdid = ? AND (artist = ? OR artist = ?)', (2, 1, 2));
389 my @cds = $cd_rs->search(\[ 'cdid = ? AND (artist = ? OR artist = ?)', [ 'cdid', 2 ], [ 'artist', 1 ], [ 'artist', 2 ] ]);
392 See L<DBIx::Class::Manual::Cookbook/Searching> and
393 L<DBIx::Class::Manual::FAQ/Searching> for searching techniques that do not
394 require C<search_literal>.
399 my ($self, $sql, @bind) = @_;
401 if ( @bind && ref($bind[-1]) eq 'HASH' ) {
404 return $self->search(\[ $sql, map [ __DUMMY__ => $_ ], @bind ], ($attr || () ));
411 =item Arguments: @values | \%cols, \%attrs?
413 =item Return Value: $row_object | undef
417 Finds a row based on its primary key or unique constraint. For example, to find
418 a row by its primary key:
420 my $cd = $schema->resultset('CD')->find(5);
422 You can also find a row by a specific unique constraint using the C<key>
423 attribute. For example:
425 my $cd = $schema->resultset('CD')->find('Massive Attack', 'Mezzanine', {
426 key => 'cd_artist_title'
429 Additionally, you can specify the columns explicitly by name:
431 my $cd = $schema->resultset('CD')->find(
433 artist => 'Massive Attack',
434 title => 'Mezzanine',
436 { key => 'cd_artist_title' }
439 If the C<key> is specified as C<primary>, it searches only on the primary key.
441 If no C<key> is specified, it searches on all unique constraints defined on the
442 source for which column data is provided, including the primary key.
444 If your table does not have a primary key, you B<must> provide a value for the
445 C<key> attribute matching one of the unique constraints on the source.
447 In addition to C<key>, L</find> recognizes and applies standard
448 L<resultset attributes|/ATTRIBUTES> in the same way as L</search> does.
450 Note: If your query does not return only one row, a warning is generated:
452 Query returned more than one row
454 See also L</find_or_create> and L</update_or_create>. For information on how to
455 declare unique constraints, see
456 L<DBIx::Class::ResultSource/add_unique_constraint>.
462 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
464 # Default to the primary key, but allow a specific key
465 my @cols = exists $attrs->{key}
466 ? $self->result_source->unique_constraint_columns($attrs->{key})
467 : $self->result_source->primary_columns;
468 $self->throw_exception(
469 "Can't find unless a primary key is defined or unique constraint is specified"
472 # Parse out a hashref from input
474 if (ref $_[0] eq 'HASH') {
475 $input_query = { %{$_[0]} };
477 elsif (@_ == @cols) {
479 @{$input_query}{@cols} = @_;
482 # Compatibility: Allow e.g. find(id => $value)
483 carp "Find by key => value deprecated; please use a hashref instead";
487 my (%related, $info);
489 KEY: foreach my $key (keys %$input_query) {
490 if (ref($input_query->{$key})
491 && ($info = $self->result_source->relationship_info($key))) {
492 my $val = delete $input_query->{$key};
493 next KEY if (ref($val) eq 'ARRAY'); # has_many for multi_create
494 my $rel_q = $self->result_source->_resolve_condition(
495 $info->{cond}, $val, $key
497 die "Can't handle OR join condition in find" if ref($rel_q) eq 'ARRAY';
498 @related{keys %$rel_q} = values %$rel_q;
501 if (my @keys = keys %related) {
502 @{$input_query}{@keys} = values %related;
506 # Build the final query: Default to the disjunction of the unique queries,
507 # but allow the input query in case the ResultSet defines the query or the
508 # user is abusing find
509 my $alias = exists $attrs->{alias} ? $attrs->{alias} : $self->{attrs}{alias};
511 if (exists $attrs->{key}) {
512 my @unique_cols = $self->result_source->unique_constraint_columns($attrs->{key});
513 my $unique_query = $self->_build_unique_query($input_query, \@unique_cols);
514 $query = $self->_add_alias($unique_query, $alias);
516 elsif ($self->{attrs}{accessor} and $self->{attrs}{accessor} eq 'single') {
517 # This means that we got here after a merger of relationship conditions
518 # in ::Relationship::Base::search_related (the row method), and furthermore
519 # the relationship is of the 'single' type. This means that the condition
520 # provided by the relationship (already attached to $self) is sufficient,
521 # as there can be only one row in the databse that would satisfy the
525 my @unique_queries = $self->_unique_queries($input_query, $attrs);
526 $query = @unique_queries
527 ? [ map { $self->_add_alias($_, $alias) } @unique_queries ]
528 : $self->_add_alias($input_query, $alias);
532 my $rs = $self->search ($query, $attrs);
533 if (keys %{$rs->_resolved_attrs->{collapse}}) {
535 carp "Query returned more than one row" if $rs->next;
545 # Add the specified alias to the specified query hash. A copy is made so the
546 # original query is not modified.
549 my ($self, $query, $alias) = @_;
551 my %aliased = %$query;
552 foreach my $col (grep { ! m/\./ } keys %aliased) {
553 $aliased{"$alias.$col"} = delete $aliased{$col};
561 # Build a list of queries which satisfy unique constraints.
563 sub _unique_queries {
564 my ($self, $query, $attrs) = @_;
566 my @constraint_names = exists $attrs->{key}
568 : $self->result_source->unique_constraint_names;
570 my $where = $self->_collapse_cond($self->{attrs}{where} || {});
571 my $num_where = scalar keys %$where;
574 foreach my $name (@constraint_names) {
575 my @unique_cols = $self->result_source->unique_constraint_columns($name);
576 my $unique_query = $self->_build_unique_query($query, \@unique_cols);
578 my $num_cols = scalar @unique_cols;
579 my $num_query = scalar keys %$unique_query;
581 my $total = $num_query + $num_where;
582 if ($num_query && ($num_query == $num_cols || $total == $num_cols)) {
583 # The query is either unique on its own or is unique in combination with
584 # the existing where clause
585 push @unique_queries, $unique_query;
589 return @unique_queries;
592 # _build_unique_query
594 # Constrain the specified query hash based on the specified column names.
596 sub _build_unique_query {
597 my ($self, $query, $unique_cols) = @_;
600 map { $_ => $query->{$_} }
601 grep { exists $query->{$_} }
606 =head2 search_related
610 =item Arguments: $rel, $cond, \%attrs?
612 =item Return Value: $new_resultset
616 $new_rs = $cd_rs->search_related('artist', {
620 Searches the specified relationship, optionally specifying a condition and
621 attributes for matching records. See L</ATTRIBUTES> for more information.
626 return shift->related_resultset(shift)->search(@_);
629 =head2 search_related_rs
631 This method works exactly the same as search_related, except that
632 it guarantees a restultset, even in list context.
636 sub search_related_rs {
637 return shift->related_resultset(shift)->search_rs(@_);
644 =item Arguments: none
646 =item Return Value: $cursor
650 Returns a storage-driven cursor to the given resultset. See
651 L<DBIx::Class::Cursor> for more information.
658 my $attrs = $self->_resolved_attrs_copy;
660 return $self->{cursor}
661 ||= $self->result_source->storage->select($attrs->{from}, $attrs->{select},
662 $attrs->{where},$attrs);
669 =item Arguments: $cond?
671 =item Return Value: $row_object?
675 my $cd = $schema->resultset('CD')->single({ year => 2001 });
677 Inflates the first result without creating a cursor if the resultset has
678 any records in it; if not returns nothing. Used by L</find> as a lean version of
681 While this method can take an optional search condition (just like L</search>)
682 being a fast-code-path it does not recognize search attributes. If you need to
683 add extra joins or similar, call L</search> and then chain-call L</single> on the
684 L<DBIx::Class::ResultSet> returned.
690 As of 0.08100, this method enforces the assumption that the preceeding
691 query returns only one row. If more than one row is returned, you will receive
694 Query returned more than one row
696 In this case, you should be using L</next> or L</find> instead, or if you really
697 know what you are doing, use the L</rows> attribute to explicitly limit the size
700 This method will also throw an exception if it is called on a resultset prefetching
701 has_many, as such a prefetch implies fetching multiple rows from the database in
702 order to assemble the resulting object.
709 my ($self, $where) = @_;
711 $self->throw_exception('single() only takes search conditions, no attributes. You want ->search( $cond, $attrs )->single()');
714 my $attrs = $self->_resolved_attrs_copy;
716 if (keys %{$attrs->{collapse}}) {
717 $self->throw_exception(
718 'single() can not be used on resultsets prefetching has_many. Use find( \%cond ) or next() instead'
723 if (defined $attrs->{where}) {
726 [ map { ref $_ eq 'ARRAY' ? [ -or => $_ ] : $_ }
727 $where, delete $attrs->{where} ]
730 $attrs->{where} = $where;
734 # XXX: Disabled since it doesn't infer uniqueness in all cases
735 # unless ($self->_is_unique_query($attrs->{where})) {
736 # carp "Query not guaranteed to return a single row"
737 # . "; please declare your unique constraints or use search instead";
740 my @data = $self->result_source->storage->select_single(
741 $attrs->{from}, $attrs->{select},
742 $attrs->{where}, $attrs
745 return (@data ? ($self->_construct_object(@data))[0] : undef);
751 # Try to determine if the specified query is guaranteed to be unique, based on
752 # the declared unique constraints.
754 sub _is_unique_query {
755 my ($self, $query) = @_;
757 my $collapsed = $self->_collapse_query($query);
758 my $alias = $self->{attrs}{alias};
760 foreach my $name ($self->result_source->unique_constraint_names) {
761 my @unique_cols = map {
763 } $self->result_source->unique_constraint_columns($name);
765 # Count the values for each unique column
766 my %seen = map { $_ => 0 } @unique_cols;
768 foreach my $key (keys %$collapsed) {
769 my $aliased = $key =~ /\./ ? $key : "$alias.$key";
770 next unless exists $seen{$aliased}; # Additional constraints are okay
771 $seen{$aliased} = scalar keys %{ $collapsed->{$key} };
774 # If we get 0 or more than 1 value for a column, it's not necessarily unique
775 return 1 unless grep { $_ != 1 } values %seen;
783 # Recursively collapse the query, accumulating values for each column.
785 sub _collapse_query {
786 my ($self, $query, $collapsed) = @_;
790 if (ref $query eq 'ARRAY') {
791 foreach my $subquery (@$query) {
792 next unless ref $subquery; # -or
793 $collapsed = $self->_collapse_query($subquery, $collapsed);
796 elsif (ref $query eq 'HASH') {
797 if (keys %$query and (keys %$query)[0] eq '-and') {
798 foreach my $subquery (@{$query->{-and}}) {
799 $collapsed = $self->_collapse_query($subquery, $collapsed);
803 foreach my $col (keys %$query) {
804 my $value = $query->{$col};
805 $collapsed->{$col}{$value}++;
817 =item Arguments: $cond?
819 =item Return Value: $resultsetcolumn
823 my $max_length = $rs->get_column('length')->max;
825 Returns a L<DBIx::Class::ResultSetColumn> instance for a column of the ResultSet.
830 my ($self, $column) = @_;
831 my $new = DBIx::Class::ResultSetColumn->new($self, $column);
839 =item Arguments: $cond, \%attrs?
841 =item Return Value: $resultset (scalar context), @row_objs (list context)
845 # WHERE title LIKE '%blue%'
846 $cd_rs = $rs->search_like({ title => '%blue%'});
848 Performs a search, but uses C<LIKE> instead of C<=> as the condition. Note
849 that this is simply a convenience method retained for ex Class::DBI users.
850 You most likely want to use L</search> with specific operators.
852 For more information, see L<DBIx::Class::Manual::Cookbook>.
854 This method is deprecated and will be removed in 0.09. Use L</search()>
855 instead. An example conversion is:
857 ->search_like({ foo => 'bar' });
861 ->search({ foo => { like => 'bar' } });
868 'search_like() is deprecated and will be removed in DBIC version 0.09.'
869 .' Instead use ->search({ x => { -like => "y%" } })'
870 .' (note the outer pair of {}s - they are important!)'
872 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
873 my $query = ref $_[0] eq 'HASH' ? { %{shift()} }: {@_};
874 $query->{$_} = { 'like' => $query->{$_} } for keys %$query;
875 return $class->search($query, { %$attrs });
882 =item Arguments: $first, $last
884 =item Return Value: $resultset (scalar context), @row_objs (list context)
888 Returns a resultset or object list representing a subset of elements from the
889 resultset slice is called on. Indexes are from 0, i.e., to get the first
892 my ($one, $two, $three) = $rs->slice(0, 2);
897 my ($self, $min, $max) = @_;
898 my $attrs = {}; # = { %{ $self->{attrs} || {} } };
899 $attrs->{offset} = $self->{attrs}{offset} || 0;
900 $attrs->{offset} += $min;
901 $attrs->{rows} = ($max ? ($max - $min + 1) : 1);
902 return $self->search(undef(), $attrs);
903 #my $slice = (ref $self)->new($self->result_source, $attrs);
904 #return (wantarray ? $slice->all : $slice);
911 =item Arguments: none
913 =item Return Value: $result?
917 Returns the next element in the resultset (C<undef> is there is none).
919 Can be used to efficiently iterate over records in the resultset:
921 my $rs = $schema->resultset('CD')->search;
922 while (my $cd = $rs->next) {
926 Note that you need to store the resultset object, and call C<next> on it.
927 Calling C<< resultset('Table')->next >> repeatedly will always return the
928 first record from the resultset.
934 if (my $cache = $self->get_cache) {
935 $self->{all_cache_position} ||= 0;
936 return $cache->[$self->{all_cache_position}++];
938 if ($self->{attrs}{cache}) {
939 $self->{all_cache_position} = 1;
940 return ($self->all)[0];
942 if ($self->{stashed_objects}) {
943 my $obj = shift(@{$self->{stashed_objects}});
944 delete $self->{stashed_objects} unless @{$self->{stashed_objects}};
948 exists $self->{stashed_row}
949 ? @{delete $self->{stashed_row}}
950 : $self->cursor->next
952 return undef unless (@row);
953 my ($row, @more) = $self->_construct_object(@row);
954 $self->{stashed_objects} = \@more if @more;
958 sub _construct_object {
959 my ($self, @row) = @_;
960 my $info = $self->_collapse_result($self->{_attrs}{as}, \@row);
961 my @new = $self->result_class->inflate_result($self->result_source, @$info);
962 @new = $self->{_attrs}{record_filter}->(@new)
963 if exists $self->{_attrs}{record_filter};
967 sub _collapse_result {
968 my ($self, $as_proto, $row) = @_;
972 # 'foo' => [ undef, 'foo' ]
973 # 'foo.bar' => [ 'foo', 'bar' ]
974 # 'foo.bar.baz' => [ 'foo.bar', 'baz' ]
976 my @construct_as = map { [ (/^(?:(.*)\.)?([^.]+)$/) ] } @$as_proto;
978 my %collapse = %{$self->{_attrs}{collapse}||{}};
982 # if we're doing collapsing (has_many prefetch) we need to grab records
983 # until the PK changes, so fill @pri_index. if not, we leave it empty so
984 # we know we don't have to bother.
986 # the reason for not using the collapse stuff directly is because if you
987 # had for e.g. two artists in a row with no cds, the collapse info for
988 # both would be NULL (undef) so you'd lose the second artist
990 # store just the index so we can check the array positions from the row
991 # without having to contruct the full hash
993 if (keys %collapse) {
994 my %pri = map { ($_ => 1) } $self->result_source->primary_columns;
995 foreach my $i (0 .. $#construct_as) {
996 next if defined($construct_as[$i][0]); # only self table
997 if (delete $pri{$construct_as[$i][1]}) {
998 push(@pri_index, $i);
1000 last unless keys %pri; # short circuit (Johnny Five Is Alive!)
1004 # no need to do an if, it'll be empty if @pri_index is empty anyway
1006 my %pri_vals = map { ($_ => $copy[$_]) } @pri_index;
1010 do { # no need to check anything at the front, we always want the first row
1014 foreach my $this_as (@construct_as) {
1015 $const{$this_as->[0]||''}{$this_as->[1]} = shift(@copy);
1018 push(@const_rows, \%const);
1020 } until ( # no pri_index => no collapse => drop straight out
1023 do { # get another row, stash it, drop out if different PK
1025 @copy = $self->cursor->next;
1026 $self->{stashed_row} = \@copy;
1028 # last thing in do block, counts as true if anything doesn't match
1030 # check xor defined first for NULL vs. NOT NULL then if one is
1031 # defined the other must be so check string equality
1034 (defined $pri_vals{$_} ^ defined $copy[$_])
1035 || (defined $pri_vals{$_} && ($pri_vals{$_} ne $copy[$_]))
1040 my $alias = $self->{attrs}{alias};
1047 foreach my $const (@const_rows) {
1048 scalar @const_keys or do {
1049 @const_keys = sort { length($a) <=> length($b) } keys %$const;
1051 foreach my $key (@const_keys) {
1054 my @parts = split(/\./, $key);
1056 my $data = $const->{$key};
1057 foreach my $p (@parts) {
1058 $target = $target->[1]->{$p} ||= [];
1060 if ($cur eq ".${key}" && (my @ckey = @{$collapse{$cur}||[]})) {
1061 # collapsing at this point and on final part
1062 my $pos = $collapse_pos{$cur};
1063 CK: foreach my $ck (@ckey) {
1064 if (!defined $pos->{$ck} || $pos->{$ck} ne $data->{$ck}) {
1065 $collapse_pos{$cur} = $data;
1066 delete @collapse_pos{ # clear all positioning for sub-entries
1067 grep { m/^\Q${cur}.\E/ } keys %collapse_pos
1074 if (exists $collapse{$cur}) {
1075 $target = $target->[-1];
1078 $target->[0] = $data;
1080 $info->[0] = $const->{$key};
1088 =head2 result_source
1092 =item Arguments: $result_source?
1094 =item Return Value: $result_source
1098 An accessor for the primary ResultSource object from which this ResultSet
1105 =item Arguments: $result_class?
1107 =item Return Value: $result_class
1111 An accessor for the class to use when creating row objects. Defaults to
1112 C<< result_source->result_class >> - which in most cases is the name of the
1113 L<"table"|DBIx::Class::Manual::Glossary/"ResultSource"> class.
1115 Note that changing the result_class will also remove any components
1116 that were originally loaded in the source class via
1117 L<DBIx::Class::ResultSource/load_components>. Any overloaded methods
1118 in the original source class will not run.
1123 my ($self, $result_class) = @_;
1124 if ($result_class) {
1125 $self->ensure_class_loaded($result_class);
1126 $self->_result_class($result_class);
1128 $self->_result_class;
1135 =item Arguments: $cond, \%attrs??
1137 =item Return Value: $count
1141 Performs an SQL C<COUNT> with the same query as the resultset was built
1142 with to find the number of elements. Passing arguments is equivalent to
1143 C<< $rs->search ($cond, \%attrs)->count >>
1149 return $self->search(@_)->count if @_ and defined $_[0];
1150 return scalar @{ $self->get_cache } if $self->get_cache;
1152 my $attrs = $self->_resolved_attrs_copy;
1154 # this is a little optimization - it is faster to do the limit
1155 # adjustments in software, instead of a subquery
1156 my $rows = delete $attrs->{rows};
1157 my $offset = delete $attrs->{offset};
1160 if ($self->_has_resolved_attr (qw/collapse group_by/)) {
1161 $crs = $self->_count_subq_rs ($attrs);
1164 $crs = $self->_count_rs ($attrs);
1166 my $count = $crs->next;
1168 $count -= $offset if $offset;
1169 $count = $rows if $rows and $rows < $count;
1170 $count = 0 if ($count < 0);
1179 =item Arguments: $cond, \%attrs??
1181 =item Return Value: $count_rs
1185 Same as L</count> but returns a L<DBIx::Class::ResultSetColumn> object.
1186 This can be very handy for subqueries:
1188 ->search( { amount => $some_rs->count_rs->as_query } )
1190 As with regular resultsets the SQL query will be executed only after
1191 the resultset is accessed via L</next> or L</all>. That would return
1192 the same single value obtainable via L</count>.
1198 return $self->search(@_)->count_rs if @_;
1200 # this may look like a lack of abstraction (count() does about the same)
1201 # but in fact an _rs *must* use a subquery for the limits, as the
1202 # software based limiting can not be ported if this $rs is to be used
1203 # in a subquery itself (i.e. ->as_query)
1204 if ($self->_has_resolved_attr (qw/collapse group_by offset rows/)) {
1205 return $self->_count_subq_rs;
1208 return $self->_count_rs;
1213 # returns a ResultSetColumn object tied to the count query
1216 my ($self, $attrs) = @_;
1218 my $rsrc = $self->result_source;
1219 $attrs ||= $self->_resolved_attrs;
1221 my $tmp_attrs = { %$attrs };
1223 # take off any limits, record_filter is cdbi, and no point of ordering a count
1224 delete $tmp_attrs->{$_} for (qw/select as rows offset order_by record_filter/);
1226 # overwrite the selector (supplied by the storage)
1227 $tmp_attrs->{select} = $rsrc->storage->_count_select ($rsrc, $tmp_attrs);
1228 $tmp_attrs->{as} = 'count';
1230 my $tmp_rs = $rsrc->resultset_class->new($rsrc, $tmp_attrs)->get_column ('count');
1236 # same as above but uses a subquery
1238 sub _count_subq_rs {
1239 my ($self, $attrs) = @_;
1241 my $rsrc = $self->result_source;
1242 $attrs ||= $self->_resolved_attrs_copy;
1244 my $sub_attrs = { %$attrs };
1246 # these can not go in the subquery, and there is no point of ordering it
1247 delete $sub_attrs->{$_} for qw/collapse select as order_by/;
1249 # if we prefetch, we group_by primary keys only as this is what we would get out of the rs via ->next/->all
1250 # clobber old group_by regardless
1251 if ( keys %{$attrs->{collapse}} ) {
1252 $sub_attrs->{group_by} = [ map { "$attrs->{alias}.$_" } ($rsrc->primary_columns) ]
1255 $sub_attrs->{select} = $rsrc->storage->_subq_count_select ($rsrc, $sub_attrs);
1257 # this is so that ordering can be thrown away in things like Top limit
1258 $sub_attrs->{-for_count_only} = 1;
1260 my $sub_rs = $rsrc->resultset_class->new ($rsrc, $sub_attrs);
1262 -alias => 'count_subq',
1263 -source_handle => $rsrc->handle,
1264 count_subq => $sub_rs->as_query,
1267 # the subquery replaces this
1268 delete $attrs->{$_} for qw/where bind collapse group_by having having_bind rows offset/;
1270 return $self->_count_rs ($attrs);
1278 =head2 count_literal
1282 =item Arguments: $sql_fragment, @bind_values
1284 =item Return Value: $count
1288 Counts the results in a literal query. Equivalent to calling L</search_literal>
1289 with the passed arguments, then L</count>.
1293 sub count_literal { shift->search_literal(@_)->count; }
1299 =item Arguments: none
1301 =item Return Value: @objects
1305 Returns all elements in the resultset. Called implicitly if the resultset
1306 is returned in list context.
1313 $self->throw_exception("all() doesn't take any arguments, you probably wanted ->search(...)->all()");
1316 return @{ $self->get_cache } if $self->get_cache;
1320 # TODO: don't call resolve here
1321 if (keys %{$self->_resolved_attrs->{collapse}}) {
1322 # if ($self->{attrs}{prefetch}) {
1323 # Using $self->cursor->all is really just an optimisation.
1324 # If we're collapsing has_many prefetches it probably makes
1325 # very little difference, and this is cleaner than hacking
1326 # _construct_object to survive the approach
1327 my @row = $self->cursor->next;
1329 push(@obj, $self->_construct_object(@row));
1330 @row = (exists $self->{stashed_row}
1331 ? @{delete $self->{stashed_row}}
1332 : $self->cursor->next);
1335 @obj = map { $self->_construct_object(@$_) } $self->cursor->all;
1338 $self->set_cache(\@obj) if $self->{attrs}{cache};
1346 =item Arguments: none
1348 =item Return Value: $self
1352 Resets the resultset's cursor, so you can iterate through the elements again.
1358 delete $self->{_attrs} if exists $self->{_attrs};
1359 $self->{all_cache_position} = 0;
1360 $self->cursor->reset;
1368 =item Arguments: none
1370 =item Return Value: $object?
1374 Resets the resultset and returns an object for the first result (if the
1375 resultset returns anything).
1380 return $_[0]->reset->next;
1386 # Determines whether and what type of subquery is required for the $rs operation.
1387 # If grouping is necessary either supplies its own, or verifies the current one
1388 # After all is done delegates to the proper storage method.
1390 sub _rs_update_delete {
1391 my ($self, $op, $values) = @_;
1393 my $rsrc = $self->result_source;
1395 my $needs_group_by_subq = $self->_has_resolved_attr (qw/collapse group_by -join/);
1396 my $needs_subq = $self->_has_resolved_attr (qw/row offset/);
1398 if ($needs_group_by_subq or $needs_subq) {
1400 # make a new $rs selecting only the PKs (that's all we really need)
1401 my $attrs = $self->_resolved_attrs_copy;
1403 delete $attrs->{$_} for qw/collapse select as/;
1404 $attrs->{columns} = [ map { "$attrs->{alias}.$_" } ($self->result_source->primary_columns) ];
1406 if ($needs_group_by_subq) {
1407 # make sure no group_by was supplied, or if there is one - make sure it matches
1408 # the columns compiled above perfectly. Anything else can not be sanely executed
1409 # on most databases so croak right then and there
1411 if (my $g = $attrs->{group_by}) {
1412 my @current_group_by = map
1413 { $_ =~ /\./ ? $_ : "$attrs->{alias}.$_" }
1414 (ref $g eq 'ARRAY' ? @$g : $g );
1417 join ("\x00", sort @current_group_by)
1419 join ("\x00", sort @{$attrs->{columns}} )
1421 $self->throw_exception (
1422 "You have just attempted a $op operation on a resultset which does group_by"
1423 . ' on columns other than the primary keys, while DBIC internally needs to retrieve'
1424 . ' the primary keys in a subselect. All sane RDBMS engines do not support this'
1425 . ' kind of queries. Please retry the operation with a modified group_by or'
1426 . ' without using one at all.'
1431 $attrs->{group_by} = $attrs->{columns};
1435 my $subrs = (ref $self)->new($rsrc, $attrs);
1437 return $self->result_source->storage->_subq_update_delete($subrs, $op, $values);
1440 return $rsrc->storage->$op(
1442 $op eq 'update' ? $values : (),
1443 $self->_cond_for_update_delete,
1449 # _cond_for_update_delete
1451 # update/delete require the condition to be modified to handle
1452 # the differing SQL syntax available. This transforms the $self->{cond}
1453 # appropriately, returning the new condition.
1455 sub _cond_for_update_delete {
1456 my ($self, $full_cond) = @_;
1459 $full_cond ||= $self->{cond};
1460 # No-op. No condition, we're updating/deleting everything
1461 return $cond unless ref $full_cond;
1463 if (ref $full_cond eq 'ARRAY') {
1467 foreach my $key (keys %{$_}) {
1469 $hash{$1} = $_->{$key};
1475 elsif (ref $full_cond eq 'HASH') {
1476 if ((keys %{$full_cond})[0] eq '-and') {
1478 my @cond = @{$full_cond->{-and}};
1479 for (my $i = 0; $i < @cond; $i++) {
1480 my $entry = $cond[$i];
1482 if (ref $entry eq 'HASH') {
1483 $hash = $self->_cond_for_update_delete($entry);
1486 $entry =~ /([^.]+)$/;
1487 $hash->{$1} = $cond[++$i];
1489 push @{$cond->{-and}}, $hash;
1493 foreach my $key (keys %{$full_cond}) {
1495 $cond->{$1} = $full_cond->{$key};
1500 $self->throw_exception("Can't update/delete on resultset with condition unless hash or array");
1511 =item Arguments: \%values
1513 =item Return Value: $storage_rv
1517 Sets the specified columns in the resultset to the supplied values in a
1518 single query. Return value will be true if the update succeeded or false
1519 if no records were updated; exact type of success value is storage-dependent.
1524 my ($self, $values) = @_;
1525 $self->throw_exception('Values for update must be a hash')
1526 unless ref $values eq 'HASH';
1528 return $self->_rs_update_delete ('update', $values);
1535 =item Arguments: \%values
1537 =item Return Value: 1
1541 Fetches all objects and updates them one at a time. Note that C<update_all>
1542 will run DBIC cascade triggers, while L</update> will not.
1547 my ($self, $values) = @_;
1548 $self->throw_exception('Values for update_all must be a hash')
1549 unless ref $values eq 'HASH';
1550 foreach my $obj ($self->all) {
1551 $obj->set_columns($values)->update;
1560 =item Arguments: none
1562 =item Return Value: $storage_rv
1566 Deletes the contents of the resultset from its result source. Note that this
1567 will not run DBIC cascade triggers. See L</delete_all> if you need triggers
1568 to run. See also L<DBIx::Class::Row/delete>.
1570 Return value will be the amount of rows deleted; exact type of return value
1571 is storage-dependent.
1577 $self->throw_exception('delete does not accept any arguments')
1580 return $self->_rs_update_delete ('delete');
1587 =item Arguments: none
1589 =item Return Value: 1
1593 Fetches all objects and deletes them one at a time. Note that C<delete_all>
1594 will run DBIC cascade triggers, while L</delete> will not.
1600 $self->throw_exception('delete_all does not accept any arguments')
1603 $_->delete for $self->all;
1611 =item Arguments: \@data;
1615 Accepts either an arrayref of hashrefs or alternatively an arrayref of arrayrefs.
1616 For the arrayref of hashrefs style each hashref should be a structure suitable
1617 forsubmitting to a $resultset->create(...) method.
1619 In void context, C<insert_bulk> in L<DBIx::Class::Storage::DBI> is used
1620 to insert the data, as this is a faster method.
1622 Otherwise, each set of data is inserted into the database using
1623 L<DBIx::Class::ResultSet/create>, and the resulting objects are
1624 accumulated into an array. The array itself, or an array reference
1625 is returned depending on scalar or list context.
1627 Example: Assuming an Artist Class that has many CDs Classes relating:
1629 my $Artist_rs = $schema->resultset("Artist");
1631 ## Void Context Example
1632 $Artist_rs->populate([
1633 { artistid => 4, name => 'Manufactured Crap', cds => [
1634 { title => 'My First CD', year => 2006 },
1635 { title => 'Yet More Tweeny-Pop crap', year => 2007 },
1638 { artistid => 5, name => 'Angsty-Whiny Girl', cds => [
1639 { title => 'My parents sold me to a record company' ,year => 2005 },
1640 { title => 'Why Am I So Ugly?', year => 2006 },
1641 { title => 'I Got Surgery and am now Popular', year => 2007 }
1646 ## Array Context Example
1647 my ($ArtistOne, $ArtistTwo, $ArtistThree) = $Artist_rs->populate([
1648 { name => "Artist One"},
1649 { name => "Artist Two"},
1650 { name => "Artist Three", cds=> [
1651 { title => "First CD", year => 2007},
1652 { title => "Second CD", year => 2008},
1656 print $ArtistOne->name; ## response is 'Artist One'
1657 print $ArtistThree->cds->count ## reponse is '2'
1659 For the arrayref of arrayrefs style, the first element should be a list of the
1660 fieldsnames to which the remaining elements are rows being inserted. For
1663 $Arstist_rs->populate([
1664 [qw/artistid name/],
1665 [100, 'A Formally Unknown Singer'],
1666 [101, 'A singer that jumped the shark two albums ago'],
1667 [102, 'An actually cool singer.'],
1670 Please note an important effect on your data when choosing between void and
1671 wantarray context. Since void context goes straight to C<insert_bulk> in
1672 L<DBIx::Class::Storage::DBI> this will skip any component that is overriding
1673 C<insert>. So if you are using something like L<DBIx-Class-UUIDColumns> to
1674 create primary keys for you, you will find that your PKs are empty. In this
1675 case you will have to use the wantarray context in order to create those
1681 my $self = shift @_;
1682 my $data = ref $_[0][0] eq 'HASH'
1683 ? $_[0] : ref $_[0][0] eq 'ARRAY' ? $self->_normalize_populate_args($_[0]) :
1684 $self->throw_exception('Populate expects an arrayref of hashes or arrayref of arrayrefs');
1686 if(defined wantarray) {
1688 foreach my $item (@$data) {
1689 push(@created, $self->create($item));
1691 return wantarray ? @created : \@created;
1693 my ($first, @rest) = @$data;
1695 my @names = grep {!ref $first->{$_}} keys %$first;
1696 my @rels = grep { $self->result_source->has_relationship($_) } keys %$first;
1697 my @pks = $self->result_source->primary_columns;
1699 ## do the belongs_to relationships
1700 foreach my $index (0..$#$data) {
1702 # delegate to create() for any dataset without primary keys with specified relationships
1703 if (grep { !defined $data->[$index]->{$_} } @pks ) {
1705 if (grep { ref $data->[$index]{$r} eq $_ } qw/HASH ARRAY/) { # a related set must be a HASH or AoH
1706 my @ret = $self->populate($data);
1712 foreach my $rel (@rels) {
1713 next unless ref $data->[$index]->{$rel} eq "HASH";
1714 my $result = $self->related_resultset($rel)->create($data->[$index]->{$rel});
1715 my ($reverse) = keys %{$self->result_source->reverse_relationship_info($rel)};
1716 my $related = $result->result_source->_resolve_condition(
1717 $result->result_source->relationship_info($reverse)->{cond},
1722 delete $data->[$index]->{$rel};
1723 $data->[$index] = {%{$data->[$index]}, %$related};
1725 push @names, keys %$related if $index == 0;
1729 ## do bulk insert on current row
1730 my @values = map { [ @$_{@names} ] } @$data;
1732 $self->result_source->storage->insert_bulk(
1733 $self->result_source,
1738 ## do the has_many relationships
1739 foreach my $item (@$data) {
1741 foreach my $rel (@rels) {
1742 next unless $item->{$rel} && ref $item->{$rel} eq "ARRAY";
1744 my $parent = $self->find(map {{$_=>$item->{$_}} } @pks)
1745 || $self->throw_exception('Cannot find the relating object.');
1747 my $child = $parent->$rel;
1749 my $related = $child->result_source->_resolve_condition(
1750 $parent->result_source->relationship_info($rel)->{cond},
1755 my @rows_to_add = ref $item->{$rel} eq 'ARRAY' ? @{$item->{$rel}} : ($item->{$rel});
1756 my @populate = map { {%$_, %$related} } @rows_to_add;
1758 $child->populate( \@populate );
1764 =head2 _normalize_populate_args ($args)
1766 Private method used by L</populate> to normalize its incoming arguments. Factored
1767 out in case you want to subclass and accept new argument structures to the
1768 L</populate> method.
1772 sub _normalize_populate_args {
1773 my ($self, $data) = @_;
1774 my @names = @{shift(@$data)};
1775 my @results_to_create;
1776 foreach my $datum (@$data) {
1777 my %result_to_create;
1778 foreach my $index (0..$#names) {
1779 $result_to_create{$names[$index]} = $$datum[$index];
1781 push @results_to_create, \%result_to_create;
1783 return \@results_to_create;
1790 =item Arguments: none
1792 =item Return Value: $pager
1796 Return Value a L<Data::Page> object for the current resultset. Only makes
1797 sense for queries with a C<page> attribute.
1799 To get the full count of entries for a paged resultset, call
1800 C<total_entries> on the L<Data::Page> object.
1807 return $self->{pager} if $self->{pager};
1809 my $attrs = $self->{attrs};
1810 $self->throw_exception("Can't create pager for non-paged rs")
1811 unless $self->{attrs}{page};
1812 $attrs->{rows} ||= 10;
1814 # throw away the paging flags and re-run the count (possibly
1815 # with a subselect) to get the real total count
1816 my $count_attrs = { %$attrs };
1817 delete $count_attrs->{$_} for qw/rows offset page pager/;
1818 my $total_count = (ref $self)->new($self->result_source, $count_attrs)->count;
1820 return $self->{pager} = Data::Page->new(
1823 $self->{attrs}{page}
1831 =item Arguments: $page_number
1833 =item Return Value: $rs
1837 Returns a resultset for the $page_number page of the resultset on which page
1838 is called, where each page contains a number of rows equal to the 'rows'
1839 attribute set on the resultset (10 by default).
1844 my ($self, $page) = @_;
1845 return (ref $self)->new($self->result_source, { %{$self->{attrs}}, page => $page });
1852 =item Arguments: \%vals
1854 =item Return Value: $rowobject
1858 Creates a new row object in the resultset's result class and returns
1859 it. The row is not inserted into the database at this point, call
1860 L<DBIx::Class::Row/insert> to do that. Calling L<DBIx::Class::Row/in_storage>
1861 will tell you whether the row object has been inserted or not.
1863 Passes the hashref of input on to L<DBIx::Class::Row/new>.
1868 my ($self, $values) = @_;
1869 $self->throw_exception( "new_result needs a hash" )
1870 unless (ref $values eq 'HASH');
1873 my $alias = $self->{attrs}{alias};
1876 defined $self->{cond}
1877 && $self->{cond} eq $DBIx::Class::ResultSource::UNRESOLVABLE_CONDITION
1879 %new = %{ $self->{attrs}{related_objects} || {} }; # nothing might have been inserted yet
1880 $new{-from_resultset} = [ keys %new ] if keys %new;
1882 $self->throw_exception(
1883 "Can't abstract implicit construct, condition not a hash"
1884 ) if ($self->{cond} && !(ref $self->{cond} eq 'HASH'));
1886 my $collapsed_cond = (
1888 ? $self->_collapse_cond($self->{cond})
1892 # precendence must be given to passed values over values inherited from
1893 # the cond, so the order here is important.
1894 my %implied = %{$self->_remove_alias($collapsed_cond, $alias)};
1895 while( my($col,$value) = each %implied ){
1896 if(ref($value) eq 'HASH' && keys(%$value) && (keys %$value)[0] eq '='){
1897 $new{$col} = $value->{'='};
1900 $new{$col} = $value if $self->_is_deterministic_value($value);
1906 %{ $self->_remove_alias($values, $alias) },
1907 -source_handle => $self->_source_handle,
1908 -result_source => $self->result_source, # DO NOT REMOVE THIS, REQUIRED
1911 return $self->result_class->new(\%new);
1914 # _is_deterministic_value
1916 # Make an effor to strip non-deterministic values from the condition,
1917 # to make sure new_result chokes less
1919 sub _is_deterministic_value {
1922 my $ref_type = ref $value;
1923 return 1 if $ref_type eq '' || $ref_type eq 'SCALAR';
1924 return 1 if Scalar::Util::blessed($value);
1928 # _has_resolved_attr
1930 # determines if the resultset defines at least one
1931 # of the attributes supplied
1933 # used to determine if a subquery is neccessary
1935 sub _has_resolved_attr {
1936 my ($self, @attr_names) = @_;
1938 my $attrs = $self->_resolved_attrs;
1942 for my $n (@attr_names) {
1943 ++$join_check_req if $n eq '-join';
1945 my $attr = $attrs->{$n};
1947 next if not defined $attr;
1949 if (ref $attr eq 'HASH') {
1950 return 1 if keys %$attr;
1952 elsif (ref $attr eq 'ARRAY') {
1960 # a resolved join is expressed as a multi-level from
1964 ref $attrs->{from} eq 'ARRAY'
1966 @{$attrs->{from}} > 1
1974 # Recursively collapse the condition.
1976 sub _collapse_cond {
1977 my ($self, $cond, $collapsed) = @_;
1981 if (ref $cond eq 'ARRAY') {
1982 foreach my $subcond (@$cond) {
1983 next unless ref $subcond; # -or
1984 $collapsed = $self->_collapse_cond($subcond, $collapsed);
1987 elsif (ref $cond eq 'HASH') {
1988 if (keys %$cond and (keys %$cond)[0] eq '-and') {
1989 foreach my $subcond (@{$cond->{-and}}) {
1990 $collapsed = $self->_collapse_cond($subcond, $collapsed);
1994 foreach my $col (keys %$cond) {
1995 my $value = $cond->{$col};
1996 $collapsed->{$col} = $value;
2006 # Remove the specified alias from the specified query hash. A copy is made so
2007 # the original query is not modified.
2010 my ($self, $query, $alias) = @_;
2012 my %orig = %{ $query || {} };
2015 foreach my $key (keys %orig) {
2017 $unaliased{$key} = $orig{$key};
2020 $unaliased{$1} = $orig{$key}
2021 if $key =~ m/^(?:\Q$alias\E\.)?([^.]+)$/;
2027 =head2 as_query (EXPERIMENTAL)
2031 =item Arguments: none
2033 =item Return Value: \[ $sql, @bind ]
2037 Returns the SQL query and bind vars associated with the invocant.
2039 This is generally used as the RHS for a subquery.
2041 B<NOTE>: This feature is still experimental.
2048 my $attrs = $self->_resolved_attrs_copy;
2053 # my ($sql, \@bind, \%dbi_bind_attrs) = _select_args_to_query (...)
2054 # $sql also has no wrapping parenthesis in list ctx
2056 my $sqlbind = $self->result_source->storage
2057 ->_select_args_to_query ($attrs->{from}, $attrs->{select}, $attrs->{where}, $attrs);
2066 =item Arguments: \%vals, \%attrs?
2068 =item Return Value: $rowobject
2072 my $artist = $schema->resultset('Artist')->find_or_new(
2073 { artist => 'fred' }, { key => 'artists' });
2075 $cd->cd_to_producer->find_or_new({ producer => $producer },
2076 { key => 'primary });
2078 Find an existing record from this resultset, based on its primary
2079 key, or a unique constraint. If none exists, instantiate a new result
2080 object and return it. The object will not be saved into your storage
2081 until you call L<DBIx::Class::Row/insert> on it.
2083 You most likely want this method when looking for existing rows using
2084 a unique constraint that is not the primary key, or looking for
2087 If you want objects to be saved immediately, use L</find_or_create> instead.
2089 B<Note>: C<find_or_new> is probably not what you want when creating a
2090 new row in a table that uses primary keys supplied by the
2091 database. Passing in a primary key column with a value of I<undef>
2092 will cause L</find> to attempt to search for a row with a value of
2099 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
2100 my $hash = ref $_[0] eq 'HASH' ? shift : {@_};
2101 if (keys %$hash and my $row = $self->find($hash, $attrs) ) {
2104 return $self->new_result($hash);
2111 =item Arguments: \%vals
2113 =item Return Value: a L<DBIx::Class::Row> $object
2117 Attempt to create a single new row or a row with multiple related rows
2118 in the table represented by the resultset (and related tables). This
2119 will not check for duplicate rows before inserting, use
2120 L</find_or_create> to do that.
2122 To create one row for this resultset, pass a hashref of key/value
2123 pairs representing the columns of the table and the values you wish to
2124 store. If the appropriate relationships are set up, foreign key fields
2125 can also be passed an object representing the foreign row, and the
2126 value will be set to its primary key.
2128 To create related objects, pass a hashref for the value if the related
2129 item is a foreign key relationship (L<DBIx::Class::Relationship/belongs_to>),
2130 and use the name of the relationship as the key. (NOT the name of the field,
2131 necessarily). For C<has_many> and C<has_one> relationships, pass an arrayref
2132 of hashrefs containing the data for each of the rows to create in the foreign
2133 tables, again using the relationship name as the key.
2135 Instead of hashrefs of plain related data (key/value pairs), you may
2136 also pass new or inserted objects. New objects (not inserted yet, see
2137 L</new>), will be inserted into their appropriate tables.
2139 Effectively a shortcut for C<< ->new_result(\%vals)->insert >>.
2141 Example of creating a new row.
2143 $person_rs->create({
2144 name=>"Some Person",
2145 email=>"somebody@someplace.com"
2148 Example of creating a new row and also creating rows in a related C<has_many>
2149 or C<has_one> resultset. Note Arrayref.
2152 { artistid => 4, name => 'Manufactured Crap', cds => [
2153 { title => 'My First CD', year => 2006 },
2154 { title => 'Yet More Tweeny-Pop crap', year => 2007 },
2159 Example of creating a new row and also creating a row in a related
2160 C<belongs_to>resultset. Note Hashref.
2163 title=>"Music for Silly Walks",
2166 name=>"Silly Musician",
2173 my ($self, $attrs) = @_;
2174 $self->throw_exception( "create needs a hashref" )
2175 unless ref $attrs eq 'HASH';
2176 return $self->new_result($attrs)->insert;
2179 =head2 find_or_create
2183 =item Arguments: \%vals, \%attrs?
2185 =item Return Value: $rowobject
2189 $cd->cd_to_producer->find_or_create({ producer => $producer },
2190 { key => 'primary' });
2192 Tries to find a record based on its primary key or unique constraints; if none
2193 is found, creates one and returns that instead.
2195 my $cd = $schema->resultset('CD')->find_or_create({
2197 artist => 'Massive Attack',
2198 title => 'Mezzanine',
2202 Also takes an optional C<key> attribute, to search by a specific key or unique
2203 constraint. For example:
2205 my $cd = $schema->resultset('CD')->find_or_create(
2207 artist => 'Massive Attack',
2208 title => 'Mezzanine',
2210 { key => 'cd_artist_title' }
2213 B<Note>: Because find_or_create() reads from the database and then
2214 possibly inserts based on the result, this method is subject to a race
2215 condition. Another process could create a record in the table after
2216 the find has completed and before the create has started. To avoid
2217 this problem, use find_or_create() inside a transaction.
2219 B<Note>: C<find_or_create> is probably not what you want when creating
2220 a new row in a table that uses primary keys supplied by the
2221 database. Passing in a primary key column with a value of I<undef>
2222 will cause L</find> to attempt to search for a row with a value of
2225 See also L</find> and L</update_or_create>. For information on how to declare
2226 unique constraints, see L<DBIx::Class::ResultSource/add_unique_constraint>.
2230 sub find_or_create {
2232 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
2233 my $hash = ref $_[0] eq 'HASH' ? shift : {@_};
2234 if (keys %$hash and my $row = $self->find($hash, $attrs) ) {
2237 return $self->create($hash);
2240 =head2 update_or_create
2244 =item Arguments: \%col_values, { key => $unique_constraint }?
2246 =item Return Value: $rowobject
2250 $resultset->update_or_create({ col => $val, ... });
2252 First, searches for an existing row matching one of the unique constraints
2253 (including the primary key) on the source of this resultset. If a row is
2254 found, updates it with the other given column values. Otherwise, creates a new
2257 Takes an optional C<key> attribute to search on a specific unique constraint.
2260 # In your application
2261 my $cd = $schema->resultset('CD')->update_or_create(
2263 artist => 'Massive Attack',
2264 title => 'Mezzanine',
2267 { key => 'cd_artist_title' }
2270 $cd->cd_to_producer->update_or_create({
2271 producer => $producer,
2278 If no C<key> is specified, it searches on all unique constraints defined on the
2279 source, including the primary key.
2281 If the C<key> is specified as C<primary>, it searches only on the primary key.
2283 See also L</find> and L</find_or_create>. For information on how to declare
2284 unique constraints, see L<DBIx::Class::ResultSource/add_unique_constraint>.
2286 B<Note>: C<update_or_create> is probably not what you want when
2287 looking for a row in a table that uses primary keys supplied by the
2288 database, unless you actually have a key value. Passing in a primary
2289 key column with a value of I<undef> will cause L</find> to attempt to
2290 search for a row with a value of I<NULL>.
2294 sub update_or_create {
2296 my $attrs = (@_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {});
2297 my $cond = ref $_[0] eq 'HASH' ? shift : {@_};
2299 my $row = $self->find($cond, $attrs);
2301 $row->update($cond);
2305 return $self->create($cond);
2308 =head2 update_or_new
2312 =item Arguments: \%col_values, { key => $unique_constraint }?
2314 =item Return Value: $rowobject
2318 $resultset->update_or_new({ col => $val, ... });
2320 First, searches for an existing row matching one of the unique constraints
2321 (including the primary key) on the source of this resultset. If a row is
2322 found, updates it with the other given column values. Otherwise, instantiate
2323 a new result object and return it. The object will not be saved into your storage
2324 until you call L<DBIx::Class::Row/insert> on it.
2326 Takes an optional C<key> attribute to search on a specific unique constraint.
2329 # In your application
2330 my $cd = $schema->resultset('CD')->update_or_new(
2332 artist => 'Massive Attack',
2333 title => 'Mezzanine',
2336 { key => 'cd_artist_title' }
2339 if ($cd->in_storage) {
2340 # the cd was updated
2343 # the cd is not yet in the database, let's insert it
2347 See also L</find>, L</find_or_create> and L<find_or_new>.
2353 my $attrs = ( @_ > 1 && ref $_[$#_] eq 'HASH' ? pop(@_) : {} );
2354 my $cond = ref $_[0] eq 'HASH' ? shift : {@_};
2356 my $row = $self->find( $cond, $attrs );
2357 if ( defined $row ) {
2358 $row->update($cond);
2362 return $self->new_result($cond);
2369 =item Arguments: none
2371 =item Return Value: \@cache_objects?
2375 Gets the contents of the cache for the resultset, if the cache is set.
2377 The cache is populated either by using the L</prefetch> attribute to
2378 L</search> or by calling L</set_cache>.
2390 =item Arguments: \@cache_objects
2392 =item Return Value: \@cache_objects
2396 Sets the contents of the cache for the resultset. Expects an arrayref
2397 of objects of the same class as those produced by the resultset. Note that
2398 if the cache is set the resultset will return the cached objects rather
2399 than re-querying the database even if the cache attr is not set.
2401 The contents of the cache can also be populated by using the
2402 L</prefetch> attribute to L</search>.
2407 my ( $self, $data ) = @_;
2408 $self->throw_exception("set_cache requires an arrayref")
2409 if defined($data) && (ref $data ne 'ARRAY');
2410 $self->{all_cache} = $data;
2417 =item Arguments: none
2419 =item Return Value: []
2423 Clears the cache for the resultset.
2428 shift->set_cache(undef);
2431 =head2 related_resultset
2435 =item Arguments: $relationship_name
2437 =item Return Value: $resultset
2441 Returns a related resultset for the supplied relationship name.
2443 $artist_rs = $schema->resultset('CD')->related_resultset('Artist');
2447 sub related_resultset {
2448 my ($self, $rel) = @_;
2450 $self->{related_resultsets} ||= {};
2451 return $self->{related_resultsets}{$rel} ||= do {
2452 my $rel_info = $self->result_source->relationship_info($rel);
2454 $self->throw_exception(
2455 "search_related: result source '" . $self->result_source->source_name .
2456 "' has no such relationship $rel")
2459 my ($from,$seen) = $self->_resolve_from($rel);
2461 my $join_count = $seen->{$rel};
2462 my $alias = ($join_count > 1 ? join('_', $rel, $join_count) : $rel);
2464 #XXX - temp fix for result_class bug. There likely is a more elegant fix -groditi
2465 my %attrs = %{$self->{attrs}||{}};
2466 delete @attrs{qw(result_class alias)};
2470 if (my $cache = $self->get_cache) {
2471 if ($cache->[0] && $cache->[0]->related_resultset($rel)->get_cache) {
2472 $new_cache = [ map { @{$_->related_resultset($rel)->get_cache} }
2477 my $rel_source = $self->result_source->related_source($rel);
2481 # The reason we do this now instead of passing the alias to the
2482 # search_rs below is that if you wrap/overload resultset on the
2483 # source you need to know what alias it's -going- to have for things
2484 # to work sanely (e.g. RestrictWithObject wants to be able to add
2485 # extra query restrictions, and these may need to be $alias.)
2487 my $attrs = $rel_source->resultset_attributes;
2488 local $attrs->{alias} = $alias;
2490 $rel_source->resultset
2498 where => $self->{cond},
2503 $new->set_cache($new_cache) if $new_cache;
2508 =head2 current_source_alias
2512 =item Arguments: none
2514 =item Return Value: $source_alias
2518 Returns the current table alias for the result source this resultset is built
2519 on, that will be used in the SQL query. Usually it is C<me>.
2521 Currently the source alias that refers to the result set returned by a
2522 L</search>/L</find> family method depends on how you got to the resultset: it's
2523 C<me> by default, but eg. L</search_related> aliases it to the related result
2524 source name (and keeps C<me> referring to the original result set). The long
2525 term goal is to make L<DBIx::Class> always alias the current resultset as C<me>
2526 (and make this method unnecessary).
2528 Thus it's currently necessary to use this method in predefined queries (see
2529 L<DBIx::Class::Manual::Cookbook/Predefined searches>) when referring to the
2530 source alias of the current result set:
2532 # in a result set class
2534 my ($self, $user) = @_;
2536 my $me = $self->current_source_alias;
2538 return $self->search(
2539 "$me.modified" => $user->id,
2545 sub current_source_alias {
2548 return ($self->{attrs} || {})->{alias} || 'me';
2551 # This code is called by search_related, and makes sure there
2552 # is clear separation between the joins before, during, and
2553 # after the relationship. This information is needed later
2554 # in order to properly resolve prefetch aliases (any alias
2555 # with a relation_chain_depth less than the depth of the
2556 # current prefetch is not considered)
2558 my ($self, $rel) = @_;
2559 my $source = $self->result_source;
2560 my $attrs = $self->{attrs};
2566 -source_handle => $source->handle,
2567 -alias => $attrs->{alias},
2568 $attrs->{alias} => $source->from,
2572 my $seen = { %{$attrs->{seen_join} || {} } };
2574 # we need to take the prefetch the attrs into account before we
2575 # ->_resolve_join as otherwise they get lost - captainL
2576 my $merged = $self->_merge_attr( $attrs->{join}, $attrs->{prefetch} );
2578 push @$from, $source->_resolve_join($merged, $attrs->{alias}, $seen) if ($merged);
2580 ++$seen->{-relation_chain_depth};
2582 push @$from, $source->_resolve_join($rel, $attrs->{alias}, $seen);
2584 ++$seen->{-relation_chain_depth};
2586 return ($from,$seen);
2589 # too many times we have to do $attrs = { %{$self->_resolved_attrs} }
2590 sub _resolved_attrs_copy {
2592 return { %{$self->_resolved_attrs (@_)} };
2595 sub _resolved_attrs {
2597 return $self->{_attrs} if $self->{_attrs};
2599 my $attrs = { %{ $self->{attrs} || {} } };
2600 my $source = $self->result_source;
2601 my $alias = $attrs->{alias};
2603 $attrs->{columns} ||= delete $attrs->{cols} if exists $attrs->{cols};
2606 # build columns (as long as select isn't set) into a set of as/select hashes
2607 unless ( $attrs->{select} ) {
2609 ( ref($_) eq 'HASH' )
2613 /^\Q${alias}.\E(.+)$/
2624 } ( ref($attrs->{columns}) eq 'ARRAY' ) ? @{ delete $attrs->{columns}} : (delete $attrs->{columns} || $source->columns );
2626 # add the additional columns on
2627 foreach ( 'include_columns', '+columns' ) {
2628 push @colbits, map {
2629 ( ref($_) eq 'HASH' )
2631 : { ( split( /\./, $_ ) )[-1] => ( /\./ ? $_ : "${alias}.$_" ) }
2632 } ( ref($attrs->{$_}) eq 'ARRAY' ) ? @{ delete $attrs->{$_} } : delete $attrs->{$_} if ( $attrs->{$_} );
2635 # start with initial select items
2636 if ( $attrs->{select} ) {
2638 ( ref $attrs->{select} eq 'ARRAY' )
2639 ? [ @{ $attrs->{select} } ]
2640 : [ $attrs->{select} ];
2644 ref $attrs->{as} eq 'ARRAY'
2645 ? [ @{ $attrs->{as} } ]
2648 : [ map { m/^\Q${alias}.\E(.+)$/ ? $1 : $_ } @{ $attrs->{select} } ]
2653 # otherwise we intialise select & as to empty
2654 $attrs->{select} = [];
2658 # now add colbits to select/as
2659 push( @{ $attrs->{select} }, map { values( %{$_} ) } @colbits );
2660 push( @{ $attrs->{as} }, map { keys( %{$_} ) } @colbits );
2663 if ( $adds = delete $attrs->{'+select'} ) {
2664 $adds = [$adds] unless ref $adds eq 'ARRAY';
2666 @{ $attrs->{select} },
2667 map { /\./ || ref $_ ? $_ : "${alias}.$_" } @$adds
2670 if ( $adds = delete $attrs->{'+as'} ) {
2671 $adds = [$adds] unless ref $adds eq 'ARRAY';
2672 push( @{ $attrs->{as} }, @$adds );
2675 $attrs->{from} ||= [ {
2676 -source_handle => $source->handle,
2677 -alias => $self->{attrs}{alias},
2678 $self->{attrs}{alias} => $source->from,
2681 if ( $attrs->{join} || $attrs->{prefetch} ) {
2683 $self->throw_exception ('join/prefetch can not be used with a literal scalarref {from}')
2684 if ref $attrs->{from} ne 'ARRAY';
2686 my $join = delete $attrs->{join} || {};
2688 if ( defined $attrs->{prefetch} ) {
2689 $join = $self->_merge_attr( $join, $attrs->{prefetch} );
2692 $attrs->{from} = # have to copy here to avoid corrupting the original
2694 @{ $attrs->{from} },
2695 $source->_resolve_join(
2696 $join, $alias, { %{ $attrs->{seen_join} || {} } }
2701 if ( $attrs->{order_by} ) {
2702 $attrs->{order_by} = (
2703 ref( $attrs->{order_by} ) eq 'ARRAY'
2704 ? [ @{ $attrs->{order_by} } ]
2705 : [ $attrs->{order_by} ]
2709 $attrs->{order_by} = [];
2712 # If the order_by is otherwise empty - we will use this for TOP limit
2713 # emulation and the like.
2714 # Although this is needed only if the order_by is not defined, it is
2715 # actually cheaper to just populate this rather than properly examining
2716 # order_by (stuf like [ {} ] and the like)
2717 my $prefix = $alias . ($source->schema->storage->sql_maker->{name_sep} || '.');
2718 $attrs->{_virtual_order_by} = [
2719 map { $prefix . $_ } ($source->primary_columns)
2722 $attrs->{collapse} ||= {};
2723 if ( my $prefetch = delete $attrs->{prefetch} ) {
2724 $prefetch = $self->_merge_attr( {}, $prefetch );
2726 my $prefetch_ordering = [];
2728 my $join_map = $self->_joinpath_aliases ($attrs->{from}, $attrs->{seen_join});
2731 $source->_resolve_prefetch( $prefetch, $alias, $join_map, $prefetch_ordering, $attrs->{collapse} );
2733 push( @{ $attrs->{select} }, map { $_->[0] } @prefetch );
2734 push( @{ $attrs->{as} }, map { $_->[1] } @prefetch );
2736 push( @{ $attrs->{order_by} }, @$prefetch_ordering );
2737 $attrs->{_collapse_order_by} = \@$prefetch_ordering;
2741 if (delete $attrs->{distinct}) {
2742 $attrs->{group_by} ||= [ grep { !ref($_) || (ref($_) ne 'HASH') } @{$attrs->{select}} ];
2745 # if both page and offset are specified, produce a combined offset
2746 # even though it doesn't make much sense, this is what pre 081xx has
2748 if (my $page = delete $attrs->{page}) {
2749 $attrs->{offset} = ($attrs->{rows} * ($page - 1)) +
2750 ($attrs->{offset} || 0);
2753 return $self->{_attrs} = $attrs;
2756 sub _joinpath_aliases {
2757 my ($self, $fromspec, $seen) = @_;
2760 return $paths unless ref $fromspec eq 'ARRAY';
2762 for my $j (@$fromspec) {
2764 next if ref $j ne 'ARRAY';
2765 next if $j->[0]{-relation_chain_depth} < ( $seen->{-relation_chain_depth} || 0);
2768 $p = $p->{$_} ||= {} for @{$j->[0]{-join_path}};
2769 push @{$p->{-join_aliases} }, $j->[0]{-alias};
2776 my ($self, $attr) = @_;
2778 if (ref $attr eq 'HASH') {
2779 return $self->_rollout_hash($attr);
2780 } elsif (ref $attr eq 'ARRAY') {
2781 return $self->_rollout_array($attr);
2787 sub _rollout_array {
2788 my ($self, $attr) = @_;
2791 foreach my $element (@{$attr}) {
2792 if (ref $element eq 'HASH') {
2793 push( @rolled_array, @{ $self->_rollout_hash( $element ) } );
2794 } elsif (ref $element eq 'ARRAY') {
2795 # XXX - should probably recurse here
2796 push( @rolled_array, @{$self->_rollout_array($element)} );
2798 push( @rolled_array, $element );
2801 return \@rolled_array;
2805 my ($self, $attr) = @_;
2808 foreach my $key (keys %{$attr}) {
2809 push( @rolled_array, { $key => $attr->{$key} } );
2811 return \@rolled_array;
2814 sub _calculate_score {
2815 my ($self, $a, $b) = @_;
2817 if (ref $b eq 'HASH') {
2818 my ($b_key) = keys %{$b};
2819 if (ref $a eq 'HASH') {
2820 my ($a_key) = keys %{$a};
2821 if ($a_key eq $b_key) {
2822 return (1 + $self->_calculate_score( $a->{$a_key}, $b->{$b_key} ));
2827 return ($a eq $b_key) ? 1 : 0;
2830 if (ref $a eq 'HASH') {
2831 my ($a_key) = keys %{$a};
2832 return ($b eq $a_key) ? 1 : 0;
2834 return ($b eq $a) ? 1 : 0;
2840 my ($self, $orig, $import) = @_;
2842 return $import unless defined($orig);
2843 return $orig unless defined($import);
2845 $orig = $self->_rollout_attr($orig);
2846 $import = $self->_rollout_attr($import);
2849 foreach my $import_element ( @{$import} ) {
2850 # find best candidate from $orig to merge $b_element into
2851 my $best_candidate = { position => undef, score => 0 }; my $position = 0;
2852 foreach my $orig_element ( @{$orig} ) {
2853 my $score = $self->_calculate_score( $orig_element, $import_element );
2854 if ($score > $best_candidate->{score}) {
2855 $best_candidate->{position} = $position;
2856 $best_candidate->{score} = $score;
2860 my ($import_key) = ( ref $import_element eq 'HASH' ) ? keys %{$import_element} : ($import_element);
2862 if ($best_candidate->{score} == 0 || exists $seen_keys->{$import_key}) {
2863 push( @{$orig}, $import_element );
2865 my $orig_best = $orig->[$best_candidate->{position}];
2866 # merge orig_best and b_element together and replace original with merged
2867 if (ref $orig_best ne 'HASH') {
2868 $orig->[$best_candidate->{position}] = $import_element;
2869 } elsif (ref $import_element eq 'HASH') {
2870 my ($key) = keys %{$orig_best};
2871 $orig->[$best_candidate->{position}] = { $key => $self->_merge_attr($orig_best->{$key}, $import_element->{$key}) };
2874 $seen_keys->{$import_key} = 1; # don't merge the same key twice
2884 $self->_source_handle($_[0]->handle);
2886 $self->_source_handle->resolve;
2890 =head2 throw_exception
2892 See L<DBIx::Class::Schema/throw_exception> for details.
2896 sub throw_exception {
2898 if (ref $self && $self->_source_handle->schema) {
2899 $self->_source_handle->schema->throw_exception(@_)
2906 # XXX: FIXME: Attributes docs need clearing up
2910 Attributes are used to refine a ResultSet in various ways when
2911 searching for data. They can be passed to any method which takes an
2912 C<\%attrs> argument. See L</search>, L</search_rs>, L</find>,
2915 These are in no particular order:
2921 =item Value: ( $order_by | \@order_by | \%order_by )
2925 Which column(s) to order the results by. If a single column name, or
2926 an arrayref of names is supplied, the argument is passed through
2927 directly to SQL. The hashref syntax allows for connection-agnostic
2928 specification of ordering direction:
2930 For descending order:
2932 order_by => { -desc => [qw/col1 col2 col3/] }
2934 For explicit ascending order:
2936 order_by => { -asc => 'col' }
2938 The old scalarref syntax (i.e. order_by => \'year DESC') is still
2939 supported, although you are strongly encouraged to use the hashref
2940 syntax as outlined above.
2946 =item Value: \@columns
2950 Shortcut to request a particular set of columns to be retrieved. Each
2951 column spec may be a string (a table column name), or a hash (in which
2952 case the key is the C<as> value, and the value is used as the C<select>
2953 expression). Adds C<me.> onto the start of any column without a C<.> in
2954 it and sets C<select> from that, then auto-populates C<as> from
2955 C<select> as normal. (You may also use the C<cols> attribute, as in
2956 earlier versions of DBIC.)
2962 =item Value: \@columns
2966 Indicates additional columns to be selected from storage. Works the same
2967 as L</columns> but adds columns to the selection. (You may also use the
2968 C<include_columns> attribute, as in earlier versions of DBIC). For
2971 $schema->resultset('CD')->search(undef, {
2972 '+columns' => ['artist.name'],
2976 would return all CDs and include a 'name' column to the information
2977 passed to object inflation. Note that the 'artist' is the name of the
2978 column (or relationship) accessor, and 'name' is the name of the column
2979 accessor in the related table.
2981 =head2 include_columns
2985 =item Value: \@columns
2989 Deprecated. Acts as a synonym for L</+columns> for backward compatibility.
2995 =item Value: \@select_columns
2999 Indicates which columns should be selected from the storage. You can use
3000 column names, or in the case of RDBMS back ends, function or stored procedure
3003 $rs = $schema->resultset('Employee')->search(undef, {
3006 { count => 'employeeid' },
3011 When you use function/stored procedure names and do not supply an C<as>
3012 attribute, the column names returned are storage-dependent. E.g. MySQL would
3013 return a column named C<count(employeeid)> in the above example.
3019 Indicates additional columns to be selected from storage. Works the same as
3020 L</select> but adds columns to the selection.
3028 Indicates additional column names for those added via L</+select>. See L</as>.
3036 =item Value: \@inflation_names
3040 Indicates column names for object inflation. That is, C<as>
3041 indicates the name that the column can be accessed as via the
3042 C<get_column> method (or via the object accessor, B<if one already
3043 exists>). It has nothing to do with the SQL code C<SELECT foo AS bar>.
3045 The C<as> attribute is used in conjunction with C<select>,
3046 usually when C<select> contains one or more function or stored
3049 $rs = $schema->resultset('Employee')->search(undef, {
3052 { count => 'employeeid' }
3054 as => ['name', 'employee_count'],
3057 my $employee = $rs->first(); # get the first Employee
3059 If the object against which the search is performed already has an accessor
3060 matching a column name specified in C<as>, the value can be retrieved using
3061 the accessor as normal:
3063 my $name = $employee->name();
3065 If on the other hand an accessor does not exist in the object, you need to
3066 use C<get_column> instead:
3068 my $employee_count = $employee->get_column('employee_count');
3070 You can create your own accessors if required - see
3071 L<DBIx::Class::Manual::Cookbook> for details.
3073 Please note: This will NOT insert an C<AS employee_count> into the SQL
3074 statement produced, it is used for internal access only. Thus
3075 attempting to use the accessor in an C<order_by> clause or similar
3076 will fail miserably.
3078 To get around this limitation, you can supply literal SQL to your
3079 C<select> attibute that contains the C<AS alias> text, eg:
3081 select => [\'myfield AS alias']
3087 =item Value: ($rel_name | \@rel_names | \%rel_names)
3091 Contains a list of relationships that should be joined for this query. For
3094 # Get CDs by Nine Inch Nails
3095 my $rs = $schema->resultset('CD')->search(
3096 { 'artist.name' => 'Nine Inch Nails' },
3097 { join => 'artist' }
3100 Can also contain a hash reference to refer to the other relation's relations.
3103 package MyApp::Schema::Track;
3104 use base qw/DBIx::Class/;
3105 __PACKAGE__->table('track');
3106 __PACKAGE__->add_columns(qw/trackid cd position title/);
3107 __PACKAGE__->set_primary_key('trackid');
3108 __PACKAGE__->belongs_to(cd => 'MyApp::Schema::CD');
3111 # In your application
3112 my $rs = $schema->resultset('Artist')->search(
3113 { 'track.title' => 'Teardrop' },
3115 join => { cd => 'track' },
3116 order_by => 'artist.name',
3120 You need to use the relationship (not the table) name in conditions,
3121 because they are aliased as such. The current table is aliased as "me", so
3122 you need to use me.column_name in order to avoid ambiguity. For example:
3124 # Get CDs from 1984 with a 'Foo' track
3125 my $rs = $schema->resultset('CD')->search(
3128 'tracks.name' => 'Foo'
3130 { join => 'tracks' }
3133 If the same join is supplied twice, it will be aliased to <rel>_2 (and
3134 similarly for a third time). For e.g.
3136 my $rs = $schema->resultset('Artist')->search({
3137 'cds.title' => 'Down to Earth',
3138 'cds_2.title' => 'Popular',
3140 join => [ qw/cds cds/ ],
3143 will return a set of all artists that have both a cd with title 'Down
3144 to Earth' and a cd with title 'Popular'.
3146 If you want to fetch related objects from other tables as well, see C<prefetch>
3149 For more help on using joins with search, see L<DBIx::Class::Manual::Joining>.
3155 =item Value: ($rel_name | \@rel_names | \%rel_names)
3159 Contains one or more relationships that should be fetched along with
3160 the main query (when they are accessed afterwards the data will
3161 already be available, without extra queries to the database). This is
3162 useful for when you know you will need the related objects, because it
3163 saves at least one query:
3165 my $rs = $schema->resultset('Tag')->search(
3174 The initial search results in SQL like the following:
3176 SELECT tag.*, cd.*, artist.* FROM tag
3177 JOIN cd ON tag.cd = cd.cdid
3178 JOIN artist ON cd.artist = artist.artistid
3180 L<DBIx::Class> has no need to go back to the database when we access the
3181 C<cd> or C<artist> relationships, which saves us two SQL statements in this
3184 Simple prefetches will be joined automatically, so there is no need
3185 for a C<join> attribute in the above search.
3187 C<prefetch> can be used with the following relationship types: C<belongs_to>,
3188 C<has_one> (or if you're using C<add_relationship>, any relationship declared
3189 with an accessor type of 'single' or 'filter'). A more complex example that
3190 prefetches an artists cds, the tracks on those cds, and the tags associted
3191 with that artist is given below (assuming many-to-many from artists to tags):
3193 my $rs = $schema->resultset('Artist')->search(
3197 { cds => 'tracks' },
3198 { artist_tags => 'tags' }
3204 B<NOTE:> If you specify a C<prefetch> attribute, the C<join> and C<select>
3205 attributes will be ignored.
3215 Makes the resultset paged and specifies the page to retrieve. Effectively
3216 identical to creating a non-pages resultset and then calling ->page($page)
3219 If L<rows> attribute is not specified it defaults to 10 rows per page.
3221 When you have a paged resultset, L</count> will only return the number
3222 of rows in the page. To get the total, use the L</pager> and call
3223 C<total_entries> on it.
3233 Specifes the maximum number of rows for direct retrieval or the number of
3234 rows per page if the page attribute or method is used.
3240 =item Value: $offset
3244 Specifies the (zero-based) row number for the first row to be returned, or the
3245 of the first row of the first page if paging is used.
3251 =item Value: \@columns
3255 A arrayref of columns to group by. Can include columns of joined tables.
3257 group_by => [qw/ column1 column2 ... /]
3263 =item Value: $condition
3267 HAVING is a select statement attribute that is applied between GROUP BY and
3268 ORDER BY. It is applied to the after the grouping calculations have been
3271 having => { 'count(employee)' => { '>=', 100 } }
3277 =item Value: (0 | 1)
3281 Set to 1 to group by all columns.
3287 Adds to the WHERE clause.
3289 # only return rows WHERE deleted IS NULL for all searches
3290 __PACKAGE__->resultset_attributes({ where => { deleted => undef } }); )
3292 Can be overridden by passing C<{ where => undef }> as an attribute
3299 Set to 1 to cache search results. This prevents extra SQL queries if you
3300 revisit rows in your ResultSet:
3302 my $resultset = $schema->resultset('Artist')->search( undef, { cache => 1 } );
3304 while( my $artist = $resultset->next ) {
3308 $rs->first; # without cache, this would issue a query
3310 By default, searches are not cached.
3312 For more examples of using these attributes, see
3313 L<DBIx::Class::Manual::Cookbook>.
3319 =item Value: \@from_clause
3323 The C<from> attribute gives you manual control over the C<FROM> clause of SQL
3324 statements generated by L<DBIx::Class>, allowing you to express custom C<JOIN>
3327 NOTE: Use this on your own risk. This allows you to shoot off your foot!
3329 C<join> will usually do what you need and it is strongly recommended that you
3330 avoid using C<from> unless you cannot achieve the desired result using C<join>.
3331 And we really do mean "cannot", not just tried and failed. Attempting to use
3332 this because you're having problems with C<join> is like trying to use x86
3333 ASM because you've got a syntax error in your C. Trust us on this.
3335 Now, if you're still really, really sure you need to use this (and if you're
3336 not 100% sure, ask the mailing list first), here's an explanation of how this
3339 The syntax is as follows -
3342 { <alias1> => <table1> },
3344 { <alias2> => <table2>, -join_type => 'inner|left|right' },
3345 [], # nested JOIN (optional)
3346 { <table1.column1> => <table2.column2>, ... (more conditions) },
3348 # More of the above [ ] may follow for additional joins
3355 ON <table1.column1> = <table2.column2>
3356 <more joins may follow>
3358 An easy way to follow the examples below is to remember the following:
3360 Anything inside "[]" is a JOIN
3361 Anything inside "{}" is a condition for the enclosing JOIN
3363 The following examples utilize a "person" table in a family tree application.
3364 In order to express parent->child relationships, this table is self-joined:
3366 # Person->belongs_to('father' => 'Person');
3367 # Person->belongs_to('mother' => 'Person');
3369 C<from> can be used to nest joins. Here we return all children with a father,
3370 then search against all mothers of those children:
3372 $rs = $schema->resultset('Person')->search(
3375 alias => 'mother', # alias columns in accordance with "from"
3377 { mother => 'person' },
3380 { child => 'person' },
3382 { father => 'person' },
3383 { 'father.person_id' => 'child.father_id' }
3386 { 'mother.person_id' => 'child.mother_id' }
3393 # SELECT mother.* FROM person mother
3396 # JOIN person father
3397 # ON ( father.person_id = child.father_id )
3399 # ON ( mother.person_id = child.mother_id )
3401 The type of any join can be controlled manually. To search against only people
3402 with a father in the person table, we could explicitly use C<INNER JOIN>:
3404 $rs = $schema->resultset('Person')->search(
3407 alias => 'child', # alias columns in accordance with "from"
3409 { child => 'person' },
3411 { father => 'person', -join_type => 'inner' },
3412 { 'father.id' => 'child.father_id' }
3419 # SELECT child.* FROM person child
3420 # INNER JOIN person father ON child.father_id = father.id
3422 You can select from a subquery by passing a resultset to from as follows.
3424 $schema->resultset('Artist')->search(
3426 { alias => 'artist2',
3427 from => [ { artist2 => $artist_rs->as_query } ],
3430 # and you'll get sql like this..
3431 # SELECT artist2.artistid, artist2.name, artist2.rank, artist2.charfield FROM
3432 # ( SELECT me.artistid, me.name, me.rank, me.charfield FROM artists me ) artist2
3434 If you need to express really complex joins, you
3435 can supply literal SQL to C<from> via a scalar reference. In this case
3436 the contents of the scalar will replace the table name associated with the
3439 WARNING: This technique might very well not work as expected on chained
3440 searches - you have been warned.
3442 # Assuming the Event resultsource is defined as:
3444 MySchema::Event->add_columns (
3447 is_auto_increment => 1,
3456 MySchema::Event->set_primary_key ('sequence');
3458 # This will get back the latest event for every location. The column
3459 # selector is still provided by DBIC, all we do is add a JOIN/WHERE
3460 # combo to limit the resultset
3462 $rs = $schema->resultset('Event');
3463 $table = $rs->result_source->name;
3464 $latest = $rs->search (
3467 (SELECT e1.* FROM $table e1
3469 ON e1.location = e2.location
3470 AND e1.sequence < e2.sequence
3471 WHERE e2.sequence is NULL
3476 # Equivalent SQL (with the DBIC chunks added):
3478 SELECT me.sequence, me.location, me.type FROM
3479 (SELECT e1.* FROM events e1
3481 ON e1.location = e2.location
3482 AND e1.sequence < e2.sequence
3483 WHERE e2.sequence is NULL
3490 =item Value: ( 'update' | 'shared' )
3494 Set to 'update' for a SELECT ... FOR UPDATE or 'shared' for a SELECT