OpenProject is the leading open source project management software.
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 
openproject/app/models/query/results.rb

216 lines
6.2 KiB

#-- encoding: UTF-8
#-- copyright
# OpenProject is a project management system.
# Copyright (C) 2012-2018 the OpenProject Foundation (OPF)
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License version 3.
#
# OpenProject is a fork of ChiliProject, which is a fork of Redmine. The copyright follows:
# Copyright (C) 2006-2017 Jean-Philippe Lang
# Copyright (C) 2010-2013 the ChiliProject Team
#
# This program is free software; you can redistribute it and/or
# modify it under the terms of the GNU General Public License
# as published by the Free Software Foundation; either version 2
# of the License, or (at your option) any later version.
#
# This program is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
# GNU General Public License for more details.
#
# You should have received a copy of the GNU General Public License
# along with this program; if not, write to the Free Software
# Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
#
# See docs/COPYRIGHT.rdoc for more details.
#++
require_dependency 'query/group_by'
require_dependency 'query/sums'
class ::Query::Results
include ::Query::Grouping
include ::Query::Sums
include Redmine::I18n
attr_accessor :options,
:query
# Valid options are :order, :include, :conditions
def initialize(query, options = {})
self.options = options
self.query = query
end
# Returns the work package count
def work_package_count
WorkPackage.visible
.joins(all_filter_joins)
.includes(:status, :project)
.where(query.statement)
.references(:statuses, :projects)
.count
rescue ::ActiveRecord::StatementInvalid => e
raise ::Query::StatementInvalid.new(e.message)
end
def work_packages
WorkPackage
.visible
.where(query.statement)
.where(options[:conditions])
.includes(all_includes)
.joins(all_joins)
.order(order_option)
.references(:projects)
end
# Same as :work_packages, but returns a result sorted by the sort_criteria defined in the query.
# Note: It escapes me, why this is not the default behaviour.
# If there is a reason: This is a somewhat DRY way of using the sort criteria.
# If there is no reason: The :work_package method can die over time and be replaced by this one.
def sorted_work_packages
work_packages.order(sort_criteria_array)
end
def versions
scope = Version
.visible
.where(options[:conditions])
if query.project
scope.where(query.project_limiting_filter.where)
end
scope
end
def order_option
order_option = [group_by_sort_order].reject(&:blank?).join(', ')
if order_option.blank?
nil
else
Arel.sql(order_option)
end
end
private
def all_includes
(%i(status project) +
includes_for_columns(include_columns) +
(options[:include] || [])).uniq
end
def all_joins
sort_criteria_joins + all_filter_joins
end
def includes_for_columns(column_names)
column_names = Array(column_names)
(WorkPackage.reflections.keys.map(&:to_sym) & column_names.map(&:to_sym))
end
def custom_field_column?(name)
name.to_s =~ /\Acf_\d+\z/
end
##
# Returns the columns that need to be included to allow:
# * sorting
# * grouping
def include_columns
columns = query.sort_criteria_columns.map { |column, _direction| column.association }
if query.group_by_column
columns << query.group_by_column.association
end
columns << all_filter_includes(query)
clean_symbol_list(columns)
end
def sort_criteria_joins
query
.sort_criteria_columns
.map { |column, _direction| column.sortable_join_statement(query) }
.compact
end
def sort_criteria_array
criteria = SortHelper::SortCriteria.new
criteria.available_criteria = aliased_sorting_by_column_name
criteria.criteria = query.sort_criteria
criteria.map_each { |criteria| criteria.map { |raw| Arel.sql raw } }
end
def aliased_sorting_by_column_name
sorting_by_column_name = query.sortable_key_by_column_name
aliases = include_aliases
reflection_includes.each do |inc|
sorting_by_column_name[inc.to_s] = Array(sorting_by_column_name[inc.to_s]).map { |column| "#{aliases[inc]}.#{column}" }
end
sorting_by_column_name
end
# To avoid naming conflicts, joined tables are aliased if they are joined
# more than once. Here, joining tables that are referenced by multiple
# columns are of particular interest.
#
# Mirroring the way AR creates aliases for included/joined tables: Normally,
# included/joined associations are not aliased and as such, they simply use
# the table name. But if an association is joined/included that relies on a
# table which an already joined/included association also relies upon, that
# name is already taken in the DB query. Therefore, the #alias_candidate
# method is used which will concatenate the pluralized association name with
# the table name the association is defined for.
#
# There is no handling for cases when the same association is joined/included
# multiple times as the rest of the code should prevent that.
def include_aliases
counts = Hash.new do |h, key|
h[key] = 0
end
reflection_includes.each_with_object({}) do |inc, hash|
reflection = WorkPackage.reflections[inc.to_s]
table_name = reflection.klass.table_name
hash[inc] = reflection_alias(reflection, counts[table_name])
counts[table_name] += 1
end
end
def reflection_includes
WorkPackage.reflections.keys.map(&:to_sym) & all_includes.map(&:to_sym)
end
def reflection_alias(reflection, count)
if count.zero?
reflection.klass.table_name
else
reflection.alias_candidate(WorkPackage.table_name)
end
end
def all_filter_includes(query)
query.filters.map(&:includes)
end
def all_filter_joins
query.filters.map(&:joins).flatten.compact
end
def clean_symbol_list(list)
list.flatten.compact.uniq.map(&:to_sym)
end
end