# Redmine - project management software # Copyright (C) 2006-2015 Jean-Philippe Lang # # 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. module Redmine module NestedSet module IssueNestedSet def self.included(base) base.class_eval do belongs_to :parent, :class_name => self.name before_create :add_to_nested_set, :if => lambda {|issue| issue.parent.present?} after_create :add_as_root, :if => lambda {|issue| issue.parent.blank?} before_update :handle_parent_change, :if => lambda {|issue| issue.parent_id_changed?} before_destroy :destroy_children end base.extend ClassMethods base.send :include, Redmine::NestedSet::Traversing end private def target_lft scope_for_max_rgt = self.class.where(:root_id => root_id).where(:parent_id => parent_id) if id scope_for_max_rgt = scope_for_max_rgt.where("id < ?", id) end max_rgt = scope_for_max_rgt.maximum(:rgt) if max_rgt max_rgt + 1 elsif parent parent.lft + 1 else 1 end end def add_to_nested_set(lock=true) lock_nested_set if lock parent.send :reload_nested_set_values self.root_id = parent.root_id self.lft = target_lft self.rgt = lft + 1 self.class.where(:root_id => root_id).where("lft >= ? OR rgt >= ?", lft, lft).update_all([ "lft = CASE WHEN lft >= :lft THEN lft + 2 ELSE lft END, " + "rgt = CASE WHEN rgt >= :lft THEN rgt + 2 ELSE rgt END", {:lft => lft} ]) end def add_as_root self.root_id = id self.lft = 1 self.rgt = 2 self.class.where(:id => id).update_all(:root_id => root_id, :lft => lft, :rgt => rgt) end def handle_parent_change lock_nested_set reload_nested_set_values if parent_id_was remove_from_nested_set end if parent move_to_nested_set end reload_nested_set_values end def move_to_nested_set if parent previous_root_id = root_id self.root_id = parent.root_id lft_after_move = target_lft self.class.where(:root_id => parent.root_id).update_all([ "lft = CASE WHEN lft >= :lft THEN lft + :shift ELSE lft END, " + "rgt = CASE WHEN rgt >= :lft THEN rgt + :shift ELSE rgt END", {:lft => lft_after_move, :shift => (rgt - lft + 1)} ]) self.class.where(:root_id => previous_root_id).update_all([ "root_id = :root_id, lft = lft + :shift, rgt = rgt + :shift", {:root_id => parent.root_id, :shift => lft_after_move - lft} ]) self.lft, self.rgt = lft_after_move, (rgt - lft + lft_after_move) parent.send :reload_nested_set_values end end def remove_from_nested_set self.class.where(:root_id => root_id).where("lft >= ? AND rgt <= ?", lft, rgt). update_all(["root_id = :id, lft = lft - :shift, rgt = rgt - :shift", {:id => id, :shift => lft - 1}]) self.class.where(:root_id => root_id).update_all([ "lft = CASE WHEN lft >= :lft THEN lft - :shift ELSE lft END, " + "rgt = CASE WHEN rgt >= :lft THEN rgt - :shift ELSE rgt END", {:lft => lft, :shift => rgt - lft + 1} ]) self.root_id = id self.lft, self.rgt = 1, (rgt - lft + 1) end def destroy_children unless @without_nested_set_update lock_nested_set reload_nested_set_values end children.each {|c| c.send :destroy_without_nested_set_update} reload unless @without_nested_set_update self.class.where(:root_id => root_id).where("lft > ? OR rgt > ?", lft, lft).update_all([ "lft = CASE WHEN lft > :lft THEN lft - :shift ELSE lft END, " + "rgt = CASE WHEN rgt > :lft THEN rgt - :shift ELSE rgt END", {:lft => lft, :shift => rgt - lft + 1} ]) end end def destroy_without_nested_set_update @without_nested_set_update = true destroy end def reload_nested_set_values self.root_id, self.lft, self.rgt = self.class.where(:id => id).pluck(:root_id, :lft, :rgt).first end def save_nested_set_values self.class.where(:id => id).update_all(:root_id => root_id, :lft => lft, :rgt => rgt) end def move_possible?(issue) new_record? || !is_or_is_ancestor_of?(issue) end def lock_nested_set if self.class.connection.adapter_name =~ /sqlserver/i lock = "WITH (ROWLOCK HOLDLOCK UPDLOCK)" # Custom lock for SQLServer # This can be problematic if root_id or parent root_id changes # before locking sets_to_lock = [root_id, parent.try(:root_id)].compact.uniq self.class.reorder(:id).where(:root_id => sets_to_lock).lock(lock).ids else sets_to_lock = [id, parent_id].compact self.class.reorder(:id).where("root_id IN (SELECT root_id FROM #{self.class.table_name} WHERE id IN (?))", sets_to_lock).lock.ids end end def nested_set_scope self.class.order(:lft).where(:root_id => root_id) end def same_nested_set_scope?(issue) root_id == issue.root_id end module ClassMethods def rebuild_tree! transaction do reorder(:id).lock.ids update_all(:root_id => nil, :lft => nil, :rgt => nil) where(:parent_id => nil).update_all(["root_id = id, lft = ?, rgt = ?", 1, 2]) roots_with_children = joins("JOIN #{table_name} parent ON parent.id = #{table_name}.parent_id AND parent.id = parent.root_id").uniq.pluck("parent.id") roots_with_children.each do |root_id| rebuild_nodes(root_id) end end end private def rebuild_nodes(parent_id = nil) nodes = where(:parent_id => parent_id, :rgt => nil, :lft => nil).order(:id).to_a nodes.each do |node| node.send :add_to_nested_set, false node.send :save_nested_set_values rebuild_nodes node.id end end end end end end trash'>artonge/fix/catch_exception_in_expire_trash Nextcloud server, a safe home for all your data: https://github.com/nextcloud/serverwww-data
aboutsummaryrefslogtreecommitdiffstats
path: root/apps/user_ldap/lib/UserPluginManager.php
blob: 2d99d887604575df1cbef21d8f6d76992cfdc726 (plain) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210