data-struct 0.0.6

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 5061a74197d99c6e371bcef1d8b0f2c7d14c8075
+  data.tar.gz: 8b63a07ed7dcd06a2a390b1ffe7d8800ca4a2c8a
+SHA512:
+  metadata.gz: 7494f81c1eead45e555f4213174c5618b1d1d8449d46685557cd4d4c34a92057dd79e1d07417a0920324cf9f3eb848da7028755b8ca07ae1f86a8e957440fc70
+  data.tar.gz: e8fd26c9a28b9705aa9319a6e5683073abfc7e33135904825dba7c654b475e1c21431525b9618632629f18aefeabe4e3c483d9ac0ee059b924ed8d496ab01f48

data/lib/data-struct.rb

@@ -0,0 +1,13 @@
+
+require_relative "doubly_linked_list"                            
+require_relative "dynamic_array"
+require_relative "max_stack"
+require_relative "min_max_stack"
+require_relative "min_max_queue"
+require_relative "singly_linked_list"
+require_relative "stack_queue"
+
+module DataStruct
+  class DynamicArray < DynamicArray
+  end
+end

data/lib/doubly_linked_list.rb

@@ -0,0 +1,61 @@
+#doubly linked list
+class LinkedList
+  attr_reader :begin_sentinel, :last_sentinel
+
+  def initialize
+    @begin_sentinel = Link.new(nil)
+    @last_sentinel = Link.new(nil)
+  end
+
+  def pop
+    last_link = @last_sentinel.prev
+    val = last_link.val
+    @last_sentinel.prev = last_link.prev
+
+    val
+  end
+
+  def push(val)
+    link = Link.new(val)
+    last_link = @last_sentinel.prev
+    unless last_link.nil?
+      last_link.next, link.prev = link, @last_sentinel.prev
+    else
+      @begin_sentinel.next = link
+    end
+      @last_sentinel.prev = link
+
+    self
+  end
+
+  def unshift(val)
+    link = Link.new(val)
+    first_link = @begin_sentinel.next
+    unless first_link.nil?
+      first_link.prev, link.next = link, first_link
+    else
+      @last_sentinel.prev = link
+    end
+    @begin_sentinel.next = link
+
+    self
+  end
+
+  def shift
+    first_link = @begin_sentinel.next
+    return nil if first_link.nil?
+    @begin_sentinel.next = first_link.next
+
+    first_link.val
+  end
+end
+
+class Link
+  attr_accessor :next, :prev, :val
+
+  def initialize(val)
+    @val = val
+    @next = nil
+    @prev = nil
+  end
+end

data/lib/dynamic_array.rb

@@ -0,0 +1,118 @@
+class DynamicArray
+  # dynamic array with ring buffer
+  attr_accessor :store, :size, :start
+  attr_reader :num_items
+
+  def initialize(size)
+    @num_items = 0
+    @size = size
+    @start = 0
+    @store = Array.new(size)
+  end
+
+  def empty?
+    # will refactor to check num_items because I'm not testing that variable right now
+    return @store.empty?
+  end
+
+  def insert(val, idx)
+    # O(n) because you need to copy
+    idx += @start
+    validate_idx(idx)
+    resize! if @num_items == @size
+
+    queue = [val]
+    count = 0 # in case @store is full, then @store[idx] will never be nil, 
+              # break you move all the way around
+
+    until queue.empty? || count > @num_items
+      count += 1
+      queue.push(@store[idx]) unless @store[idx].nil?
+      @store[idx] = queue.shift
+      idx += 1
+    end
+    @num_items += 1
+
+    @store
+  end
+
+  def pop
+    # O(1)
+    @num_items -= 1
+    idx = @start + @num_items
+    val, @store[idx] = @store[idx], nil
+
+    val
+  end
+
+  def push(val)
+    # O(1) ammortized; not called on every push
+    resize! if @num_items == @size
+    idx = (@start + @num_items) % @size
+    @num_items += 1
+    @store[idx] = val
+
+    @store
+  end
+
+  # def remove(idx)
+  #   p "here"
+  #   # O(n) because you need to copy
+  #   idx += @start
+  #   validate_idx(idx)
+
+  #   queue = [@store[idx + 1]]
+
+  #   until queue.empty?
+  #     @store[idx] = queue.shift
+  #     idx += 1
+  #     queue.push(@store[idx]) unless @store[idx].nil?
+  #   end
+
+  #   @store
+  # end
+
+  def shift
+    # O(1)
+    val, @store[@start] = @store[@start], nil
+    @num_items -= 1
+    @start += 1
+
+    val
+  end
+
+  def unshift(val)
+    # O(1) ammortized; not called on every unshift
+    resize! if @num_items == @size
+    @start -= 1
+    idx = (@start) % @size
+    @num_items += 1
+    @store[idx] = val
+
+    @store
+  end
+
+  private 
+
+  def resize!
+    # O(n) because it copies the whole array into new store
+    new_size = @size * 2
+    new_store = Array.new(new_size)
+    old_idx = @start
+    new_idx = 0
+
+    @size.times do
+      new_store[new_idx], @store[old_idx] = @store[old_idx], nil
+      new_idx = (new_idx + 1) % @num_items
+      old_idx = (old_idx + 1) % @num_items
+    end
+
+    @start = 0
+    @size = new_size
+    @store = new_store
+  end
+
+  def validate_idx(idx)
+    raise "invalid index, not in range" if idx < @start || idx > (@start + @num_items - 1)
+  end
+end

data/lib/max_stack.rb

@@ -0,0 +1,24 @@
+class MaxStack
+  attr_reader :store
+
+  def initialize
+    @store = []
+  end
+
+  def push(val)
+    if @store.empty?
+      @store << [val, val]
+    else
+      max_val = [val, self.max].max
+      @store << [val, max_val]
+    end
+  end
+
+  def pop
+    @store.pop[0]
+  end
+
+  def max
+    @store[-1][1]
+  end
+end

data/lib/min_max_stack.rb

@@ -0,0 +1,33 @@
+class MinMaxStack
+  attr_reader :store
+
+  def initialize
+    @store = []
+  end
+
+  def length
+    @store.length
+  end
+
+  def max
+    @store.empty? ? nil : @store[-1][2]
+  end
+
+  def min
+    @store.empty? ? nil : @store[-1][1]
+  end
+
+  def pop
+    val, _ = @store.pop
+
+    val
+  end
+
+  def push(val)
+    if @store.empty?
+      @store << [val, val, val]
+    else
+      @store << [val, [self.min, val].min, [self.max, val].max]
+    end
+  end
+end

data/lib/singly_linked_list.rb

@@ -0,0 +1,63 @@
+# singly linked list
+class SingleLinkedList
+  attr_reader :sentinel
+
+  def initialize
+    @sentinel = SingleLink.new(nil)
+  end
+
+  def pop
+    prev, last = walkthrough
+    raise "cannot pop from empty list" if prev.nil?
+    prev.next = nil
+
+    last.val
+  end
+
+  def push(val)
+    link = SingleLink.new(val)
+    _, last_link = walkthrough
+    last_link.next = link
+
+    self
+  end
+
+  def shift
+    first_link = @sentinel.next
+    raise "cannot shift from empty list" if prev.nil?
+    val = first_link.val
+    @sentinel.next = first_link.next
+
+    val
+  end
+
+  def unshift(val)
+    link = SingleLink.new(val)
+    @sentinel.next, link.next = link, @sentinel.next
+    
+    self
+  end
+
+  private
+
+  def walkthrough
+    # walksthrough and returns array of second last and last link
+    current = @sentinel
+    until current.next.nil?
+      prev = current
+      current = current.next
+    end
+
+    [prev, current]
+  end
+end
+
+class SingleLink
+  attr_accessor :next, :val
+
+  def initialize(val)
+    @val = val
+    @next = nil
+  end
+end
+

data/lib/stack_queue.rb

@@ -0,0 +1,28 @@
+class StackQueue
+
+  attr_reader :in, :out
+  def initialize
+    @in, @out = [], []
+  end
+
+  # O(1) ammortized
+  def push(val)
+    @in << val
+  end
+
+  # WC: O(n)
+  def shift
+    if @out.empty?
+      flip!
+    end
+
+    @out.pop
+  end
+
+  # O(n)
+  def flip!
+    @in.length.times do
+      @out << @in.pop
+    end
+  end
+end

metadata

@@ -0,0 +1,53 @@
+--- !ruby/object:Gem::Specification
+name: data-struct
+version: !ruby/object:Gem::Version
+  version: 0.0.6
+platform: ruby
+authors:
+- Kevin Wang
+- Daniel Ng
+- Conan Tzou
+- Karen Ling
+autorequire: 
+bindir: bin
+cert_chain: []
+date: 2015-07-16 00:00:00.000000000 Z
+dependencies: []
+description: A simple gem that provides several useful implementations of data structures
+email: kevinwang2400@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- lib/data-struct.rb
+- lib/doubly_linked_list.rb
+- lib/dynamic_array.rb
+- lib/max_stack.rb
+- lib/min_max_stack.rb
+- lib/singly_linked_list.rb
+- lib/stack_queue.rb
+homepage: http://rubygems.org/gems/data-struct
+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.4.3
+signing_key: 
+specification_version: 4
+summary: Data structures, some up and running, not fully tested
+test_files: []