ramaze 0.3.9.1 → 2023.01.06

data/lib/ramaze/snippets/dictionary.rb

@@ -1,504 +0,0 @@
-# = dictionary.rb
-#
-# == Copyright (c) 2005 Jan Molic, Thomas Sawyer
-#
-#   Ruby License
-#
-#   This module is free software. You may use, modify, and/or redistribute this
-#   software under the same terms as Ruby.
-#
-#   This program is distributed in the hope that it will be useful, but WITHOUT
-#   ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
-#   FOR A PARTICULAR PURPOSE.
-#
-# == Special Thanks
-#
-# Ported from OrderHash 2.0, Copyright (c) 2005 jan molic
-#
-# Thanks to Andrew Johnson for his suggestions and fixes of Hash[],
-# merge, to_a, inspect and shift.
-#
-# == Authors & Contributors
-#
-# * Jan Molic
-# * Thomas Sawyer
-
-# Author::    Jan Molic
-# Copyright:: Copyright (c) 2006 Jan Molic
-# License::   Ruby License
-
-# = Dictionary
-#
-# The Dictionary class is a Hash that preserves order.
-# So it has some array-like extensions also. By defualt
-# a Dictionary object preserves insertion order, but any
-# order can be specified including alphabetical key order.
-#
-# == Usage
-#
-# Just require this file and use Dictionary instead of Hash.
-#
-#   # You can do simply
-#   hsh = Dictionary.new
-#   hsh['z'] = 1
-#   hsh['a'] = 2
-#   hsh['c'] = 3
-#   p hsh.keys     #=> ['z','a','c']
-#
-#   # or using Dictionary[] method
-#   hsh = Dictionary['z', 1, 'a', 2, 'c', 3]
-#   p hsh.keys     #=> ['z','a','c']
-#
-#   # but this don't preserve order
-#   hsh = Dictionary['z'=>1, 'a'=>2, 'c'=>3]
-#   p hsh.keys     #=> ['a','c','z']
-#
-#   # Dictionary has useful extensions: push, pop and unshift
-#   p hsh.push('to_end', 15)       #=> true, key added
-#   p hsh.push('to_end', 30)       #=> false, already - nothing happen
-#   p hsh.unshift('to_begin', 50)  #=> true, key added
-#   p hsh.unshift('to_begin', 60)  #=> false, already - nothing happen
-#   p hsh.keys                     #=> ["to_begin", "a", "c", "z", "to_end"]
-#   p hsh.pop                      #=> ["to_end", 15], if nothing remains, return nil
-#   p hsh.keys                     #=> ["to_begin", "a", "c", "z"]
-#   p hsh.shift                    #=> ["to_begin", 30], if nothing remains, return nil
-#
-# == Usage Notes
-#
-# * You can use #order_by to set internal sort order.
-# * #<< takes a two element [k,v] array and inserts.
-# * Use ::auto which creates Dictionay sub-entries as needed.
-# * And ::alpha which creates a new Dictionary sorted by key.
-
-module Ramaze
-  class Dictionary
-
-    class << self
-
-      #--
-      # TODO is this needed? Doesn't the super class do this?
-      #++
-
-      def []( *args )
-        hsh = new
-        if Hash === args[0]
-          hsh.replace(args[0])
-        elsif (args.size % 2) != 0
-          raise ArgumentError, "odd number of elements for Hash"
-        else
-          while !args.empty?
-            hsh[args.shift] = args.shift
-          end
-        end
-        hsh
-      end
-
-      # Like #new but the block sets the order.
-      #
-      def new_by( *args, &blk )
-        new(*args).order_by(&blk)
-      end
-
-      # Alternate to #new which creates a dictionary sorted by key.
-      #
-      #   d = Dictionary.alpha
-      #   d["z"] = 1
-      #   d["y"] = 2
-      #   d["x"] = 3
-      #   d  #=> {"x"=>3,"y"=>2,"z"=>2}
-      #
-      # This is equivalent to:
-      #
-      #   Dictionary.new.order_by { |key,value| key }
-
-      def alpha( *args, &block )
-        new( *args, &block ).order_by_key
-      end
-
-      # Alternate to #new which auto-creates sub-dictionaries as needed.
-      #
-      #   d = Dictionary.auto
-      #   d["a"]["b"]["c"] = "abc"  #=> { "a"=>{"b"=>{"c"=>"abc"}}}
-      #
-      def auto( *args )
-        #AutoDictionary.new(*args)
-        leet = lambda { |hsh, key| hsh[key] = new( &leet ) }
-        new(*args, &leet)
-      end
-    end
-
-    def initialize( *args, &blk )
-      @order = []
-      @order_by = nil
-      @hash = Hash.new( *args, &blk )
-    end
-
-    def order
-      reorder if @order_by
-      @order
-    end
-
-    # Keep dictionary sorted by a specific sort order.
-
-    def order_by( &block )
-      @order_by = block
-      order
-      self
-    end
-
-    # Keep dictionary sorted by key.
-    #
-    #   d = Dictionary.new.order_by_key
-    #   d["z"] = 1
-    #   d["y"] = 2
-    #   d["x"] = 3
-    #   d  #=> {"x"=>3,"y"=>2,"z"=>2}
-    #
-    # This is equivalent to:
-    #
-    #   Dictionary.new.order_by { |key,value| key }
-    #
-    # The initializer Dictionary#alpha also provides this.
-
-    def order_by_key
-      @order_by = lambda { |k,v| k }
-      order
-      self
-    end
-
-    # Keep dictionary sorted by value.
-    #
-    #   d = Dictionary.new.order_by_value
-    #   d["z"] = 1
-    #   d["y"] = 2
-    #   d["x"] = 3
-    #   d  #=> {"x"=>3,"y"=>2,"z"=>2}
-    #
-    # This is equivalent to:
-    #
-    #   Dictionary.new.order_by { |key,value| value }
-
-    def order_by_value
-      @order_by = lambda { |k,v| v }
-      order
-      self
-    end
-
-    #
-
-    def reorder
-      if @order_by
-        assoc = @order.collect{ |k| [k,@hash[k]] }.sort_by( &@order_by )
-        @order = assoc.collect{ |k,v| k }
-      end
-      @order
-    end
-
-    #def ==( hsh2 )
-    #  return false if @order != hsh2.order
-    #  super hsh2
-    #end
-
-    def ==( hsh2 )
-      if hsh2.is_a?( Dictionary )
-        @order == hsh2.order &&
-          @hash  == hsh2.instance_variable_get("@hash")
-      else
-        false
-      end
-    end
-
-    def [] k
-      @hash[ k ]
-    end
-
-    def fetch( k )
-      @hash.fetch( k )
-    end
-
-    # Store operator.
-    #
-    #   h[key] = value
-    #
-    # Or with additional index.
-    #
-    #  h[key,index] = value
-
-    def []=(k, i=nil, v=nil)
-      if v
-        insert(i,k,v)
-      else
-        store(k,i)
-      end
-    end
-
-    def insert( i,k,v )
-      @order.insert( i,k )
-      @hash.store( k,v )
-    end
-
-    def store( a,b )
-      @order.push( a ) unless @hash.has_key?( a )
-      @hash.store( a,b )
-    end
-
-    def clear
-      @order = []
-      @hash.clear
-    end
-
-    def delete( key )
-      @order.delete( key )
-      @hash.delete( key )
-    end
-
-    def each_key
-      order.each { |k| yield( k ) }
-      self
-    end
-
-    def each_value
-      order.each { |k| yield( @hash[k] ) }
-      self
-    end
-
-    def each
-      order.each { |k| yield( k,@hash[k] ) }
-      self
-    end
-    alias each_pair each
-
-    def delete_if
-      order.clone.each { |k| delete k if yield }
-      self
-    end
-
-    def values
-      ary = []
-      order.each { |k| ary.push @hash[k] }
-      ary
-    end
-
-    def keys
-      order
-    end
-
-    def invert
-      hsh2 = self.class.new
-      order.each { |k| hsh2[@hash[k]] = k }
-      hsh2
-    end
-
-    def reject( &block )
-      self.dup.delete_if &block
-    end
-
-    def reject!( &block )
-      hsh2 = reject &block
-      self == hsh2 ? nil : hsh2
-    end
-
-    def replace( hsh2 )
-      @order = hsh2.order
-      @hash = hsh2.hash
-    end
-
-    def shift
-      key = order.first
-      key ? [key,delete(key)] : super
-    end
-
-    def unshift( k,v )
-      unless @hash.include?( k )
-        @order.unshift( k )
-        @hash.store( k,v )
-        true
-      else
-        false
-      end
-    end
-
-    def <<(kv)
-      push *kv
-    end
-
-    def push( k,v )
-      unless @hash.include?( k )
-        @order.push( k )
-        @hash.store( k,v )
-        true
-      else
-        false
-      end
-    end
-
-    def pop
-      key = order.last
-      key ? [key,delete(key)] : nil
-    end
-
-    def to_a
-      ary = []
-      each { |k,v| ary << [k,v] }
-      ary
-    end
-
-    def to_s
-      self.to_a.to_s
-    end
-
-    def inspect
-      ary = []
-      each {|k,v| ary << k.inspect + "=>" + v.inspect}
-      '{' + ary.join(", ") + '}'
-    end
-
-    def dup
-      self.class[*to_a.flatten]
-    end
-
-    def update( hsh2 )
-      hsh2.each { |k,v| self[k] = v }
-      reorder
-      self
-    end
-    alias :merge! update
-
-    def merge( hsh2 )
-      self.dup.update(hsh2)
-    end
-
-    def select
-      ary = []
-      each { |k,v| ary << [k,v] if yield k,v }
-      ary
-    end
-
-    def find
-      each{|k,v| return k, v if yield(k,v) }
-      return nil
-    end
-
-    def first
-      @hash[order.first]
-    end
-
-    def last
-      @hash[order.last]
-    end
-
-    def length
-      @order.length
-    end
-    alias :size :length
-
-    def empty?
-      @hash.empty?
-    end
-
-  end
-end
-
-
-
-#  _____         _
-# |_   _|__  ___| |_
-#   | |/ _ \/ __| __|
-#   | |  __/\__ \ |_
-#   |_|\___||___/\__|
-#
-
-=begin testing
-
-  require 'test/unit'
-
-  class TC_Dictionary < Test::Unit::TestCase
-
-    def test_create
-      hsh = Dictionary['z', 1, 'a', 2, 'c', 3]
-      assert_equal( ['z','a','c'], hsh.keys )
-    end
-
-    def test_op_store
-      hsh = Dictionary.new
-      hsh['z'] = 1
-      hsh['a'] = 2
-      hsh['c'] = 3
-      assert_equal( ['z','a','c'], hsh.keys )
-    end
-
-    def test_push
-      hsh = Dictionary['a', 1, 'c', 2, 'z', 3]
-      assert( hsh.push('end', 15) )
-      assert_equal( 15, hsh['end'] )
-      assert( ! hsh.push('end', 30) )
-      assert( hsh.unshift('begin', 50) )
-      assert_equal( 50, hsh['begin'] )
-      assert( ! hsh.unshift('begin', 60) )
-      assert_equal( ["begin", "a", "c", "z", "end"], hsh.keys )
-      assert_equal( ["end", 15], hsh.pop )
-      assert_equal( ["begin", "a", "c", "z"], hsh.keys )
-      assert_equal( ["begin", 50], hsh.shift )
-    end
-
-    def test_insert
-      # front
-      h = Dictionary['a', 1, 'b', 2, 'c', 3]
-      r = Dictionary['d', 4, 'a', 1, 'b', 2, 'c', 3]
-      assert_equal( 4, h.insert(0,'d',4) )
-      assert_equal( r, h )
-      # back
-      h = Dictionary['a', 1, 'b', 2, 'c', 3]
-      r = Dictionary['a', 1, 'b', 2, 'c', 3, 'd', 4]
-      assert_equal( 4, h.insert(-1,'d',4) )
-      assert_equal( r, h )
-    end
-
-    def test_update
-      # with other orderred hash
-      h1 = Dictionary['a', 1, 'b', 2, 'c', 3]
-      h2 = Dictionary['d', 4]
-      r = Dictionary['a', 1, 'b', 2, 'c', 3, 'd', 4]
-      assert_equal( r, h1.update(h2) )
-      assert_equal( r, h1 )
-      # with other hash
-      h1 = Dictionary['a', 1, 'b', 2, 'c', 3]
-      h2 = { 'd' => 4 }
-      r = Dictionary['a', 1, 'b', 2, 'c', 3, 'd', 4]
-      assert_equal( r, h1.update(h2) )
-      assert_equal( r, h1 )
-    end
-
-    def test_merge
-      # with other orderred hash
-      h1 = Dictionary['a', 1, 'b', 2, 'c', 3]
-      h2 = Dictionary['d', 4]
-      r = Dictionary['a', 1, 'b', 2, 'c', 3, 'd', 4]
-      assert_equal( r, h1.merge(h2) )
-      # with other hash
-      h1 = Dictionary['a', 1, 'b', 2, 'c', 3]
-      h2 = { 'd' => 4 }
-      r = Dictionary['a', 1, 'b', 2, 'c', 3, 'd', 4]
-      assert_equal( r, h1.merge(h2) )
-    end
-
-    def test_order_by
-      h1 = Dictionary['a', 3, 'b', 2, 'c', 1]
-      h1.order_by{ |k,v| v }
-      assert_equal( [1,2,3], h1.values )
-      assert_equal( ['c','b','a'], h1.keys )
-    end
-
-    def test_op_store
-      h1 = Dictionary[]
-      h1[:a] = 1
-      h1[:c] = 3
-      assert_equal( [1,3], h1.values )
-      h1[:b,1] = 2
-      assert_equal( [1,2,3], h1.values )
-      assert_equal( [:a,:b,:c], h1.keys )
-    end
-
-  end
-
-=end

data/lib/ramaze/snippets/divide.rb

@@ -1,20 +0,0 @@
-#          Copyright (c) 2008 Michael Fellinger m.fellinger@gmail.com
-# All files in this distribution are subject to the terms of the Ruby license.
-
-# A convenient way to do File.join
-#
-# Example:
-#   'a' / 'b'                      # -> 'a/b'
-#   File.dirname(__FILE__) / 'bar' # -> "ramaze/snippets/string/bar"
-
-class String
-  def / obj
-    File.join(self, obj.to_s)
-  end
-end
-
-class Symbol
-  def / obj
-    self.to_s / obj
-  end
-end

data/lib/ramaze/snippets/kernel/__dir__.rb

@@ -1,23 +0,0 @@
-#          Copyright (c) 2008 Michael Fellinger m.fellinger@gmail.com
-# All files in this distribution are subject to the terms of the Ruby license.
-
-# Extensions for Kernel
-
-module Kernel
-  unless defined?__DIR__
-
-    # This is similar to +__FILE__+ and +__LINE__+, and returns a String
-    # representing the directory of the current file is.
-    # Unlike +__FILE__+ the path returned is absolute.
-    #
-    # This method is convenience for the
-    #  File.expand_path(File.dirname(__FILE__))
-    # idiom.
-    #
-
-    def __DIR__()
-      filename = caller[0][/(.*?):/, 1]
-      File.expand_path(File.dirname(filename))
-    end
-  end
-end

data/lib/ramaze/snippets/kernel/acquire.rb

@@ -1,39 +0,0 @@
-#          Copyright (c) 2008 Michael Fellinger m.fellinger@gmail.com
-# All files in this distribution are subject to the terms of the Ruby license.
-
-# Extensions for Kernel
-
-module Kernel
-
-  # Require all .rb and .so files on the given globs, utilizes Dir::[].
-  #
-  # Examples:
-  #   # Given following directory structure:
-  #   # src/foo.rb
-  #   # src/bar.so
-  #   # src/foo.yaml
-  #   # src/foobar/baz.rb
-  #   # src/foobar/README
-  #
-  #   # requires all files in 'src':
-  #   acquire 'src/*'
-  #
-  #   # requires all files in 'src' recursive:
-  #   acquire 'src/**/*'
-  #
-  #   # require 'src/foo.rb' and 'src/bar.so' and 'src/foobar/baz.rb'
-  #   acquire 'src/*', 'src/foobar/*'
-
-  def acquire *globs
-    globs.flatten.each do |glob|
-      Dir[glob].each do |file|
-        require file if file =~ /\.(rb|so)$/
-      end
-    end
-  end
-
-  def aquire *globs
-    warn "Kernel#aquire is being deprecated, use Kernel#acquire instead"
-    acquire *globs
-  end
-end

data/lib/ramaze/snippets/kernel/aquire.rb

@@ -1 +0,0 @@
-require(File.join(File.dirname(__FILE__), 'acquire'))

data/lib/ramaze/snippets/kernel/constant.rb

@@ -1,26 +0,0 @@
-#          Copyright (c) 2008 Michael Fellinger m.fellinger@gmail.com
-# All files in this distribution are subject to the terms of the Ruby license.
-
-# Extensions for Kernel
-
-module Kernel
-  # Original from Trans (Facets 1.4.5)
-  # This is similar to +Module#const_get+ but is accessible at all levels,
-  # and, unlike +const_get+, can handle module hierarchy.
-  #
-  #   constant("Fixnum")                  # -> Fixnum
-  #   constant(:Fixnum)                   # -> Fixnum
-  #
-  #   constant("Process::Sys")            # -> Process::Sys
-  #   constant("Regexp::MULTILINE")       # -> 4
-  #
-  #   require 'test/unit'
-  #   Test.constant("Unit::Assertions")   # -> Test::Unit::Assertions
-  #   Test.constant("::Test::Unit")       # -> Test::Unit
-
-  def constant(const)
-    const = const.to_s.dup
-    base = const.sub!(/^::/, '') ? Object : ( self.kind_of?(Module) ? self : self.class )
-    const.split(/::/).inject(base){ |mod, name| mod.const_get(name) }
-  end
-end

data/lib/ramaze/snippets/kernel/pretty_inspect.rb

@@ -1,15 +0,0 @@
-#          Copyright (c) 2008 Michael Fellinger m.fellinger@gmail.com
-# All files in this distribution are subject to the terms of the Ruby license.
-
-require 'pp'
-
-# Extensions for Kernel
-
-module Kernel
-  unless defined?(pretty_inspect)
-    # returns a pretty printed object as a string.
-    def pretty_inspect
-      PP.pp(self, '')
-    end
-  end
-end

data/lib/ramaze/snippets/metaid.rb

@@ -1,17 +0,0 @@
-# from http://whytheluckystiff.net/articles/seeingMetaclassesClearly.html
-
-class Object
-  # The hidden singleton lurks behind everyone
-  def metaclass; class << self; self; end; end
-  def meta_eval &blk; metaclass.instance_eval &blk; end
-
-  # Adds methods to a metaclass
-  def meta_def name, &blk
-    meta_eval { define_method name, &blk }
-  end
-
-  # Defines an instance method within a class
-  def class_def name, &blk
-    class_eval { define_method name, &blk }
-  end
-end

data/lib/ramaze/snippets/numeric/filesize_format.rb

@@ -1,19 +0,0 @@
-#          Copyright (c) 2008 Michael Fellinger m.fellinger@gmail.com
-# All files in this distribution are subject to the terms of the Ruby license.
-
-class Numeric
-  FILESIZE_FORMAT = [
-      ['%.1fT', 1 << 40],
-      ['%.1fG', 1 << 30],
-      ['%.1fM', 1 << 20],
-      ['%.1fK', 1 << 10],
-    ]
-
-  def filesize_format
-    FILESIZE_FORMAT.each do |format, size|
-      return format % (self.to_f / size) if self >= size
-    end
-
-    self.to_s
-  end
-end

data/lib/ramaze/snippets/object/pretty.rb

@@ -1,6 +0,0 @@
-class Object
-  def pretty s = ''
-    PP.pp(self, s)
-    s
-  end
-end

data/lib/ramaze/snippets/object/scope.rb

@@ -1,11 +0,0 @@
-class Object
-
-  # returns a new clean binding for this object
-  #   usage: eval 'self', object.scope  #=> returns object 
-  #
-
-  def scope
-    lambda{}
-  end
-
-end

data/lib/ramaze/snippets/object/thread_accessor.rb

@@ -1,5 +0,0 @@
-require(File.join(File.dirname(__FILE__), '../ramaze/thread_accessor'))
-
-class Object
-  include Ramaze::ThreadAccessor
-end