Module: CollectiveIdea::Acts::NestedSet::Base::InstanceMethods

Defined in:
lib/awesome_nested_set/base.rb

Overview

Any instance method that returns a collection makes use of Rails 2.1’s named_scope (which is bundled for Rails 2.0), so it can be treated as a finder.

category.self_and_descendants.count
category.ancestors.find(:all, :conditions => "name like '%foo%'")

Instance Method Summary collapse

Instance Method Details

#<=>(x) ⇒ Object

order by left column



308
309
310
 
# File 'lib/awesome_nested_set/base.rb', line 308

def <=>(x)
  left <=> x.left
end

#==(comparison_object) ⇒ Object

Redefine to act like active record



313
314
315
316
317
318
 
# File 'lib/awesome_nested_set/base.rb', line 313

def ==(comparison_object)
  comparison_object.equal?(self) ||
    (comparison_object.instance_of?(self.class) &&
      comparison_object.id == id &&
      !comparison_object.new_record?)
end

#ancestors ⇒ Object

Returns an array of all parents



331
332
333
 
# File 'lib/awesome_nested_set/base.rb', line 331

def ancestors
  without_self self_and_ancestors
end

#child? ⇒ Boolean

Returns true is this is a child node

Returns:

  • (Boolean) 


303
304
305
 
# File 'lib/awesome_nested_set/base.rb', line 303

def child?
  !parent_id.nil?
end

#descendants ⇒ Object

Returns a set of all of its children and nested children



362
363
364
 
# File 'lib/awesome_nested_set/base.rb', line 362

def descendants
  without_self self_and_descendants
end

#is_ancestor_of?(other) ⇒ Boolean

Returns:

  • (Boolean) 


374
375
376
 
# File 'lib/awesome_nested_set/base.rb', line 374

def is_ancestor_of?(other)
  self.left < other.left && other.left < self.right && same_scope?(other)
end

#is_descendant_of?(other) ⇒ Boolean

Returns:

  • (Boolean) 


366
367
368
 
# File 'lib/awesome_nested_set/base.rb', line 366

def is_descendant_of?(other)
  other.left < self.left && self.left < other.right && same_scope?(other)
end

#is_or_is_ancestor_of?(other) ⇒ Boolean

Returns:

  • (Boolean) 


378
379
380
 
# File 'lib/awesome_nested_set/base.rb', line 378

def is_or_is_ancestor_of?(other)
  self.left <= other.left && other.left < self.right && same_scope?(other)
end

#is_or_is_descendant_of?(other) ⇒ Boolean

Returns:

  • (Boolean) 


370
371
372
 
# File 'lib/awesome_nested_set/base.rb', line 370

def is_or_is_descendant_of?(other)
  other.left <= self.left && self.left < other.right && same_scope?(other)
end

#leaf? ⇒ Boolean

Returns:

  • (Boolean) 


298
299
300
 
# File 'lib/awesome_nested_set/base.rb', line 298

def leaf?
  !new_record? && right - left == 1
end

#leaves ⇒ Object

Returns a set of all of its nested children which do not have children



346
347
348
 
# File 'lib/awesome_nested_set/base.rb', line 346

def leaves
  descendants.scoped.where("#{q_right} - #{q_left} = 1")
end

#left ⇒ Object

Value of the left column



284
285
286
 
# File 'lib/awesome_nested_set/base.rb', line 284

def left
  self[left_column_name]
end

#left_sibling ⇒ Object

Find the first sibling to the left



390
391
392
 
# File 'lib/awesome_nested_set/base.rb', line 390

def left_sibling
  siblings.where("#{q_left} < ?", left).reverse_order.first
end

#level ⇒ Object

Returns the level of this object in the tree root level is 0



352
353
354
 
# File 'lib/awesome_nested_set/base.rb', line 352

def level
  parent_id.nil? ? 0 : ancestors.count
end

#move_left ⇒ Object

Shorthand method for finding the left sibling and moving to the left of it.



400
401
402
 
# File 'lib/awesome_nested_set/base.rb', line 400

def move_left
  move_to_left_of left_sibling
end

#move_possible?(target) ⇒ Boolean

Returns:

  • (Boolean) 


429
430
431
432
433
434
435
 
# File 'lib/awesome_nested_set/base.rb', line 429

def move_possible?(target)
  self != target && # Can't target self
  same_scope?(target) && # can't be in different scopes
  # !(left..right).include?(target.left..target.right) # this needs tested more
  # detect impossible move
  !((left <= target.left && right >= target.left) or (left <= target.right && right >= target.right))
end

#move_right ⇒ Object

Shorthand method for finding the right sibling and moving to the right of it.



405
406
407
 
# File 'lib/awesome_nested_set/base.rb', line 405

def move_right
  move_to_right_of right_sibling
end

#move_to_child_of(node) ⇒ Object

Move the node to the child of another node (you can pass id only)



420
421
422
 
# File 'lib/awesome_nested_set/base.rb', line 420

def move_to_child_of(node)
  move_to node, :child
end

#move_to_left_of(node) ⇒ Object

Move the node to the left of another node (you can pass id only)



410
411
412
 
# File 'lib/awesome_nested_set/base.rb', line 410

def move_to_left_of(node)
  move_to node, :left
end

#move_to_right_of(node) ⇒ Object

Move the node to the left of another node (you can pass id only)



415
416
417
 
# File 'lib/awesome_nested_set/base.rb', line 415

def move_to_right_of(node)
  move_to node, :right
end

#move_to_root ⇒ Object

Move the node to root nodes



425
426
427
 
# File 'lib/awesome_nested_set/base.rb', line 425

def move_to_root
  move_to nil, :root
end

#parent_id ⇒ Object

Value of the parent column



279
280
281
 
# File 'lib/awesome_nested_set/base.rb', line 279

def parent_id
  self[parent_column_name]
end

#right ⇒ Object

Value of the right column



289
290
291
 
# File 'lib/awesome_nested_set/base.rb', line 289

def right
  self[right_column_name]
end

#right_sibling ⇒ Object

Find the first sibling to the right



395
396
397
 
# File 'lib/awesome_nested_set/base.rb', line 395

def right_sibling
  siblings.where("#{q_left} > ?", left).first
end

#root ⇒ Object

Returns root



321
322
323
 
# File 'lib/awesome_nested_set/base.rb', line 321

def root
  self_and_ancestors.first
end

#root? ⇒ Boolean

Returns true if this is a root node.

Returns:

  • (Boolean) 


294
295
296
 
# File 'lib/awesome_nested_set/base.rb', line 294

def root?
  parent_id.nil?
end

#same_scope?(other) ⇒ Boolean

Check if other model is in the same scope

Returns:

  • (Boolean) 


383
384
385
386
387
 
# File 'lib/awesome_nested_set/base.rb', line 383

def same_scope?(other)
  Array(acts_as_nested_set_options[:scope]).all? do |attr|
    self.send(attr) == other.send(attr)
  end
end

#self_and_ancestors ⇒ Object

Returns the array of all parents and self



326
327
328
 
# File 'lib/awesome_nested_set/base.rb', line 326

def self_and_ancestors
  nested_set_scope.scoped.where("#{q_left} <= ? AND #{q_right} >= ?", left, right)
end

#self_and_descendants ⇒ Object

Returns a set of itself and all of its nested children



357
358
359
 
# File 'lib/awesome_nested_set/base.rb', line 357

def self_and_descendants
  nested_set_scope.scoped.where("#{q_left} >= ? AND #{q_right} <= ?", left, right)
end

#self_and_siblings ⇒ Object

Returns the array of all children of the parent, including self



336
337
338
 
# File 'lib/awesome_nested_set/base.rb', line 336

def self_and_siblings
  nested_set_scope.scoped.where(parent_column_name => parent_id)
end

#siblings ⇒ Object

Returns the array of all children of the parent, except self



341
342
343
 
# File 'lib/awesome_nested_set/base.rb', line 341

def siblings
  without_self self_and_siblings
end

#to_text ⇒ Object 



437
438
439
440
441
 
# File 'lib/awesome_nested_set/base.rb', line 437

def to_text
  self_and_descendants.map do |node|
    "#{'*'*(node.level+1)} #{node.id} #{node.to_s} (#{node.parent_id}, #{node.left}, #{node.right})"
  end.join("\n")
end