Skip to content

Converted Crystal file to Ruby #2

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: ruby-conversion
Choose a base branch
from
Open

Converted Crystal file to Ruby #2

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
47 changes: 27 additions & 20 deletions AA_Tree.rb
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,7 +1,14 @@
class AANode
property :value, :parent, :left, :right, :level
class Object
# Hack to preserve the .as() calls
def as(_)
self
end
end

def initialize(value : Int32, level : Int32, left : (AANode | Nil)=nil, right : (AANode | Nil)=nil, parent : (AANode | Nil)=nil)
class AANode
attr_accessor :value, :parent, :left, :right, :level

def initialize(value:, level:, left: nil, right: nil, parent: nil)
@value = value
@level = level
@parent = parent
Expand All @@ -11,7 +18,7 @@ def initialize(value : Int32, level : Int32, left : (AANode | Nil)=nil, right :
end

class AATree
def initialize(root : AANode)
def initialize(root)
@root = root
@count = 1
end
Expand All @@ -21,7 +28,7 @@ class AANode
#
# Returns the grandparent of the node
#
def grandparent : (AANode | Nil)
def grandparent
if @parent.nil?
nil
else
Expand All @@ -39,26 +46,26 @@ def grandparent : (AANode | Nil)
# In the above example, 3 is a right grandchild of 1.
# 6 is not a right grandchild of 5
#
def is_right_grandchild?(grandparent : AANode)
def is_right_grandchild?(grandparent)
(!grandparent.right.nil?) && (!grandparent.right.as(AANode).right.nil?) && grandparent.right.as(AANode).right == self
end
end

class AATree
def initialize(root : AANode)
def initialize(root)
@root = root
@count = 1
end

def contains?(value : Int32) : Bool
def contains?(value)
if @root.nil?
raise Exception.new("Tree is empty!")
else
_contains?(value, @root.as(AANode))
end
end

protected def _contains?(value : Int32, node : AANode) : Bool
protected def _contains?(value, node)
if node.value > value
if node.left.nil?
false
Expand All @@ -79,7 +86,7 @@ def contains?(value : Int32) : Bool
#
# Adds a value into the tree
#
def add(value : Int32)
def add(value)
if @root.nil?
@root = AANode.new(value: value, level: 1)
else
Expand All @@ -91,7 +98,7 @@ def add(value : Int32)
#
# Removes a value from the tree
#
def remove(value : Int32)
def remove(value)
if @root.nil?
raise Exception.new("There is nothing to remove!")
elsif @count == 1
Expand All @@ -107,7 +114,7 @@ def remove(value : Int32)
#
# Removes a value from the tree
#
protected def _remove(value : Int32, node : (AANode | Nil))
protected def _remove(value, node)
if node.nil?
raise Exception.new("Value #{value} is not in the tree!")
end
Expand Down Expand Up @@ -165,10 +172,10 @@ def remove(value : Int32)
# The node is removed, now fix the levels

# left node should be exactly one level less
left_level_is_wrong : Bool = (!node.left.nil? && node.left.as(AANode).level < node.level - 1) || (node.left.nil? && node.level > 1) # if we don't have a left node, our level should be 1
left_level_is_wrong = (!node.left.nil? && node.left.as(AANode).level < node.level - 1) || (node.left.nil? && node.level > 1) # if we don't have a left node, our level should be 1

# right node should be exactly one less or equal
right_level_is_wrong : Bool = (!node.right.nil? && node.right.as(AANode).level < node.level - 1) || (node.right.nil? && node.level > 1) # if we don't have a right node, our level should be 1
right_level_is_wrong = (!node.right.nil? && node.right.as(AANode).level < node.level - 1) || (node.right.nil? && node.level > 1) # if we don't have a right node, our level should be 1

# If there is no break in the levels there is no need to do rebalance operations
return unless (left_level_is_wrong || right_level_is_wrong)
Expand Down Expand Up @@ -217,7 +224,7 @@ def remove(value : Int32)
# left/right of which the new node should be inserted.
# Backtracing from the recursion, we check if we should perform a split or skew operation*/
#
protected def _add(value : Int32, node : AANode)
protected def _add(value, node)
if value < node.value
# go left
if node.left.nil?
Expand Down Expand Up @@ -259,7 +266,7 @@ def remove(value : Int32)
# i.e if 12 had a left child 11.5, 11.5 should become the right child of the new 11
#

def split(grandparent : AANode, parent : AANode)
def split(grandparent, parent)
# fixes grandparent's link
grand_grandparent = grandparent.parent
unless grand_grandparent.nil?
Expand Down Expand Up @@ -287,7 +294,7 @@ def split(grandparent : AANode, parent : AANode)

# Given a node, check if a Split operation should be performed, by checking the node's grandparent level
# The node we're given would be the downmost one in the split operation */
def check_split(node : AANode)
def check_split(node)
grandparent = node.grandparent
if (!grandparent.nil?) && node.is_right_grandchild?(grandparent) && grandparent.level <= node.level
split(grandparent, node.parent.as(AANode))
Expand All @@ -300,7 +307,7 @@ def check_split(node : AANode)
# / ===> \
# 11(B) 1 12(A)1
#
def skew(parent : AANode, leaf : AANode)
def skew(parent, leaf)
grandparent = parent.parent
unless grandparent.nil?
if grandparent.value < parent.value
Expand Down Expand Up @@ -329,7 +336,7 @@ def skew(parent : AANode, leaf : AANode)
# We generally don't want to do that in deletions, as in the example on the TestFunctionalTestTreeRemoval function
# where we remove 1 from the tree
#
def check_skew(node : AANode, check_for_split : Bool)
def check_skew(node, check_for_split)
parent = node.parent
if (!parent.nil?) && parent.left == node && parent.level <= node.level
skew(parent, node)
Expand All @@ -356,4 +363,4 @@ def check_skew(node : AANode, check_for_split : Bool)
raise Exception.new("Tree should contain #{num}") unless tree.contains?(num)
tree.remove(num)
raise Exception.new("Tree should not contain #{num}") if tree.contains?(num)
end
end