zadt 0.1.0 → 0.1.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: db43fb9319e2b6c73ea120c94757c39d06988d8d
-  data.tar.gz: f470b3aa44f5e0a9b7e057fbefdc69a9103e641c
+  metadata.gz: cbc3136e504bb61d48ef017ca9fc1ccf398d2fdb
+  data.tar.gz: be82f8e8688f3074e381a293fa1aea983587c994
 SHA512:
-  metadata.gz: ccf89f6657fd21b44cda7372d8eef144b25574a61dc0ab7ae68b48672b03f88ff99f79f5088940dd534fd503b547d4d133503ed62bcc4199d963e951fa84c16e
-  data.tar.gz: e45995f6e8a8f38170c87068d5df3b3fcb021bf52d71b70f9248fdccc138a0b357707be952b578ba73dbedcfb4ea20b814ce948eec8dc661b122998fb9bdf819
+  metadata.gz: 878cc14d73b9ac881fcc787d214c6541afc91990aa551df86692c1bd2dd2178a1288ab22806a6ca66768a3241b648b343e2104d07c397eb528a74ff5a67370dc
+  data.tar.gz: cf9047e02fa9921b30e7925c00a7700b30d4ce812c15e3d696f792f22309818b1864f63ff55f74fd933ec99a5e9f1d527770dd05b5101745a33543d7315badaa

data/lib/ADT_requireables.rb

@@ -0,0 +1,6 @@
+require_relative 'zadt/AbstractDataTypes/ADT.rb'
+require_relative 'zadt/AbstractDataTypes/Stack.rb'
+require_relative 'zadt/AbstractDataTypes/Queue.rb'
+require_relative 'zadt/AbstractDataTypes/StackQueue.rb'
+require_relative 'zadt/AbstractDataTypes/MinMaxStack.rb'
+require_relative 'zadt/AbstractDataTypes/MinMaxStackQueue.rb'

data/lib/zadt/AbstractDataTypes/ADT.rb

@@ -0,0 +1,15 @@
+module Zadt
+  class ADT
+    def self.help
+      puts "Thank you for using Zagorski Advanced Data Types!"
+      puts "This package contains the following Array-like Data Types:"
+      puts "-Stack, a LIFO array with functions push and pop"
+      puts "-Queue, a FIFO array with functions enqueue and dequeue"
+      puts "-StackQueue, a Queue that is Stack-based (no real difference)"
+      puts "-MinMaxStack, a Stack that can return Min and Max in constant time"
+      puts "-MinMaxStackQueue, a Queue that can return Min and Max in constant time"
+      puts ""
+      puts "Each data type also has a help function.  Type Zadt::Stack::help for a list of Stack functions, and so on."
+    end
+  end
+end

data/lib/zadt/AbstractDataTypes/MinMaxStack.rb

@@ -0,0 +1,74 @@
+# A MinMaxStack is a stack that allows for Min and Max
+# to be found in constant time, unlike a stack or
+# array that generally takes linear time.
+module Zadt
+  class MinMaxStack
+    def initialize
+      @values = []
+    end
+
+    def self.help
+      puts "Here are the functions for MinMaxStack:"
+      puts "push(value)"
+      puts "pop"
+      puts "peek"
+      puts "min"
+      puts "max"
+      puts "length"
+      puts "show"
+      puts "empty?"
+    end
+
+    def self.methods
+      self.help
+    end
+
+    def help
+      MinMaxStack.help
+    end
+
+    def methods
+      help
+    end
+
+    def push(val)
+      if @values.empty?
+        @values.push([val, val, val])
+      else
+        cur_min = @values.last[1]
+        cur_max = @values.last[2]
+        @values.push([val, [val, cur_min].min, [val, cur_max].max])
+        @values
+      end
+    end
+
+    def pop
+      @values.pop[0]
+    end
+
+    def peek
+      @values.last[0]
+    end
+
+    def min
+      @values.empty? ? "Empty" : @values.last[1]
+    end
+
+    def max
+      @values.empty? ? "Empty" : @values.last[2]
+    end
+
+    def length
+      @values.length
+    end
+
+    def show
+      showthis = []
+      @values.map{|value| value[0]}
+    end
+
+    def empty?
+      @values.empty?
+    end
+  end
+end

data/lib/zadt/AbstractDataTypes/MinMaxStackQueue.rb

@@ -0,0 +1,81 @@
+# A MinMaxStackQueue is a queue that allows for Min and Max
+# to be found in constant time, unlike a queue or
+# array that generally takes linear time.  It does this
+# because it's based on a MinMaxStack, which has this
+# ability.
+module Zadt
+  class MinMaxStackQueue
+    def initialize
+      @in = MinMaxStack.new
+      @out = MinMaxStack.new
+    end
+
+    def self.help
+      puts "Here are the functions for MinMaxStackQueue:"
+      puts "show"
+      puts "enqueue(value)"
+      puts "dequeue"
+      puts "min"
+      puts "max"
+      puts "length"
+      puts "empty?"
+    end
+
+    def self.methods
+      self.help
+    end
+
+    def help
+      MinMaxStackQueue.help
+    end
+
+    def methods
+      help
+    end
+
+    def show
+      @out.show.reverse + @in.show
+    end
+
+    def enqueue(val)
+      @in.push(val)
+    end
+
+    def dequeue
+      if @out.empty?
+        @in.length.times do
+          @out.push(@in.pop)
+        end
+      end
+      @out.pop
+    end
+
+    def min
+      if @in.empty?
+        @out.min
+      elsif @out.empty?
+        @in.min
+      else
+        [@in.min, @out.min].min
+      end
+    end
+
+    def max
+      if @in.empty?
+        @out.max
+      elsif @out.empty?
+        @in.max
+      else
+        [@in.max, @out.max].max
+      end
+    end
+
+    def length
+      @in.length + @out.length
+    end
+
+    def empty?
+      @in.empty? && @out.empty?
+    end
+  end
+end

data/lib/zadt/AbstractDataTypes/Queue.rb

@@ -0,0 +1,49 @@
+module Zadt
+  class Queue
+    def initialize
+      @values = Array.new
+    end
+
+    def self.help
+      puts "Here are the functions for Queue:"
+      puts "show"
+      puts "enqueue(value)"
+      puts "dequeue"
+      puts "length"
+      puts "empty?"
+    end
+
+    def self.methods
+      self.help
+    end
+
+    def help
+      Queue.help
+    end
+
+    def methods
+      help
+    end
+
+    def show
+      @values
+    end
+
+    def enqueue(val)
+      @values.push(val)
+      @values
+    end
+
+    def dequeue
+      @values.shift
+    end
+
+    def length
+      @values.length
+    end
+
+    def empty?
+      @values.empty?
+    end
+  end
+end

data/lib/zadt/AbstractDataTypes/Stack.rb

@@ -0,0 +1,49 @@
+module Zadt
+  class Stack
+    def initialize
+      @values = Array.new
+    end
+
+    def self.help
+      puts "Here are the functions for Stack:"
+      puts "show"
+      puts "push(value)"
+      puts "pop"
+      puts "length"
+      puts "empty?"
+    end
+
+    def self.methods
+      self.help
+    end
+
+    def help
+      Stack.help
+    end
+
+    def methods
+      help
+    end
+
+    def show
+      @values
+    end
+
+    def push(val)
+      @values.push(val)
+      @values
+    end
+
+    def pop
+      @values.pop
+    end
+
+    def length
+      @values.length
+    end
+
+    def empty?
+      @values.empty?
+    end
+  end
+end

data/lib/zadt/AbstractDataTypes/StackQueue.rb

@@ -0,0 +1,58 @@
+# A StackQueue works just like a queue, but it's based on
+# a Stack.  Functionality-wise, it's exactly the same
+# as a queue.  I mainly made it as an exercise leading
+# up to MinMaxStackQueue.
+module Zadt
+  class StackQueue
+    def initialize
+      @in = Stack.new
+      @out = Stack.new
+    end
+
+    def self.help
+      puts "Here are the functions for StackQueue:"
+      puts "show"
+      puts "enqueue(value)"
+      puts "dequeue"
+      puts "length"
+      puts "empty?"
+    end
+
+    def self.methods
+      self.help
+    end
+
+    def help
+      StackQueue.help
+    end
+
+    def methods
+      help
+    end
+
+    def show
+      @out.show.reverse + @in.show
+    end
+
+    def enqueue(val)
+      @in.push(val)
+    end
+
+    def dequeue
+      if @out.empty?
+        @in.length.times do
+          @out.push(@in.pop)
+        end
+      end
+      @out.pop
+    end
+
+    def length
+      @in.length + @out.length
+    end
+
+    def empty?
+      @values.empty?
+    end
+  end
+end

data/lib/zadt/version.rb

@@ -1,3 +1,3 @@
 module Zadt
-  VERSION = "0.1.0"
+  VERSION = "0.1.1"
 end

data/lib/zadt.rb

@@ -1,4 +1,5 @@
 require "zadt/version"
+require_relative "ADT_requireables.rb"
 
 module Zadt
   # Your code goes here...

data/zadt.gemspec

@@ -10,7 +10,7 @@ Gem::Specification.new do |spec|
   spec.email         = ["benj@zagorski.com"]
 
   spec.summary       = %q{Zagorski ADT is a collection of advanced data types that are not included in the standard Ruby library.}
-  spec.description   = %q{Includes the following Advanced Data Types: Stack, Queue, StackQueue, MinMaxStack, and MinMaxStackQueue.}
+  spec.description   = %q{Includes the following Advanced Data Types: Stack, Queue, StackQueue, MinMaxStack, and MinMaxStackQueue.  Once installed, type "Zadt::ADT::help" for a list of datatypes and basic functionality.}
   spec.homepage      = "https://github.com/MrMicrowaveOven/zadt.git"
   spec.license       = "MIT"
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: zadt
 version: !ruby/object:Gem::Version
-  version: 0.1.0
+  version: 0.1.1
 platform: ruby
 authors:
 - Benjamin Zagorski
@@ -53,13 +53,15 @@ dependencies:
       - !ruby/object:Gem::Version
         version: '3.0'
 description: 'Includes the following Advanced Data Types: Stack, Queue, StackQueue,
-  MinMaxStack, and MinMaxStackQueue.'
+  MinMaxStack, and MinMaxStackQueue.  Once installed, type "Zadt::ADT::help" for a
+  list of datatypes and basic functionality.'
 email:
 - benj@zagorski.com
 executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- ".DS_Store"
 - ".gitignore"
 - ".rspec"
 - ".travis.yml"
@@ -70,7 +72,14 @@ files:
 - Rakefile
 - bin/console
 - bin/setup
+- lib/ADT_requireables.rb
 - lib/zadt.rb
+- lib/zadt/AbstractDataTypes/ADT.rb
+- lib/zadt/AbstractDataTypes/MinMaxStack.rb
+- lib/zadt/AbstractDataTypes/MinMaxStackQueue.rb
+- lib/zadt/AbstractDataTypes/Queue.rb
+- lib/zadt/AbstractDataTypes/Stack.rb
+- lib/zadt/AbstractDataTypes/StackQueue.rb
 - lib/zadt/version.rb
 - zadt.gemspec
 homepage: https://github.com/MrMicrowaveOven/zadt.git