ZagorskiADT 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: a13b07ff338071374da71e2aa74edd00bb82e89b
+  data.tar.gz: 135869779c3be728a9c9b6583c2f35b465c35227
+SHA512:
+  metadata.gz: 2972188af44c18a2c670353833c476d30a8530b6e587153ac80eb3a3d6a5465a2c1fc203030bf5d67b4d642029e769efe8535fccbc53c37ece366d79754fc1c4
+  data.tar.gz: eb34948b602176e0e8f7e524bc3bb461a4c61806d883651c52773706aabc0f331fb18cff76c2832a166a1b803a7834950af7012993db41d92ea87e8eafd3811c

data/.gitignore

@@ -0,0 +1,10 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+*.gem

data/.rspec

@@ -0,0 +1,2 @@
+--format documentation
+--color

data/.travis.yml

@@ -0,0 +1,4 @@
+language: ruby
+rvm:
+  - 2.1.2
+before_install: gem install bundler -v 1.11.2

data/CODE_OF_CONDUCT.md

@@ -0,0 +1,49 @@
+# Contributor Code of Conduct
+
+As contributors and maintainers of this project, and in the interest of
+fostering an open and welcoming community, we pledge to respect all people who
+contribute through reporting issues, posting feature requests, updating
+documentation, submitting pull requests or patches, and other activities.
+
+We are committed to making participation in this project a harassment-free
+experience for everyone, regardless of level of experience, gender, gender
+identity and expression, sexual orientation, disability, personal appearance,
+body size, race, ethnicity, age, religion, or nationality.
+
+Examples of unacceptable behavior by participants include:
+
+* The use of sexualized language or imagery
+* Personal attacks
+* Trolling or insulting/derogatory comments
+* Public or private harassment
+* Publishing other's private information, such as physical or electronic
+  addresses, without explicit permission
+* Other unethical or unprofessional conduct
+
+Project maintainers have the right and responsibility to remove, edit, or
+reject comments, commits, code, wiki edits, issues, and other contributions
+that are not aligned to this Code of Conduct, or to ban temporarily or
+permanently any contributor for other behaviors that they deem inappropriate,
+threatening, offensive, or harmful.
+
+By adopting this Code of Conduct, project maintainers commit themselves to
+fairly and consistently applying these principles to every aspect of managing
+this project. Project maintainers who do not follow or enforce the Code of
+Conduct may be permanently removed from the project team.
+
+This code of conduct applies both within project spaces and in public spaces
+when an individual is representing the project or its community.
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported by contacting a project maintainer at benj@zagorski.com. All
+complaints will be reviewed and investigated and will result in a response that
+is deemed necessary and appropriate to the circumstances. Maintainers are
+obligated to maintain confidentiality with regard to the reporter of an
+incident.
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 1.3.0, available at
+[http://contributor-covenant.org/version/1/3/0/][version]
+
+[homepage]: http://contributor-covenant.org
+[version]: http://contributor-covenant.org/version/1/3/0/

data/Gemfile

@@ -0,0 +1,4 @@
+source 'https://rubygems.org'
+
+# Specify your gem's dependencies in ZagorskiADT.gemspec
+gemspec

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2016 Benjamin
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
+THE SOFTWARE.

data/README.md

@@ -0,0 +1,46 @@
+# ZagorskiADT
+
+Zagorski ADT is a collection of data types that are not included in the standard Ruby library.
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'ZagorskiADT'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install ZagorskiADT
+
+## Usage
+
+ZagorskiADT::ADT.help will return a list of objects in the collection, as well as a brief description of each type.
+
+I also made a "help" function for each Data Type.  Type ZagorskiADT::StackQueue.help get a list of functions for the StackQueue, and so on.
+
+### MinMaxStackQueue
+
+A MinMaxStackQueue is an Queue object that allows the minimum and maximum values to be found in constant time.  It's built by making a Queue out of a Stack, which has that same min/max ability.
+
+Since it is made out of Queues and Stacks, those data types are also available.  I also provided StackQueue (functionally the same as a Queue), and a MinMaxStack, which is a Stack version of MinMaxStackQueue.
+
+## Development
+
+After checking out the repo, run `bin/setup` to install dependencies. Then, run `rake spec` to run the tests. You can also run `bin/console` for an interactive prompt that will allow you to experiment.
+
+To install this gem onto your local machine, run `bundle exec rake install`. To release a new version, update the version number in `version.rb`, and then run `bundle exec rake release`, which will create a git tag for the version, push git commits and tags, and push the `.gem` file to [rubygems.org](https://rubygems.org).
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/[USERNAME]/ZagorskiADT. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.
+
+
+## License
+
+The gem is available as open source under the terms of the [MIT License](http://opensource.org/licenses/MIT).

data/Rakefile

@@ -0,0 +1,6 @@
+require "bundler/gem_tasks"
+require "rspec/core/rake_task"
+
+RSpec::Core::RakeTask.new(:spec)
+
+task :default => :spec

data/ZagorskiADT.gemspec

@@ -0,0 +1,33 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'ZagorskiADT/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "ZagorskiADT"
+  spec.version       = ZagorskiADT::VERSION
+  spec.authors       = ["Benjamin Zagorski"]
+  spec.email         = ["benj@zagorski.com"]
+
+  spec.summary       = %q{Zagorski ADT is a collection of data types that are not included in the standard Ruby library.}
+  spec.description   = %q{Includes Stack, Queue, StackQueue, MinMaxStack, and MinMaxStackQueue.}
+  spec.homepage      = "https://github.com/MrMicrowaveOven/ZagorskiADT.git"
+  spec.license       = "MIT"
+
+  # Prevent pushing this gem to RubyGems.org by setting 'allowed_push_host', or
+  # delete this section to allow pushing this gem to any host.
+  if spec.respond_to?(:metadata)
+    spec.metadata['allowed_push_host'] = "https://rubygems.org"
+  else
+    raise "RubyGems 2.0 or newer is required to protect against public gem pushes."
+  end
+
+  spec.files         = `git ls-files -z`.split("\x0").reject { |f| f.match(%r{^(test|spec|features)/}) }
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.11"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.0"
+end

data/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "ZagorskiADT"
+
+# You can add fixtures and/or initialization code here to make experimenting
+# with your gem easier. You can also use a different console, if you like.
+
+# (If you use this, don't forget to add pry to your Gemfile!)
+# require "pry"
+# Pry.start
+
+require "irb"
+IRB.start

data/bin/setup

@@ -0,0 +1,8 @@
+#!/usr/bin/env bash
+set -euo pipefail
+IFS=$'\n\t'
+set -vx
+
+bundle install
+
+# Do any other automated setup that you need to do here

data/lib/ADT_requireables.rb

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

data/lib/ZagorskiADT/AbstractDataTypes/ADT.rb

@@ -0,0 +1,15 @@
+module ZagorskiADT
+  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 "Type Stack.help for a list of Stack functions, and so on."
+    end
+  end
+end

data/lib/ZagorskiADT/AbstractDataTypes/MinMaxStack.rb

@@ -0,0 +1,62 @@
+# 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 ZagorskiADT
+  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 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/ZagorskiADT/AbstractDataTypes/MinMaxStackQueue.rb

@@ -0,0 +1,69 @@
+# 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 ZagorskiADT
+  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 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/ZagorskiADT/AbstractDataTypes/Queue.rb

@@ -0,0 +1,37 @@
+module ZagorskiADT
+  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 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/ZagorskiADT/AbstractDataTypes/Stack.rb

@@ -0,0 +1,37 @@
+module ZagorskiADT
+  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 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/ZagorskiADT/AbstractDataTypes/StackQueue.rb

@@ -0,0 +1,46 @@
+# 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 ZagorskiADT
+  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 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/ZagorskiADT/version.rb

@@ -0,0 +1,3 @@
+module ZagorskiADT
+  VERSION = "0.1.0"
+end

data/lib/ZagorskiADT.rb

@@ -0,0 +1,6 @@
+require "ZagorskiADT/version"
+require_relative "ADT_requireables.rb"
+
+module ZagorskiADT
+  # Your code goes here...
+end

metadata

@@ -0,0 +1,112 @@
+--- !ruby/object:Gem::Specification
+name: ZagorskiADT
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Benjamin Zagorski
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2016-03-29 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.11'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.11'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '10.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+description: Includes Stack, Queue, StackQueue, MinMaxStack, and MinMaxStackQueue.
+email:
+- benj@zagorski.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".DS_Store"
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- CODE_OF_CONDUCT.md
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- ZagorskiADT.gemspec
+- bin/console
+- bin/setup
+- lib/.DS_Store
+- lib/ADT_requireables.rb
+- lib/ZagorskiADT.rb
+- lib/ZagorskiADT/.DS_Store
+- lib/ZagorskiADT/AbstractDataTypes/.DS_Store
+- lib/ZagorskiADT/AbstractDataTypes/ADT.rb
+- lib/ZagorskiADT/AbstractDataTypes/MinMaxStack.rb
+- lib/ZagorskiADT/AbstractDataTypes/MinMaxStackQueue.rb
+- lib/ZagorskiADT/AbstractDataTypes/Queue.rb
+- lib/ZagorskiADT/AbstractDataTypes/Stack.rb
+- lib/ZagorskiADT/AbstractDataTypes/StackQueue.rb
+- lib/ZagorskiADT/version.rb
+homepage: https://github.com/MrMicrowaveOven/ZagorskiADT.git
+licenses:
+- MIT
+metadata:
+  allowed_push_host: https://rubygems.org
+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.2.2
+signing_key: 
+specification_version: 4
+summary: Zagorski ADT is a collection of data types that are not included in the standard
+  Ruby library.
+test_files: []