algorithms 1.0.0 → 1.0.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 7cee1c06e078dc124212a3462d765d26ce5fbe16dd6b31ca6392388d8f51644c
-  data.tar.gz: 491e3540ee5567752d208bb7b8502d1ee998b55e9664c66b5cf5fc17394e10e7
+  metadata.gz: d542bb52d6a148cc95802bfc5d84549e605b7077009343496e51a00d405bed05
+  data.tar.gz: b66ba40d7c3b4d29f108294e2623f85c48f52f1cdcfa7282191ed412d1877cf5
 SHA512:
-  metadata.gz: a4a533a2053ae799f87df22b51ff93744e8128e0982239f3d6717bfb6f8ee8817d9c6ebffd6b4a2b478694a3f2f742fc4465eba242e5d2d0d23bfc0c881c1daa
-  data.tar.gz: 4ffaed30fc92fca18dd258102a702f8fceb1a77594ac6b086c627e1a3ab8ae1ad6650295acd0fb423a6ce441b6b7ab686bb56ae9ff937448d031f319d937a427
+  metadata.gz: 3bacbfc0793cce5bb67c51b33a64a6a4bb91e0d2cdfea661e5ee5721433bdbc19b723724ebb54e86289b053e71740dcd4c70a7e02fbed998015cd4fa31728f67
+  data.tar.gz: f2ec4934f51e631750aea36af36fb33a4b2dc0fee95ec1b138a8e97c75952b341f9f235e17a12868bb9233e88f6bb4bcfff0800e47fefe417712ee9167d389b1

data/README.markdown

@@ -1,4 +1,4 @@
-# algorithms [![Build Status](https://travis-ci.org/kanwei/algorithms.png)](https://travis-ci.org/kanwei/algorithms)
+# algorithms [![Build Status](https://travis-ci.org/kanwei/algorithms.svg?branch=master)](https://travis-ci.org/github/kanwei/algorithms)
 
 [API Documentation](http://kanwei.github.io/algorithms/)
 
@@ -8,7 +8,7 @@ Started as a [Google Summer of Code 2008](http://code.google.com/soc/2008/ruby/a
 
 Written by [Kanwei Li](http://kanwei.com/), mentored by Austin Ziegler
 
-### Original Proposal: ###
+## Original Proposal: ##
 
 Using the right data structure or algorithm for the situation is an important
 aspect of programming. In computer science literature, many data structures

data/algorithms.gemspec

@@ -2,12 +2,12 @@
 
 Gem::Specification.new do |s|
   s.name = "algorithms"
-  s.version = "1.0.0"
+  s.version = "1.0.1"
 
   s.authors = ["Kanwei Li"]
   s.email = "kanwei@gmail.com"
   s.license = 'MIT'
-  s.date = "2021-04-04"
+  s.date = "2023-11-11"
   s.summary = "Useful algorithms and data structures for Ruby. Optional C extensions."
   s.description = "Heap, Priority Queue, Deque, Stack, Queue, Red-Black Trees, Splay Trees, sorting algorithms, and more"
   if defined?(RUBY_ENGINE) && RUBY_ENGINE == 'jruby'

data/lib/containers/heap.rb

@@ -75,13 +75,6 @@ class Containers::Heap
     end
     @size += 1
     
-    arr = []
-    w = @next.right
-    until w == @next do
-      arr << w.value
-      w = w.right
-    end
-    arr << @next.value
     @stored[key] ||= []
     @stored[key] << node
     value

data/lib/containers/rb_tree_map.rb

@@ -15,7 +15,7 @@ require 'containers/stack'
     explicitly used as well; their functionality is identical.
     
     Most methods have O(log n) complexity.
-    
+
 =end
 class Containers::RubyRBTreeMap
   include Enumerable
@@ -160,7 +160,7 @@ class Containers::RubyRBTreeMap
     result
   end
   
-  # Deletes the item with the smallest key and returns the item. Returns nil
+  # Deletes the item with the largest key and returns the item. Returns nil
   # if key is not present.
   #
   # Complexity: O(log n)

data/lib/containers/suffix_array.rb

@@ -12,10 +12,10 @@ class Containers::SuffixArray
   #
   # Complexity: O(n^2 log n)
   #
-  #   s_array = Containers::SuffixArray("abracadabra")
+  #   s_array = Containers::SuffixArray.new("abracadabra")
   #   s_array["abra"] #=> true
   #
-  #   number = Containers::SuffixArray(1234567)
+  #   number = Containers::SuffixArray.new(1234567)
   #   number[1] #=> true
   #   number[13] #=> false 
   def initialize(string)
@@ -65,4 +65,4 @@ class Containers::SuffixArray
     return false
   end
   alias_method :[], :has_substring?
-end
+end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: algorithms
 version: !ruby/object:Gem::Version
-  version: 1.0.0
+  version: 1.0.1
 platform: ruby
 authors:
 - Kanwei Li
-autorequire: 
+autorequire:
 bindir: bin
 cert_chain: []
-date: 2021-04-04 00:00:00.000000000 Z
+date: 2023-11-11 00:00:00.000000000 Z
 dependencies: []
 description: Heap, Priority Queue, Deque, Stack, Queue, Red-Black Trees, Splay Trees,
   sorting algorithms, and more
@@ -78,7 +78,7 @@ homepage: https://github.com/kanwei/algorithms
 licenses:
 - MIT
 metadata: {}
-post_install_message: 
+post_install_message:
 rdoc_options:
 - "--line-numbers"
 - "--inline-source"
@@ -100,8 +100,8 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.1.2
-signing_key: 
+rubygems_version: 3.2.32
+signing_key:
 specification_version: 4
 summary: Useful algorithms and data structures for Ruby. Optional C extensions.
 test_files: []