kanbanworkflowstimelinescrumrubyroadmapproject-planningproject-managementopenprojectangularissue-trackerifcgantt-chartganttbug-trackerboardsbcf
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.
109 lines
3.9 KiB
109 lines
3.9 KiB
#-- copyright
|
|
# OpenProject is an open source project management software.
|
|
# Copyright (C) 2012-2022 the OpenProject GmbH
|
|
#
|
|
# 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-2013 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 COPYRIGHT and LICENSE files for more details.
|
|
#++
|
|
|
|
# When included, it adds the ability to rebuild nested sets, thus fixing
|
|
# corrupted trees.
|
|
#
|
|
# AwesomeNestedSet has this functionality as well but it fixes the sets with
|
|
# running the callbacks defined in the model. This has two drawbacks:
|
|
#
|
|
# * It is prone to fail when a validation fails that has nothing to do with
|
|
# nested sets.
|
|
# * It is slow.
|
|
#
|
|
# The methods included are purely sql based. The code in here is partly copied
|
|
# over from awesome_nested_set's non sql methods.
|
|
|
|
module OpenProject::NestedSet::RebuildPatch
|
|
def self.included(base)
|
|
base.extend(ClassMethods)
|
|
end
|
|
|
|
module ClassMethods
|
|
# Rebuilds the left & rights if unset or invalid. Also very useful for converting from acts_as_tree.
|
|
# Very similar to original nested_set implementation but uses update_all so that callbacks are not triggered
|
|
def rebuild_silently!(roots = nil)
|
|
# Don't rebuild a valid tree.
|
|
return true if valid?
|
|
|
|
scope = lambda { |_node| }
|
|
if acts_as_nested_set_options[:scope]
|
|
scope = lambda { |node|
|
|
scope_column_names.inject('') do |str, column_name|
|
|
str << "AND #{connection.quote_column_name(column_name)} = #{connection.quote(node.send(column_name.to_sym))} "
|
|
end
|
|
}
|
|
end
|
|
|
|
# setup index
|
|
|
|
indices = Hash.new do |h, k|
|
|
h[k] = 0
|
|
end
|
|
|
|
set_left_and_rights = lambda { |node|
|
|
# set left
|
|
node[left_column_name] = indices[scope.call(node)] += 1
|
|
# find
|
|
children = where(["#{quoted_parent_column_name} = ? #{scope.call(node)}", node])
|
|
.order([quoted_left_column_name,
|
|
quoted_right_column_name,
|
|
acts_as_nested_set_options[:order]].compact.join(', '))
|
|
|
|
children.each { |n| set_left_and_rights.call(n) }
|
|
|
|
# set right
|
|
node[right_column_name] = indices[scope.call(node)] += 1
|
|
|
|
changes = node.changes.inject({}) do |hash, (attribute, _values)|
|
|
hash[attribute] = node.send(attribute.to_s)
|
|
hash
|
|
end
|
|
|
|
where(id: node.id).update_all(changes) unless changes.empty?
|
|
}
|
|
|
|
# Find root node(s)
|
|
# or take provided
|
|
root_nodes = if roots.is_a? Array
|
|
roots
|
|
elsif roots.present?
|
|
[roots]
|
|
else
|
|
where("#{quoted_parent_column_name} IS NULL")
|
|
.order([quoted_left_column_name,
|
|
quoted_right_column_name,
|
|
acts_as_nested_set_options[:order]].compact.join(', '))
|
|
end
|
|
|
|
root_nodes.each do |root_node|
|
|
set_left_and_rights.call(root_node)
|
|
end
|
|
end
|
|
end
|
|
end
|
|
|