data_structures_101 0.2.5 → 0.2.6

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 33887e0ad362811a5165c4bcf889cd5610a17101
-  data.tar.gz: b9d2a978fcefe7f67883fef2235b26011cf801c0
+  metadata.gz: e15be8b700463083c82dda684ae895dde3d8baa7
+  data.tar.gz: 2d63d489be4c9eafac10a425f7f4b52e68a90d6e
 SHA512:
-  metadata.gz: d4b356091a218b458ecf8286bec17a4005f2827856d0dbda09bd70587db7154ef87fa491f1084411cfd2f3d8e768dd897748d09f0e52285eff5663977cde6885
-  data.tar.gz: 9becb8117223f6220887774f6872a980d825ff4042aa9bd02fe238e2e86b228d4098c0c7b710dfe8b9701748db427815924add4a482c03f6af758212ba0b4c21
+  metadata.gz: 11947ea941d77805167838c153543e3db5215817e4d614e78e7d27d9021917cf0cdd21ef312dd8e2f53ca6acecbcc88c2a20eac7430f3e0234e86219f5392b66
+  data.tar.gz: c4f82b40b433e5156bd8a20492a2833d9d1cf104c0c49b71e97aa67e33098cd3725d559bc34c202b2250d915d74c19e3b9010a8d2e4784231a5252607e8cc382

data/.editorconfig

@@ -0,0 +1,9 @@
+root = true
+
+[*.rb]
+indent_style = space
+indent_size = 2
+end_of_line = lf
+charset = utf-8
+trim_trailing_whitespace = true
+insert_final_newline = true

data/.rubocop.yml

@@ -0,0 +1,17 @@
+AllCops:
+  TargetRubyVersion: 2.4
+Metrics/MethodLength:
+  Max: 25
+  CountComments: false
+Metrics/AbcSize:
+  Max: 20
+Metrics/CyclomaticComplexity:
+  Max: 10
+Metrics/BlockLength:
+  Exclude: 
+    - spec/**/*
+Metrics/LineLength:
+  Exclude:
+    - spec/**/*
+Style/FrozenStringLiteralComment:
+  EnforcedStyle: always

data/.travis.yml

@@ -2,13 +2,24 @@ sudo: false
 language: ruby
 rvm:
 - 2.4.0
-script: bundle exec rspec
+script: 
+  - bundle exec rspec
+  - bundle exec rubocop lib
+  - bundle exec rubocop spec
+before_deploy: bundle exec yard doc
 deploy:
-  provider: rubygems
-  api_key:
-    secure: YDkCNjnzyBTEcZLjKqt6ep1rIHYGF6tbqwNVUXEOFiBpQA534xl8AcsNIcb4MZGcNzn9ZeJiHstIeHKKP135sLKnA00RptoVtNAHn9F5hBgDyPc5GyIEzml4wDv7NM+jcM4df39CEBIyYi+77vRUvUfrOJ+0RF7CxvlGX4ZUvbI+5edFXjt9ioVPOhG+V6FyTbGlNEG2Rj4lx6jjUF3HYVVhwHCva3F4uXNh/3CjZXvcJ6ZahKCiO0/pqxZsS6L/xfDaih/jg/8B3nQ2L7Lx+g5A8uNLCZ4u2G4SPoCg0a+mrttJAkIgTNC8reVBAbS9V7BV6/OJcJwwhJKNQ+UsleTv0oDdOWsSFgL8I2qtUJb7r1cpmFHi/LC5fnfpfC6xcoRk7sxrFboYsbm8yGt2KEk68Jregl9j0EqrHynog/9zFKx9Sfcrw2Fo+6oMACDYm3NzlcAo+6bQHni/kV94oaD58nZ3OQgvBMh4jeZ854jjCbpJaCMs2u2CgezjlTZCY7+E38t+/tiFlAOakVBSC9oGEYCFxh5X/clKXi7Q2PZj8j/pmcc51wmVFEMB5Led7kj1R1YWCnalhIZO4hpz83yBGCYZQgm2AZy0r8k741L9ab0H/KhMSJHGN2ym2Dgdpg1a0QdlMGVidIQGNjeSEx7TPkkDStuM588qKcR8C6M=
-  gem: data_structures_101
-  on:
-    tags: true
-    repo: renehernandez/data_structures_101
-    branch: master
+  - provider: pages
+    skip_cleanup: true
+    github_token: $GITHUB_TOKEN
+    local_dir: doc
+    target_branch: gh-pages
+    on:
+      branch: master
+  - provider: rubygems
+    api_key:
+      secure: YDkCNjnzyBTEcZLjKqt6ep1rIHYGF6tbqwNVUXEOFiBpQA534xl8AcsNIcb4MZGcNzn9ZeJiHstIeHKKP135sLKnA00RptoVtNAHn9F5hBgDyPc5GyIEzml4wDv7NM+jcM4df39CEBIyYi+77vRUvUfrOJ+0RF7CxvlGX4ZUvbI+5edFXjt9ioVPOhG+V6FyTbGlNEG2Rj4lx6jjUF3HYVVhwHCva3F4uXNh/3CjZXvcJ6ZahKCiO0/pqxZsS6L/xfDaih/jg/8B3nQ2L7Lx+g5A8uNLCZ4u2G4SPoCg0a+mrttJAkIgTNC8reVBAbS9V7BV6/OJcJwwhJKNQ+UsleTv0oDdOWsSFgL8I2qtUJb7r1cpmFHi/LC5fnfpfC6xcoRk7sxrFboYsbm8yGt2KEk68Jregl9j0EqrHynog/9zFKx9Sfcrw2Fo+6oMACDYm3NzlcAo+6bQHni/kV94oaD58nZ3OQgvBMh4jeZ854jjCbpJaCMs2u2CgezjlTZCY7+E38t+/tiFlAOakVBSC9oGEYCFxh5X/clKXi7Q2PZj8j/pmcc51wmVFEMB5Led7kj1R1YWCnalhIZO4hpz83yBGCYZQgm2AZy0r8k741L9ab0H/KhMSJHGN2ym2Dgdpg1a0QdlMGVidIQGNjeSEx7TPkkDStuM588qKcR8C6M=
+    gem: data_structures_101
+    on:
+      tags: true
+      repo: renehernandez/data_structures_101
+      branch: master

data/.yardopts

@@ -0,0 +1,2 @@
+--markup-provider=redcarpet
+--markup=markdown

data/README.md

@@ -1,4 +1,4 @@
-# DataStructures101 [![Build Status](https://travis-ci.org/renehernandez/data_structures_101.svg?branch=master)](https://travis-ci.org/renehernandez/bok-data_structures_101) [![Gem Version](https://badge.fury.io/rb/data_structures_101.svg)](https://badge.fury.io/rb/data_structures_101)
+# DataStructures101 [![Build Status](https://travis-ci.org/renehernandez/data_structures_101.svg)](https://travis-ci.org/renehernandez/data_structures_101) [![Gem Version](https://badge.fury.io/rb/data_structures_101.svg)](https://badge.fury.io/rb/data_structures_101)
 
 DataStructures101 is a simple gem that groups several implementations of common data structures usually taught in Computer Science courses. The overall goal of the gem is to provide easy to use functionality (trying to match the behavior of existent structures in Ruby) while providing the user with a framework to test and compare their implementations against.
 
@@ -24,7 +24,7 @@ Or install it yourself as:
 require 'data_structures_101'
 ```
 
-### LinkedList
+### LinkedList example
 
 To create a LinkedList
 
@@ -32,7 +32,17 @@ To create a LinkedList
 list = DataStructures101::LinkedList.new
 ```
 
-For more information in the `LinkedList` class, check [this post](https://bitsofknowledge.net/2017/08/05/data-structures-101-linkedlist-implementation) and read the documentation.
+### HashTable example
+
+To create a hash table using *separate chaining* strategy:
+
+```ruby
+hash = DataStructures101::ChainedHashTable.new
+```
+
+### Documentation
+
+The website documentation lives at the [github pages](https://renehernandez.github.io/data_structures_101/). You can also chec several posts on [https://bitsofknowledge.net](https://bitsofknowledge.net) where I have discusses some implementations.
 
 ## Contributing
 

data/_config.yml

@@ -1 +1,2 @@
-theme: jekyll-theme-slate
+theme: jekyll-theme-slate
+title: Welcome to DataStructures101

data/config.reek

@@ -0,0 +1,6 @@
+TooManyStatements:
+  max_statements: 20
+
+UncommunicativeModuleName:
+  accept:
+    - DataStructures101

data/data_structures_101.gemspec

@@ -6,7 +6,7 @@ require 'data_structures_101/version'
 Gem::Specification.new do |spec|
   spec.name          = "data_structures_101"
   spec.version       = DataStructures101::VERSION
-  spec.authors       = ["aegis"]
+  spec.authors       = ["renehernandez"]
   spec.email         = ["renehr9102@gmail.com"]
 
   spec.summary       = %q{DataStructures101 is a simple gem that groups several implementations of common data structures usually taught in Computer Science courses.}
@@ -23,4 +23,9 @@ Gem::Specification.new do |spec|
   spec.add_development_dependency "bundler", "~> 1.14"
   spec.add_development_dependency "rake", "~> 10.0"
   spec.add_development_dependency "rspec", "~> 3.5"
+  spec.add_development_dependency "reek", "~> 4.7"
+  spec.add_development_dependency "rubocop", "~> 0.49"
+  spec.add_development_dependency "yard"
+  spec.add_development_dependency "redcarpet"
+  spec.add_development_dependency "github-markup"
 end

data/lib/data_structures_101/chained_hash_table.rb

@@ -1,50 +1,55 @@
+# frozen_string_literal: true
+
 module DataStructures101
+  # HashTable implementation using separate chaining strategy
+  # for collision-resolution
+  # It subclasses Hash::BaseHashTable
+  # @author Rene Hernandez
+  # @since 0.2
+  class ChainedHashTable < Hash::BaseHashTable
+    def initialize(capacity: 31, prime: 109_345_121, compression_lambda: nil)
+      super
+    end
 
-    class ChainedHashTable < Hash::BaseHashTable
+    private
 
-        def initialize(capacity: 31, prime: 109345121, compression_lambda: nil)
-            super
-        end
+    def bucket_find(hash_code, key)
+      bucket = @table[hash_code]
+      return nil if bucket.nil?
 
-        private
+      bucket.find(key)
+    end
 
-        def bucket_find(hash_code, key)
-            bucket = @table[hash_code]
-            return nil if bucket.nil?
-            
-            bucket.find(key)
-        end
+    def bucket_insert(hash_code, key, value)
+      bucket = @table[hash_code]
+      bucket = @table[hash_code] = Hash::Bucket.new if bucket.nil?
 
-        def bucket_insert(hash_code, key, value)
-            bucket = @table[hash_code]
-            bucket = @table[hash_code] = Hash::Bucket.new if bucket.nil?
+      old_size = bucket.size
+      old_value = bucket.insert(key, value)
+      @size += (bucket.size - old_size)
 
-            old_size = bucket.size()
-            old_value = bucket.insert(key, value)
-            @size += (bucket.size - old_size)
+      old_value
+    end
 
-            old_value
-        end
+    def bucket_delete(hash_code, key)
+      bucket = @table[hash_code]
+      return nil if bucket.nil?
 
-        def bucket_delete(hash_code, key)
-            bucket = @table[hash_code]
-            return nil if bucket.nil?
+      old_size = bucket.size
+      value = bucket.delete(key)
+      @size -= (old_size - bucket.size)
 
-            old_size = bucket.size
-            value = bucket.delete(key)
-            @size -= (old_size - bucket.size)
+      value
+    end
 
-            value
-        end
+    def bucket_each
+      @table.each do |bucket|
+        next if bucket.nil?
 
-        def bucket_each
-            @table.each do |bucket|
-                next if bucket.nil?
-                
-                bucket.each do |key, value|
-                    yield(key, value)
-                end
-            end
+        bucket.each do |key, value|
+          yield(key, value)
         end
+      end
     end
-end
+  end
+end

data/lib/data_structures_101/hash/base_hash_table.rb

@@ -1,70 +1,82 @@
-module DataStructures101  
-    module Hash
-        class BaseHashTable
-            include Enumerable
-
-            attr_reader :size, :compression_lambda, :capacity
-
-            def initialize(capacity:, prime:, compression_lambda:) 
-                @capacity = capacity
-                @size = 0
-                @table = Array.new(@capacity)
-                           
-                @compression_lambda = compression_lambda
-                
-                if @compression_lambda.nil?      
-                    random = Random.new
-                    scale = random.rand(prime - 1) + 1
-                    shift = random.rand(prime)                             
-                    @compression_lambda = ->(key, cap) { return (((key.hash * scale + shift) % prime) % cap).abs }
-                end
-            end
-
-            def []=(key, value)
-                insert(key, value)
-            end     
-
-            def insert(key, value)
-                old_value = bucket_insert(compression_lambda.call(key, @capacity), key, value)
-
-                # keep load factor <= 0.5
-                resize(new_capacity) if @size > @capacity / 2
-
-                old_value
-            end
-            
-            def [](key)
-                bucket_find(compression_lambda.call(key, @capacity), key)
-            end
-
-            def delete(key)
-                bucket_delete(compression_lambda.call(key, @capacity), key)
-            end
-
-            def each
-                return enum_for(:each) unless block_given?
-
-                bucket_each do |key, value|
-                    yield(key, value) 
-                end
-            end
-
-            private
-
-            def new_capacity
-                2 * @capacity - 1
-            end
-
-            def resize(new_cap)
-                @capacity = new_cap
-
-                buffer = self.map { |key, value| [key, value] }
-
-                @table = Array.new(@capacity)
-                @size = 0
-
-                buffer.each { |key, value| self[key] = value }
-            end
+# frozen_string_literal: true
+
+module DataStructures101
+  # @author Rene Hernandez
+  # @since 0.2
+  module Hash
+    # Abstract class for shared HashTable functionalities.
+    # @see ChainedHashTable
+    # @see ProbeHashTable
+    # @author Rene Hernandez
+    # @since 0.2
+    class BaseHashTable
+      include Enumerable
+
+      attr_reader :size, :compression_lambda, :capacity
+
+      def initialize(capacity:, prime:, compression_lambda:)
+        @capacity = capacity
+        @size = 0
+        @table = Array.new(@capacity)
+
+        @compression_lambda = compression_lambda
+
+        return unless @compression_lambda.nil?
+
+        random = Random.new
+        scale = random.rand(prime - 1) + 1
+        shift = random.rand(prime)
+        @compression_lambda = lambda do |key, cap|
+          return (((key.hash * scale + shift) % prime) % cap).abs
         end
+      end
+
+      def []=(key, value)
+        insert(key, value)
+      end
+
+      def insert(key, value)
+        hash_code = compression_lambda.call(key, @capacity)
+        old_value = bucket_insert(hash_code, key, value)
+
+        # Keep load factor below 0.5.
+        resize(new_capacity) if @size > @capacity / 2
+
+        old_value
+      end
+
+      def [](key)
+        bucket_find(compression_lambda.call(key, @capacity), key)
+      end
+
+      def delete(key)
+        bucket_delete(compression_lambda.call(key, @capacity), key)
+      end
+
+      def each
+        return enum_for(:each) unless block_given?
+
+        bucket_each do |key, value|
+          yield(key, value)
+        end
+      end
+
+      private
+
+      def new_capacity
+        2 * @capacity - 1
+      end
+
+      def resize(new_cap)
+        @capacity = new_cap
+
+        buffer = map { |key, value| [key, value] }
+
+        @table = Array.new(@capacity)
+        @size = 0
+
+        buffer.each { |key, value| self[key] = value }
+      end
     end
-end
+  end
+end

data/lib/data_structures_101/hash/bucket.rb

@@ -1,59 +1,64 @@
+# frozen_string_literal: true
+
 module DataStructures101
-    module Hash
-        class Bucket
-
-            attr_reader :table
-
-            def initialize()
-                @table = []
-            end
-
-            def [](key)
-                find(key)
-            end
-
-            def []=(key, value)
-                insert(key, value)
-            end
-
-            def insert(key, value)
-                idx = @table.find_index {|_key, _| _key == key} 
-
-                if idx.nil?
-                    @table << [key, value]
-                    return nil
-                else
-                    value, @table[idx][1] = @table[idx][1], value
-                    return value
-                end
-            end
-
-            def size
-                @table.size
-            end
-
-            def find(key)
-                pair = @table.find {|_key, _| _key == key}
-                pair.nil? ? nil : pair.last
-            end
-
-            def delete(key) 
-                idx = @table.find_index {|_key, _| _key == key}
-                return nil if idx.nil?
-
-                value = @table[idx].last
-                @table[idx] = @table.last if idx != @table.size - 1
-                @table.pop
-                value
-            end
-
-            def each
-                return enum_for(:each) unless block_given?
-
-                @table.each do |key, value|
-                    yield(key, value)
-                end
-            end
+  module Hash
+    # Utility class to manipulate (key, pairs) that have same hash code.
+    # @see ChainedHashTable
+    # @author Rene Hernandez
+    # @since 0.2
+    class Bucket
+      attr_reader :table
+
+      def initialize
+        @table = []
+      end
+
+      def [](key)
+        find(key)
+      end
+
+      def []=(key, value)
+        insert(key, value)
+      end
+
+      def insert(key, value)
+        idx = @table.find_index { |table_key, _| table_key == key }
+
+        if idx.nil?
+          @table << [key, value]
+          return nil
+        else
+          value, @table[idx][1] = @table[idx][1], value
+          return value
+        end
+      end
+
+      def size
+        @table.size
+      end
+
+      def find(key)
+        pair = @table.find { |table_key, _| table_key == key }
+        pair.nil? ? nil : pair.last
+      end
+
+      def delete(key)
+        idx = @table.find_index { |table_key, _| table_key == key }
+        return nil if idx.nil?
+
+        value = @table[idx].last
+        @table[idx] = @table.last if idx != @table.size - 1
+        @table.pop
+        value
+      end
+
+      def each
+        return enum_for(:each) unless block_given?
+
+        @table.each do |key, value|
+          yield(key, value)
         end
+      end
     end
-end
+  end
+end

data/lib/data_structures_101/linked_list.rb

@@ -1,15 +1,23 @@
-module DataStructures101
+# frozen_string_literal: true
 
+module DataStructures101
+  # @author Rene Hernandez
+  # @since 0.1
   class LinkedList
     include Enumerable
 
+    # Internal class to store a given value in the LinkedList.
+    # Provides reference to next and previous node in the list
+    # @see LinkedList
+    # @author Rene Hernandez
+    # @since 0.1
     class Node
       attr_accessor :value, :prev, :next
 
-      def initialize(value, prev = nil, _next = nil)
+      def initialize(value, previous_node = nil, next_node = nil)
         @value = value
-        @next = _next
-        @prev = prev
+        @prev = previous_node
+        @next = next_node
       end
 
       def to_s
@@ -46,10 +54,12 @@ module DataStructures101
       return_value
     end
 
-    def each(&block)
+    def each
+      return enum_for(:each) unless block_given?
+
       curr = head.next
       until curr.nil?
-        block.call(value)
+        yield curr.value
         curr = curr.next
       end
     end
@@ -61,7 +71,7 @@ module DataStructures101
     def insert(index, *values)
       curr = fetch_node(index)
 
-      curr = index < 0 ? curr : curr.prev
+      curr = index.negative? ? curr : curr.prev
 
       values.each do |value|
         curr = add_node(value, curr.next)
@@ -72,17 +82,17 @@ module DataStructures101
     def first(n = nil)
       return @head.next.value if n.nil?
 
-      raise ArgumentError, "negative array size" if n < 0
+      raise ArgumentError, 'negative array size' if n.negative?
 
-      return new_list_from_range(0, n - 1)
+      new_list_from_range(0, n - 1)
     end
 
     def last(n = nil)
       return @tail.prev.value if n.nil?
-    
-      raise ArgumentError, "negative array size" if n < 0
 
-      return new_list_from_range(size - n, size - 1)
+      raise ArgumentError, 'negative array size' if n.negative?
+
+      new_list_from_range(size - n, size - 1)
     end
 
     def push(*values)
@@ -95,10 +105,10 @@ module DataStructures101
     private
 
     def fetch_node(index)
-      index += size if index < 0
-      if index < 0 || index >= size
-        raise IndexError, "index #{index} outside of array bounds: #{-size}...#{size}"
-      end
+      index += size if index.negative?
+
+      error_msg = "index #{index} outside of array bounds: #{-size}...#{size}"
+      raise IndexError, error_msg if index.negative? || index >= size
 
       pos = 0
       curr = @head.next
@@ -127,9 +137,9 @@ module DataStructures101
     def new_list_from_range(start_index, finish_index)
       new_list = LinkedList.new
 
-      return new_list if size == 0 || start_index == size || finish_index == -1
+      return new_list if size.zero? || start_index == size || finish_index == -1
 
-      start_index = 0 if start_index < 0
+      start_index = 0 if start_index.negative?
       finish_index = size - 1 if finish_index >= size
 
       start_node = fetch_node(start_index)
@@ -142,7 +152,5 @@ module DataStructures101
 
       new_list
     end
-
   end
-
 end

data/lib/data_structures_101/probe_hash_table.rb

@@ -1,86 +1,93 @@
+# frozen_string_literal: true
+
 require 'singleton'
 
 module DataStructures101
-    class ProbeHashTable < Hash::BaseHashTable
+  # HashTable implementation using probing strategy for collision-resolution
+  # It subclasses Hash::BaseHashTable
+  # @author Rene Hernandez
+  # @since 0.2
+  class ProbeHashTable < Hash::BaseHashTable
+    attr_reader :probe_lambda
 
-        attr_reader :probe_lambda
+    def initialize(capacity: 31, prime: 109_345_121,
+                   compression_lambda: nil, probe_lambda: nil)
+      super(capacity: capacity, prime: prime,
+            compression_lambda: compression_lambda)
 
-        def initialize(capacity: 31, prime: 109345121, compression_lambda: nil, probe_lambda: nil)
-            super(capacity: capacity, prime: prime, compression_lambda: compression_lambda)
+      @probe_lambda = probe_lambda
 
-            @probe_lambda = if probe_lambda.nil?
-                                ->(h, i) { return (h + i) % @capacity }
-                            else
-                                probe_lambda
-                            end
-        end
+      return unless @probe_lambda.nil?
 
-        private
+      @probe_lambda = ->(h, i) { return (h + i) % @capacity }
+    end
 
-        Sentinel = Class.new do 
-            include Singleton
-        end
+    private
 
-        def bucket_find(hash_code, key)
-            idx = find_slot(hash_code, key)
-            
-            slot_available?(idx) ? nil : @table[idx].last
-        end
+    Sentinel = Class.new do
+      include Singleton
+    end
 
-        def bucket_insert(hash_code, key, value)
-            idx = find_slot(hash_code, key)
+    def bucket_find(hash_code, key)
+      idx = find_slot(hash_code, key)
 
-            if !slot_available?(idx)
-                old_value = @table[idx].last
-                @table[idx] = [key, value]
-                return old_value
-            end
-            
-            @table[idx] = [key, value]
-            @size += 1
+      slot_available?(idx) ? nil : @table[idx].last
+    end
 
-            nil
-        end
-        
-        def bucket_delete(hash_code, key)
-            idx = find_slot(hash_code, key)
-            return nil if slot_available?(idx)
+    def bucket_insert(hash_code, key, value)
+      idx = find_slot(hash_code, key)
 
-            value = @table[idx].last
-            @table[idx] = Sentinel.instance
-            @size -= 1
+      unless slot_available?(idx)
+        old_value = @table[idx].last
+        @table[idx] = [key, value]
+        return old_value
+      end
 
-            value
-        end
+      @table[idx] = [key, value]
+      @size += 1
+
+      nil
+    end
 
-        def bucket_each
-            @table.each do |elem|
-                next if elem.nil? || elem == Sentinel.instance
+    def bucket_delete(hash_code, key)
+      idx = find_slot(hash_code, key)
+      return nil if slot_available?(idx)
 
-                yield(elem.first, elem.last)
-            end
-        end
+      value = @table[idx].last
+      @table[idx] = Sentinel.instance
+      @size -= 1
 
-        def find_slot(h, key)
-            idx = -1
-
-            j = 0
-            loop do
-                i = @probe_lambda.call(h, j)
-                if slot_available?(i)
-                    idx = i if idx == -1
-                    break if @table[i].nil?
-                elsif @table[i].first == key
-                    return i
-                end
-                j += 1
-            end
-
-            idx
-        end
+      value
+    end
+
+    def bucket_each
+      @table.each do |elem|
+        next if elem.nil? || elem == Sentinel.instance
 
-        def slot_available?(i)
-            @table[i].nil? || @table[i] == Sentinel.instance
+        yield(elem.first, elem.last)
+      end
+    end
+
+    def find_slot(h, key)
+      idx = -1
+
+      j = 0
+      loop do
+        i = @probe_lambda.call(h, j)
+        if slot_available?(i)
+          idx = i if idx == -1
+          break if @table[i].nil?
+        elsif @table[i].first == key
+          return i
         end
+        j += 1
+      end
+
+      idx
+    end
+
+    def slot_available?(i)
+      @table[i].nil? || @table[i] == Sentinel.instance
     end
-end
+  end
+end

data/lib/data_structures_101/version.rb

@@ -1,3 +1,5 @@
+# frozen_string_literal: true
+
 module DataStructures101
-  VERSION = "0.2.5"
+  VERSION = '0.2.6'
 end

data/lib/data_structures_101.rb

@@ -1,10 +1,14 @@
-require "data_structures_101/version"
-require "data_structures_101/linked_list"
-require "data_structures_101/hash/base_hash_table"
-require "data_structures_101/hash/bucket"
-require "data_structures_101/chained_hash_table"
-require "data_structures_101/probe_hash_table"
+# frozen_string_literal: true
 
+require 'data_structures_101/version'
+require 'data_structures_101/linked_list'
+require 'data_structures_101/hash/base_hash_table'
+require 'data_structures_101/hash/bucket'
+require 'data_structures_101/chained_hash_table'
+require 'data_structures_101/probe_hash_table'
+
+# @author Rene Hernandez
+# @since 0.1
 module DataStructures101
   # Your code goes here...
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: data_structures_101
 version: !ruby/object:Gem::Version
-  version: 0.2.5
+  version: 0.2.6
 platform: ruby
 authors:
-- aegis
+- renehernandez
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2017-08-27 00:00:00.000000000 Z
+date: 2017-09-03 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler
@@ -52,6 +52,76 @@ dependencies:
     - - "~>"
       - !ruby/object:Gem::Version
         version: '3.5'
+- !ruby/object:Gem::Dependency
+  name: reek
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '4.7'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '4.7'
+- !ruby/object:Gem::Dependency
+  name: rubocop
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.49'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '0.49'
+- !ruby/object:Gem::Dependency
+  name: yard
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: redcarpet
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+- !ruby/object:Gem::Dependency
+  name: github-markup
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: '0'
 description: 
 email:
 - renehr9102@gmail.com
@@ -59,9 +129,12 @@ executables: []
 extensions: []
 extra_rdoc_files: []
 files:
+- ".editorconfig"
 - ".gitignore"
 - ".rspec"
+- ".rubocop.yml"
 - ".travis.yml"
+- ".yardopts"
 - Gemfile
 - LICENSE.txt
 - README.md
@@ -69,6 +142,7 @@ files:
 - _config.yml
 - bin/console
 - bin/setup
+- config.reek
 - data_structures_101.gemspec
 - lib/data_structures_101.rb
 - lib/data_structures_101/chained_hash_table.rb