ruby_collections 0.0.5 → 0.0.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 7398054d1b760aabc43207861265e55fe82b4f92
-  data.tar.gz: 691f42570967b022e3f558f8e4713c0b036810c6
+  metadata.gz: c0462986d07093cf4ecca10470680ebbafcda8d9
+  data.tar.gz: f722323cd43f7b4d5f4abb4301dfd2fb9ae57fd5
 SHA512:
-  metadata.gz: 6d23fc58a7e892a2b551745cc9a11c1a0071548a022aeb10b66b9691d9b7615a7cb7f240bc56c0f1c0ac9a4332b05b3d85fcade2acf75b331dc53ab249b5b65d
-  data.tar.gz: 2c8bb1e27007067a9e83ae8950900d9a431261c81b612cfa709cbf80d28e3194196afacf4724aa0c9293ac50c82dc96a4a34985905efdfcba93ebbeee7711fc2
+  metadata.gz: 5a78827b01c0fd4fc5fd2908d5f668d35f341236dce3fbd5018ce652c332fe5da1976fa47d4c730e81fadd50109b1a787a8f1f87a6e9e04acd4bc9d2a83d300a
+  data.tar.gz: 96b622b4028421d8624f3536e9a2d36d6540f6b0de02a5f8b7ee387d7330e895508dcb5d2ded53ff82b058b6c41ebf430651ff2c670870e1bfc30667476d945a

data/README.md

@@ -20,7 +20,7 @@ Or install it yourself as:
 
 ## Usage
 
-Supported Data Structures: Max Heap, Min Heap, Stack, LinkedList
+Supported Data Structures: Max Heap, Min Heap, Stack, LinkedList, Deque
 
 ### RubyCollections::MaxHeap
 
@@ -72,7 +72,7 @@ list.size # => 0
 
 list.header # => ""
 
-list.isEmpty? # => true
+list.empty? # => true
 
 list.add(1) # => 1 (number of elements in list)
 
@@ -98,6 +98,64 @@ list.get(1).getNext # => 12
 
 ```
 
+### RubyCollections::Deque
+
+```ruby
+
+list = RubyCollections::Deque.new
+
+list.size # => 0
+
+list.head # => nil
+
+list.empty? # => true
+
+list.add(2) # => 1 (number of elements in list), list: [2]
+
+list.add(1) # => 2 (number of elements in list), list: [1,2]
+
+list.to_s # => "[1, 2]"
+
+# add 3 at index 1
+
+list.add(3,1) # => 3 (number of elements in list), list: [1, 3, 2]
+
+# add 5 at first postion
+
+list.add_first(5) # list: [5, 1, 3, 2]
+
+# see tail element
+
+list.tail # => 2
+
+#add 6 at last position
+
+list.add_last(6) # list: [5, 1, 3, 2, 6]
+
+list.size # => 5
+
+# get element at index 2
+
+list.get(2) # => 3
+
+# set element at index 1 to 10
+
+list.set(1, 10) # list; [5, 10, 3, 2, 6]
+
+# remove element at index 2
+
+list.remove(2) # list: [5, 10, 2, 6]
+
+# remove first element
+
+list.remove_first # list: [10, 2, 6]
+
+# remove last element
+
+list.remove_last # list: [10, 2]
+
+```
+
 ## Development
 
 After checking out the repo, run `bin/setup` to install dependencies. Then, run `bin/console` for an interactive prompt that will allow you to experiment.

data/lib/ruby_collections/collections.rb

@@ -1,4 +1,5 @@
 require "ruby_collections/max_heap"
 require "ruby_collections/min_heap"
 require "ruby_collections/stack"
-require "ruby_collections/linked_list"
+require "ruby_collections/linked_list"
+require "ruby_collections/deque"

data/lib/ruby_collections/deque.rb

@@ -0,0 +1,131 @@
+require 'securerandom'
+module RubyCollections
+  class Deque
+
+    def initialize
+      @hash = {size: 0, front: {data: nil, next: :rear, prev: nil}, 
+              rear: {data: nil, next: nil, prev: :front}}
+    end
+
+    def empty?
+      size.zero?
+    end
+
+    def size
+      hash[:size]
+    end
+
+    def head
+      hash[front[:next]][:data]
+    end
+
+    def tail
+      hash[rear[:prev]][:data]
+    end
+
+    def add(data, index = 0)
+      return nil if index > size
+      if index == 0 then add_first(data) and return end
+      setNext(getNode(index-1), data) if index > 0 and index < size
+      hash[:size] += 1 
+    end
+
+    def add_first(data)
+      setNext(:front, data)
+      hash[:size] += 1
+    end
+
+    def add_last(data)
+      setPrev(:rear, data)
+      hash[:size] += 1
+    end
+
+    def get(index)
+      return nil if index >= size
+      hash[getNode(index)][:data]
+    end
+
+    def set(index, data)
+      return nil if index >= size
+      hash[getNode(index)][:data] = data
+    end
+
+    def remove(index)
+      return nil if index >= size or index < 0
+      node_id = getNode(index)
+      hash[getNext(node_id)][:prev] = getPrev(node_id)
+      hash[getPrev(node_id)][:next] = getNext(node_id)
+      hash.delete(node_id)
+      hash[:size] -= 1
+    end
+
+    def remove_first
+      return nil if empty?
+      remove(0)
+    end
+
+    def remove_last
+      return nil if empty?
+      node_id = getPrev(:rear)
+      prev_id = getPrev(node_id)
+      hash[prev_id][:next] = :rear
+      rear[:prev] = prev_id
+      hash.delete(node_id)
+      hash[:size] -= 1
+    end
+
+    def to_s
+      return "" if empty?
+      data = []
+      node_id = :front
+      size.times do
+        node_id = getNext(node_id)
+        data << hash[node_id][:data]
+      end
+      return data.to_s
+    end
+
+    private
+
+    def hash
+      @hash
+    end
+
+    def front
+      hash[:front]
+    end
+
+    def rear
+      hash[:rear]
+    end
+
+    def setNext(node_id, data)
+      uuid = SecureRandom.uuid
+      hash[uuid] = {data: data, next: getNext(node_id), prev: node_id}
+      hash[getNext(node_id)][:prev] = uuid
+      hash[node_id][:next] = uuid
+    end
+
+    def setPrev(node_id, data)
+      uuid = SecureRandom.uuid
+      hash[uuid] = {data: data, next: node_id, prev: getPrev(node_id)}
+      hash[getPrev(node_id)][:next] = uuid
+      hash[node_id][:prev] = uuid
+    end
+
+    def getNext(node_id)
+      hash[node_id][:next]
+    end
+
+    def getPrev(node_id)
+      hash[node_id][:prev]
+    end
+
+    def getNode(index)
+      node = front[:next]
+      index.times {node = getNext(node)}
+      return node
+    end
+
+  end
+end

data/lib/ruby_collections/version.rb

@@ -1,3 +1,3 @@
 module RubyCollections
-  VERSION = "0.0.5"
+  VERSION = "0.0.6"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: ruby_collections
 version: !ruby/object:Gem::Version
-  version: 0.0.5
+  version: 0.0.6
 platform: ruby
 authors:
 - Vikash Vikram
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-04-08 00:00:00.000000000 Z
+date: 2015-04-10 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -58,6 +58,7 @@ files:
 - bin/setup
 - lib/ruby_collections.rb
 - lib/ruby_collections/collections.rb
+- lib/ruby_collections/deque.rb
 - lib/ruby_collections/linked_list.rb
 - lib/ruby_collections/max_heap.rb
 - lib/ruby_collections/min_heap.rb