tree_hierarchy 1.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: db5dc5ed6f2dbd7d4ed8a3e4e2a9b3e05aef7f73
+  data.tar.gz: 5ab59d283cb8cd8f6120d76678397633f91ca6a1
+SHA512:
+  metadata.gz: 1811c27470218f21c6d07e3f6aa73b8649a88cd07eb2bb4aa1b64cf7abe03e948714bac414a5185ca737b358a4636636e8da215bfd8d82070ad50bd94ea6861f
+  data.tar.gz: b6534b6803544ff2957456a79870b3181778f131e460b6259a36701a37a3fda0a7bde9204d5af4872e514d6ea36968157a2147f624bef99022654f270198c44f

data/lib/helper/support_method.rb

@@ -0,0 +1,11 @@
+module SupportMethod
+
+  def group_result_set(result_set) 
+    result_set.group_by(&:parent_id)
+  end
+
+  def total_calc(result_group,field_set)
+    result_group.sum{|x| x[field_set].to_i}
+  end
+
+end

data/lib/hierarchy/added_hierarchy_level.rb

@@ -0,0 +1,76 @@
+module AddedHierarchyLevel
+
+  @@result_group = []
+
+  def added_hierarchy(result_set,depth = 0,*args)
+    @@result_group = group_result_set(result_set)
+    parent_child_add(args)
+    (depth == 0) ? self.tree_structure(result_set,@@result_group) : self.tree_structure_depth(result_set,@@result_group,depth.to_i)
+  end
+ 
+  def added_hierarchy_level(result_set,depth = 0, *args)
+    @@result_group = group_result_set(result_set)
+    parent_child_add(args)
+    (depth == 0) ? self.tree_structure_level(result_set,@@result_group) : self.tree_structure_depth_level(result_set,@@result_group,depth.to_i)
+  end
+
+  def parent_child_add(field_set)
+    case field_set.length
+    when 0
+    when 1
+      calc_of_parent_one(field_set)
+    when 2
+      calc_of_parent_two(field_set)
+    when 3
+      calc_of_parent_three(field_set)
+    when 4
+      calc_of_parent_four(field_set)
+    else
+      calc_of_parent_five(field_set)
+    end
+  end
+
+  # Code repetiation occurs to avoid unwanted conditions during execution 
+  # If these codes are combained together, more conditions need to check for each looping and updating of @@result_group become too complex, this affect the performance
+
+  def calc_of_parent_one(field_set)
+    unless @@result_group[self.id].blank?
+      @@result_group[self.id].map{|x| x.calc_of_parent_one(field_set)}
+      sum_value = total_calc(@@result_group[self.id],field_set[0]) 
+      @@result_group[self.parent_id].map{|x| x.id == self.id && x[field_set[0]] = sum_value}
+    end 
+  end
+  
+  def calc_of_parent_two(field_set)
+    unless @@result_group[self.id].blank?
+      @@result_group[self.id].map{|x| x.calc_of_parent_two(field_set)}
+      sum_value0,sum_value1 = total_calc(@@result_group[self.id],field_set[0]),total_calc(@@result_group[self.id],field_set[1])
+      @@result_group[self.parent_id].map{|x| (x.id == self.id) && (x[field_set[0]] = sum_value0) && (x[field_set[1]] = sum_value1)}
+    end 
+  end
+
+  def calc_of_parent_three(field_set)
+    unless @@result_group[self.id].blank?
+      @@result_group[self.id].map{|x| x.calc_of_parent_three(field_set)}
+      sum_value0,sum_value1,sum_value2 = total_calc(@@result_group[self.id],field_set[0]),total_calc(@@result_group[self.id],field_set[1]),total_calc(@@result_group[self.id],field_set[2])
+      @@result_group[self.parent_id].map{|x| (x.id == self.id) && (x[field_set[0]] = sum_value0) && (x[field_set[1]] = sum_value1) && (x[field_set[2]] = sum_value2)}
+    end 
+  end
+
+  def calc_of_parent_four(field_set)
+    unless @@result_group[self.id].blank?
+      @@result_group[self.id].map{|x| x.calc_of_parent_four(field_set)}
+      sum_value0,sum_value1,sum_value2,sum_value3 = total_calc(@@result_group[self.id],field_set[0]),total_calc(@@result_group[self.id],field_set[1]),total_calc(@@result_group[self.id],field_set[2]),total_calc(@@result_group[self.id],field_set[3])
+      @@result_group[self.parent_id].map{|x| (x.id == self.id) && (x[field_set[0]] = sum_value0) && (x[field_set[1]] = sum_value1) && (x[field_set[2]] = sum_value2) && (x[field_set[3]] = sum_value3)}
+    end 
+  end
+
+  def calc_of_parent_five(field_set)
+    unless @@result_group[self.id].blank?
+      @@result_group[self.id].map{|x| x.calc_of_parent_five(field_set)}
+      sum_value0,sum_value1,sum_value2,sum_value3,sum_value4 = total_calc(@@result_group[self.id],field_set[0]),total_calc(@@result_group[self.id],field_set[1]),total_calc(@@result_group[self.id],field_set[2]),total_calc(@@result_group[self.id],field_set[3]),total_calc(@@result_group[self.id],field_set[4])
+      @@result_group[self.parent_id].map{|x| (x.id == self.id) && (x[field_set[0]] = sum_value0) && (x[field_set[1]] = sum_value1) && (x[field_set[2]] = sum_value2) && (x[field_set[3]] = sum_value3) && (x[field_set[4]] = sum_value4)}
+    end 
+  end
+
+end

data/lib/hierarchy/hierarchy_no_level.rb

@@ -0,0 +1,16 @@
+module HierarchyNoLevel
+
+  def hierarchy(result_set,depth = 0)
+    result_group = group_result_set(result_set)
+    (depth == 0) ? self.tree_structure(result_set,result_group) : self.tree_structure_depth(result_set,result_group,depth.to_i)
+  end
+
+  def tree_structure(result_set,result_group)
+    result_group[self.id].blank? ? self.attributes : self.attributes.merge({:children => result_group[self.id].map{|x| x.tree_structure(result_set,result_group)}}) 
+  end
+
+  def tree_structure_depth(result_set,result_group,depth,increment = 1)
+    result_group[self.id].blank? ? self.attributes : self.attributes.merge({:children => result_group[self.id].map{|x| x.tree_structure_depth(result_set,result_group,depth,increment + 1)}}) unless increment > depth 
+  end
+
+end 

data/lib/hierarchy/hierarchy_with_level.rb

@@ -0,0 +1,16 @@
+module HierarchyWithLevel
+
+  def hierarchy_level(result_set,depth = 0)
+    result_group = group_result_set(result_set)
+    (depth == 0) ? self.tree_structure_level(result_set,result_group) : self.tree_structure_depth_level(result_set,result_group,depth.to_i)
+  end
+
+  def tree_structure_level(result_set,result_group,increment = 1)
+    result_group[self.id].blank? ? self.attributes.merge({:level => increment}) : self.attributes.merge({:level => increment, :children => result_group[self.id].map{|x| x.tree_structure_level(result_set,result_group,increment + 1)}}) 
+  end
+
+  def tree_structure_depth_level(result_set,result_group,depth,increment = 1)
+    result_group[self.id].blank? ? self.attributes.merge({:level => increment}) : self.attributes.merge({:level => increment, :children => result_group[self.id].map{|x| x.tree_structure_depth_level(result_set,result_group,depth,increment + 1)}}) unless increment > depth 
+  end
+
+end

data/lib/tree_hierarchy.rb

@@ -0,0 +1,11 @@
+require "hierarchy/hierarchy_no_level"
+require "hierarchy/hierarchy_with_level"
+require "hierarchy/added_hierarchy_level"
+require "helper/support_method"
+
+class ActiveRecord::Base  
+  include HierarchyNoLevel 
+  include HierarchyWithLevel
+  include AddedHierarchyLevel
+  include SupportMethod 
+end 

metadata

@@ -0,0 +1,50 @@
+--- !ruby/object:Gem::Specification
+name: tree_hierarchy
+version: !ruby/object:Gem::Version
+  version: 1.0.0
+platform: ruby
+authors:
+- dheenaINDIAN
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2014-04-02 00:00:00.000000000 Z
+dependencies: []
+description: "  \n  Tree_hierarchy allows to form a tree structure based on parent-child
+  relationship \n  with simple and fast computation with large records. Additional
+  feature of updating\n  the parent record with the sum of its child value\n  \n"
+email: dheenaindian@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/tree_hierarchy.rb
+- lib/hierarchy/hierarchy_no_level.rb
+- lib/hierarchy/hierarchy_with_level.rb
+- lib/hierarchy/added_hierarchy_level.rb
+- lib/helper/support_method.rb
+homepage: https://github.com/dheenaINDIAN/tree_hierarchy.git
+licenses:
+- MIT
+metadata: {}
+post_install_message: Thanks for installing!
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubyforge_project: 
+rubygems_version: 2.0.3
+signing_key: 
+specification_version: 4
+summary: Create a tree structure and update the parent with sum of its child value
+test_files: []