forestify 1.0.0 → 1.0.1

data/README.md

@@ -14,12 +14,9 @@ end
 You can then do something like this :
 
 ```ruby
-vehicle = Tag.new(name: "Vehicle")
-vehicle.save!
-car = Tag.new(name: "Car", parent: vehicle.id)
-car.save!
-audi = Tag.new(name: "Audi", parent: car.id)
-audi.save!
+vehicle = Tag.create!(name: "Vehicle")
+car = Tag.create!(name: "Car", parent_id: vehicle.id)
+audi = Tag.create!(name: "Audi", parent_id: car.id)
 
 audi.parents
 # => [vehicle, car]
@@ -37,7 +34,6 @@ Although I will add generators later, you still need to manually add migrations
 
 ```ruby
 change_table :tags do |t|
-	t.string :name
 	t.integer :left_position
 	t.integer :right_position
 	t.integer :level

data/lib/forestify.rb

@@ -5,7 +5,7 @@ module Forestify
 		end
 		before_create :initialize_position
 		before_destroy :update_positions_after_delete
-		attr_accessor :parent
+		attr_accessor :parent_id
 	end
 
 	module InstanceMethods
@@ -14,7 +14,7 @@ module Forestify
 		# Should be run only once
 		def initialize_position
 			# @parent = -1 is the option 'No parent'
-			if @parent.nil? || @parent == "-1"
+			if @parent_id.nil? || @parent_id == "-1"
 				# No parent has been specified, we need to add this leaf
 				# to the right side of the last root node.
 				last = self.class.order("right_position DESC").first
@@ -23,8 +23,8 @@ module Forestify
 				self.level = 0
 			else
 				# Makes sure it's an integer
-				@parent = @parent.to_i
-				p = self.class.find(@parent)
+				@parent_id = @parent_id.to_i
+				p = self.class.find(@parent_id)
 				self.left_position = p.right_position
 				self.right_position = self.left_position + 1
 				self.level = p.level + 1
@@ -50,16 +50,27 @@ module Forestify
 			end
 		end
 
-
 		def parents
 			self.class.where('left_position < ?', self.left_position).where('right_position > ?', self.right_position)
 		end
 
+		def parent
+      self.parents.where('level = ?', self.level - 1).first
+		end
+
 		def children
       [] if is_leaf?
 			self.class.where('left_position > ?', self.left_position).where('right_position < ?', self.right_position)
 		end
 
+		def siblings
+			if self.parent.nil?
+				self.class.where('level = 0').where('id != ?', self.id)
+			else
+				self.parent.children.where('level = ?', self.level).where('id != ?', self.id)
+			end
+		end
+
     def is_node?
 			(self.right_position - self.left_position) > 1
 		end

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: forestify
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 1.0.1
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2012-02-05 00:00:00.000000000 Z
+date: 2012-02-06 00:00:00.000000000 Z
 dependencies: []
 description: Forestify brings a tree data-structure to your Active Record models
 email: gabriel.malkas@gmail.com