adt_utilit 0.0.0 → 0.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: b6af6922d287bcf52954bdaf9ba808109883652e
-  data.tar.gz: 3ced982a4a11dc086b532390cb855dd32abde1d6
+  metadata.gz: 5e8ee1f39f314d0f7ca04f595bd4b474d361aa2f
+  data.tar.gz: 9e26d7ba45ad54ddb0bff7b5f4860e146957a415
 SHA512:
-  metadata.gz: 4c8380a9e31dbf75bdf91f8444e36c650bcfa9fd1f55c7a17047ed9d0197d986399b2174140462341a05cfe3a99da5fd92c8477d5f3ede8845910b622173d70a
-  data.tar.gz: 36d70d84e451c2e4f022523d1c6371f92a3b6cbb08289ef56ee3f625c77b2790acf1ffc9d9fafe46b6b054f6edca87a9fcf5a0889f786d1b6e92cbbd786f8f46
+  metadata.gz: e13664fee3e3cfcf5b2587d966accf1f2c7ab520d921109a161fae1f57098a2c57b1389c6a35994866713f10955890497afab20353b547f15030dcadc7a47a3f
+  data.tar.gz: cf2dfcd78512d7de2110ab393c3acb621a5d97b97deb12baa38d27c57af897c8e26bf3da5e9a8ad1f8290369855ef25ca8e86ea635e9641784ef74d39f798880

data/lib/adt_utilit/linked_list.rb

@@ -1,14 +1,13 @@
 require_relative 'linked_list_node.rb'
-require "byebug"
 class LinkedList
   include Enumerable
   attr_reader :length, :head, :tail
 
-  def initialize(value)
-    if value.is_a?(Array)
+  def initialize(value = nil)
+    if value.nil?
+      nodes = []
+    elsif value.is_a?(Array)
       nodes = initialize_with_array(value)
-    elsif value.is_a?(Hash)
-      nodes = initialize_with_hash(value)
     else
       nodes = [LinkedListNode.new(value)]
     end
@@ -52,8 +51,14 @@ class LinkedList
     else
       node = LinkedListNode.new(value)
     end
-    @tail.connect(node)
-    @tail = node
+
+    if @length == 0
+      @head = @tail = node
+    else
+      @tail.connect(node)
+      @tail = node
+    end
+
     @length +=1
     self
   end
@@ -64,8 +69,14 @@ class LinkedList
     else
       node = LinkedListNode.new(value)
     end
-    node.connect(@head)
-    @head = node
+
+    if @length == 0
+      @head = @tail = node
+    else
+      node.connect(@head)
+      @head = node
+    end
+
     @length +=1
     self
   end
@@ -84,7 +95,7 @@ class LinkedList
     shifted_node
   end
 
-  def find(value)
+  def find_node(value)
     self.each do |node|
       return node if node.value == value
     end
@@ -148,14 +159,4 @@ class LinkedList
     nodes
   end
 
-  def initialize_with_hash(hash)
-    nodes = []
-    hash.map do |key, value|
-      node = LinkedListNode.new({key => value})
-      nodes[-1].connect(node) unless nodes[-1].nil?
-      nodes << node
-    end
-    nodes
-  end
-
 end

data/lib/adt_utilit/queue.rb

@@ -0,0 +1,37 @@
+class Queue
+  include Enumerable
+  def initialize(value = nil)
+    if value.nil?
+      @queue = []
+    elsif value.is_a?(Array)
+      @queue = value
+    else
+      @queue = [value]
+    end
+  end
+
+  def each(&prc)
+    @queue.each(&prc)
+  end
+
+  def length
+    @queue.length
+  end
+
+  def enqueue(value)
+    @queue.push(value)
+  end
+
+  def dequeue
+    @queue.shift
+  end
+
+  def peek
+    @queue.first
+  end
+
+  def last
+    @queue.last
+  end
+
+end

data/lib/adt_utilit/stack.rb

@@ -0,0 +1,105 @@
+class Stack
+  include Enumerable
+  def initialize(value = nil)
+    @stack = []
+    if value.nil?
+      return
+    elsif value.is_a?(Array)
+      value.each do |el|
+        push(el)
+      end
+    else
+      push(value)
+    end
+  end
+
+  def self.new_with_metadata(metadata_name, &prc)
+    stack = self.new
+    stack.instance_variable_set(:@metadata, {max: "#{metadata_name}_max", min: "#{metadata_name}_min", proc: prc})
+
+    define_method("#{metadata_name}_max"){
+      raise "such metadata has not been set for this instance" if @metadata.nil?
+      return nil if @stack.empty?
+      @stack.last[@metadata[:max]]
+    }
+    define_method("#{metadata_name}_min"){
+      raise "such metadata has not been set for this instance" if @metadata.nil?
+      return nil if @stack.empty?
+      @stack.last[@metadata[:min]]
+    }
+    stack
+  end
+
+  def peek
+    return nil if @stack.empty?
+    @stack.last[:value]
+  end
+
+  def min
+    return nil if @stack.empty?
+    @stack.last[:min]
+  end
+
+  def max
+    return nil if @stack.empty?
+    @stack.last[:max]
+  end
+
+  def length
+    @stack.length
+  end
+
+  def empty?
+    @stack.length == 0
+  end
+
+  def push(value)
+    stack_el = {value: value}
+    if @stack.empty?
+      stack_el[:max] = stack_el[:min] = stack_el[:value]
+      unless @metadata.nil?
+        stack_el[@metadata[:max]] = stack_el[@metadata[:min]] = stack_el[:value]
+      end
+    else
+      stack_el[:max] = stack_el[:value] >= max ? stack_el[:value] : max
+      stack_el[:min] = stack_el[:value] <= min ? stack_el[:value] : min
+      if @metadata
+        proc = @metadata[:proc]
+
+        if proc.call(stack_el[:value]) >= proc.call(self.send("#{@metadata[:max]}"))
+          stack_el[@metadata[:max]] = stack_el[:value]
+        else
+          stack_el[@metadata[:max]] = self.send("#{@metadata[:max]}")
+        end
+
+        if proc.call(stack_el[:value]) <= proc.call(self.send("#{@metadata[:min]}"))
+          stack_el[@metadata[:min]] = stack_el[:value]
+        else
+          stack_el[@metadata[:min]] = self.send("#{@metadata[:min]}")
+        end
+      end
+    end
+    @stack << stack_el
+    self
+  end
+
+  def pop
+    return nil if @stack.empty?
+    top_el = @stack.pop
+    top_el[:value]
+  end
+
+  def each(&prc)
+    @stack.each do |el|
+      prc.call(el[:value])
+    end
+  end
+
+  def each_from_top(&prc)
+    (@stack.length - 1).downto(0) do |i|
+      prc.call(@stack[i][:value])
+    end
+    self
+  end
+
+end

data/lib/adt_utilit/stack_queue.rb

@@ -0,0 +1,121 @@
+require_relative "queue"
+require_relative "stack"
+class StackQueue
+  include Enumerable
+  def initialize(value = nil)
+    @stack_a = Stack.new
+    @stack_b = Stack.new
+    if !value.nil?
+      if value.is_a?(Array)
+        value.each { |el| @stack_a.push(el) }
+      else
+        @stack_a.push(value)
+      end
+    end
+  end
+
+  def peek
+    slinky if @stack_b.empty?
+    @stack_b.peek
+  end
+
+  def last
+    if @stack_a.empty?
+      @stack_b_bottom
+    else
+      @stack_a.peek
+    end
+  end
+
+  def enqueue(value)
+    @stack_a.push(value)
+  end
+
+  def dequeue
+    return nil if self.empty?
+    slinky if @stack_b.empty?
+    @stack_b.pop
+  end
+
+  def min
+    return nil if self.empty?
+    return @stack_a.min if @stack_b.min.nil?
+    return @stack_b.min if @stack_a.min.nil?
+    [@stack_a.min, @stack_b.min].min
+  end
+
+  def max
+    return nil if self.empty?
+    return @stack_a.max if @stack_b.max.nil?
+    return @stack_b.max if @stack_a.max.nil?
+    [@stack_a.max, @stack_b.max].max
+  end
+
+  def length
+    @stack_a.length + @stack_b.length
+  end
+
+  def empty?
+    @stack_a.empty? && @stack_b.empty?
+  end
+
+  def self.new_with_metadata(metadata_name, &prc)
+    stack_queue = self.new
+    stack_queue.instance_variable_set(:@metadata, {
+      max: "#{metadata_name}_max",
+      min: "#{metadata_name}_min",
+      proc: prc
+    })
+    stack_queue.instance_variable_set(:@stack_a, Stack.new_with_metadata(metadata_name, &prc))
+    stack_queue.instance_variable_set(:@stack_b, Stack.new_with_metadata(metadata_name, &prc))
+
+    define_method("#{metadata_name}_max") {
+      raise "such metadata has not been set for this instance" if @metadata.nil?
+      return nil if self.empty?
+      prc = @metadata[:proc]
+      stack_a_max = @stack_a.send(@metadata[:max])
+      stack_b_max = @stack_b.send(@metadata[:max])
+
+      return stack_b_max if stack_a_max.nil?
+      return stack_a_max if stack_b_max.nil?
+      if prc.call(stack_a_max) < prc.call(stack_b_max)
+        return stack_b_max
+      else
+        return stack_a_max
+      end
+    }
+
+    define_method("#{metadata_name}_min"){
+      raise "such metadata has not been set for this instance" if @metadata.nil?
+      return nil if self.empty?
+      prc = @metadata[:proc]
+      stack_a_min = @stack_a.send(@metadata[:min])
+      stack_b_min = @stack_b.send(@metadata[:min])
+
+      return stack_b_min if stack_a_min.nil?
+      return stack_a_min if stack_b_min.nil?
+      if prc.call(stack_a_min) < prc.call(stack_b_min)
+        return stack_b_min
+      else
+        return stack_a_min
+      end
+    }
+
+    return stack_queue
+  end
+
+  def each(&prc)
+    @stack_b.each_from_top(&prc)
+    @stack_a.each(&prc)
+    self
+  end
+
+  private
+  def slinky
+    if @stack_b.empty?
+      @stack_b_bottom = @stack_a.peek
+      @stack_b.push(@stack_a.pop) until @stack_a.empty?
+    end
+  end
+
+end

data/lib/adt_utilit.rb

@@ -1,4 +1,5 @@
 require 'adt_utilit/linked_list'
+require 'adt_utilit/stack_queue'
 
 class AdtUtilit
 

metadata

@@ -1,16 +1,18 @@
 --- !ruby/object:Gem::Specification
 name: adt_utilit
 version: !ruby/object:Gem::Version
-  version: 0.0.0
+  version: 0.0.1
 platform: ruby
 authors:
 - Hirosvk
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2016-07-19 00:00:00.000000000 Z
+date: 2016-07-25 00:00:00.000000000 Z
 dependencies: []
-description: still in development
+description: "<in development> AdtUtilit is a Ruby gem that provides a set of useful
+  data type classes such as Linked List, Queue, Stack, StackQueue, and Polytree. Many
+  intuitive methods are available for each class. See documentations for the details."
 email: kajino.hiroyuki@gmail.com
 executables: []
 extensions: []
@@ -19,6 +21,9 @@ files:
 - lib/adt_utilit.rb
 - lib/adt_utilit/linked_list.rb
 - lib/adt_utilit/linked_list_node.rb
+- lib/adt_utilit/queue.rb
+- lib/adt_utilit/stack.rb
+- lib/adt_utilit/stack_queue.rb
 homepage: http://rubygems.org/gems/adt_utilit
 licenses:
 - MIT