fast_tree 0.2.0 → 0.2.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 1a2408d73a49d03de109154c5bc8897bfcbeadaf
-  data.tar.gz: 48bda26709f050ccc1b56ac535220aaf89169696
+  metadata.gz: d7ad496b93e43daf87291d74fe77ca656f69da04
+  data.tar.gz: ea272ac4a8e05a1c65d666bf7bb1d60c92fb81a2
 SHA512:
-  metadata.gz: 59bd83c3ee0bb38e65dfe8ce9152619a18c65b06eddedfb65b765581e7afd354fc4687f82d25d86058c4d12894e20ad278c8eaa48802eafd4d2e4f30c78ee74f
-  data.tar.gz: c89f948f54b279fc8a857764995353abac0bf56e0bbb38e1ba6ef5afcb6e952757df66db150a1ce5c92211a813f2cd77feecb115d7036100c4baf7e71a210796
+  metadata.gz: 65c311ec95d820c844dc04fb8b2322bc1a675eb081e8e637ff2ca9e0c28b2333d08cf39008d50f0e3b60064287a8f6e0d6971356344305e3dc47ca282be531ab
+  data.tar.gz: f2a89aed4d7837dd4fc206ad40d2fe6589d02af90cd5000eecf09727720c15529f6b22739bf6a7537dd64c87b0a10176f3665061b3bfca8b8924d27fa318b577

data/README.md

@@ -197,6 +197,23 @@ root.subtree.bfs.each do |node|
 end
 ```
 
+### Parent and children
+
+To get a parent node,
+
+```ruby
+node = YOUR_MODEL_NAME.take
+node.parent
+```
+
+or child nodes,
+
+```ruby
+node = YOUR_MODEL_NAME.take
+node.children
+```
+
+
 ### Boolean methods
 
 `fast_tree` provides several boolean methods, such as:

data/lib/fast_tree/model.rb

@@ -168,14 +168,16 @@ UPDATE #{self.to_s.underscore.pluralize}
     end
 
     def copy_to(node)
-      subtree = self.class.find_subtree_by_root(self)
-
       # create empty space into which subtree embedded
-      _update_nodes(node.l_ptr, node.r_ptr, "r_ptr >= #{r_ptr}", width + 1)
+      _update_nodes(node.l_ptr, node.r_ptr, "r_ptr >= #{node.r_ptr}", width + 1)
+
+      # self and node may be updated by shifting
+      self.reload
+      node.reload
 
-      bias = node.l_ptr + 1 - l_ptr
+      bias = node.r_ptr - r_ptr - 1
       base_depth = depth
-      subtree.each do |st_node|
+      self.subtree.each do |st_node|
         attributes = st_node.attributes.to_h
         attributes.delete("id")
         attributes["l_ptr"] += bias
@@ -190,25 +192,31 @@ UPDATE #{self.to_s.underscore.pluralize}
       # copy_to and remove change node ids
       # move operation should change nothing but left and right pointers
 
-      # bind subtree to a variable
-      subtree = self.class.find_subtree_by_root(self)
-
-      # fill (virtual) empty spaces that will be created by moving subtree
-      _update_nodes(l_ptr, r_ptr, "l_ptr > #{r_ptr}", - (width + 1))
-
       # create empty spaces under the node
+      _update_nodes(node.r_ptr, node.r_ptr, "r_ptr >= #{node.r_ptr}", width + 1)
+
+      self.reload
       node.reload
-      _update_nodes(node.l_ptr, node.r_ptr, "l_ptr >= #{node.l_ptr} AND r_ptr <= #{node.r_ptr}", width + 1)
+
+      # remember where the node were
+      empty_space_left = self.l_ptr
+      empty_space_right = self.r_ptr
 
       # move subtree under the given node
-      bias = node.l_ptr + 1 - l_ptr
+      bias = node.r_ptr - r_ptr - 1
       base_depth = depth
-      subtree.each do |st_node|
+      self.subtree.each do |st_node|
         st_node.l_ptr += bias
         st_node.r_ptr += bias
         st_node.depth += node.depth - base_depth + 1
         st_node.save
       end
+
+      self.reload
+      node.reload
+
+      # fill (virtual) empty spaces that will be created by moving subtree
+      _update_nodes(empty_space_left, empty_space_right, "r_ptr > #{empty_space_right}", - (width + 1))
     end
 
     def remove
@@ -253,10 +261,66 @@ UPDATE #{self.to_s.underscore.pluralize}
       l_ptr != r_ptr - 1
     end
 
+    #
+    # Getter Methods
+    #
+
+    def parent
+      self.class.where(self.class.arel_table[:l_ptr].lt(l_ptr))
+                .where(self.class.arel_table[:r_ptr].gt(r_ptr))
+                .where(depth: depth - 1)
+                .try(:first)
+    end
+
+    def children
+      self.class.where(self.class.arel_table[:l_ptr].gt(l_ptr))
+                .where(self.class.arel_table[:r_ptr].lt(r_ptr))
+                .where(depth: depth + 1)
+    end
+
 
     protected
 
       def _update_nodes(left, right, condition, diff = 2)
+        #
+        # Possible patterns
+        #
+        #     left         right
+        # --------------------------
+        # <---> |            |         ... 1.
+        #     <----->        |         ... 2.
+        #       |  <----->   |         ... 3.
+        #       |         <----->      ... 4.
+        #       |            | <---->  ... 5.
+        #   <------------------->      ... 6.
+        #       |            |
+        #
+        #
+        # 1: do nothing
+        #   l_ptr <- l_ptr
+        #   r_ptr <- r_ptr
+        #
+        # 2: do nothing (illegal node)
+        #   l_ptr <- l_ptr
+        #   r_ptr <- r_ptr
+        #
+        # 3: move diff - 1 to the right
+        #   l_ptr <- l_ptr + diff - 1
+        #   r_ptr <- r_ptr + diff - 1
+        #
+        # 4: do nothing (illegal node)
+        #   l_ptr <- l_ptr
+        #   r_ptr <- r_ptr
+        #
+        # 5: move diff to the right
+        #   l_ptr <- l_ptr + diff
+        #   r_ptr <- r_ptr + diff
+        #
+        # 6: move right endpoint by diff to the right
+        #   l_ptr <- l_ptr
+        #   r_ptr <- r_ptr + diff
+        #
+
         #
         # NOTE:
         # Due to performance reason,

data/lib/fast_tree/version.rb

@@ -1,3 +1,3 @@
 module FastTree
-  VERSION = '0.2.0'
+  VERSION = '0.2.1'
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: fast_tree
 version: !ruby/object:Gem::Version
-  version: 0.2.0
+  version: 0.2.1
 platform: ruby
 authors:
 - Chisato Hasegawa
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2017-02-08 00:00:00.000000000 Z
+date: 2017-02-14 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rails
@@ -92,7 +92,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
       version: '0'
 requirements: []
 rubyforge_project: 
-rubygems_version: 2.5.2
+rubygems_version: 2.5.1
 signing_key: 
 specification_version: 4
 summary: '["Rails plugin for Fast Tree Structure", "fast_tree is an implementation