lilutils 0.0.1 → 0.0.2

data/Gemfile

@@ -0,0 +1,14 @@
+source "http://rubygems.org"
+# Add dependencies required to use your gem here.
+# Example:
+#   gem "activesupport", ">= 2.3.5"
+
+# Add dependencies to develop your gem here.
+# Include everything needed to run rake, tests, features, etc.
+group :development do
+  gem "shoulda", ">= 0"
+  gem "bundler", "~> 1.0.0"
+  gem "jeweler", "~> 1.5.2"
+  gem "rcov", ">= 0"
+  gem "test-unit"
+end

data/Gemfile.lock

@@ -0,0 +1,22 @@
+GEM
+  remote: http://rubygems.org/
+  specs:
+    git (1.2.5)
+    jeweler (1.5.2)
+      bundler (~> 1.0.0)
+      git (>= 1.2.5)
+      rake
+    rake (0.8.7)
+    rcov (0.9.9)
+    shoulda (2.11.3)
+    test-unit (2.1.2)
+
+PLATFORMS
+  ruby
+
+DEPENDENCIES
+  bundler (~> 1.0.0)
+  jeweler (~> 1.5.2)
+  rcov
+  shoulda
+  test-unit

data/History.txt

@@ -1,3 +1,9 @@
+=== 0.0.2
+  * Utility to test whether an array is in order. The comparator is defined by the block.
+  * Utility to find out the sandwiching indexes for an element in a given collection that is supposed to be sorted.
+  * Utility to generate random strings of specified length.
+  * Utility to generate k integers (each e of which is such that 0 <= e < n) in sorted manner. The recipe is in Jon Bentley's 
+    Programming Pearls.
 === 0.0.1 2011-02-08
 
 * 1 major enhancement:

data/Rakefile

@@ -13,6 +13,7 @@ require 'jeweler'
 Jeweler::Tasks.new do |gem|
   # gem is a Gem::Specification... see http://docs.rubygems.org/read/chapter/20 for more options
   gem.name = "lilutils"
+  gem.version = "0.0.2"
   gem.homepage = "http://github.com/kedarmhaswade/lilutils"
   gem.license = "MIT"
   gem.summary = %Q{Little utilities for everyone}

data/VERSION

@@ -0,0 +1 @@
+0.0.1

data/lib/lilutils/algo_test_utils/data_sets.rb

@@ -11,8 +11,8 @@ module LilUtils
       # The length of each string is determined by the parameter passed.
       # The characters that can appear in returned strings are defined by
       # the {#ALPHABET}.
-      # @param howmany [Integer] How many random strings do you need?
-      # @param rest [Integer] Optional arguments. First argument should be the length of
+      # @param [Integer] howmany How many random strings do you need?
+      # @param [Integer] rest Optional arguments. First argument should be the length of
       # each string in returned set. If unspecified, this is calculated from first
       # argument, howmany, such that the length is enough to generate strings from the
       # entire ALPHABET.
@@ -28,6 +28,41 @@ module LilUtils
         strings
       end
 
+      # Returns an array of k randomly chosen numbers between [0, n) where each number will be chosen with
+      # equal probability. Note that returned array will be sorted. The algorithm is taken from Jon Bentley's excellent
+      # Programming Pearls. To make the method to what you mean, both select_random(n, k) and select_random(k, n) do
+      # the same thing, i.e. return an array of size k, each element of array is between 0 and n-1.
+      # @param [Integer] k the number of numbers to choose. May not be > n
+      # @param [Integer] n the upper limit, never included in returned array
+      # @return [Array] Integer array of size k such that 0 <= Array[i] < n for all 0 <=i <= k
+      # @see #random_enumerator
+      def self.select_random_array(k, n)
+        a = []
+        random_enumerator(k, n).each {|random_selection| a << random_selection}
+        a
+      end
+
+      def self.select_random_array_to_file(k, n, file)
+        File.open(file, "w") do |f|
+          random_enumerator(k, n).each {|random_selection| f.puts random_selection}
+        end
+      end
+
+      def self.random_enumerator(k, n)
+        k <= n ? (select, remaining = k, n) : (select, remaining = n, k)
+        raise ArgumentError, "k, n should be non-negative" if k < 0 or n < 0
+        Enumerator.new do |yielder|
+          big = 1 << 32 # 4B is a big number?
+          0.upto(n-1) do |num|
+            if ((rand(big) % remaining) < select)
+              yielder.yield num
+              select -= 1
+            end
+            remaining -= 1
+          end
+        end
+      end
+
       private
 
       def self.get_ascii_string(length)

data/lib/lilutils/algo_test_utils_entry.rb

@@ -1,4 +1,4 @@
 # used to include code from all of the algo_test_utils classes
 # Add a line here when you add a new class that should be available to clients. Then, clients can just
 # require this one file.
-require 'lilutils/algo_test_utils/data_sets'
+require File.dirname(__FILE__) + '/algo_test_utils/data_sets'

data/lib/lilutils/misc/binary_search.rb

@@ -0,0 +1,43 @@
+module LilUtils
+  module Misc
+    module BinarySearch
+
+      def self.sandwiching_indexes_for(value, array, fi=0, li=array.length-1, check_if_in_order=true)
+        # it is __not__ assumed that the array is sorted, we skip the check if we are asked to
+        if check_if_in_order
+          raise ArgumentError, "Unordered array provided to this routine based on binary search" unless in_order? array
+        end
+        # make other checks
+        while true
+          i = fi + (li-fi+1)/2 # Google "nearly all binary searches are broken"
+          return [i, i] if array[i] == value
+          return [fi, li] if (fi+1) >= li and value >= array[fi] and value <=array[li]
+          return [fi-1, fi] if (fi+1) >= li and value <= array[fi]
+          return [li, li+1] if (fi+1) >= li and value >= array[fi]
+          value < array[i] ? li = i : fi = i
+          #puts "fi=#{fi}, li=#{li}"
+        end
+      end
+
+      def self.in_order?(array, &block)
+        block = Proc.new {|x, y| x <=> y} unless block_given?
+        old_order = new_order = 0
+        array.each_cons(2) do |a|
+          new_order = block.call(a[0], a[1])
+          return false if (new_order > 0 and old_order < 0) or (new_order < 0 and old_order > 0)
+          old_order = new_order if new_order != 0
+        end
+        true
+      end
+    end
+  end
+end
+#puts LilUtils::Misc::BinarySearch.in_order? ["rujuta", "kedar", "deepa", "apoorv"] {|x, y| x.length <=> y.length}
+#puts LilUtils::Misc::BinarySearch.in_order? ["rujuta", "kedar", "apoorv", "deepa"]
+#puts LilUtils::Misc::BinarySearch.in_order? ["rujuta", "kedar", "deepa", "apoorv"]
+#puts LilUtils::Misc::BinarySearch.in_order? [6, 5, 5, 4]
+#puts LilUtils::Misc::BinarySearch.in_order? [2, 1]
+#puts LilUtils::Misc::BinarySearch.in_order? [1]
+#puts LilUtils::Misc::BinarySearch.in_order? [1, 2]
+#puts LilUtils::Misc::BinarySearch.sandwiching_indexes_for(25.2, [1, 4, 8, 8, 9, 12, 15, 23.4, 44])
+#puts LilUtils::Misc::BinarySearch.sandwiching_indexes_for(0, [1])

data/lib/lilutils/misc/pascal.rb

@@ -3,15 +3,17 @@ module LilUtils
     module Pascal
       # Returns the nth row of the Pascal's triangle as an array of n+1 elements.
       # This is an O(n) algorithm. Uses: nCr = nCr-1*(n-r+1)/r which calculates
+      # an element using the previous element (which is already initialized or
+      # calculated). Thus, it does not throw away any computation. The constant
+      # factors of this alogirthm are also good (~0.5).
       # @param [Integer] n starts at 1
       # @return [Array] of Integers representing numbers in given row.
       def self.row(n)
         raise ArgumentError, "#{n} is not valid" if !n.is_a?(Integer) || n < 1
         len = n == 1 ? 1 : n + 1
-        a = Array.new(len); a[0] = a[-1] = 1
+        a = Array.new(len); a[0] = a[-1] = 1 # by definition
         1.upto n/2 do |r|
           a[r] = a[-r-1] = a[r-1] * (n-r+1)/r
-          r += 1
         end
         a
       end

data/lib/lilutils/misc_entry.rb

@@ -1,5 +1,5 @@
 # used to include code from all of the misc classes
 # Add a line here when you add a new class that should be available to clients. Then, clients can just
 # require this one file.
-require 'lilutils/misc/misc'
-require 'lilutils/misc/pascal'
+require File.dirname(__FILE__) + '/misc/pascal'
+require File.dirname(__FILE__) + '/misc/binary_search'

data/lilutils.gemspec

@@ -0,0 +1,88 @@
+# Generated by jeweler
+# DO NOT EDIT THIS FILE DIRECTLY
+# Instead, edit Jeweler::Tasks in Rakefile, and run 'rake gemspec'
+# -*- encoding: utf-8 -*-
+
+Gem::Specification.new do |s|
+  s.name = %q{lilutils}
+  s.version = "0.0.2"
+
+  s.required_rubygems_version = Gem::Requirement.new(">= 0") if s.respond_to? :required_rubygems_version=
+  s.authors = ["Kedar Mhaswade"]
+  s.date = %q{2011-03-12}
+  s.default_executable = %q{cli-demo}
+  s.description = %q{Provides little utilties. It's a gem by a newbie, but I think it is quite useful. As of now, it provides a nicely abstracted out yes/no/cancel dialog box on a console.}
+  s.email = %q{kedar.mhaswade@gmail.com}
+  s.executables = ["cli-demo"]
+  s.extra_rdoc_files = [
+    "README.rdoc"
+  ]
+  s.files = [
+    "Gemfile",
+    "Gemfile.lock",
+    "History.txt",
+    "Manifest.txt",
+    "PostInstall.txt",
+    "README.rdoc",
+    "Rakefile",
+    "VERSION",
+    "bin/cli-demo",
+    "lib/lilutils.rb",
+    "lib/lilutils/algo_test_utils/data_sets.rb",
+    "lib/lilutils/algo_test_utils_entry.rb",
+    "lib/lilutils/cli/cli.rb",
+    "lib/lilutils/cli_entry.rb",
+    "lib/lilutils/misc/binary_search.rb",
+    "lib/lilutils/misc/misc.rb",
+    "lib/lilutils/misc/pascal.rb",
+    "lib/lilutils/misc_entry.rb",
+    "lilutils.gemspec",
+    "script/console",
+    "script/destroy",
+    "script/generate",
+    "test/algo_test_utils/data_sets_test.rb",
+    "test/cli/cli_basic_test.rb",
+    "test/misc/binary_search_test.rb",
+    "test/misc/misc_pascal_test.rb",
+    "test/test_helper.rb",
+    "test/test_lilutils.rb"
+  ]
+  s.homepage = %q{http://github.com/kedarmhaswade/lilutils}
+  s.licenses = ["MIT"]
+  s.require_paths = ["lib"]
+  s.rubygems_version = %q{1.6.2}
+  s.summary = %q{Little utilities for everyone}
+  s.test_files = [
+    "test/algo_test_utils/data_sets_test.rb",
+    "test/cli/cli_basic_test.rb",
+    "test/misc/binary_search_test.rb",
+    "test/misc/misc_pascal_test.rb",
+    "test/test_helper.rb",
+    "test/test_lilutils.rb"
+  ]
+
+  if s.respond_to? :specification_version then
+    s.specification_version = 3
+
+    if Gem::Version.new(Gem::VERSION) >= Gem::Version.new('1.2.0') then
+      s.add_development_dependency(%q<shoulda>, [">= 0"])
+      s.add_development_dependency(%q<bundler>, ["~> 1.0.0"])
+      s.add_development_dependency(%q<jeweler>, ["~> 1.5.2"])
+      s.add_development_dependency(%q<rcov>, [">= 0"])
+      s.add_development_dependency(%q<test-unit>, [">= 0"])
+    else
+      s.add_dependency(%q<shoulda>, [">= 0"])
+      s.add_dependency(%q<bundler>, ["~> 1.0.0"])
+      s.add_dependency(%q<jeweler>, ["~> 1.5.2"])
+      s.add_dependency(%q<rcov>, [">= 0"])
+      s.add_dependency(%q<test-unit>, [">= 0"])
+    end
+  else
+    s.add_dependency(%q<shoulda>, [">= 0"])
+    s.add_dependency(%q<bundler>, ["~> 1.0.0"])
+    s.add_dependency(%q<jeweler>, ["~> 1.5.2"])
+    s.add_dependency(%q<rcov>, [">= 0"])
+    s.add_dependency(%q<test-unit>, [">= 0"])
+  end
+end
+

data/test/algo_test_utils/data_sets_test.rb

@@ -1,5 +1,6 @@
 require "test/unit"
-require "lilutils/algo_test_utils/data_sets"
+require "minitest/unit"
+require File.dirname(__FILE__) + '/../../lib/lilutils/algo_test_utils/data_sets'
 
 class DataSetsTest < Test::Unit::TestCase
 
@@ -9,4 +10,23 @@ class DataSetsTest < Test::Unit::TestCase
     strs = DS.ascii_strings(100, 5)
     assert_equal(100, strs.size)
   end
+
+  def test_select_random_array
+    assert_equal((0...5).to_a, DS.select_random_array(5, 5))
+  end
+
+  def test_select_random_array_1_of_4
+    a0, a1, a2, a3 = [0, 1, 2], [0, 1, 3], [0, 2, 3], [1, 2, 3]
+    probables = [a0, a1, a2, a3]
+    actual = DS.select_random_array(3, 4)
+    assert_true(probables.member? actual)
+  end
+
+  def test_select_random_array_to_file
+    require 'tmpdir'
+    fn = File.join(Dir.tmpdir, "foo")
+    DS.select_random_array_to_file(1_000, 10_000, fn)
+#    DS.select_random_array_to_file(1_000_000, 10_000_000, fn)
+    File.delete(fn)
+  end
 end

data/test/misc/binary_search_test.rb

@@ -0,0 +1,37 @@
+require "test/unit"
+require File.dirname(__FILE__) + '/../../lib/lilutils/misc_entry'
+require File.dirname(__FILE__) + '/../../lib/lilutils/algo_test_utils_entry'
+
+class BinarySearchTest < Test::Unit::TestCase
+
+  # Called before every test method runs. Can be used
+  # to set up fixture information.
+  def setup
+    # Do nothing
+  end
+
+  # Called after every test method runs. Can be used to tear
+  # down fixture information.
+
+  def teardown
+    # Do nothing
+  end
+  BinarySearch = LilUtils::Misc::BinarySearch
+  def test_1_numbers_in_order?
+    a = []
+    1.upto(100_000) { |n| a << n}
+    assert_equal(true, BinarySearch.in_order?(a))
+    a << -1 # now they are unsorted
+    assert_equal(false, BinarySearch.in_order?(a))
+  end
+
+  def test_sandwich_1
+    a = []
+    0.upto(999) {|x| a << x} # a 1000 element array with a[i] = i
+    assert_equal([-1, 0], BinarySearch.sandwiching_indexes_for(-1, a))
+    assert_equal([999, 1000], BinarySearch.sandwiching_indexes_for(1001, a))
+    assert_equal([499, 500], BinarySearch.sandwiching_indexes_for(499.4, a))
+    assert_equal([2, 2], BinarySearch.sandwiching_indexes_for(2, a))
+    assert_equal([22, 22], BinarySearch.sandwiching_indexes_for(22.0, a))
+  end
+end

data/test/test_lilutils.rb

@@ -2,6 +2,7 @@ require 'test_helper'
 require 'cli/cli_basic_test'
 require 'algo_test_utils/data_sets_test'
 require 'misc/misc_pascal_test'
+require 'misc/binary_search_test'
 
 class TestLilutils < Test::Unit::TestCase
 

metadata

@@ -1,145 +1,143 @@
---- !ruby/object:Gem::Specification 
+--- !ruby/object:Gem::Specification
 name: lilutils
-version: !ruby/object:Gem::Version 
-  prerelease: false
-  segments: 
-  - 0
-  - 0
-  - 1
-  version: 0.0.1
+version: !ruby/object:Gem::Version
+  version: 0.0.2
+  prerelease: 
 platform: ruby
-authors: 
+authors:
 - Kedar Mhaswade
 autorequire: 
 bindir: bin
 cert_chain: []
-
-date: 2011-02-08 00:00:00 -08:00
+date: 2011-03-12 00:00:00.000000000 -08:00
 default_executable: cli-demo
-dependencies: 
-- !ruby/object:Gem::Dependency 
+dependencies:
+- !ruby/object:Gem::Dependency
   name: shoulda
-  requirement: &id001 !ruby/object:Gem::Requirement 
+  requirement: &15751660 !ruby/object:Gem::Requirement
     none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 0
-        version: "0"
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
   type: :development
   prerelease: false
-  version_requirements: *id001
-- !ruby/object:Gem::Dependency 
+  version_requirements: *15751660
+- !ruby/object:Gem::Dependency
   name: bundler
-  requirement: &id002 !ruby/object:Gem::Requirement 
+  requirement: &15750340 !ruby/object:Gem::Requirement
     none: false
-    requirements: 
+    requirements:
     - - ~>
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 1
-        - 0
-        - 0
+      - !ruby/object:Gem::Version
         version: 1.0.0
   type: :development
   prerelease: false
-  version_requirements: *id002
-- !ruby/object:Gem::Dependency 
+  version_requirements: *15750340
+- !ruby/object:Gem::Dependency
   name: jeweler
-  requirement: &id003 !ruby/object:Gem::Requirement 
+  requirement: &15748560 !ruby/object:Gem::Requirement
     none: false
-    requirements: 
+    requirements:
     - - ~>
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 1
-        - 5
-        - 2
+      - !ruby/object:Gem::Version
         version: 1.5.2
   type: :development
   prerelease: false
-  version_requirements: *id003
-- !ruby/object:Gem::Dependency 
+  version_requirements: *15748560
+- !ruby/object:Gem::Dependency
   name: rcov
-  requirement: &id004 !ruby/object:Gem::Requirement 
+  requirement: &15502600 !ruby/object:Gem::Requirement
     none: false
-    requirements: 
-    - - ">="
-      - !ruby/object:Gem::Version 
-        segments: 
-        - 0
-        version: "0"
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
   type: :development
   prerelease: false
-  version_requirements: *id004
-description: Provides little utilties. It's a gem by a newbie, but I think it is quite useful. As of now, it provides a nicely abstracted out yes/no/cancel dialog box on a console.
+  version_requirements: *15502600
+- !ruby/object:Gem::Dependency
+  name: test-unit
+  requirement: &15497500 !ruby/object:Gem::Requirement
+    none: false
+    requirements:
+    - - ! '>='
+      - !ruby/object:Gem::Version
+        version: '0'
+  type: :development
+  prerelease: false
+  version_requirements: *15497500
+description: Provides little utilties. It's a gem by a newbie, but I think it is quite
+  useful. As of now, it provides a nicely abstracted out yes/no/cancel dialog box
+  on a console.
 email: kedar.mhaswade@gmail.com
-executables: 
+executables:
 - cli-demo
 extensions: []
-
-extra_rdoc_files: 
+extra_rdoc_files:
 - README.rdoc
-files: 
+files:
+- Gemfile
+- Gemfile.lock
 - History.txt
 - Manifest.txt
 - PostInstall.txt
 - README.rdoc
 - Rakefile
+- VERSION
 - bin/cli-demo
 - lib/lilutils.rb
 - lib/lilutils/algo_test_utils/data_sets.rb
 - lib/lilutils/algo_test_utils_entry.rb
 - lib/lilutils/cli/cli.rb
 - lib/lilutils/cli_entry.rb
+- lib/lilutils/misc/binary_search.rb
 - lib/lilutils/misc/misc.rb
 - lib/lilutils/misc/pascal.rb
 - lib/lilutils/misc_entry.rb
+- lilutils.gemspec
 - script/console
 - script/destroy
 - script/generate
 - test/algo_test_utils/data_sets_test.rb
 - test/cli/cli_basic_test.rb
+- test/misc/binary_search_test.rb
 - test/misc/misc_pascal_test.rb
 - test/test_helper.rb
 - test/test_lilutils.rb
 has_rdoc: true
 homepage: http://github.com/kedarmhaswade/lilutils
-licenses: 
+licenses:
 - MIT
 post_install_message: 
 rdoc_options: []
-
-require_paths: 
+require_paths:
 - lib
-required_ruby_version: !ruby/object:Gem::Requirement 
+required_ruby_version: !ruby/object:Gem::Requirement
   none: false
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      hash: -896547783063548006
-      segments: 
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
+      segments:
       - 0
-      version: "0"
-required_rubygems_version: !ruby/object:Gem::Requirement 
+      hash: -890236444021516907
+required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
-  requirements: 
-  - - ">="
-    - !ruby/object:Gem::Version 
-      segments: 
-      - 0
-      version: "0"
+  requirements:
+  - - ! '>='
+    - !ruby/object:Gem::Version
+      version: '0'
 requirements: []
-
 rubyforge_project: 
-rubygems_version: 1.3.7
+rubygems_version: 1.6.2
 signing_key: 
 specification_version: 3
 summary: Little utilities for everyone
-test_files: 
+test_files:
 - test/algo_test_utils/data_sets_test.rb
 - test/cli/cli_basic_test.rb
+- test/misc/binary_search_test.rb
 - test/misc/misc_pascal_test.rb
 - test/test_helper.rb
 - test/test_lilutils.rb