collection_utils 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: ce5adb05105792945942d3c83bc675fb67a2bedf
+  data.tar.gz: 7ab710ea4fa7f278ee40c9f5dc6c4591167a8de5
+SHA512:
+  metadata.gz: ec7d96ce17ca0816bab823ec8966d25b11bd361530be6dda756eec11ee88d236fc8cc63d4cc10b497b1eb10aa58773daedce1cab42063243b696094ea6bb8d61
+  data.tar.gz: f4b447cc6da79c419b1c3e6d83dbf9cc88b2b9d99f5c3656b8ac2de5b346361112e98df53762de605a75e7b571331b3c024e881a71709694d9ddd2514d3c7809

data/.gitignore

@@ -0,0 +1,12 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+
+# rspec failure tracking
+.rspec_status

data/.rspec

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

data/.travis.yml

@@ -0,0 +1,5 @@
+sudo: false
+language: ruby
+rvm:
+  - 2.0.0
+before_install: gem install bundler -v 1.14.2

data/Gemfile

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

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 deeshugupta
+
+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,38 @@
+# CollectionUtils
+
+CollectionUtils provide with basic collection templates like stack, queues and heaps e.t.c for easier development. 
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'collection_utils'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install collection_utils
+
+## Usage
+
+TODO: Write usage instructions here
+
+## 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/deeshugupta/collection_utils. 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/bin/console

@@ -0,0 +1,14 @@
+#!/usr/bin/env ruby
+
+require "bundler/setup"
+require "collection_utils"
+
+# 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(__FILE__)

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/collection_utils.gemspec

@@ -0,0 +1,29 @@
+# coding: utf-8
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'collection_utils/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = "collection_utils"
+  spec.version       = CollectionUtils::VERSION
+  spec.authors       = ["deeshugupta"]
+  spec.email         = ["gupta.deeshu@gmail.com"]
+
+  spec.summary       = ""
+  spec.description   = "CollectionUtils provide with basic collection templates
+  like stack, queues and heaps e.t.c for easier development."
+  spec.homepage      = "https://github.com/deeshugupta/collection_utils"
+  spec.license       = "MIT"
+
+
+  spec.files         = `git ls-files -z`.split("\x0").reject do |f|
+    f.match(%r{^(test|spec|features)/})
+  end
+  spec.bindir        = "exe"
+  spec.executables   = spec.files.grep(%r{^exe/}) { |f| File.basename(f) }
+  spec.require_paths = ["lib"]
+
+  spec.add_development_dependency "bundler", "~> 1.14"
+  spec.add_development_dependency "rake", "~> 10.0"
+  spec.add_development_dependency "rspec", "~> 3.0"
+end

data/lib/collection_utils.rb

@@ -0,0 +1,4 @@
+Dir[File.dirname(__FILE__) + '/collection_utils/*.rb'].each {|file| require file }
+module CollectionUtils
+  # Your code goes here...
+end

data/lib/collection_utils/heap_utils.rb

@@ -0,0 +1,5 @@
+Dir[File.dirname(__FILE__) + '/heap_utils/*.rb'].each {|file| require file }
+module CollectionUtils
+  module HeapUtils
+  end
+end

data/lib/collection_utils/heap_utils/heap.rb

@@ -0,0 +1,97 @@
+module CollectionUtils
+  module HeapUtils
+    class Heap
+      private
+      attr_accessor :heap
+
+      public
+      #Constructors
+      def initialize(array = [])
+        @heap = array
+      end
+
+       #Public methods
+       def root
+         return @heap.first
+       end
+
+       def push(element)
+         @heap << element
+       end
+
+       def pop
+         element = @heap.pop
+         return element
+       end
+
+       def left_child(parent = 0)
+         left = (2*parent + 1)
+         return nil, nil if @heap[left].nil?
+         return @heap[left], left
+       end
+
+       def right_child(parent = 0)
+         right = (2*parent + 2)
+         return nil, nil if @heap[right].nil?
+         return @heap[right], right
+       end
+
+       def assign_left(parent =0, node)
+         left = (2*parent + 1)
+         @heap[left] = node
+       end
+
+       def assign_right(parent =0, node)
+         right = (2*parent + 2)
+         @heap[right] = node
+       end
+
+       def parent(child = 0)
+         par = child/2
+         return @heap[par], par
+       end
+
+       def size
+         return @heap.size
+       end
+
+       def is_empty?
+         return size == 0
+       end
+
+       def bfs
+         queue = CollectionUtils::Queue.new
+         queue.enqueue({element: @heap.first, index: 0})
+         while true do
+           node = queue.dequeue
+           break if node.nil?
+           left = left_child(node[:index])
+           right = right_child(node[:index])
+           yield(node[:element]) if block_given?
+           queue.enqueue({element: left.first, index: left.last}) if !left.first.nil?
+           queue.enqueue({element: right.first, index: right.last}) if !right.first.nil?
+           break if left.first.nil? && right.first
+         end
+
+       end
+
+       def dfs
+         stack = CollectionUtils::Stack.new
+         stack.push({element: @heap.first, index: 0})
+         while true do
+           node = stack.pop
+           break if node.nil?
+           left = left_child(node[:index])
+           right = right_child(node[:index])
+           yield(node[:element]) if block_given?
+           stack.push({element: left.first, index: left.last}) if !left.first.nil?
+           stack.push({element: right.first, index: right.last}) if !right.first.nil?
+           break if left.first.nil? && right.first
+         end
+
+       end
+
+    end
+    Tree = Heap
+  end
+end

data/lib/collection_utils/heap_utils/max_heap.rb

@@ -0,0 +1,81 @@
+require_relative './heap'
+module CollectionUtils
+  module HeapUtils
+    class MaxHeap < Heap
+
+      private
+      attr_accessor :heap
+
+      def exchange(element, comparor)
+        temp = comparor[:element]
+        comparor[:element] = element[:element]
+        element[:element] = temp
+        return element, comparor
+      end
+
+      def heapify(node)
+        left = left_child(node[:index]).first
+        right = right_child(node[:index]).first
+        largest = node
+        if !left.nil? && left[:element] >= node[:element]
+          largest = left
+        end
+
+        if !right.nil? && right[:element] >= largest[:element]
+          largest = right
+        end
+
+        if largest != node
+          exchange(largest, node)
+          heapify(largest)
+        end
+
+      end
+
+      def max
+        @heap.first
+      end
+
+      public
+      def initialize(array = [])
+        @heap = []
+        array.each_with_index do |element, index|
+          insert(element)
+        end
+      end
+
+      def insert(value)
+        value = {element: element, index: size}
+        @heap << value
+        i = @heap.size - 1
+        node, index = parent(i)
+        while i != 0 && @heap[i][:element] >= node[:element] do
+          exchange(@heap[i], node)
+          i = index
+          node, index = parent(i)
+        end
+      end
+
+      def get_max
+        return if is_empty?
+        return max[:element]
+      end
+
+      def extract_max
+        return if is_empty?
+        maximum = max
+        if @heap.size > 1
+          last_value = @heap.last
+          last_value[:index] = 0
+          @heap = @heap.slice(0..@heap.size-2)
+          @heap[0] = last_value
+          heapify(max)
+        else
+          @heap =[  ]
+        end
+
+        return maximum[:element]
+      end
+    end
+  end
+end

data/lib/collection_utils/heap_utils/min_heap.rb

@@ -0,0 +1,81 @@
+require_relative './heap'
+module CollectionUtils
+  module HeapUtils
+    class MinHeap < Heap
+
+      private
+      attr_accessor :heap
+
+      def exchange(element, comparor)
+        temp = comparor[:element]
+        comparor[:element] = element[:element]
+        element[:element] = temp
+        return element, comparor
+      end
+
+      def heapify(node)
+        left = left_child(node[:index]).first
+        right = right_child(node[:index]).first
+        smallest = node
+        if !left.nil? && left[:element] < node[:element]
+          smallest = left
+        end
+
+        if !right.nil? && right[:element] < smallest[:element]
+          smallest = right
+        end
+
+        if smallest != node
+          exchange(smallest, node)
+          heapify(smallest)
+        end
+
+      end
+
+      def min
+        @heap.first
+      end
+
+      public
+      def initialize(array = [])
+        @heap = []
+        array.each_with_index do |element, index|
+          insert(element)
+        end
+      end
+
+      def insert(element)
+        value = {element: element, index: size}
+        @heap << value
+        i = size - 1
+        node, index = parent(i)
+        while i != 0 && @heap[i][:element] < node[:element] do
+          exchange(@heap[i], node)
+          i = index
+          node, index = parent(i)
+        end
+      end
+
+      def get_min
+        return if is_empty?
+        return min[:element]
+      end
+
+      def extract_min
+        return if is_empty?
+        minimum = min
+        if @heap.size > 1
+          last_value = @heap.last
+          last_value[:index] = 0
+          @heap = @heap.slice(0..@heap.size-2)
+          @heap[0] = last_value
+          heapify(min)
+        else
+          @heap =[  ]
+        end
+
+        return minimum[:element]
+      end
+    end
+  end
+end

data/lib/collection_utils/queue.rb

@@ -0,0 +1,45 @@
+module CollectionUtils
+  class Queue
+    private
+    attr_accessor :queue
+
+    public
+    #Constructors
+
+    def initialize(array=[])
+      @queue = []
+      array.each do |element|
+        enqueue(element)
+      end
+    end
+
+    #Public Methods
+
+    def enqueue(element)
+      @queue << element
+    end
+
+    def dequeue
+      element = @queue.first
+      @queue = @queue.slice(1..-1)
+      return element
+    end
+
+    def front
+      return @queue.first
+    end
+
+    def rear
+      return @queue.last
+    end
+
+    def is_empty?
+      return @queue.size == 0
+    end
+
+    def size
+      return @queue.size
+    end
+
+  end
+end

data/lib/collection_utils/stack.rb

@@ -0,0 +1,37 @@
+module CollectionUtils
+  class Stack
+    private
+    attr_accessor :stack
+
+    public
+    #Constructors
+    def initialize(array=[])
+      @stack = []
+      array.each do |element|
+        @stack << element
+      end
+    end
+
+   #Public methods
+    def pop()
+      return @stack.pop
+    end
+
+    def push(element)
+      @stack << element
+    end
+
+    def is_empty?
+      return @stack.size == 0
+    end
+
+    def peek
+      return @stack.last
+    end
+
+    def size
+      return @stack.size
+    end
+
+  end
+end

data/lib/collection_utils/version.rb

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

metadata

@@ -0,0 +1,106 @@
+--- !ruby/object:Gem::Specification
+name: collection_utils
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- deeshugupta
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2017-07-18 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.14'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ~>
+      - !ruby/object:Gem::Version
+        version: '1.14'
+- !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: |-
+  CollectionUtils provide with basic collection templates
+    like stack, queues and heaps e.t.c for easier development.
+email:
+- gupta.deeshu@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- .gitignore
+- .rspec
+- .travis.yml
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- collection_utils.gemspec
+- lib/collection_utils.rb
+- lib/collection_utils/heap_utils.rb
+- lib/collection_utils/heap_utils/heap.rb
+- lib/collection_utils/heap_utils/max_heap.rb
+- lib/collection_utils/heap_utils/min_heap.rb
+- lib/collection_utils/queue.rb
+- lib/collection_utils/stack.rb
+- lib/collection_utils/version.rb
+homepage: https://github.com/deeshugupta/collection_utils
+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.8
+signing_key: 
+specification_version: 4
+summary: ''
+test_files: []