splaytree 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: d251409b924ce93ff916bf31539babb39da6ff50
+  data.tar.gz: 96ce8b423c24cc2cdc21d8e9a3afe04f89aaae78
+SHA512:
+  metadata.gz: 9815b103c477f5fccde78d85fd48c00b89b13aa0162495fe53eeb843c96cb4bb36721d260d687ae35d41fbf2981e8a5f68fe452b5d46663f908d171a319da07a
+  data.tar.gz: ac6a350fd0a2a98df6bf46dde19837c84fd8ed34499410629f3840bdb3b365896aacedd75971298423f052e020d93ddfb9f702386d582c693334be9fa349dbcb

data/lib/splaytree/node.rb

@@ -0,0 +1,103 @@
+class Splaytree
+  class Node
+    include Comparable
+
+    attr_reader :key
+    attr_accessor :value, :left, :right, :parent, :duplicates
+
+    def initialize(key, value = nil, parent = nil, left = nil, right = nil)
+      @key = key
+      @value = value
+      @parent = parent
+      @left = left
+      @right = right
+      @duplicates = []
+    end
+
+    def add_duplicate!(value)
+      @duplicates.push(@value)
+      @value = value
+    end
+
+    def remove_duplicate!
+      return if @duplicates.empty?
+      deleted = @value
+      @value = @duplicates.pop
+      deleted
+    end
+
+    def has_duplicates?
+      @duplicates.length > 0
+    end
+
+    def root?
+      parent.nil?
+    end
+
+    def parent_root?
+      parent && parent.root?
+    end
+
+    def gparent
+      parent && parent.parent
+    end
+
+    def set_left(node)
+      @left = node
+      return unless node
+      node.parent = self
+    end
+
+    def set_right(node)
+      @right = node
+      return unless node
+      node.parent = self
+    end
+
+    def rotate
+      parent = self.parent
+      gparent = self.gparent
+      if gparent
+        if parent.object_id == gparent.left.object_id
+          gparent.set_left(self)
+        else
+          gparent.set_right(self)
+        end
+      else
+        self.parent = nil
+      end
+
+      if self.object_id == parent.left.object_id
+        parent.set_left(self.right)
+        self.set_right(parent)
+      else
+        parent.set_right(self.left)
+        self.set_left(parent)
+      end
+    end
+
+    def zigzig?
+      (self.object_id == parent.left.object_id && parent.object_id == gparent.left.object_id) ||
+        (self.object_id == parent.right.object_id && parent.object_id == gparent.right.object_id)
+    end
+
+    def to_s
+      key.to_s
+    end
+
+    def to_h
+      { key => value }
+    end
+    alias_method :to_hash, :to_h
+
+    def to_a
+      [key, value]
+    end
+
+    def <=>(node)
+      return unless node
+      self.key <=> node.key
+    end
+
+  end
+end

data/lib/splaytree/version.rb

@@ -0,0 +1,3 @@
+class Splaytree
+  VERSION = "0.1.0"
+end

data/lib/splaytree.rb

@@ -0,0 +1,271 @@
+require 'splaytree/version'
+require 'splaytree/node'
+
+class Splaytree
+  include Enumerable
+
+  attr_reader :root
+
+  def initialize
+    @root = nil
+    @size = 0
+  end
+
+  def size
+    @size
+  end
+  alias_method :length, :size
+
+  def empty?
+    @root.nil?
+  end
+
+  def has_key?(key)
+    !!get(key)
+  end
+
+  def higher(key)
+    return if empty?
+    get(key)
+    return @root.to_h if @root.key > key
+    get_one_higher_of_root
+  end
+
+  def lower(key)
+    return if empty?
+    get(key)
+    return @root.to_h if @root.key < key
+    get_one_lower_of_root
+  end
+
+  def ceiling(key)
+    return if empty?
+    get(key)
+    return @root.to_h if @root.key >= key
+    get_one_higher_of_root
+  end
+
+  def floor(key)
+    return if empty?
+    get(key)
+    return @root.to_h if @root.key <= key
+    get_one_lower_of_root
+  end
+
+  def min
+    return if empty?
+    node = @root
+    while node.left
+      node = node.left
+    end
+    splay(node)
+    node.to_h
+  end
+
+  def max
+    return if empty?
+    node = @root
+    while node.right
+      node = node.right
+    end
+    splay(node)
+    node.to_h
+  end
+
+  def height
+    height_recursive(@root)
+  end
+
+  def get_with_duplicates(key)
+    return if empty?
+    get(key)
+    return if @root.key != key
+    @root.duplicates + [@root.value]
+  end
+
+  def get(key)
+    return if empty?
+    node = @root
+    value = nil
+    loop do
+      case key <=> node.key
+      when 0
+        value = node.value
+        break
+      when -1
+        break if node.left.nil?
+        node = node.left
+      when 1
+        break if node.right.nil?
+        node = node.right
+      else
+        fail
+      end
+    end
+    splay(node)
+    value
+  end
+  alias_method :[], :get
+
+  def insert(key, value)
+    node = Node.new(key, value)
+    if @root
+      current = @root
+      loop do
+        case key <=> current.key
+        when 0
+          node = current
+          node.add_duplicate!(value)
+          break
+        when -1
+          if !current.left
+            current.set_left(node)
+            break
+          end
+          current = current.left
+        when 1
+          if !current.right
+            current.set_right(node)
+            break
+          end
+          current = current.right
+        else
+          fail
+        end
+      end
+    end
+    splay(node)
+    @size += 1
+    return true
+  end
+  alias_method :[]=, :insert
+
+  def update(key, value)
+    return false if empty?
+    get(key)
+    return false if @root.key != key
+    @root.value = value
+    return true
+  end
+
+  def remove(key)
+    return if empty?
+    get(key)
+    return if @root.key != key
+    if @root.has_duplicates?
+      deleted = @root.remove_duplicate!
+    else
+      deleted = @root.value
+      if @root.left.nil?
+        @root = @root.right
+        @root.parent = nil
+      else
+        right = @root.right
+        @root = @root.left
+        @root.parent = nil
+        get(key)
+        @root.set_right(right)
+      end
+    end
+    @size -= 1
+    deleted
+  end
+
+  def clear
+    @root = nil
+    @size = 0
+  end
+
+  def each
+    return if self.empty?
+    stack = []
+    node = @root
+    loop do
+      if node
+        stack.push(node)
+        node.duplicates.each do |value|
+          stack.push(Node.new(node.key, value, node))
+        end
+        node = node.left
+      else
+        break if stack.empty?
+        node = stack.pop
+        yield(node)
+        node = node.right
+      end
+    end
+  end
+
+  def each_key(&block)
+    each { |node| yield node.key }
+  end
+
+  def each_value(&block)
+    each { |node| yield node.value }
+  end
+
+  def keys
+    to_enum(:each_key).to_a
+  end
+
+  def values
+    to_enum(:each_value).to_a
+  end
+
+  def report
+    return if empty?
+    result = []
+    each_with_index do |node, index|
+      result << { node: node.key, parent: node.parent&.key, left: node.left&.key, right: node.right&.key }
+    end
+    result
+  end
+
+  private
+
+    def get_one_higher_of_root
+      return if @root.right.nil?
+      node = @root.right
+      while node.left do
+        if node.left
+          node = node.left
+        end
+      end
+      splay(node)
+      node.to_h
+    end
+
+    def get_one_lower_of_root
+      return if @root.left.nil?
+      node = @root.left
+      while node.right do
+        node = node.right
+      end
+      splay(node)
+      node.to_h
+    end
+
+    def height_recursive(node)
+      return 0 unless node
+
+      left_height   = 1 + height_recursive(node.left)
+      right_height  = 1 + height_recursive(node.right)
+      left_height > right_height ? left_height : right_height
+    end
+
+    def splay(node)
+      while !node.root? do
+        parent = node.parent
+        if parent.root?
+          node.rotate
+        elsif node.zigzig?
+          parent.rotate
+          node.rotate
+        else
+          node.rotate
+          node.rotate
+        end
+      end
+      @root = node
+    end
+end

metadata

@@ -0,0 +1,119 @@
+--- !ruby/object:Gem::Specification
+name: splaytree
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Artur Babagulyyev
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2017-05-22 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.14'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.14'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: minitest
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '5.0'
+- !ruby/object:Gem::Dependency
+  name: pry
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.10'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.10'
+- !ruby/object:Gem::Dependency
+  name: minitest-reporters
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.1'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.1'
+description: A splay tree is a self-adjusting binary search tree with the additional
+  property that recently accessed elements are quick to access again. It performs
+  basic operations such as insertion, look-up and removal in O(log n) amortized time.
+email:
+- artur.babagulyyev@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/splaytree.rb
+- lib/splaytree/node.rb
+- lib/splaytree/version.rb
+homepage: https://github.com/SnowDiamond/splaytree
+licenses:
+- MIT
+metadata: {}
+post_install_message: 
+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.6.8
+signing_key: 
+specification_version: 4
+summary: Splay Tree Data Structure
+test_files: []