module CollectiveIdea::Acts::NestedSet::Model::Movable
def after_move_to(target, position)
def after_move_to(target, position) target.reload_nested_set if target self.set_depth_for_self_and_descendants! self.reload_nested_set end
def find_left_neighbor(parent, order_attribute, ascending)
def find_left_neighbor(parent, order_attribute, ascending) left = nil parent.children.each do |n| if ascending left = n if n.send(order_attribute) < self.send(order_attribute) else left = n if n.send(order_attribute) > self.send(order_attribute) end end left end
def move_left
def move_left move_to_left_of left_sibling end
def move_possible?(target)
def move_possible?(target) self != target && # Can't target self same_scope?(target) && # can't be in different scopes # detect impossible move within_bounds?(target.left, target.left) && within_bounds?(target.right, target.right) end
def move_right
def move_right move_to_right_of right_sibling end
def move_to(target, position)
def move_to(target, position) prevent_unpersisted_move run_callbacks :move do in_tenacious_transaction do target = reload_target(target, position) self.reload_nested_set Move.new(target, position, self).move update_counter_cache end after_move_to(target, position) end end
def move_to_child_of(node)
def move_to_child_of(node) move_to node, :child end
def move_to_child_with_index(node, index)
def move_to_child_with_index(node, index) if node.children.empty? move_to_child_of(node) elsif node.children.count == index move_to_right_of(node.children.last) else my_position = node.children.to_a.index(self) if my_position && my_position < index # e.g. if self is at position 0 and we want to move self to position 1 then self # needs to move to the *right* of the node at position 1. That's because the node # that is currently at position 1 will be at position 0 after the move completes. move_to_right_of(node.children[index]) elsif my_position && my_position == index # do nothing. already there. else move_to_left_of(node.children[index]) end end end
def move_to_left_of(node)
def move_to_left_of(node) move_to node, :left end
def move_to_new_parent
def move_to_new_parent if @move_to_new_parent_id.nil? move_to_root elsif @move_to_new_parent_id move_to_child_of(@move_to_new_parent_id) end end
def move_to_ordered_child_of(parent, order_attribute, ascending = true)
Can order by any attribute class that uses the Comparable mixin, for example a string or integer
Order children in a nested set by an attribute
def move_to_ordered_child_of(parent, order_attribute, ascending = true) self.move_to_root and return unless parent left_neighbor = find_left_neighbor(parent, order_attribute, ascending) self.move_to_child_of(parent) return unless parent.children.many? if left_neighbor self.move_to_right_of(left_neighbor) else # Self is the left most node. self.move_to_left_of(parent.children[0]) end end
def move_to_right_of(node)
def move_to_right_of(node) move_to node, :right end
def move_to_root
def move_to_root move_to self, :root end
def out_of_bounds?(left_bound, right_bound)
def out_of_bounds?(left_bound, right_bound) left <= left_bound && right >= right_bound end
def prevent_unpersisted_move
def prevent_unpersisted_move if self.new_record? raise ActiveRecord::ActiveRecordError, "You cannot move a new node" end end
def within_bounds?(left_bound, right_bound)
def within_bounds?(left_bound, right_bound) !out_of_bounds?(left_bound, right_bound) end