as-extensions 0.1.0

data/LICENSE

@@ -0,0 +1,189 @@
+Copyright (c) 2010-2011 Moodstocks SAS
+
+Apache License Version 2.0, January 2004
+http://www.apache.org/licenses/
+
+TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+1. Definitions.
+
+"License" shall mean the terms and conditions for use, reproduction, and
+distribution as defined by Sections 1 through 9 of this document.
+
+"Licensor" shall mean the copyright owner or entity authorized by the
+copyright owner that is granting the License.
+
+"Legal Entity" shall mean the union of the acting entity and all other
+entities that control, are controlled by, or are under common control with
+that entity. For the purposes of this definition, "control" means (i) the
+power, direct or indirect, to cause the direction or management of such
+entity, whether by contract or otherwise, or (ii) ownership of fifty percent
+(50%) or more of the outstanding shares, or (iii) beneficial ownership of such
+entity.
+
+"You" (or "Your") shall mean an individual or Legal Entity exercising
+permissions granted by this License.
+
+"Source" form shall mean the preferred form for making modifications,
+including but not limited to software source code, documentation source, and
+configuration files.
+
+"Object" form shall mean any form resulting from mechanical transformation or
+translation of a Source form, including but not limited to compiled object
+code, generated documentation, and conversions to other media types.
+
+"Work" shall mean the work of authorship, whether in Source or Object form,
+made available under the License, as indicated by a copyright notice that is
+included in or attached to the work (an example is provided in the Appendix
+below).
+
+"Derivative Works" shall mean any work, whether in Source or Object form, that
+is based on (or derived from) the Work and for which the editorial revisions,
+annotations, elaborations, or other modifications represent, as a whole, an
+original work of authorship. For the purposes of this License, Derivative
+Works shall not include works that remain separable from, or merely link (or
+bind by name) to the interfaces of, the Work and Derivative Works thereof.
+
+"Contribution" shall mean any work of authorship, including the original
+version of the Work and any modifications or additions to that Work or
+Derivative Works thereof, that is intentionally submitted to Licensor for
+inclusion in the Work by the copyright owner or by an individual or Legal
+Entity authorized to submit on behalf of the copyright owner. For the purposes
+of this definition, "submitted" means any form of electronic, verbal, or
+written communication sent to the Licensor or its representatives, including
+but not limited to communication on electronic mailing lists, source code
+control systems, and issue tracking systems that are managed by, or on behalf
+of, the Licensor for the purpose of discussing and improving the Work, but
+excluding communication that is conspicuously marked or otherwise designated
+in writing by the copyright owner as "Not a Contribution."
+
+"Contributor" shall mean Licensor and any individual or Legal Entity on behalf
+of whom a Contribution has been received by Licensor and subsequently
+incorporated within the Work.
+
+2. Grant of Copyright License. Subject to the terms and conditions of this
+License, each Contributor hereby grants to You a perpetual, worldwide,
+non-exclusive, no-charge, royalty-free, irrevocable copyright license to
+reproduce, prepare Derivative Works of, publicly display, publicly perform,
+sublicense, and distribute the Work and such Derivative Works in Source or
+Object form.
+
+3. Grant of Patent License. Subject to the terms and conditions of this
+License, each Contributor hereby grants to You a perpetual, worldwide,
+non-exclusive, no-charge, royalty-free, irrevocable (except as stated in this
+section) patent license to make, have made, use, offer to sell, sell, import,
+and otherwise transfer the Work, where such license applies only to those
+patent claims licensable by such Contributor that are necessarily infringed by
+their Contribution(s) alone or by combination of their Contribution(s) with
+the Work to which such Contribution(s) was submitted. If You institute patent
+litigation against any entity (including a cross-claim or counterclaim in a
+lawsuit) alleging that the Work or a Contribution incorporated within the Work
+constitutes direct or contributory patent infringement, then any patent
+licenses granted to You under this License for that Work shall terminate as of
+the date such litigation is filed.
+
+4. Redistribution. You may reproduce and distribute copies of the Work or
+Derivative Works thereof in any medium, with or without modifications, and in
+Source or Object form, provided that You meet the following conditions:
+
+ 1. You must give any other recipients of the Work or Derivative Works a copy
+of this License; and
+
+ 2. You must cause any modified files to carry prominent notices stating that
+You changed the files; and
+
+ 3. You must retain, in the Source form of any Derivative Works that You
+distribute, all copyright, patent, trademark, and attribution notices from the
+Source form of the Work, excluding those notices that do not pertain to any
+part of the Derivative Works; and
+
+ 4. If the Work includes a "NOTICE" text file as part of its distribution,
+then any Derivative Works that You distribute must include a readable copy of
+the attribution notices contained within such NOTICE file, excluding those
+notices that do not pertain to any part of the Derivative Works, in at least
+one of the following places: within a NOTICE text file distributed as part of
+the Derivative Works; within the Source form or documentation, if provided
+along with the Derivative Works; or, within a display generated by the
+Derivative Works, if and wherever such third-party notices normally appear.
+The contents of the NOTICE file are for informational purposes only and do not
+modify the License. You may add Your own attribution notices within Derivative
+Works that You distribute, alongside or as an addendum to the NOTICE text from
+the Work, provided that such additional attribution notices cannot be
+construed as modifying the License.
+
+You may add Your own copyright statement to Your modifications and may provide
+additional or different license terms and conditions for use, reproduction, or
+distribution of Your modifications, or for any such Derivative Works as a
+whole, provided Your use, reproduction, and distribution of the Work otherwise
+complies with the conditions stated in this License.
+
+5. Submission of Contributions. Unless You explicitly state otherwise, any
+Contribution intentionally submitted for inclusion in the Work by You to the
+Licensor shall be under the terms and conditions of this License, without any
+additional terms or conditions. Notwithstanding the above, nothing herein
+shall supersede or modify the terms of any separate license agreement you may
+have executed with Licensor regarding such Contributions.
+
+6. Trademarks. This License does not grant permission to use the trade names,
+trademarks, service marks, or product names of the Licensor, except as
+required for reasonable and customary use in describing the origin of the Work
+and reproducing the content of the NOTICE file.
+
+7. Disclaimer of Warranty. Unless required by applicable law or agreed to in
+writing, Licensor provides the Work (and each Contributor provides its
+Contributions) on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
+KIND, either express or implied, including, without limitation, any warranties
+or conditions of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+PARTICULAR PURPOSE. You are solely responsible for determining the
+appropriateness of using or redistributing the Work and assume any risks
+associated with Your exercise of permissions under this License.
+
+8. Limitation of Liability. In no event and under no legal theory, whether in
+tort (including negligence), contract, or otherwise, unless required by
+applicable law (such as deliberate and grossly negligent acts) or agreed to in
+writing, shall any Contributor be liable to You for damages, including any
+direct, indirect, special, incidental, or consequential damages of any
+character arising as a result of this License or out of the use or inability
+to use the Work (including but not limited to damages for loss of goodwill,
+work stoppage, computer failure or malfunction, or any and all other
+commercial damages or losses), even if such Contributor has been advised of
+the possibility of such damages.
+
+9. Accepting Warranty or Additional Liability. While redistributing the Work
+or Derivative Works thereof, You may choose to offer, and charge a fee for,
+acceptance of support, warranty, indemnity, or other liability obligations
+and/or rights consistent with this License. However, in accepting such
+obligations, You may act only on Your own behalf and on Your sole
+responsibility, not on behalf of any other Contributor, and only if You agree
+to indemnify, defend, and hold each Contributor harmless for any liability
+incurred by, or claims asserted against, such Contributor by reason of your
+accepting any such warranty or additional liability.
+
+END OF TERMS AND CONDITIONS
+
+This software includes subcomponents with separate copyright notices and
+license terms.
+
+slugstring.rb
+=============
+
+Copyright (c) 2008-2010 Norman Clarke, Adrian Mugnolo and Emilio Tagua.
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
+

data/README.md

@@ -0,0 +1,25 @@
+# ASE (as-extensions)
+
+## Purpose
+
+This gem is built on top of ActiveSupport. It provides useful core
+extensions, methods and modules.
+
+## Warning
+
+Using this gem will make some classes behave differently than what you
+are used to. The Time and DateTime classes are especially concerned.
+Read the RDoc if you use them.
+
+## How To Install
+
+1. Install Jeweler (http://github.com/technicalpickles/jeweler).
+2. Clone the Git repository
+3. Run:
+        rake build
+        gem install pkg/*.gem
+4. Add "require 'as-extensions'" to your code.
+
+## Copyright
+
+Copyright (c) 2010-2011 Moodstocks SAS

data/ext/array.rb

@@ -0,0 +1,113 @@
+#--
+# Copyright (c) 2010-2011 Moodstocks SAS
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+# http://www.apache.org/licenses/LICENSE-2.0
+#
+# or in the LICENSE file which you should have received as part of
+# this distribution.
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#++
+
+Array.class_eval do
+  
+  # Boolean AND of elements
+  def band
+    inject{ |s,x| s && x }
+  end
+  
+  # For compatibility purpose.
+  def bmap(&blk)
+    map(&blk).band
+  end
+  
+  # Boolean OR of elements
+  def bor
+    inject{ |s,x| s || x }
+  end
+  
+  # Call ASE::deepcompact(self)
+  def deepcompact
+    ASE::deepcompact(self)
+  end
+  
+  def first=(x)
+    raise IndexError, 'empty array' if empty?
+    self[0] = x
+  end
+
+  def fpop
+    [last,init]
+  end
+
+  def fshift
+    [head,tail]
+  end
+
+  alias :head :first
+  alias :head= :first=
+  
+  def init
+    self[0..-2]
+  end
+  
+  def last=(x)
+    raise IndexError, 'empty array' if empty?
+    self[-1] = x
+  end
+  
+  # Map a function (ie. Method object) to members
+  def map_f(f, *args)
+    self.map{ |x| f.call(self, *args) }
+  end
+  
+  # Map a method of members to themselves
+  def map_m(sym, *args)
+    self.map{ |x| x.send(sym.to_sym, *args) }
+  end
+  
+  # In-place version of map_m
+  def map_m!(sym, *args)
+    self.map!{ |x| x.send(sym.to_sym, *args) }
+  end
+  
+  # Reverse map_m: members are arguments
+  def map_mr(sym, obj, *args)
+    self.map{ |x| obj.send(sym.to_sym, x, *args) }
+  end
+  
+  # In-place version of map_mr
+  def map_mr!(sym, obj, *args)
+    self.map!{ |x| obj.send(sym.to_sym, x, *args) }
+  end
+  
+  # Return a random element.
+  def pick(secure=false)
+    self[secure ? ActiveSupport::SecureRandom.random_number(size) : Kernel.rand(size)]
+  end
+  
+  def tail
+    self[1..-1] || []
+  end
+  
+  # See vsum for an example of what this does
+  # Another example: vapply(:to_a) transposes a matrix!
+  def vapply(x)
+    (head||[]).zip(*tail).map_m(x)
+  end
+  
+  # Vector sum
+  # For instance: [[1,2],[1,3]].vsum => [2,5]
+  def vsum
+    vapply(:sum)
+  end
+  
+end

data/ext/boolean.rb

@@ -0,0 +1,36 @@
+#--
+# Copyright (c) 2010-2011 Moodstocks SAS
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+# http://www.apache.org/licenses/LICENSE-2.0
+#
+# or in the LICENSE file which you should have received as part of
+# this distribution.
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#++
+
+TrueClass.class_eval do
+  
+  # Return 1
+  def to_i
+    1
+  end
+  
+end
+
+FalseClass.class_eval do
+  
+  # Return 0
+  def to_i
+    0
+  end
+  
+end

data/ext/datetime.rb

@@ -0,0 +1,39 @@
+#--
+# Copyright (c) 2010-2011 Moodstocks SAS
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+# http://www.apache.org/licenses/LICENSE-2.0
+#
+# or in the LICENSE file which you should have received as part of
+# this distribution.
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#++
+
+DateTime.class_eval do
+  
+  alias :to_s_noase :to_s
+  # Convert to the standard ASE time string format
+  def to_s(format=nil)
+    if format.nil? then ASE::Time::to_string(self)
+    else to_s_noase(format) end
+  end
+  
+  # Get the number of seconds since Epoch
+  def to_epoch
+    ASE::Time::epoch(self)
+  end
+  
+  # Convert to a Time object
+  def to_time
+    ASE::Time::to_time(self)
+  end
+  
+end

data/ext/dir.rb

@@ -0,0 +1,29 @@
+#--
+# Copyright (c) 2010-2011 Moodstocks SAS
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+# http://www.apache.org/licenses/LICENSE-2.0
+#
+# or in the LICENSE file which you should have received as part of
+# this distribution.
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#++
+
+Dir.class_eval do
+  
+  # Iterate over files in directory with a specific extension.
+  def each_file(ext, &blk)
+    grep(/^[^.].*\.(#{ext})$/).each do |f|
+      yield "#{path}/#{f}"
+    end
+  end
+  
+end

data/ext/enumerable.rb

@@ -0,0 +1,28 @@
+#--
+# Copyright (c) 2010-2011 Moodstocks SAS
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+# http://www.apache.org/licenses/LICENSE-2.0
+#
+# or in the LICENSE file which you should have received as part of
+# this distribution.
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#++
+
+Enumerable.class_eval do
+  
+  # When a method doesn't exist, convert to an Array
+  def method_missing(method_sym, *arguments, &block)
+    if !is_a?(Array) && respond_to?(:to_a) then to_a.send(method_sym, *arguments, &block)
+    else super end
+  end
+  
+end

data/ext/file.rb

@@ -0,0 +1,11 @@
+File.class_eval do
+  
+  class << self
+    # Recursive dirname.
+    # dirname(x, 2) <=> dirname(dirname(expand_path(x)))
+    def parent_dir(x, n=1, expand=true)
+      (n > 1) ? parent_dir(dirname(expand_path(x)), n-1, false) : dirname(x)
+    end
+  end
+  
+end

data/ext/hash.rb

@@ -0,0 +1,167 @@
+#--
+# Copyright (c) 2010-2011 Moodstocks SAS
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+# http://www.apache.org/licenses/LICENSE-2.0
+#
+# or in the LICENSE file which you should have received as part of
+# this distribution.
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#++
+
+Hash.class_eval do
+  
+  class << self
+    
+    # See Hash#normalize. This does the opposite.
+    def renormalize(array)
+      r = {}
+      array.each do |l|
+        s = r
+        l[0..-3].each do |x|
+          s = (s[x] ||= {})
+        end
+        if s[l[-2]].nil?
+          s[l[-2]] = l.last
+        elsif s[l[-2]].nil?.is_a?(Array)
+          s[l[-2]].push(l.last)
+        else
+          s[l[-2]] = [s[l[-2]], l.last]
+        end
+      end
+      r
+    end
+    
+  end # class << self
+  
+  # Call ASE::deepcompact(self)
+  def deepcompact
+    ASE::deepcompact(self)
+  end
+  
+  # Same logic as get! but for deleting values.
+  # Examples with h = {:a=>{:b=>{:c=>:d}}}:
+  #   h.del!(:a, :b, :c) # => {:a=>{:b=>{}}}
+  #   h.del!(:a, :b){|x| x[:c] == :z} # => {:a=>{:b=>{:c=>:d}}}
+  #   h.del!(:a, :b){|x| x[:c] == :d} # => {:a=>{}}
+  def del!(*nodes, &blk)
+    if nodes.length == 1
+      self.delete(nodes.head) if ( (!block_given?) || blk.call(self[nodes.head]) )
+    else
+      ( self.get!(*nodes.init) {{}} ).del!(nodes.last, &blk)
+    end
+    self
+  end
+  
+  # Transforms a hash-based tree into an array of arrays
+  # Example input: {'a'=>'aa', 'b' => {'ba' => 'baa', 'bb' => 'bba'}}
+  # Example output: [["a", "aa"], ["b", "bb", "bba"], ["b", "ba", "baa"]]
+  def denormalize(trace=[])
+    r = Set.new
+    self.each_pair do |k,v|
+      if v.is_a?(Hash)
+        l = v.denormalize(trace + [k])
+        l.each do |x|
+          r.merge!(l) unless (l.respond_to?(:empty?) && l.empty?)
+        end
+      elsif v.is_a?(Array) || v.is_a?(::Set)
+        v.each do |x|
+          r.add(trace + [k, x])
+        end
+      else
+        r.add(trace + [k, v]) unless (v.respond_to?(:empty?) && v.empty?)
+      end
+    end
+    r.to_a
+  end
+  
+  def equiv?(x)
+    eq_canonize(self).inspect == eq_canonize(x).inspect
+  end
+  
+  # Get a node in a recursive hash structure and create intermediate hashes if needed.
+  # Example:
+  #   a = {}
+  #   a.get!(:a, :b, :c) # => nil
+  #   a # => {:a=>{:b=>{}}}
+  # You can pass a block to set the default value for the leaf:
+  #   a = {}
+  #   a.get!(:a, :b, :c) { :d } # => :d
+  #   a # => {:a=>{:b=>{:c=>:d}}}
+  def get!(*nodes, &blk)
+    return self if (l = nodes.length) == 0
+    nh = nodes.head
+    if block_given?
+      if l == 1
+        self[nh] ||= yield
+        self[nh]
+      else
+        self[nh] ||= {}
+        self[nh].get!(*(nodes.tail), &blk)
+      end
+    else
+      if l == 1
+        self[nh]
+      else
+        self[nh] ||= {}
+        self[nh].get!(*(nodes.tail))
+      end
+    end
+  end
+  
+  # Keep all keys except those in array x
+  def kexcept(*x)
+    reject{ |k,v| x.include?(k) }
+  end
+  
+  # Keep only keys in array x
+  def konly(*x)
+    reject{ |k,v| !x.include?(k) }
+  end
+  
+  def map_keys
+    self.inject(self.class.new){ |h,(k,v)| h.merge!( (yield k) => v ) }
+  end
+  
+  def map_values
+    self.inject(self.class.new){ |h,(k,v)| h.merge!( k => (yield v) ) }
+  end
+  
+  def map_values!
+    self.each_pair{ |k,v| self[k] = (yield v) }; self
+  end
+  
+  # Same logic as get! but for setting values.
+  # Example:
+  #   {}.set!(:a, :b, :c) { :d } # => {:a=>{:b=>{:c=>:d}}}
+  def set!(*nodes, &blk)
+    raise "Hash#set! takes a block and at least an argument." unless (block_given? && (l = nodes.length) > 0)
+    if l == 1 then self[nodes.head] = yield
+    else ( self.get!(*nodes.init) {{}} ).set!(nodes.last, &blk) end
+    self
+  end
+
+  # WARNING: breaks recent versions of Map
+  # def to_map
+  #   self.is_a?(Map) ? self : Map(self)
+  # end
+  
+  alias :to_sym :symbolize_keys
+  
+  private
+  
+  def eq_canonize(d) # helper for equiv?
+    if d.is_a?(Hash)
+      Map(d).inject(Map.new){ |h,(k,v)| h.set!(k){eq_canonize(v)} }.sort{ |x,y| x[0] <=> y[0] }
+    else d end
+  end
+  
+end

data/ext/io.rb

@@ -0,0 +1,27 @@
+#--
+# Copyright (c) 2010-2011 Moodstocks SAS
+#
+# Licensed under the Apache License, Version 2.0 (the "License");
+# you may not use this file except in compliance with the License.
+# You may obtain a copy of the License at
+#
+# http://www.apache.org/licenses/LICENSE-2.0
+#
+# or in the LICENSE file which you should have received as part of
+# this distribution.
+#
+# Unless required by applicable law or agreed to in writing, software
+# distributed under the License is distributed on an "AS IS" BASIS,
+# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+# See the License for the specific language governing permissions and
+# limitations under the License.
+#++
+
+IO.class_eval do
+  
+  # Read from a compressed IO stream
+  def gzread
+    ASE::IO::to_string(self, true)
+  end
+  
+end