adt_utilit 0.0.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: b6af6922d287bcf52954bdaf9ba808109883652e
+  data.tar.gz: 3ced982a4a11dc086b532390cb855dd32abde1d6
+SHA512:
+  metadata.gz: 4c8380a9e31dbf75bdf91f8444e36c650bcfa9fd1f55c7a17047ed9d0197d986399b2174140462341a05cfe3a99da5fd92c8477d5f3ede8845910b622173d70a
+  data.tar.gz: 36d70d84e451c2e4f022523d1c6371f92a3b6cbb08289ef56ee3f625c77b2790acf1ffc9d9fafe46b6b054f6edca87a9fcf5a0889f786d1b6e92cbbd786f8f46

data/lib/adt_utilit/linked_list.rb

@@ -0,0 +1,161 @@
+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)
+      nodes = initialize_with_array(value)
+    elsif value.is_a?(Hash)
+      nodes = initialize_with_hash(value)
+    else
+      nodes = [LinkedListNode.new(value)]
+    end
+    @head = nodes[0]
+    @tail = nodes[-1]
+    @length = nodes.length
+  end
+
+  def each(&block)
+    i = 0
+    current_node = @head
+    while i < self.length
+      block.call(current_node)
+      current_node = current_node.next
+      i += 1
+    end
+  end
+
+  def [](idx)
+    if (idx >= 0)
+      current_node = @head
+      self.each_with_index do |node, llidx|
+        return node if idx == llidx
+        current_node = current_node.next
+      end
+    else
+      current_node = @tail
+      i = 0
+      while i < @length
+        return current_node if idx == -i - 1
+        current_node = current_node.prev
+        i += 1
+      end
+    end
+    nil
+  end
+
+  def push(value)
+    if value.is_a?(LinkedListNode)
+      node = value
+    else
+      node = LinkedListNode.new(value)
+    end
+    @tail.connect(node)
+    @tail = node
+    @length +=1
+    self
+  end
+
+  def unshift(value)
+    if value.is_a?(LinkedListNode)
+      node = value
+    else
+      node = LinkedListNode.new(value)
+    end
+    node.connect(@head)
+    @head = node
+    @length +=1
+    self
+  end
+
+  def pop
+    popped_node = @tail.remove
+    @length -= 1
+    @tail = @tail.prev
+    popped_node
+  end
+
+  def shift
+    shifted_node = @head.remove
+    @length -= 1
+    @head = @head.next
+    shifted_node
+  end
+
+  def find(value)
+    self.each do |node|
+      return node if node.value == value
+    end
+    nil
+  end
+
+  def find_all(value)
+    self.select{|node| node.value == value}
+  end
+
+  def insert(value, idx)
+    if value.is_a?(LinkedListNode)
+      node = value
+    else
+      node = LinkedListNode.new(value)
+    end
+
+    node.connect(self[idx])
+    self[idx-1].connect(node) if idx > 0
+    @head = node if idx == 0 || idx == -@length
+    @tail = node if idx == -1 || idx == @length - 1
+    @length += 1
+  end
+
+  def remove_at(idx)
+    removing_node = self[idx]
+    return nil if removing_node.nil?
+
+    removing_node.remove
+    @tail = removing_node.prev if idx == -1 || idx == @length-1
+    @head = removing_node.next if idx == 0 || idx == -@length
+    @length -= 1
+    idx
+  end
+
+  def remove_all(value)
+    found = false
+    current_node = @head
+    while current_node
+      if current_node.value == value
+        current_node.remove
+        @length -= 1
+        @head = current_node.next if current_node == @head
+        @tail = current_node.prev if current_node == @tail
+        found = true
+      end
+      current_node = current_node.next
+    end
+    found
+  end
+
+
+  private
+  def initialize_with_array(array)
+    nodes = []
+    array.map.with_index do |el, idx|
+      node = LinkedListNode.new(el)
+      nodes[-1].connect(node) unless nodes[-1].nil?
+      nodes << node
+    end
+    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/linked_list_node.rb

@@ -0,0 +1,24 @@
+class LinkedListNode
+  attr_accessor :value, :next, :prev
+
+  def initialize(value)
+    @value = value
+    @next = nil
+    @prev = nil
+  end
+
+  def connect(node)
+    self.next = node
+    node.prev = self unless node.nil?
+  end
+
+  def remove
+    if @prev.nil?
+      @next.prev = nil
+    else
+      @prev.connect(@next)
+    end
+    self
+  end
+
+end

data/lib/adt_utilit.rb

@@ -0,0 +1,5 @@
+require 'adt_utilit/linked_list'
+
+class AdtUtilit
+
+end

metadata

@@ -0,0 +1,46 @@
+--- !ruby/object:Gem::Specification
+name: adt_utilit
+version: !ruby/object:Gem::Version
+  version: 0.0.0
+platform: ruby
+authors:
+- Hirosvk
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2016-07-19 00:00:00.000000000 Z
+dependencies: []
+description: still in development
+email: kajino.hiroyuki@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/adt_utilit.rb
+- lib/adt_utilit/linked_list.rb
+- lib/adt_utilit/linked_list_node.rb
+homepage: http://rubygems.org/gems/adt_utilit
+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.5.1
+signing_key: 
+specification_version: 4
+summary: ADT Utilities
+test_files: []