winding-polygon 0.0.3 → 0.0.4

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 4d430cfe91bb9a92623cb8f79b9ad4b7592b5db5
-  data.tar.gz: 1bcfa936807da46199b6c7a71b1faa0c64e057c8
+  metadata.gz: 8f09f3e08429b83b14f827767c614a710c744d00
+  data.tar.gz: 3a2490fe74d30ffccb353b72dad90df6d381950f
 SHA512:
-  metadata.gz: fe5ee6fb05e9f98dd6cf4b2785043d91de374460f66cf35de8b8911e1b541c2f56cbb8b0fc681f533dbcb617304879b53434984bd0d2412411fb93c5d954506d
-  data.tar.gz: 06e207c51824273756dc7504826b0e2fb513805b2c4c24d5e398b22ab6376cd08080bae5763837489c2793c7d594aa8d57a87ae4b2ba23347387fc02d7b3fbd4
+  metadata.gz: adde2609596a7b83a81a234cb4a1d66fde5cade1663f28aeece7361147490a48a61f9d29d164ac7382a20df5ee54361b4ed0b732043f654607321e193b2d8cf0
+  data.tar.gz: 13babb54197e2582cc71fed07e3aa08a2c13f8ced36c70c51e5bd528e2a1f4e61309cd741533140759c60e453891465bb44b378dc0c1f16a9b039224ce22a5af

data/lib/winding-polygon/avltree.rb

@@ -1,287 +1,289 @@
-class AVLTree
-  attr_accessor :root
-  def initialize(array = [])
-    #create root
-    @root = nil
-    array.each do |n|
-      insert n
+module WindingPolygon
+  class AVLTree
+    attr_accessor :root
+    def initialize(array = [])
+      #create root
+      @root = nil
+      array.each do |n|
+        insert n
+      end
     end
-  end
 
-  def insert(v)
-    i_node = create_node(v)
+    def insert(v)
+      i_node = create_node(v)
+
+      prev_node = nil
+      curr_node = @root
+      while !curr_node.nil?
+        prev_node = curr_node
+        if i_node.value < curr_node.value
+          curr_node = curr_node.left
+        else
+          curr_node = curr_node.right
+        end
+      end
 
-    prev_node = nil
-    curr_node = @root
-    while !curr_node.nil?
-      prev_node = curr_node
-      if i_node.value < curr_node.value
-        curr_node = curr_node.left
+      if prev_node.nil?
+        @root = i_node
       else
-        curr_node = curr_node.right
+        i_node.parent = prev_node
+        if i_node.value < prev_node.value
+          prev_node.left = i_node
+        else
+          prev_node.right = i_node
+        end
       end
+      i_node.update_height
+      @root = i_node.balance
+      i_node
+    end
+
+    def search(v)
+      search_node(@root, v)
     end
 
-    if prev_node.nil?
-      @root = i_node
-    else
-      i_node.parent = prev_node
-      if i_node.value < prev_node.value
-        prev_node.left = i_node
+    def delete(v)
+      d = search(v)
+      return nil if d.nil?
+
+      if d.left == nil or d.right == nil
+        n = d
+      else #both children exist
+        n = d.next
+      end
+
+      if !n.left.nil?
+        b = n.left
       else
-        prev_node.right = i_node
+        b = n.right
       end
-    end
-    i_node.update_height
-    @root = i_node.balance 
-    i_node
-  end
 
-  def search(v)
-    search_node(@root, v)
-  end
+      b.parent = n.parent unless b.nil?
+
+      if n.parent.nil?
+        @root = b
+      elsif n == n.parent.left
+        n.parent.left = b
+      else
+        n.parent.right = b
+      end
 
-  def delete(v)
-    d = search(v)
-    return nil if d.nil?
+      d.value = n.value unless n == d
 
-    if d.left == nil or d.right == nil
-      n = d
-    else #both children exist
-      n = d.next
+      if b.nil?
+        n.parent.update_height if !n.parent.nil?
+        @root = n.balance
+      else
+        b.update_height
+        @root = b.balance
+      end
+      n
     end
 
-    if !n.left.nil?
-      b = n.left
-    else
-      b = n.right
+    def print
+      result = sort
+      puts result.inspect
     end
 
-    b.parent = n.parent unless b.nil?
-    
-    if n.parent.nil?
-      @root = b
-    elsif n == n.parent.left
-      n.parent.left = b
-    else
-      n.parent.right = b
+    def sort
+      result = Array.new
+      sort_node(@root, result )
+      result
     end
 
-    d.value = n.value unless n == d
+    def min
+      @root.min
+    end
 
-    if b.nil?
-      n.parent.update_height if !n.parent.nil?
-      @root = n.balance
-    else
-      b.update_height
-      @root = b.balance 
+    def max
+      @root.max
     end
-    n
-  end
 
-  def print
-    result = sort
-    puts result.inspect
-  end
 
-  def sort
-    result = Array.new
-    sort_node(@root, result )
-    result
-  end
 
-  def min
-    @root.min
-  end
+  private
+    def create_node(v = nil)
+      n = AVLNode.new(:value => v)
+    end
 
-  def max
-    @root.max
-  end
+    def sort_node(n, array)
+      if !n.nil?
+        sort_node(n.left, array)
+        array.push(n.value)
+        sort_node(n.right, array)
+      end
+    end
 
+    def search_node(n, v)
+      if !n.nil?
+        if n.value == v
+          return n
+        elsif v < n.value
+          search_node(n.left,v)
+        else
+          search_node(n.right,v)
+        end
+      end
+    end
+  end
 
+  class AVLNode
+    BAL_H = 1
+    attr_accessor :height, :left, :right, :value, :parent
+    def initialize args
+      @height = 0
+      @left = nil
+      @right = nil
+      @value = nil
+      @parent = nil
+      args.each do |k,v|
+        instance_variable_set("@#{k}", v) unless v.nil?
+      end
+    end
 
-private
-  def create_node(v = nil)
-    n = AVLNode.new(:value => v)
-  end
+    def balance
+      rotate if difference.abs > BAL_H
+      return self if @parent.nil?
+      @parent.balance
+    end
 
-  def sort_node(n, array)
-    if !n.nil?
-      sort_node(n.left, array)
-      array.push(n.value)
-      sort_node(n.right, array)
+    def update_height
+      l_height = @left.nil? ? 0 : @left.height
+      r_height = @right.nil? ? 0 : @right.height
+      @height = ((l_height > r_height) ? l_height : r_height) + 1
+      @parent.update_height unless @parent.nil?
     end
-  end
 
-  def search_node(n, v)
-    if !n.nil?
-      if n.value == v
-        return n
-      elsif v < n.value
-        search_node(n.left,v) 
-      else
-        search_node(n.right,v)
+    def rotate
+      if difference >= BAL_H
+        #check if children should rotate too
+        @right.rotate if @right.difference <= -BAL_H
+        rotate_left
+      elsif difference <= - BAL_H
+        #check if children should rotate too
+        @left.rotate if @left.difference >= BAL_H
+        rotate_right
       end
     end
-  end
-end
-
-class AVLNode
-  BAL_H = 1
-  attr_accessor :height, :left, :right, :value, :parent
-  def initialize args
-    @height = 0
-    @left = nil
-    @right = nil
-    @value = nil
-    @parent = nil
-    args.each do |k,v|
-      instance_variable_set("@#{k}", v) unless v.nil?
-    end
-  end
 
-  def balance
-    rotate if difference.abs > BAL_H
-    return self if @parent.nil?
-    @parent.balance 
-  end
+    def rotate_left
+      #the old right is now the root
+      root = @right
+      root.parent = @parent
+      #update the parent to point to the new root
+      if not @parent.nil?
+        if @parent.right == self
+          @parent.right = root
+        else
+          @parent.left = root
+        end
+      end
 
-  def update_height
-    l_height = @left.nil? ? 0 : @left.height
-    r_height = @right.nil? ? 0 : @right.height
-    @height = ((l_height > r_height) ? l_height : r_height) + 1
-    @parent.update_height unless @parent.nil?
-  end
+      #this node's right is now the root's left
+      @right = root.left
+      root.left.parent = self unless root.left.nil?
 
-  def rotate
-    if difference >= BAL_H
-      #check if children should rotate too
-      @right.rotate if @right.difference <= -BAL_H
-      rotate_left
-    elsif difference <= - BAL_H
-      #check if children should rotate too
-      @left.rotate if @left.difference >= BAL_H
-      rotate_right
+      #the root is now the parent of this node
+      @parent = root
+      #this node is now the root's left
+      root.left = self
+      root.left.update_height
+      root
     end
-  end
 
-  def rotate_left
-    #the old right is now the root
-    root = @right
-    root.parent = @parent
-    #update the parent to point to the new root 
-    if not @parent.nil?
-      if @parent.right == self
-        @parent.right = root
-      else
-        @parent.left = root
+    def rotate_right
+      root = @left
+      root.parent = @parent
+      #update the parent to point to the new root
+      if not @parent.nil?
+        if @parent.right == self
+          @parent.right = root
+        else
+          @parent.left = root
+        end
       end
-    end
 
-    #this node's right is now the root's left
-    @right = root.left
-    root.left.parent = self unless root.left.nil?
+      @left = root.right
+      root.right.parent = self unless root.right.nil?
 
-    #the root is now the parent of this node
-    @parent = root
-    #this node is now the root's left
-    root.left = self
-    root.left.update_height
-    root
-  end
+      @parent = root
+      root.right = self
+      root.right.update_height
+      root
+    end
+
+    def difference
+      r_height = @right.nil? ? 0 : @right.height
+      l_height = @left.nil? ? 0 : @left.height
+      r_height - l_height
+    end
 
-  def rotate_right
-    root = @left
-    root.parent = @parent
-    #update the parent to point to the new root 
-    if not @parent.nil?
-      if @parent.right == self
-        @parent.right = root
+    def next
+      if not @right.nil?
+        @right.min
       else
-        @parent.left = root
+        curr_node = self
+        p_node = @parent
+        while p_node != nil && curr_node == p_node.right
+          curr_node = p_node
+          p_node = p_node.parent
+        end
+        p_node
       end
     end
 
-    @left = root.right
-    root.right.parent = self unless root.right.nil?
-
-    @parent = root
-    root.right = self
-    root.right.update_height
-    root
-  end
+    def prev
+      if not @left.nil?
+        @left.max
+      else
+        curr_node = self
+        p_node = @parent
+        while p_node != nil && curr_node == p_node.left
+          curr_node = p_node
+          p_node = p_node.parent
+        end
+        p_node
+      end
+    end
 
-  def difference
-    r_height = @right.nil? ? 0 : @right.height
-    l_height = @left.nil? ? 0 : @left.height
-    r_height - l_height
-  end
 
-  def next
-    if not @right.nil?
-      @right.min 
-    else
-      curr_node = self
-      p_node = @parent 
-      while p_node != nil && curr_node == p_node.right
-        curr_node = p_node
-        p_node = p_node.parent
+    def min
+      node = self
+      while !node.left.nil?
+        node = node.left
       end
-      p_node
+      node
     end
-  end
 
-  def prev
-    if not @left.nil?
-      @left.max 
-    else
-      curr_node = self
-      p_node = @parent 
-      while p_node != nil && curr_node == p_node.left
-        curr_node = p_node
-        p_node = p_node.parent
+    def max
+      node = self
+      while !node.right.nil?
+        node = node.right
       end
-      p_node
+      node
     end
-  end
-
 
-  def min
-    node = self
-    while !node.left.nil?
-      node = node.left 
+    def print_node
+      out_s =  "\t\t\t\t\t\n"
+      out_s += "\t\t#{@parent}\t\t\n"
+      out_s += "#{@height}\t\t|#{@value}|\t\t\n"
+      out_s += "\t#{@left}\t\t#{@right}\t\n"
+      out_s +=  "\t\t\t\t\t\n"
+      puts out_s
     end
-    node
-  end
 
-  def max
-    node = self
-    while !node.right.nil?
-      node = node.right
+    def print
+      out_s = "#{@value} - "
+      instance_variables.each do |i|
+        out_s += "(#{i}: #{instance_variable_get(i.to_sym)})"
+      end
+      puts out_s
     end
-    node
-  end
 
-  def print_node
-    out_s =  "\t\t\t\t\t\n"
-    out_s += "\t\t#{@parent}\t\t\n"
-    out_s += "#{@height}\t\t|#{@value}|\t\t\n"
-    out_s += "\t#{@left}\t\t#{@right}\t\n"
-    out_s +=  "\t\t\t\t\t\n"
-    puts out_s
-  end
-
-  def print
-    out_s = "#{@value} - "
-    instance_variables.each do |i|
-      out_s += "(#{i}: #{instance_variable_get(i.to_sym)})"
+    def to_s
+      @value.to_s
     end
-    puts out_s
-  end
 
-  def to_s
-    @value.to_s
   end
 
-end
-
+end