nano 0.8.1

data/lib/nano/symbol/to_const.rb

@@ -0,0 +1,14 @@
+require 'nano/string/to_const'
+class Symbol
+  # Get a constant by a given symbol name.
+  #
+  #   :Class.to_const   #=> Class
+  #
+  # Note this method is not as verstile as it should be,
+  # since it can not access contants relative to the current 
+  # execution context. But without a binding_of_caller that
+  # does not seem possible.
+  def to_const
+    to_s.to_const
+  end
+end

data/lib/nano/symbol/to_proc.rb

@@ -0,0 +1,20 @@
+#--
+# Credit goes to Florian Gross (flgr).
+#++
+class Symbol
+  # Turn a symbol into a proc calling the method to
+  # which it refers.
+  #
+  #   up = :upcase.to_proc
+  #   up.call("hello")  #=> HELLO
+  #
+  # More useful is the fact that this allows <tt>&</tt>
+  # to be used to coerce Symbol into Proc. 
+  #
+  #   %w{foo bar qux}.map(&:upcase)   #=> ["FOO","BAR","QUX"]
+  #   [1, 2, 3].inject(&:+)           #=> 6
+  #
+  def to_proc
+    lambda { |obj, *args| obj.send(self, *args) }
+  end
+end

data/lib/nano/symbol/to_str.rb

@@ -0,0 +1,12 @@
+class Symbol
+  # Symbol's really are just simplified strings.
+  # Thus #to_str seems quite reasonable.
+  # This uses the Kernal#String method.
+  #--
+  # Maybe just change to #to_s?
+  # BTW: This would be lots faster, I bet, if implemented in core.
+  #++
+  def to_str
+    String( self )
+  end
+end

data/lib/nano/symbol/underscore.rb

@@ -0,0 +1,10 @@
+
+require 'nano/string/underscore'
+
+class Symbol
+
+  def underscore
+    self.to_s.underscore.to_sym
+  end
+
+end

data/lib/nano/symbol/upcase%3F.rb

@@ -0,0 +1,10 @@
+
+require 'nano/string/upcase%3F'
+
+class Symbol
+
+  def upcase?
+    self.to_s.upcase?
+  end
+
+end

data/lib/nano/time.rb

@@ -0,0 +1,6 @@
+require 'nano/time/%3A%3Adays_extrema'
+require 'nano/time/change'
+require 'nano/time/elapse'
+require 'nano/time/stamp'
+require 'nano/time/to_date'
+require 'nano/time/to_time'

data/lib/nano/time/%3A%3Adays_extrema.rb

@@ -0,0 +1,22 @@
+# This method calculates the days extrema given two time objects.
+# start time is the given time1 at 00:00:00
+# end time is the given time2 at 23:59:59:999
+#
+# Input:
+# - the two times (if only time1 is provided then you get an extrema
+#   of exactly one day extrema.
+#
+# Output:
+# - the time range. you can get the start/end times using
+#   range methods.
+#
+#--
+# Credit goes to George Moschovitis
+#++
+def Time.days_extrema(time1, time2=nil)
+  time2 = time1 if (not time2.valid? Time)
+  time2 = NEVER if (time2 <= time1)
+  start_time = Time.self.start_of_day(time1)
+  end_time = self.end_of_day(time2)
+  return (start_time..end_time)
+end

data/lib/nano/time/change.rb

@@ -0,0 +1,20 @@
+class Time
+
+  # Returns a new Time where one or more of the elements have been changed according
+  # to the +options+ parameter. The time options (hour, minute, sec, usec) reset
+  # cascadingly, so if only the hour is passed, then minute, sec, and usec is set to 0.
+  # If the hour and  minute is passed, then sec and usec is set to 0.
+  def change(options)
+    opts={}; options.each_pair{ |k,v| opts[k] = v.to_i }
+    self.class.send( self.utc? ? :utc : :local,
+      opts[:year]  || self.year,
+      opts[:month] || self.month,
+      opts[:day]   || self.day,
+      opts[:hour]  || self.hour,
+      opts[:min]   || (opts[:hour] ? 0 : self.min),
+      opts[:sec]   || ((opts[:hour] || opts[:min]) ? 0 : self.sec),
+      opts[:usec]  || ((opts[:hour] || opts[:min] || opts[:usec]) ? 0 : self.usec)
+    )
+  end
+
+end

data/lib/nano/time/elapse.rb

@@ -0,0 +1,18 @@
+
+class Time
+
+  # Tracks the elapse time of a code block.
+  #
+  #   Time.elapse { sleep 1 }  #=> 0.999188899993896
+  #
+  #--
+  # Credit goes to Hal Fulton.
+  #++
+  def self.elapse
+    raise "Need block" unless block_given?
+    t0 = Time.now.to_f
+    yield
+    Time.now.to_f - t0
+  end
+
+end

data/lib/nano/time/stamp.rb

@@ -0,0 +1,21 @@
+
+class Time
+
+  def stamp( fmt = nil )
+    case fmt
+    when :db, :dbase, :database, :utc
+      strftime("%Y-%m-%d %H:%M:%S")
+    when :short
+      strftime("%e %b %H:%M")
+    when :long
+      strftime("%B %e, %Y %H:%M")
+    when :day1st, :dmYHM  # TODO generalize
+      strftime("%d-%m-%Y %H:%M")
+    when String
+      strftime( fmt ).strip
+    else
+      strftime("%a %b %d %H:%M:%S %Z %Y")
+    end
+  end
+
+end

data/lib/nano/time/to_date.rb

@@ -0,0 +1,8 @@
+class Time
+  # Convert a Time to a Date. Time is a superset of Date.
+  # It is the year, month and day that are carried over.
+  def to_date
+    require 'date'
+    ::Date.new(year, month, day)
+  end
+end

data/lib/nano/time/to_s.rb

@@ -0,0 +1,6 @@
+require 'nano/time/stamp'
+
+class Time
+  # Replace #to_s with #stamp.
+  alias_method :to_s, :stamp
+end

data/lib/nano/time/to_time.rb

@@ -0,0 +1,10 @@
+class Time
+
+  # To be able to keep Dates and Times interchangeable
+  # on conversions.
+  def to_time
+    self
+  end
+
+end
+

data/lib/nanoreq.rb

@@ -0,0 +1,2 @@
+require 'nano/kernel/require_esc'
+require 'nano/kernel/require_nano'

data/lib/nanosys.rb

@@ -0,0 +1,203 @@
+require 'rbconfig'
+require 'nano/base'
+
+#
+# This module defines a new #require method and is appended
+# to Object, allowing it to slip in prior to the original
+# Kernel#require call.
+#
+module Kernel::NanoKernel
+  FILE_ESC_RE = %r{[^a-zA-Z_0-9./-]}
+
+  def require( fpath )
+    begin
+      super( fpath )
+    rescue LoadError => e
+      epath = URI.escape( fpath , FILE_ESC_RE )
+      raise e unless super( epath )
+    end
+  end
+
+end
+
+class Object
+  include NanoKernel
+end
+
+#
+# The NanoSystem module provides meta-information
+# on all nano-methods.
+#
+class NanoSystem
+
+  REQUIRE_DIR = 'nano'
+  DATA_DIR = File.join( Config::CONFIG['datadir'], 'site_ruby/nano' )
+
+  # class_level
+
+  class << self
+    alias __new__ new
+    def new
+      raise NoMethodError, 'cannot instantiate auto-singleton class'
+    end
+    private :new
+
+    def method_missing( meth, *args, &blk )
+      @instance ||= __new__
+      @instance.send( meth, *args, &blk )
+    end
+  end
+
+  # instance_level
+
+  attr_reader :base, :full, :noauto, :unsafe
+
+  def initialize
+    Object.send( :require, 'yaml' )
+    Object.send( :require, 'rbconfig' )
+    load
+  end
+
+  # Load nano data
+  def load
+    load_index
+    load_info
+  end
+
+  private
+
+  # Load method indexes
+  def load_index
+    f = File.join( DATA_DIR, 'index.yaml' )
+    @index = YAML.load( File.new(f) )
+  end
+
+  # Load meta info
+  def load_info
+    loadfn = lambda { |name|
+      farr = nil
+      fn = File.join( DATA_DIR, name )
+      File.open(fn) { |f| farr = f.gets(nil).split("\n") }
+      farr.collect! { |line|
+        l = line.strip.chomp('.rb')
+        (l.empty? or l[0,1] == '#') ? nil : l
+      }
+      farr.compact
+    }
+    @base = loadfn.call( 'base' )
+    @noauto = loadfn.call( 'noauto' )
+    @unsafe = loadfn.call( 'unsafe' )
+    @full = calc_full
+    true
+  end
+
+  # Full set of require files (files minus noauto and unsafe)
+  def calc_full
+    sf = files.dup
+    noauto.each do |f|
+      if f.include?('*')
+        re = %r"#{f.gsub('*','.*')}"
+        sf.reject!{ |x| x =~ re }
+      elsif sf.include?(f)
+        sf.delete f
+      end
+    end
+    unsafe.each do |f|
+      if f.include?('*')
+        re = %r"#{f.gsub('*','.*')}"
+        sf.reject!{ |x| x =~ re }
+      elsif sf.include?(f)
+        sf.delete f
+      end
+    end
+    sf.sort
+  end
+
+  public
+
+  # top level storage
+  def index
+    @index
+  end
+
+  # iterate through classes { |classname, methodhash| ... }
+  def each( &blk )
+    self.index.each &blk
+  end
+
+  # Returns a nano method lookup hash for given classname.
+  def []( classname )
+    index[classname.to_s.downcase]
+  end
+
+  # Returns list of class/module names with available nano methods.
+  #
+  def classes
+    index.keys.sort
+  end
+  alias_method :modules, :classes
+
+#   # Returns a list of all nano method names for a given class/module name.
+#   # If no class/module name is give returns a list of all nano methods
+#   # in the format of '<classname>#<methname>' for instance methods, and
+#   # '<classname>.<methname>' for class/module methods.
+#   def method_list( classname=nil )
+#     lst = nil
+#     if classname
+#       lst = store[classname.to_s].keys if store.include? classname.to_s
+#     else
+#       lst = []
+#       store.each { |classname, methmap|
+#         methmap.each { |methname, path|
+#           md = /^(self|#{classname})[.]/.match methname
+#           lst << ( md ? "#{classname}.#{md.post_match}" : "#{classname}##{methname}" )
+#         }
+#       }
+#     end
+#     lst.sort
+#   end
+
+  def files( classname=nil )
+    lst = []
+    if classname
+      index[classname.to_s.downcase].each { |methname|
+        lst << "#{classname}/#{methname}"
+      }
+    else
+      index.each { |classname, methlist|
+        methlist.each { |methname|
+          lst << "#{classname}/#{methname}"
+        }
+      }
+    end
+    lst.uniq.sort
+  end
+
+  # Require method nano(s) for given class/module.
+  #
+  def require( klass, *meths )
+    classname = klass.name.downcase
+    raise "unknown class #{klass}" unless self.index.has_key?( classname )
+    success = true
+    meths.each do |m|
+      raise "unknown nano-method #{m}" unless self[ classname ].include?( m.to_s )
+      f = "#{NanoSystem::REQUIRE_DIR}/#{classname}/#{m}"
+      r = Object.send( :require, f )
+      success = success && r
+    end
+    success
+  end
+
+end # module NanoSystem
+
+
+class Module
+  # Require method nano(s) for the class/module.
+  #
+  #   String.use :humanize, last=
+  #
+  def use( *meths )
+    NanoSystem.require( self, *meths )
+  end
+end
+

data/pub/www/doc/classes/Array.html

@@ -0,0 +1,794 @@
+<?xml version="1.0" encoding="iso-8859-1"?>
+<!DOCTYPE html 
+     PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN"
+     "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
+<html>
+  <head>
+    <title>Class: Array</title>
+    <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
+    <link rel="stylesheet" href=".././rdoc-style.css" type="text/css" media="screen" />
+
+    <script language="JavaScript" type="text/javascript">
+    // <![CDATA[
+
+        function toggleSource( id )
+        {
+          var elem
+          var link
+
+          if( document.getElementById )
+          {
+            elem = document.getElementById( id )
+            link = document.getElementById( "l_" + id )
+          }
+          else if ( document.all )
+          {
+            elem = eval( "document.all." + id )
+            link = eval( "document.all.l_" + id )
+          }
+          else
+            return false;
+
+          if( elem.style.display == "block" )
+          {
+            elem.style.display = "none"
+            link.innerHTML = "show source"
+          }
+          else
+          {
+            elem.style.display = "block"
+            link.innerHTML = "hide source"
+          }
+        }
+
+        function openCode( url )
+        {
+          window.open( url, "SOURCE_CODE", "width=400,height=400,scrollbars=yes" )
+        }
+      // ]]>
+    </script>
+  </head>
+
+  <body>
+  <table width="100%" border='0' cellpadding='0' cellspacing='0' class='banner'><tr>
+  <td class="file-title"><span class="file-title-prefix">Class</span><br />Array</td>
+  <td align="right">
+    <table cellspacing=0 cellpadding=2>
+      <tr valign="top">
+        <td>In:</td>
+        <td>
+<a href="../files/lib/nano/array/%5B%5D%3D_rb.html">lib/nano/array/%5B%5D%3D.rb</a>
+<a href="../files/lib/nano/array/at_rand%21_rb.html">lib/nano/array/at_rand%21.rb</a>
+<a href="../files/lib/nano/array/rand_index_rb.html">lib/nano/array/rand_index.rb</a>
+<a href="../files/lib/nano/array/first%21_rb.html">lib/nano/array/first%21.rb</a>
+<a href="../files/lib/nano/array/first%3D_rb.html">lib/nano/array/first%3D.rb</a>
+<a href="../files/lib/nano/array/rand_subset_rb.html">lib/nano/array/rand_subset.rb</a>
+<a href="../files/lib/nano/array/select%21_rb.html">lib/nano/array/select%21.rb</a>
+<a href="../files/lib/nano/array/slap_rb.html">lib/nano/array/slap.rb</a>
+<a href="../files/lib/nano/array/tail_rb.html">lib/nano/array/tail.rb</a>
+<a href="../files/lib/nano/array/%5B%5D_rb.html">lib/nano/array/%5B%5D.rb</a>
+<a href="../files/lib/nano/array/delete_unless_rb.html">lib/nano/array/delete_unless.rb</a>
+<a href="../files/lib/nano/array/delete_values_rb.html">lib/nano/array/delete_values.rb</a>
+<a href="../files/lib/nano/array/rotate%21_rb.html">lib/nano/array/rotate%21.rb</a>
+<a href="../files/lib/nano/array/shuffle%21_rb.html">lib/nano/array/shuffle%21.rb</a>
+<a href="../files/lib/nano/array/last_index_rb.html">lib/nano/array/last_index.rb</a>
+<a href="../files/lib/nano/array/thru_rb.html">lib/nano/array/thru.rb</a>
+<a href="../files/lib/nano/array/at_rand_rb.html">lib/nano/array/at_rand.rb</a>
+<a href="../files/lib/nano/array/foot_rb.html">lib/nano/array/foot.rb</a>
+<a href="../files/lib/nano/array/range_rb.html">lib/nano/array/range.rb</a>
+<a href="../files/lib/nano/array/to_b_rb.html">lib/nano/array/to_b.rb</a>
+<a href="../files/lib/nano/array/to_h_rb.html">lib/nano/array/to_h.rb</a>
+<a href="../files/lib/nano/array/pick%21_rb.html">lib/nano/array/pick%21.rb</a>
+<a href="../files/lib/nano/array/mid_rb.html">lib/nano/array/mid.rb</a>
+<a href="../files/lib/nano/array/delete_values_at_rb.html">lib/nano/array/delete_values_at.rb</a>
+<a href="../files/lib/nano/array/head_rb.html">lib/nano/array/head.rb</a>
+<a href="../files/lib/nano/array/pos_rb.html">lib/nano/array/pos.rb</a>
+<a href="../files/lib/nano/array/rotate_rb.html">lib/nano/array/rotate.rb</a>
+<a href="../files/lib/nano/array/shuffle_rb.html">lib/nano/array/shuffle.rb</a>
+<a href="../files/lib/nano/array/middle_rb.html">lib/nano/array/middle.rb</a>
+<a href="../files/lib/nano/array/pick_rb.html">lib/nano/array/pick.rb</a>
+<a href="../files/lib/nano/array/last%21_rb.html">lib/nano/array/last%21.rb</a>
+<a href="../files/lib/nano/array/last%3D_rb.html">lib/nano/array/last%3D.rb</a>
+<a href="../files/lib/nano/array/store_rb.html">lib/nano/array/store.rb</a>
+<a href="../files/lib/nano/array/bulk_rb.html">lib/nano/array/bulk.rb</a>
+<a href="../files/lib/nano/enumerable/each_unique_pair_rb.html">lib/nano/enumerable/each_unique_pair.rb</a>
+<a href="../files/lib/nano/enumerable/each_permutation_rb.html">lib/nano/enumerable/each_permutation.rb</a>
+<a href="../files/lib/nano/enumerable/each_by_rb.html">lib/nano/enumerable/each_by.rb</a>
+<a href="../files/lib/nano/enumerable/each_combination_rb.html">lib/nano/enumerable/each_combination.rb</a>
+<a href="../files/lib/nano/enumerable/each_slice_rb.html">lib/nano/enumerable/each_slice.rb</a>
+        </td>
+      </tr>
+    <tr>
+      <td>Parent:</td>
+      <td>
+        <a href="Object.html">
+Object
+         </a>
+     </td>
+   </tr>
+         </table>
+        </td>
+        </tr>
+      </table>
+ <!-- banner header -->
+
+  <div id="bodyContent">
+      <div id="content">
+
+  <div class="description"><p>
+Daniel Schierbeck
+</p>
+</div>
+
+
+
+  <div class="sectiontitle">Methods</div>
+  <ul>
+  <li><a href="#M000046">[]</a></li>
+  <li><a href="#M000039">[]=</a></li>
+  <li><a href="#M000053">at_rand</a></li>
+  <li><a href="#M000040">at_rand!</a></li>
+  <li><a href="#M000069">bulk</a></li>
+  <li><a href="#M000047">delete_unless</a></li>
+  <li><a href="#M000048">delete_values</a></li>
+  <li><a href="#M000060">delete_values_at</a></li>
+  <li><a href="#M000072">each_combination</a></li>
+  <li><a href="#M000071">each_permutation</a></li>
+  <li><a href="#M000073">each_slice</a></li>
+  <li><a href="#M000070">each_unique_pair</a></li>
+  <li><a href="#M000042">first=</a></li>
+  <li><a href="#M000054">foot</a></li>
+  <li><a href="#M000061">head</a></li>
+  <li><a href="#M000067">last=</a></li>
+  <li><a href="#M000051">last_index</a></li>
+  <li><a href="#M000059">mid</a></li>
+  <li><a href="#M000065">middle</a></li>
+  <li><a href="#M000066">pick</a></li>
+  <li><a href="#M000058">pick!</a></li>
+  <li><a href="#M000062">pos</a></li>
+  <li><a href="#M000041">rand_index</a></li>
+  <li><a href="#M000043">rand_subset</a></li>
+  <li><a href="#M000055">range</a></li>
+  <li><a href="#M000063">rotate</a></li>
+  <li><a href="#M000049">rotate!</a></li>
+  <li><a href="#M000044">select!</a></li>
+  <li><a href="#M000064">shuffle</a></li>
+  <li><a href="#M000050">shuffle!</a></li>
+  <li><a href="#M000068">store</a></li>
+  <li><a href="#M000045">tail</a></li>
+  <li><a href="#M000052">thru</a></li>
+  <li><a href="#M000056">to_b</a></li>
+  <li><a href="#M000057">to_h</a></li>
+  </ul>
+
+
+
+
+
+
+<div class="sectiontitle">Public Instance methods</div>
+<div class="method">
+  <div class="title">
+    <a name="M000046"></a><b>[]</b>(*args)
+[ <a href="javascript:openCode('Array.src/M000046.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Modifies #[] to also accept an array of indexes.
+</p>
+<pre>
+  a = ['a','b','c','d','e','f']
+
+  a[[1]]      #=&gt; ['b']
+  a[[1,1]]    #=&gt; ['b','b']
+  a[[1,-1]]   #=&gt; ['b','f']
+  a[[0,2,4]]  #=&gt; ['a','c','e']
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000039"></a><b>[]=</b>(*args)
+[ <a href="javascript:openCode('Array.src/M000039.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Modifies #[]= to accept an array of indexes for assignment.
+</p>
+<pre>
+  a = ['a','b','c','d']
+
+  a[[1,-1]] = ['m','n']    #=&gt; ['m','n']
+  a                        #=&gt; ['a','m','c','n']
+</pre>
+  </div>
+<div class="aka">
+  This method is also aliased as
+  <a href="Array.html#M000068">store</a>
+</div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000053"></a><b>at_rand</b>()
+[ <a href="javascript:openCode('Array.src/M000053.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Return a random element of the array.
+</p>
+<pre>
+  [1, 2, 3, 4].at_rand           #=&gt; 2
+  [1, 2, 3, 4].at_rand           #=&gt; 4
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000040"></a><b>at_rand!</b>()
+[ <a href="javascript:openCode('Array.src/M000040.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Same as <a href="Array.html#M000053">at_rand</a>, but acts in place
+removing a random element from the array.
+</p>
+<pre>
+  a = [1,2,3,4]
+  a.at_rand!       #=&gt; 2
+  a                #=&gt; [1,3,4]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000069"></a><b>bulk</b>()
+[ <a href="javascript:openCode('Array.src/M000069.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Returns an array of the first element upto, but not including, the last
+element.
+</p>
+<pre>
+  [1,2,3].bulk  #=&gt; [1,2]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000047"></a><b>delete_unless</b>(&amp;block)
+[ <a href="javascript:openCode('Array.src/M000047.html')">source</a> ]
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000048"></a><b>delete_values</b>(*values)
+[ <a href="javascript:openCode('Array.src/M000048.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Delete multiple values from array.
+</p>
+<pre>
+  a = [1,2,3,4]
+  a.delete_values(1,2)   #=&gt; [1,2]
+  a                      #=&gt; [3,4]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000060"></a><b>delete_values_at</b>(*selectors)
+[ <a href="javascript:openCode('Array.src/M000060.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Delete multiple values from array given indexes or index range.
+</p>
+<pre>
+  a = [1,2,3,4]
+  a.delete_values_at(1,2)   #=&gt; [2,3]
+  a                         #=&gt; [1,4]
+  a = [1,2,3,4]
+  a.delete_values_at(0..2)  #=&gt; [1,2,3]
+  a                         #=&gt; [4]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000072"></a><b>each_combination</b>(k=2) {|s.values_at(*idx)| ...}
+[ <a href="javascript:openCode('Array.src/M000072.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Yields the block to each unique combination of <em>n</em> elements.
+</p>
+<pre>
+  a = %w|a b c d|
+  a.each_combination(3) do |c|
+    p c
+  end
+</pre>
+<p>
+produces
+</p>
+<pre>
+  [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;]
+  [&quot;a&quot;, &quot;b&quot;, &quot;d&quot;]
+  [&quot;a&quot;, &quot;c&quot;, &quot;d&quot;]
+  [&quot;b&quot;, &quot;c&quot;, &quot;d&quot;]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000071"></a><b>each_permutation</b>( prefixed=[] ) {|prefixed + self| ...}
+[ <a href="javascript:openCode('Array.src/M000071.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Applys a block to each possible permutation of an array.
+</p>
+<pre>
+  %w[a b c].each_permutation { |x| puts(x.join('')) }
+</pre>
+<p>
+produces
+</p>
+<pre>
+  abc
+  acb
+  bac
+  bca
+  cab
+  cba
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000073"></a><b>each_slice</b>(n=nil, &amp;yld)
+[ <a href="javascript:openCode('Array.src/M000073.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Iterates over <tt>n</tt> elements at a time. If <tt>n</tt> is not given
+then the arity of the block determines the slicing quantity.
+</p>
+<pre>
+  [1, 2, 3, 4].each_slice(2){ |a,b| ... }
+</pre>
+<p>
+This is a specialized version <a
+href="Enumerable.html#M000409">Enumerable#each_slice</a> but optimized
+specifically for <a href="Array.html">Array</a>.
+</p>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000070"></a><b>each_unique_pair</b>(&amp;yld)
+[ <a href="javascript:openCode('Array.src/M000070.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Processes each unique pair (of indices, not value) in the array by yielding
+them to the supplied block.
+</p>
+<pre>
+  a = [1,2,3,4]
+  a.each_unique_pair{ |a,b| puts a+','+b }
+</pre>
+<p>
+produces
+</p>
+<pre>
+  1,2
+  1,3
+  1,4
+  2,3
+  2,4
+  3,4
+</pre>
+<p>
+This does not guarantee the uniqueness of values. For example:
+</p>
+<pre>
+  a = [1,2,1]
+  a.each_unique_pair{ |a,b| puts a+','+b }
+</pre>
+<p>
+prduces
+</p>
+<pre>
+  1,2
+  1,1
+  2,1
+</pre>
+<p>
+This is equivalent to <tt><a
+href="Array.html#M000072">each_combination</a>(2){ &#8230; }</tt>.
+</p>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000042"></a><b>first=</b>(x)
+[ <a href="javascript:openCode('Array.src/M000042.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Change the first element.
+</p>
+<pre>
+  a = [&quot;a&quot;,&quot;y&quot;,&quot;z&quot;]
+  a.first = &quot;x&quot;
+  p a           #=&gt; [&quot;x&quot;,&quot;y&quot;,&quot;z&quot;]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000054"></a><b>foot</b>()
+[ <a href="javascript:openCode('Array.src/M000054.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Like last, returning the last element in an array.
+</p>
+<pre>
+  [1,2,3].foot  #=&gt; [3]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000061"></a><b>head</b>()
+[ <a href="javascript:openCode('Array.src/M000061.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Like first but returns the first element in a new array.
+</p>
+<pre>
+  [1,2,3].head  #=&gt; [1]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000067"></a><b>last=</b>(x)
+[ <a href="javascript:openCode('Array.src/M000067.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Change the last element.
+</p>
+<pre>
+  a = [1,2,5]
+  a.last = 3
+  p a           #=&gt; [1,2,3]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000051"></a><b>last_index</b>()
+[ <a href="javascript:openCode('Array.src/M000051.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Returns the last index of the array. Returns nil is array has no elements.
+</p>
+<pre>
+  [1,2,3,4,5].last_index  #=&gt; 4
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000059"></a><b>mid</b>(offset=0)
+[ <a href="javascript:openCode('Array.src/M000059.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Returns the middle element of an array, or the element offset from middle
+if the parameter is given. Even-sized arrays, not having an exact middle,
+return the middle-right element.
+</p>
+<pre>
+  [1,2,3,4,5].mid        #=&gt; 3
+  [1,2,3,4,5,6].mid      #=&gt; 4
+  [1,2,3,4,5,6].mid(-1)  #=&gt; 3
+  [1,2,3,4,5,6].mid(-2)  #=&gt; 2
+  [1,2,3,4,5,6].mid(1)   #=&gt; 5
+</pre>
+<p>
+In other words, If there are an even number of elements the higher-indexed
+of the two center elements is indexed as orgin (0).
+</p>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000065"></a><b>middle</b>()
+[ <a href="javascript:openCode('Array.src/M000065.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Returns the middle element(s) of an array. Even-sized arrays, not having an
+exact middle, returns a two-element array of the two middle elements.
+</p>
+<pre>
+  [1,2,3,4,5].mid        #=&gt; 3
+  [1,2,3,4,5,6].mid      #=&gt; [3,4]
+</pre>
+<p>
+In contrast to <a href="Array.html#M000059">mid</a> which utilizes an
+offset.
+</p>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000066"></a><b>pick</b>(n=nil)
+[ <a href="javascript:openCode('Array.src/M000066.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Similar to <a href="Array.html#M000053">at_rand</a>, but will return an
+array of randomly picked exclusive elements if given a number.
+</p>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000058"></a><b>pick!</b>(n=nil)
+[ <a href="javascript:openCode('Array.src/M000058.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Similar to <a href="Array.html#M000040">at_rand!</a>, but given a number
+will return an array of exclusive elements.
+</p>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000062"></a><b>pos</b>(i)
+[ <a href="javascript:openCode('Array.src/M000062.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Returns the positive ordinal index given a cardinal position, 1 to n or -n
+to -1.
+</p>
+<pre>
+  [1,2,3,4,5].pos(1)   #=&gt; 0
+  [1,2,3,4,5].pos(-1)  #=&gt; 4
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000041"></a><b>rand_index</b>()
+[ <a href="javascript:openCode('Array.src/M000041.html')">source</a> ]
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000043"></a><b>rand_subset</b>( number=nil, exclusive=true )
+[ <a href="javascript:openCode('Array.src/M000043.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Returns a random subset of an <a href="Array.html">Array</a>. If a
+<em>number</em> of elements is specified then returns that number of
+elements, otherwise returns a random number of elements upto the size of
+the <a href="Array.html">Array</a>.
+</p>
+<p>
+By defualt the returned values are exclusive of each other, but if
+<em>exclusive</em> is set to <tt>false</tt>, the same values can be choosen
+more than once.
+</p>
+<p>
+When <em>exclusive</em> is <tt>true</tt> (the default) and the
+<em>number</em> given is greater than the size of the array, then all
+values are returned.
+</p>
+<pre>
+  [1, 2, 3, 4].rand_subset(1)        #=&gt; [2]
+  [1, 2, 3, 4].rand_subset(4)        #=&gt; [2, 1, 3, 4]
+  [1, 2, 3, 4].rand_subset           #=&gt; [1, 3, 4]
+  [1, 2, 3, 4].rand_subset           #=&gt; [2, 3]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000055"></a><b>range</b>(a=nil,z=nil)
+[ <a href="javascript:openCode('Array.src/M000055.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Returns the index range between two elements. If no elements are given,
+returns the range from first to last.
+</p>
+<pre>
+  ['a','b','c','d'].range            #=&gt; 0..3
+  ['a','b','c','d'].range('b','d')   #=&gt; 1..2
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000063"></a><b>rotate</b>(n=1)
+[ <a href="javascript:openCode('Array.src/M000063.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Rotates an array&#8217;s elements from back to front n times.
+</p>
+<pre>
+  [1,2,3].rotate      #=&gt; [3,1,2]
+  [3,1,2].rotate      #=&gt; [2,3,1]
+  [3,1,2].rotate      #=&gt; [1,2,3]
+  [1,2,3].rotate(3)   #=&gt; [1,2,3]
+</pre>
+<p>
+A negative parameter reverses the order from front to back.
+</p>
+<pre>
+  [1,2,3].rotate(-1)  #=&gt; [2,3,1]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000049"></a><b>rotate!</b>(n=1)
+[ <a href="javascript:openCode('Array.src/M000049.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Same as <a href="Array.html#M000063">rotate</a>, but acts in place.
+</p>
+<pre>
+  a = [1,2,3]
+  a.rotate!
+  a  #=&gt; [3,1,2]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000044"></a><b>select!</b>( {|| ...}
+[ <a href="javascript:openCode('Array.src/M000044.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+As with select but modifies the <a href="Array.html">Array</a> in place.
+</p>
+<pre>
+  a = [1,2,3,4,5,6,7,8,9,10]
+  a.select!{ |e| e % 2 == 0 }
+  a  #=&gt; [2,4,6,8,10]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000064"></a><b>shuffle</b>()
+[ <a href="javascript:openCode('Array.src/M000064.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Randomize the order of an array.
+</p>
+<pre>
+  [1,2,3,4].shuffle  #=&gt; [2,4,1,3]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000050"></a><b>shuffle!</b>()
+[ <a href="javascript:openCode('Array.src/M000050.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+As with <a href="Array.html#M000064">shuffle</a> but modifies the array in
+place. The algorithm used here is known as a Fisher-Yates shuffle.
+</p>
+<pre>
+  a = [1,2,3,4]
+  a.shuffle!
+  a  #=&gt; [2,4,1,3]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000068"></a><b>store</b>(*args)
+  </div>
+  <div class="description">
+  <p>
+Alias for #[]=
+</p>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000045"></a><b>tail</b>()
+[ <a href="javascript:openCode('Array.src/M000045.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Returns an array from second element to last element.
+</p>
+<pre>
+  [1,2,3].tail  #=&gt; [2,3]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000052"></a><b>thru</b>( from, to )
+[ <a href="javascript:openCode('Array.src/M000052.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Fetch values from a start index thru an end index.
+</p>
+<pre>
+  [1,2,3,4,5].thru(0,2)  #=&gt; [1,2,3]
+  [1,2,3,4,5].thru(2,4)  #=&gt; [3,4,5]
+</pre>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000056"></a><b>to_b</b>()
+[ <a href="javascript:openCode('Array.src/M000056.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Boolean conversion for not empty?
+</p>
+  </div>
+</div>
+<div class="method">
+  <div class="title">
+    <a name="M000057"></a><b>to_h</b>(values=nil)
+[ <a href="javascript:openCode('Array.src/M000057.html')">source</a> ]
+  </div>
+  <div class="description">
+  <p>
+Produces a hash for an <a href="Array.html">Array</a>, or two arrays.
+</p>
+<p>
+If no parameter is given, <a href="Array.html#M000057">to_h</a> expects the
+receiving array to be associative.
+</p>
+<pre>
+  a1 = [ [:a,1], [:b,2] ]
+  a1.to_h  #=&gt; { :a=&gt;1, :b=&gt;2 }
+</pre>
+<p>
+If an array is given it is considered values and zipped with the receiver,
+to produce the hash.
+</p>
+<pre>
+  a1 = [ :a, :b ]
+  a2 = [ 1, 2 ]
+  a1.to_h(a2)  #=&gt; { :a=&gt;1, :b=&gt;2 }
+</pre>
+  </div>
+</div>
+</div>
+
+  </div>
+
+    </body>
+</html>