kaninchen 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA1:
+  metadata.gz: 60f8b15a393a1f3f445c31196352d7e4d7233099
+  data.tar.gz: cfd89d83ea909a2801e2a280807c2150a1d7cf41
+SHA512:
+  metadata.gz: 36f7653de76ebe90837cfe8dede0d9a0cc0ad72ee1e1297614e2921445254ad9929960038bfd854d4e7650562bf7939882c6a3bb15f151bf0d10747d00d4be72
+  data.tar.gz: 732eb364ce1df34e7aabc7f6475505a556cfe11e8a35d9259ad1b932727164508fd8b37a687d56dcaecc45c6ff3d2328aef6e26331e30cf16177cb20dfe7f206

data/.gitignore

@@ -0,0 +1,18 @@
+/.bundle/
+/.yardoc
+/Gemfile.lock
+/_yardoc/
+/coverage/
+/doc/
+/pkg/
+/spec/reports/
+/tmp/
+
+# rspec failure tracking
+.rspec_status
+
+# Ignore byebug history
+.byebug_history
+
+# Ignore cache file
+.DS_Store

data/.rspec

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

data/.travis.yml

@@ -0,0 +1,6 @@
+sudo: false
+language: ruby
+rvm:
+  - 2.4.1
+before_install: gem install bundler -v 1.15.3
+script: rspec

data/Gemfile

@@ -0,0 +1,11 @@
+source 'https://rubygems.org'
+
+ruby '2.4.1'
+
+git_source(:github) { |repo_name| "https://github.com/#{repo_name}" }
+
+# Specify your gem's dependencies in kaninchen.gemspec
+# gemspec
+gem 'byebug'
+gem 'rake'
+gem 'rspec'

data/LICENSE.txt

@@ -0,0 +1,21 @@
+The MIT License (MIT)
+
+Copyright (c) 2017 Maxwell-Alexius
+
+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,212 @@
+# Kaninchen
+
+[![Build Status](https://travis-ci.org/travis-ci/travis-web.svg?branch=master)](https://travis-ci.org/travis-ci/travis-web)
+
+Simple implementation of data structures (and algorithms in future) in Ruby programming language.
+
+Currently support data structures:
+
+- Stacks
+- Trees
+
+Currently working on data structures:
+
+- Queues
+- Sets
+
+## Installation
+
+Add this line to your application's Gemfile:
+
+```ruby
+gem 'kaninchen'
+```
+
+And then execute:
+
+    $ bundle
+
+Or install it yourself as:
+
+    $ gem install kaninchen
+
+## Stack
+
+### Basic Usage
+
+```ruby
+# Creata a new stack data structure
+stack = Kaninchen::DataStructure::Stack.new
+
+# Use the push method to push in data
+stack.push(1)
+
+# Chained method is also allowed
+stack.push(2).push(3).push(4)
+
+# Or you can use the #<< method which is alias to push
+stack << 5 << 6 << 7
+
+# Check the size of the stack
+stack.size # -> 7
+
+# Pop out stack
+stack.pop # -> 7
+stack.pop # -> 6
+stack.pop # -> 5
+
+# Empty stack will pop out nil value
+empty_stack = Kaninchen::DataStructure::Stack.new
+empty_stack.pop # -> nil
+
+# Using bang method pop! in empty stack will raise error
+empty_stack.pop!
+# -> Kaninchen::PopEmptyStackError: Popping out empty stack
+```
+
+## Tree
+
+![Kaninchen Tree](readme_img/kaninchen_tree.png)
+
+### Basic Usage
+
+```ruby
+# Create a new tree data structure and initialize the root node value
+tree = Kaninchen::DataStructure::Tree.new 'ROOT'
+tree.class # -> Kaninchen::DataStructure::Tree
+
+# Tree has a root node which holds the string value 'ROOT'
+tree.root.class # -> Kaninchen::DataStructure::Node
+tree.root.value # -> 'ROOT'
+
+# Root node is the root of the tree and is also a kind of tree node
+tree.root.root?      # -> true
+tree.root.tree_node? # -> true
+
+# Root node is not a nil node
+tree.root.nil? # -> false
+
+# Create a node which holds the value 'CHILD'
+node = Kaninchen::DataStructure::Node.new 'CHILD'
+
+# Node currently is not a tree node, which is also a kind of "nil node"
+node.tree_node? # -> false
+node.nil?       # -> true
+
+# Attach the node to the tree root node using the #<< method
+tree.root << node
+
+# Now the tree has a child node and the node's parent is the root node
+tree.root.children.size        # -> 1
+tree.root.children[0] === node # -> true
+node.parent === tree.root      # -> true
+
+# Now node is not nil node anymore, it belongs to the tree node
+node.nil?          # -> false
+node.tree_node?    # -> true
+node.tree === tree # -> true
+node.root?         # -> false
+```
+
+### Attaching Nodes
+
+Chained `#<<` method:
+
+```ruby
+# Assume tree is the Kaninchen::DataStructure::Tree type and n1, n2, n3
+# are Kaninchen::DataStructure::Node type
+
+tree.root << n1 << n2 << n3
+tree.root.children.size      # -> 3
+tree.root.children[0] === n1 # -> true
+tree.root.children[1] === n2 # -> true
+tree.root.children[2] === n3 # -> true
+n1.parent === tree.root      # -> true
+n2.parent === tree.root      # -> true
+n3.parent === tree.root      # -> true
+```
+
+Array of nodes case:
+
+```ruby
+# Assume tree is the Kaninchen::DataStructure::Tree type and n1, n2, n3
+# are Kaninchen::DataStructure::Node type
+tree.root << [n1, n2, n3]
+tree.root.children.size      # -> 3
+tree.root.children[0] === n1 # -> true
+tree.root.children[1] === n2 # -> true
+tree.root.children[2] === n3 # -> true
+n1.parent === tree.root      # -> true
+n2.parent === tree.root      # -> true
+n3.parent === tree.root      # -> true
+```
+
+Hash of nodes case:
+```ruby
+# Assume tree is the Kaninchen::DataStructure::Tree type and n1, n2, n3
+# are Kaninchen::DataStructure::Node type
+tree.node << { n1 => n2, n3 => nil }
+tree.root.children.size                  # -> 2
+tree.root.children[0] === n1             # -> true
+tree.root.children[1] === n3             # -> true
+tree.root.children[0].size               # -> 1
+tree.root.children[1].size               # -> 0
+tree.root.children[0].children.size      # -> 1
+tree.root.children[0].children[0] === n2 # -> true
+n1.parent === tree.root                  # -> true 
+n2.parent === n1                         # -> true
+n3.parent === tree.root                  # -> true
+```
+
+Mixed structure case (array and hash composition):
+```ruby
+# Assume tree is the Kaninchen::DataStructure::Tree type and n1, n2, n3
+# n4, n5 are Kaninchen::DataStructure::Node type
+tree.node << [n1, { n2 => [n3, n4], { n5 => nil } }]
+
+# Tree Structure:
+# ROOT ---> n1
+#       |-> n2 ---> n3
+#       |       |-> n4
+#       |-> n5
+#
+```
+
+### Tree Node Order & Traversal
+
+Available methods associated with tree node order and traversal is listed below:
+
+- `Tree#nodes`: Default returns an array of `Node` type objects which represents the preorder of the tree nodes
+- `Tree#node_values`: Default returns an array of `Node` type objects' values which represents the preorder of the tree nodes
+- `Tree#each_node`: Default iterates the tree nodes in preorder format which requires a given block
+- `Tree#each_node_with_index`: Default iterates the tree nodes with index specified in preorder format which requires a given block
+
+These methods can pass in optional parameter, when pass in:
+
+- `:preorder` or `:depth_first`: Preorder mode
+- `:inorder`: Inorder mode
+- `:postorder`: Postorder mode
+- `:levelorder` or `:breadth_first`: Level order mode
+
+### Properties of Tree
+
+- `Tree#height`: The height of the tree
+- `Tree#leaves`: The leaves of the tree
+
+### Properties of Tree Nodes
+
+- `Node#type`: Returns the symbol object `:tree`
+- `Node#degree`: The degree of the tree node (which is the count of the subtrees of the node)
+- `Node#depth`: The depth of the tree node (which is the distance between the node and the tree root of the node)
+- `Node#height`: The height of the tree node (which is the longest path to the leaves of the subtree of the node)
+- `Node#subtree`: Returns the new tree type object which is the subtree of the node
+- `Node#path`: Returns the path from the node to the root node as an array
+- `Node#parent`: Returns the parent node of the node
+- `Node#children`: Returns the child nodes of the node
+- `Node#left_child`: Returns the left child node of the node
+- `Node#right_child`: Returns the right child node of the node. (If there are over two children, it will return the second child node in default)
+- `Node#leaf?`: Returns `true` if the node is the leaf of the tree
+
+## 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 'kaninchen'
+
+# 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/kaninchen.gemspec

@@ -0,0 +1,37 @@
+# coding: utf-8
+
+lib = File.expand_path('../lib', __FILE__)
+$LOAD_PATH.unshift(lib) unless $LOAD_PATH.include?(lib)
+require 'kaninchen/version'
+
+Gem::Specification.new do |spec|
+  spec.name          = 'kaninchen'
+  spec.version       = Kaninchen::VERSION
+  spec.authors       = %w[Maxwell-Alexius]
+  spec.email         = %w[destinydragon85614@gmail.com]
+
+  spec.summary       = %q(Kaninchen gem contains a collection of fundamental data structures and algorithms in practice)
+  spec.description   = %q(A simple implementation of basic data structure in Ruby)
+  # spec.homepage      = 'TODO: Put your gem\'s website or public repo URL here.'
+  spec.license       = 'MIT'
+
+  # Prevent pushing this gem to RubyGems.org. To allow pushes either set the 'allowed_push_host'
+  # to allow pushing to a single host or delete this section to allow pushing to any host.
+  if spec.respond_to?(:metadata)
+    # spec.metadata['allowed_push_host'] = 'TODO: Set to "http://mygemserver.com"'
+  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 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 = %w[lib]
+
+  spec.add_development_dependency 'bundler', '~> 1.15'
+  spec.add_development_dependency 'rake', '~> 10.0'
+  spec.add_development_dependency 'rspec', '~> 3.0'
+end

data/lib/kaninchen.rb

@@ -0,0 +1,12 @@
+require 'kaninchen/version'
+require 'kaninchen/data_structure'
+require 'kaninchen/algorithm'
+require 'kaninchen/errors'
+
+module Kaninchen
+  class << self
+    def version
+      self::VERSION
+    end
+  end
+end

data/lib/kaninchen/algorithm.rb

@@ -0,0 +1,6 @@
+# frozen_string_literal: true
+
+module Kaninchen
+  module Algorithm
+  end
+end

data/lib/kaninchen/data_structure.rb

@@ -0,0 +1,15 @@
+# frozen_string_literal: true
+
+require 'kaninchen/data_structure/stack'
+require 'kaninchen/data_structure/queue'
+require 'kaninchen/data_structure/node'
+require 'kaninchen/data_structure/tree'
+require 'kaninchen/data_structure/set'
+
+module Kaninchen
+  module DataStructure
+    def self.enable_extension!
+      require 'kaninchen/data_structure/extension'
+    end
+  end
+end

data/lib/kaninchen/data_structure/extension.rb

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+module Kaninchen
+  module DataStructure
+    module Extension
+    end
+  end
+end

data/lib/kaninchen/data_structure/node.rb

@@ -0,0 +1,48 @@
+# frozen_string_literal: true
+
+module Kaninchen
+  module DataStructure
+    class Node
+      attr_reader :type, :value
+      def initialize(params = {})
+        if params.is_a? Hash
+          @type  = params[:type]
+          @value = params[:value]
+        else
+          @value = params
+          @type  = nil
+        end
+      end
+
+      def nil?
+        @type.nil?
+      end
+
+      def to_s
+        case @type
+        when nil
+          "<NilNode value=\"#{value}\">"
+        when :tree
+          "<TreeNode value=\"#{value}\" depth=\"#{depth}\" level=\"#{level}\" degree=\"#{degree}\">"
+        end
+      end
+      alias :inspect :to_s
+
+      class << self
+        def node_type(type)
+          define_method "#{type}_node?" do
+            @type === type
+          end
+
+          define_singleton_method "#{type}_node_attr_reader" do |*attrs|
+            attrs.each do |attr|
+              define_method attr do
+                send("#{type}_node?") ? instance_variable_get("@#{attr}") : nil
+              end
+            end
+          end
+        end
+      end
+    end
+  end
+end

data/lib/kaninchen/data_structure/queue.rb

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+module Kaninchen
+  module DataStructure
+    class Queue
+    end
+  end
+end

data/lib/kaninchen/data_structure/set.rb

@@ -0,0 +1,8 @@
+# frozen_string_literal: true
+
+module Kaninchen
+  module DataStructure
+    class Set
+    end
+  end
+end

data/lib/kaninchen/data_structure/stack.rb

@@ -0,0 +1,35 @@
+# frozen_string_literal: true
+
+module Kaninchen
+  module DataStructure
+    class Stack
+      def initialize(*items)
+        @stack ||= items
+      end
+
+      def push(item)
+        @stack.push item
+        self
+      end
+      alias :<< :push
+
+      def pop
+       @stack.pop
+      end
+
+      def pop!
+        popped = self.pop
+        raise Kaninchen::PopEmptyStackError, 'Popping out empty stack' if popped.nil?
+        popped
+      end
+
+      def empty?
+        @stack.size.zero?
+      end
+
+      def size
+        @stack.size
+      end
+    end
+  end
+end

data/lib/kaninchen/data_structure/tree.rb

@@ -0,0 +1,59 @@
+# frozen_string_literal: true
+
+require 'kaninchen/data_structure/tree/properties'
+require 'kaninchen/data_structure/tree/nodes'
+require 'kaninchen/data_structure/tree/each_node'
+
+module Kaninchen
+  module DataStructure
+    class Tree
+      attr_reader :root
+      def initialize(value)
+        if value.is_a? Kaninchen::DataStructure::Node
+          @root = value
+        else
+          @root = Kaninchen::DataStructure::Node.new value
+        end
+        @root.send(:set_tree_node_data, tree: self)
+      end
+
+      def to_s
+        "<Tree root=\"#{root}\" height=\"#{height}\">"
+      end
+      alias :inspect :to_s
+    end
+
+    class Node
+      node_type :tree
+      tree_node_attr_reader :tree, :parent, :children
+
+      def <<(params)
+        case
+        when (params.is_a?(Kaninchen::DataStructure::Node) and params.nil?)
+          params.send(:set_tree_node_data, tree: self.tree, parent: self)
+          set_tree_node_data(children: @children.push(params))
+        when params.is_a?(Array) then params.each { |node| self << node }
+        when params.is_a?(Hash)
+          params.each_pair do |key, value|
+            self << key
+            key << value if key.is_a? Kaninchen::DataStructure::Node
+          end
+        end
+        self
+      end
+
+      def root?
+        @parent.nil?
+      end
+
+      private
+
+      def set_tree_node_data(params)
+        @type     = :tree
+        @tree     ||= params[:tree]
+        @parent   ||= params[:parent]
+        @children ||= params[:children] || []
+      end
+    end
+  end
+end

data/lib/kaninchen/data_structure/tree/each_node.rb

@@ -0,0 +1,71 @@
+# frozen_string_literal: true
+
+module Kaninchen
+  module DataStructure
+    class Tree
+      def each_node(type = :preorder)
+        case
+        when %i[preorder depth_first].include?(type)
+          yield self.root
+          recursive_preorder_loop(self.root) { |node| yield node }
+        when type === :inorder
+          recursive_inorder_loop(first_leaf, :left_most) { |node| yield node }
+        when type === :postorder
+          recursive_postorder_loop(self.root) { |node| yield node }
+        when %i[levelorder breadth_first].include?(type)
+          yield self.root
+          recursive_levelorder_loop(self.root) { |node| yield node }
+        end
+      end
+
+      def each_node_with_index(type = :preorder)
+        index = 0
+        self.each_node(type) do |node|
+          yield node, index
+          index += 1
+        end
+      end
+
+      private
+
+      def recursive_preorder_loop(parent_node)
+        parent_node.children.each do |child_node|
+          yield child_node
+          recursive_preorder_loop(child_node) { |node| yield node }
+        end
+      end
+
+      def recursive_inorder_loop(node, current_role, end_node = nil)
+        yield node
+        case current_role
+        when :left_most
+          until node === end_node or node.root?
+            recursive_inorder_loop(node.parent, :right_recursive, end_node) { |n| yield n } unless node.parent === end_node
+            node = node.parent
+          end
+        when :right_recursive
+          node.send(:right_children).each do |child_node|
+            left_most_child = child_node.send(:left_most_child)
+            recursive_inorder_loop(left_most_child, :left_most, end_node = node) { |n| yield n }
+          end
+        end
+      end
+
+      def recursive_postorder_loop(node)
+        unless node.leaf?
+          recursive_postorder_loop(node.left_child) { |n| yield n }
+          node.send(:right_children).each do |child_node|
+            recursive_postorder_loop(child_node) { |n| yield n }
+          end
+        end
+        yield node
+      end
+
+      def recursive_levelorder_loop(node)
+        children = node.children
+        children.each { |child_node| yield child_node }
+        children.each { |child_node| recursive_levelorder_loop(child_node) { |n| yield n } }
+      end
+    end
+  end
+end

data/lib/kaninchen/data_structure/tree/nodes.rb

@@ -0,0 +1,43 @@
+# frozen_string_literal: true
+
+module Kaninchen
+  module DataStructure
+    class Tree
+      def nodes(type = nil)
+        if type.nil?
+          { self.root => recursive_get_struct(self.root) }
+        else
+          result = []
+          each_node(type) { |node| result.push(node) }
+          result
+        end
+      end
+
+      def node_values(type = nil)
+        if type.nil?
+          { self.root.value => recursive_get_struct_value(self.root) }
+        else
+          nodes(type).map(&:value)
+        end
+      end
+
+      private
+
+      def recursive_get_struct(node)
+        result = {}
+        node.children.each do |child_node|
+          result[child_node] = recursive_get_struct(child_node)
+        end
+        result.empty? ? nil : result 
+      end
+
+      def recursive_get_struct_value(node)
+        result = {}
+        node.children.each do |child_node|
+          result[child_node.value] = recursive_get_struct_value(child_node)
+        end
+        result.empty? ? nil : result
+      end
+    end
+  end
+end

data/lib/kaninchen/data_structure/tree/properties.rb

@@ -0,0 +1,102 @@
+# frozen_string_literal: true
+
+module Kaninchen
+  module DataStructure
+    class Tree
+      def leaves
+        self.nodes(:preorder).select { |node| node.children.empty? }
+      end
+
+      def height
+        self.nodes(:preorder).map do |node|
+          count = 1
+          until node.parent.nil?
+            count += 1
+            node = node.parent
+          end
+          count
+        end.max
+      end
+
+      private
+
+      def first_leaf
+        self.each_node(:preorder) { |node| return node if node.children.empty? }
+      end
+    end
+
+    class Node
+      def degree
+        self.children.size
+      end
+
+      def path
+        node = self
+        arr = [node]
+        until node.root?
+          node = node.parent
+          arr << node
+        end
+        arr
+      end
+
+      def left_child
+        self.degree.zero? ? nil : self.children[0]
+      end
+
+      def right_child
+        self.degree < 2 ? nil : self.children[1]
+      end
+
+      def depth
+        count = 0
+        current_node = self
+        until current_node.root?
+          count += 1
+          current_node = current_node.parent          
+        end
+        count
+      end
+
+      def level
+        depth + 1
+      end
+
+      def subtree
+        tree = Kaninchen::DataStructure::Tree.new(self.value)
+        recursive_attach_subtree_nodes(tree.root, self)
+        tree
+      end
+
+      def height
+        self.subtree.height
+      end
+
+      def leaf?
+        self.children.empty?
+      end
+
+      private
+
+      def recursive_attach_subtree_nodes(new_node, origin_node)
+        origin_node.children.each do |origin_child_node|
+          new_child_node = self.class.new(origin_child_node.value)
+          new_node << new_child_node
+          recursive_attach_subtree_nodes(new_child_node, origin_child_node)
+        end
+      end
+
+      # Right children is for the n-ary but not for the binary-tree system
+      # which will be served as private method due to the needs of the
+      # implementation of traversal
+      def right_children
+        self.degree < 2 ? [] : self.children[1..-1]
+      end
+
+      def left_most_child(node = self)
+        node = node.left_child until node.left_child.nil?
+        node
+      end
+    end
+  end
+end

data/lib/kaninchen/errors.rb

@@ -0,0 +1,6 @@
+# frozen_string_literal: true
+
+module Kaninchen
+  class PopEmptyStackError < StandardError
+  end
+end

data/lib/kaninchen/version.rb

@@ -0,0 +1,3 @@
+module Kaninchen
+  VERSION = '0.1.0'
+end

metadata

@@ -0,0 +1,112 @@
+--- !ruby/object:Gem::Specification
+name: kaninchen
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Maxwell-Alexius
+autorequire: 
+bindir: exe
+cert_chain: []
+date: 2017-08-12 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.15'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '1.15'
+- !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: A simple implementation of basic data structure in Ruby
+email:
+- destinydragon85614@gmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- ".gitignore"
+- ".rspec"
+- ".travis.yml"
+- Gemfile
+- LICENSE.txt
+- README.md
+- Rakefile
+- bin/console
+- bin/setup
+- kaninchen.gemspec
+- lib/kaninchen.rb
+- lib/kaninchen/algorithm.rb
+- lib/kaninchen/data_structure.rb
+- lib/kaninchen/data_structure/extension.rb
+- lib/kaninchen/data_structure/node.rb
+- lib/kaninchen/data_structure/queue.rb
+- lib/kaninchen/data_structure/set.rb
+- lib/kaninchen/data_structure/stack.rb
+- lib/kaninchen/data_structure/tree.rb
+- lib/kaninchen/data_structure/tree/each_node.rb
+- lib/kaninchen/data_structure/tree/nodes.rb
+- lib/kaninchen/data_structure/tree/properties.rb
+- lib/kaninchen/errors.rb
+- lib/kaninchen/version.rb
+- readme_img/kaninchen_tree.png
+homepage: 
+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.6.12
+signing_key: 
+specification_version: 4
+summary: Kaninchen gem contains a collection of fundamental data structures and algorithms
+  in practice
+test_files: []