alib 0.3.1 → 0.4.0

data/a.rb

@@ -0,0 +1 @@
+IO.popen('-'){|pipe| puts(pipe ? pipe.read : 42)}

data/b.rb

@@ -0,0 +1 @@
+class C; end

data/gemspec.rb

@@ -0,0 +1,23 @@
+lib, version = File::basename(File::dirname(File::expand_path(__FILE__))).split %r/-/, 2
+
+require 'rubygems'
+
+Gem::Specification::new do |spec|
+  spec.name = lib 
+  spec.version = version 
+  spec.platform = Gem::Platform::RUBY
+  spec.summary = lib 
+
+  spec.files = Dir::glob "**/**"
+  spec.executables = Dir::glob("bin/*").map{|exe| File::basename exe}
+  
+  spec.require_path = "lib" 
+  spec.autorequire = lib
+
+  spec.has_rdoc = File::exist? "doc" 
+  spec.test_suite_file = "test/#{ lib }.rb" if File::directory? "test"
+
+  spec.author = "Ara T. Howard"
+  spec.email = "ara.t.howard@noaa.gov"
+  spec.homepage = "http://codeforpeople.com/lib/ruby/#{ lib }/"
+end

data/install

@@ -0,0 +1,143 @@
+#!/usr/bin/env ruby
+require 'rbconfig'
+require 'find'
+require 'ftools'
+require 'tempfile'
+include Config
+
+LIBDIR      = "lib"
+LIBDIR_MODE = 0644
+
+BINDIR      = "bin"
+BINDIR_MODE = 0755
+
+
+$srcdir            = CONFIG["srcdir"]
+$version           = CONFIG["MAJOR"]+"."+CONFIG["MINOR"]
+$libdir            = File.join(CONFIG["libdir"], "ruby", $version)
+$archdir           = File.join($libdir, CONFIG["arch"])
+$site_libdir       = $:.find {|x| x =~ /site_ruby$/}
+$bindir            = CONFIG["bindir"]
+$ruby_install_name = CONFIG['ruby_install_name'] || CONFIG['RUBY_INSTALL_NAME']
+$ruby              = File.join($bindir, $ruby_install_name || 'ruby')
+
+if !$site_libdir
+  $site_libdir = File.join($libdir, "site_ruby")
+elsif $site_libdir !~ %r/#{Regexp.quote($version)}/
+  $site_libdir = File.join($site_libdir, $version)
+end
+
+def install_rb(srcdir=nil, destdir=nil, mode=nil, bin=nil)
+#{{{
+  path   = []
+  dir    = []
+  Find.find(srcdir) do |f|
+    next unless FileTest.file?(f)
+    next if (f = f[srcdir.length+1..-1]) == nil
+    next if (/CVS$/ =~ File.dirname(f))
+    path.push f
+    dir |= [File.dirname(f)]
+  end
+  for f in dir
+    next if f == "."
+    next if f == "CVS"
+    File::makedirs(File.join(destdir, f))
+  end
+  for f in path
+    next if (/\~$/ =~ f)
+    next if (/^\./ =~ File.basename(f))
+    unless bin
+      File::install(File.join(srcdir, f), File.join(destdir, f), mode, true)
+    else
+      from = File.join(srcdir, f)
+      to = File.join(destdir, f)
+      shebangify(from) do |sf|
+        $deferr.print from, " -> ", File::catname(from, to), "\n"
+        $deferr.printf "chmod %04o %s\n", mode, to 
+        File::install(sf, to, mode, false)
+      end
+    end
+  end
+#}}}
+end
+def shebangify f
+#{{{
+  open(f) do |fd|
+    buf = fd.read 42 
+    if buf =~ %r/^\s*#\s*!.*ruby/o
+      ftmp = Tempfile::new("#{ $$ }_#{ File::basename(f) }")
+      begin
+        fd.rewind
+        ftmp.puts "#!#{ $ruby  }"
+        while((buf = fd.read(8192)))
+          ftmp.write buf
+        end
+        ftmp.close
+        yield ftmp.path
+      ensure
+        ftmp.close!
+      end
+    else
+      yield f
+    end
+  end
+#}}}
+end
+def ARGV.switch
+#{{{
+  return nil if self.empty?
+  arg = self.shift
+  return nil if arg == '--'
+  if arg =~ /^-(.)(.*)/
+    return arg if $1 == '-'
+    raise 'unknown switch "-"' if $2.index('-')
+    self.unshift "-#{$2}" if $2.size > 0
+    "-#{$1}"
+  else
+    self.unshift arg
+    nil
+  end
+#}}}
+end
+def ARGV.req_arg
+#{{{
+  self.shift || raise('missing argument')
+#}}}
+end
+
+
+#
+# main program
+#
+
+libdir = $site_libdir
+bindir = $bindir
+
+begin
+  while switch = ARGV.switch
+    case switch
+    when '-d', '--destdir'
+      libdir = ARGV.req_arg
+    when '-l', '--libdir'
+      libdir = ARGV.req_arg
+    when '-b', '--bindir'
+      bindir = ARGV.req_arg
+    when '-r', '--ruby'
+      $ruby = ARGV.req_arg
+    else
+      raise "unknown switch #{switch.dump}"
+    end
+  end
+rescue
+  STDERR.puts $!.to_s
+  STDERR.puts File.basename($0) + 
+    " -d <destdir>" +
+    " -l <libdir>" +
+    " -b <bindir>"
+    " -r <ruby>"
+  exit 1
+end    
+
+install_rb(LIBDIR, libdir, LIBDIR_MODE)
+install_rb(BINDIR, bindir, BINDIR_MODE, bin=true)
+

data/install.rb

@@ -0,0 +1,143 @@
+#!/usr/bin/env ruby
+require 'rbconfig'
+require 'find'
+require 'ftools'
+require 'tempfile'
+include Config
+
+LIBDIR      = "lib"
+LIBDIR_MODE = 0644
+
+BINDIR      = "bin"
+BINDIR_MODE = 0755
+
+
+$srcdir            = CONFIG["srcdir"]
+$version           = CONFIG["MAJOR"]+"."+CONFIG["MINOR"]
+$libdir            = File.join(CONFIG["libdir"], "ruby", $version)
+$archdir           = File.join($libdir, CONFIG["arch"])
+$site_libdir       = $:.find {|x| x =~ /site_ruby$/}
+$bindir            = CONFIG["bindir"]
+$ruby_install_name = CONFIG['ruby_install_name'] || CONFIG['RUBY_INSTALL_NAME']
+$ruby              = File.join($bindir, $ruby_install_name || 'ruby')
+
+if !$site_libdir
+  $site_libdir = File.join($libdir, "site_ruby")
+elsif $site_libdir !~ %r/#{Regexp.quote($version)}/
+  $site_libdir = File.join($site_libdir, $version)
+end
+
+def install_rb(srcdir=nil, destdir=nil, mode=nil, bin=nil)
+#{{{
+  path   = []
+  dir    = []
+  Find.find(srcdir) do |f|
+    next unless FileTest.file?(f)
+    next if (f = f[srcdir.length+1..-1]) == nil
+    next if (/CVS$/ =~ File.dirname(f))
+    path.push f
+    dir |= [File.dirname(f)]
+  end
+  for f in dir
+    next if f == "."
+    next if f == "CVS"
+    File::makedirs(File.join(destdir, f))
+  end
+  for f in path
+    next if (/\~$/ =~ f)
+    next if (/^\./ =~ File.basename(f))
+    unless bin
+      File::install(File.join(srcdir, f), File.join(destdir, f), mode, true)
+    else
+      from = File.join(srcdir, f)
+      to = File.join(destdir, f)
+      shebangify(from) do |sf|
+        $deferr.print from, " -> ", File::catname(from, to), "\n"
+        $deferr.printf "chmod %04o %s\n", mode, to 
+        File::install(sf, to, mode, false)
+      end
+    end
+  end
+#}}}
+end
+def shebangify f
+#{{{
+  open(f) do |fd|
+    buf = fd.read 42 
+    if buf =~ %r/^\s*#\s*!.*ruby/o
+      ftmp = Tempfile::new("#{ $$ }_#{ File::basename(f) }")
+      begin
+        fd.rewind
+        ftmp.puts "#!#{ $ruby  }"
+        while((buf = fd.read(8192)))
+          ftmp.write buf
+        end
+        ftmp.close
+        yield ftmp.path
+      ensure
+        ftmp.close!
+      end
+    else
+      yield f
+    end
+  end
+#}}}
+end
+def ARGV.switch
+#{{{
+  return nil if self.empty?
+  arg = self.shift
+  return nil if arg == '--'
+  if arg =~ /^-(.)(.*)/
+    return arg if $1 == '-'
+    raise 'unknown switch "-"' if $2.index('-')
+    self.unshift "-#{$2}" if $2.size > 0
+    "-#{$1}"
+  else
+    self.unshift arg
+    nil
+  end
+#}}}
+end
+def ARGV.req_arg
+#{{{
+  self.shift || raise('missing argument')
+#}}}
+end
+
+
+#
+# main program
+#
+
+libdir = $site_libdir
+bindir = $bindir
+
+begin
+  while switch = ARGV.switch
+    case switch
+    when '-d', '--destdir'
+      libdir = ARGV.req_arg
+    when '-l', '--libdir'
+      libdir = ARGV.req_arg
+    when '-b', '--bindir'
+      bindir = ARGV.req_arg
+    when '-r', '--ruby'
+      $ruby = ARGV.req_arg
+    else
+      raise "unknown switch #{switch.dump}"
+    end
+  end
+rescue
+  STDERR.puts $!.to_s
+  STDERR.puts File.basename($0) + 
+    " -d <destdir>" +
+    " -l <libdir>" +
+    " -b <bindir>"
+    " -r <ruby>"
+  exit 1
+end    
+
+install_rb(LIBDIR, libdir, LIBDIR_MODE)
+install_rb(BINDIR, bindir, BINDIR_MODE, bin=true)
+

data/lib/alib-0.4.0.rb

@@ -0,0 +1,104 @@
+#
+# the ALib module is a namespace for things i've found useful
+#
+module ALib
+#--{{{
+  VERSION = '0.4.0'
+
+  def self.version() VERSION end
+
+  require 'pathname'
+  require 'socket'
+  require 'tmpdir'
+  require 'rbconfig'
+  require 'logger'
+  require 'yaml'
+  require 'fileutils'
+  require 'tempfile'
+  require 'optparse'
+  require 'sync'
+  require 'time'
+  require 'fcntl'
+  require 'uri'
+  require 'net/http'
+
+
+# TODO - bundle open4!!
+
+  LIBDIR = 'alib-%s/' % VERSION
+
+  AUTOLOAD = {
+
+    'Util'             => 'util',
+
+    'Logging'          => 'logging',
+
+    'ConfigFile'       => 'configfile',
+    'Configfile'       => 'configfile',
+
+    'ListFile'         => 'listfile',
+    'Listfile'         => 'listfile',
+
+    'AutoHash'         => 'autohash',
+
+    'OrderedHash'      => 'orderedhash',
+
+    'OrderedAutoHash'  => 'orderedautohash',
+    'AutoOrderedHash'  => 'orderedautohash',
+
+    'Find'             => 'find2',
+    'Find2'            => 'find2',
+
+    'Bsearch'          => 'bsearch',
+
+    'AbstractMain'     => 'main',
+    'SimpleMain'       => 'main',
+    'ConfigurableMain' => 'main',
+
+  }
+
+  AUTOLOAD.each{|const, basename| autoload const.to_s, LIBDIR + basename.to_s}
+
+  METACLASS = 
+    class << self
+      self
+    end
+
+  AUTOLOAD.each{ |const, m| METACLASS.module_eval{ define_method(m){ ALib.send 'const_get', const}}}
+
+  begin
+    require 'open4'
+  rescue LoadError
+    require LIBDIR + 'open4'
+  end
+
+  class << self
+#--{{{
+    def load basename 
+#--{{{
+      require LIBDIR + basename.to_s
+#--}}}
+    end
+    def simple_main &b
+#--{{{
+      b ? Class::new(ALib::SimpleMain, &b) : ALib::SimpleMain
+#--}}}
+    end
+    alias_method 'main', 'simple_main'
+    alias_method 'smain', 'simple_main'
+    def configurable_main &b
+#--{{{
+      b ? Class::new(ALib::ConfigurableMain, &b) : ALib::ConfigurableMain
+#--}}}
+    end
+    alias_method 'cmain', 'configurable_main'
+#--}}}
+  end
+#--}}}
+end
+
+Alib = ALib
+
+class Object
+  def alib() Alib end
+end

data/lib/alib-0.4.0/autohash.rb

@@ -0,0 +1,11 @@
+#
+# auto vivifying hash that dumps as yaml nicely
+#
+class ALib::AutoHash < ::Hash 
+  def initialize(*args)
+    super(*args){|a,k| a[k] = AutoHash::new(*args)}
+  end
+  def class
+    Hash
+  end
+end # class AutoHash

data/lib/alib-0.4.0/bsearch.rb

@@ -0,0 +1,255 @@
+#
+# Ruby/Bsearch - a binary search library for Ruby.
+#
+# Copyright (C) 2001 Satoru Takabayashi <satoru@namazu.org>
+#     All rights reserved.
+#     This is free software with ABSOLUTELY NO WARRANTY.
+#
+# You can redistribute it and/or modify it under the terms of 
+# the Ruby's licence.
+#
+# Example:
+#
+#  % irb -r ./bsearch.rb
+#  >> %w(a b c c c d e f).bsearch_first {|x| x <=> "c"}
+#  => 2
+#  >> %w(a b c c c d e f).bsearch_last {|x| x <=> "c"}
+#  => 4
+#  >> %w(a b c e f).bsearch_first {|x| x <=> "c"}
+#  => 2
+#  >> %w(a b e f).bsearch_first {|x| x <=> "c"}
+#  => nil
+#  >> %w(a b e f).bsearch_last {|x| x <=> "c"}
+#  => nil
+#  >> %w(a b e f).bsearch_lower_boundary {|x| x <=> "c"}
+#  => 2
+#  >> %w(a b e f).bsearch_upper_boundary {|x| x <=> "c"}
+#  => 2
+#  >> %w(a b c c c d e f).bsearch_range {|x| x <=> "c"}
+#  => 2...5
+#  >> %w(a b c d e f).bsearch_range {|x| x <=> "c"}
+#  => 2...3
+#  >> %w(a b d e f).bsearch_range {|x| x <=> "c"}
+#  => 2...2
+
+module ALib::Bsearch
+#--{{{
+  VERSION = '1.5'
+
+  module BsearchMethods
+#--{{{
+  # 
+  # The binary search algorithm is extracted from Jon Bentley's
+  # Programming Pearls 2nd ed. p.93
+  #
+
+  #
+  # Return the lower boundary. (inside)
+  #
+# old
+    def bsearch_lower_boundary (range = 0 ... self.length, &block)
+#--{{{
+      lower  = range.first() -1
+      upper = if range.exclude_end? then range.last else range.last + 1 end
+      while lower + 1 != upper
+        mid = ((lower + upper) / 2).to_i # for working with mathn.rb (Rational)
+        if yield(self[mid]) < 0
+      lower = mid
+        else 
+      upper = mid
+        end
+      end
+      return upper
+#--}}}
+    end
+# new 
+    def bsearch_lower_boundary (arg = nil, &block)
+#--{{{
+      range = nil
+      if arg and not block
+        block = lambda{|x| x <=> arg}
+        range = 0 ... self.length
+      end
+      range ||= (arg ? arg : (0...self.length))
+
+      lower  = range.first() -1
+      upper = if range.exclude_end? then range.last else range.last + 1 end
+      while lower + 1 != upper
+        mid = ((lower + upper) / 2).to_i # for working with mathn.rb (Rational)
+        if block[ self[mid] ] < 0
+      lower = mid
+        else 
+      upper = mid
+        end
+      end
+      return upper
+#--}}}
+    end
+
+  #
+  # This method searches the FIRST occurrence which satisfies a
+  # condition given by a block in binary fashion and return the 
+  # index of the first occurrence. Return nil if not found.
+  #
+# old
+    def bsearch_first (range = 0 ... self.length, &block)
+#--{{{
+      boundary = bsearch_lower_boundary(range, &block)
+      if boundary >= self.length || yield(self[boundary]) != 0
+        return nil
+      else 
+        return boundary
+      end
+#--}}}
+    end
+# new 
+    def bsearch_first (arg = nil, &block)
+#--{{{
+      range = nil
+      if arg and not block
+        block = lambda{|x| x <=> arg}
+        range = 0 ... self.length
+      end
+      range ||= (arg ? arg : (0...self.length))
+      boundary = bsearch_lower_boundary(range, &block)
+      if boundary >= self.length || block[ self[boundary] ] != 0
+        return nil
+      else 
+        return boundary
+      end
+#--}}}
+    end
+
+  # alias bsearch bsearch_first
+    def bsearch(*a, &b)
+#--{{{
+      unless b
+        obj = a.first
+        b = lambda{|x| x <=> obj}
+        bsearch_first(&b)
+      else
+        bsearch_first(*a, &b)
+      end
+#--}}}
+    end
+  #
+  # Return the upper boundary. (outside)
+  #
+# old
+    def bsearch_upper_boundary (range = 0 ... self.length, &block)
+#--{{{
+      lower  = range.first() -1
+      upper = if range.exclude_end? then range.last else range.last + 1 end
+      while lower + 1 != upper
+        mid = ((lower + upper) / 2).to_i # for working with mathn.rb (Rational)
+        if yield(self[mid]) <= 0
+      lower = mid
+        else 
+      upper = mid
+        end
+      end
+      return lower + 1 # outside of the matching range.
+#--}}}
+    end
+# new 
+    def bsearch_upper_boundary (arg = nil, &block)
+#--{{{
+      range = nil
+      if arg and not block
+        block = lambda{|x| x <=> arg}
+        range = 0 ... self.length
+      end
+      range ||= (arg ? arg : (0...self.length))
+
+      lower  = range.first() -1
+      upper = if range.exclude_end? then range.last else range.last + 1 end
+      while lower + 1 != upper
+        mid = ((lower + upper) / 2).to_i # for working with mathn.rb (Rational)
+        if block[ self[mid] ] <= 0
+      lower = mid
+        else 
+      upper = mid
+        end
+      end
+      return lower + 1 # outside of the matching range.
+#--}}}
+    end
+  #
+  # This method searches the LAST occurrence which satisfies a
+  # condition given by a block in binary fashion and return the 
+  # index of the last occurrence. Return nil if not found.
+  #
+# old
+    def bsearch_last (range = 0 ... self.length, &block)
+#--{{{
+      # `- 1' for canceling `lower + 1' in bsearch_upper_boundary.
+      boundary = bsearch_upper_boundary(range, &block) - 1
+  
+      if (boundary <= -1 || yield(self[boundary]) != 0)
+        return nil
+      else
+        return boundary
+      end
+#--}}}
+    end
+# new
+    def bsearch_last (arg = nil, &block)
+#--{{{
+      range = nil
+      if arg and not block
+        block = lambda{|x| x <=> arg}
+        range = 0 ... self.length
+      end
+      range ||= (arg ? arg : (0...self.length))
+
+      # `- 1' for canceling `lower + 1' in bsearch_upper_boundary.
+      boundary = bsearch_upper_boundary(range, &block) - 1
+  
+      if (boundary <= -1 || block[ self[boundary] ] != 0)
+        return nil
+      else
+        return boundary
+      end
+#--}}}
+    end
+  #
+  # Return the search result as a Range object.
+  #
+# old
+    def bsearch_range (range = 0 ... self.length, &block)
+#--{{{
+      lower = bsearch_lower_boundary(range, &block)
+      upper = bsearch_upper_boundary(range, &block)
+      return lower ... upper
+#--}}}
+    end
+# new 
+    def bsearch_range (arg = nil, &block) 
+#--{{{
+      range = nil
+      if arg and not block
+        block = lambda{|x| x <=> arg}
+        range = 0 ... self.length
+      end
+      range ||= (arg ? arg : (0...self.length))
+
+      lower = bsearch_lower_boundary(range, &block)
+      upper = bsearch_upper_boundary(range, &block)
+      return lower ... upper
+#--}}}
+    end
+#--}}}
+  end
+
+if false
+  def Bsearch::append_features klass
+#--{{{
+    ::Array.module_eval{ include BsearchMethods }
+    super
+#--}}}
+  end
+end
+  ::Array.module_eval{ include BsearchMethods }
+#--}}}
+end # module Bsearch
+ALib::BSearch = ALib::Bsearch