facets 0.6.3 → 0.7.0

data/LICENSE-GPL

@@ -1,341 +0,0 @@
-
-                    GNU GENERAL PUBLIC LICENSE
-                      Version 2, June 1991
-
-Copyright (C) 1989, 1991 Free Software Foundation, Inc.
-    59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-Everyone is permitted to copy and distribute verbatim copies
-of this license document, but changing it is not allowed.
-
-                            Preamble
-
-  The licenses for most software are designed to take away your
-freedom to share and change it.  By contrast, the GNU General Public
-License is intended to guarantee your freedom to share and change free
-software--to make sure the software is free for all its users.  This
-General Public License applies to most of the Free Software
-Foundation's software and to any other program whose authors commit to
-using it.  (Some other Free Software Foundation software is covered by
-the GNU Library General Public License instead.)  You can apply it to
-your programs, too.
-
-  When we speak of free software, we are referring to freedom, not
-price.  Our General Public Licenses are designed to make sure that you
-have the freedom to distribute copies of free software (and charge for
-this service if you wish), that you receive source code or can get it
-if you want it, that you can change the software or use pieces of it
-in new free programs; and that you know you can do these things.
-
-  To protect your rights, we need to make restrictions that forbid
-anyone to deny you these rights or to ask you to surrender the rights.
-These restrictions translate to certain responsibilities for you if you
-distribute copies of the software, or if you modify it.
-
-  For example, if you distribute copies of such a program, whether
-gratis or for a fee, you must give the recipients all the rights that
-you have.  You must make sure that they, too, receive or can get the
-source code.  And you must show them these terms so they know their
-rights.
-
-  We protect your rights with two steps: (1) copyright the software, and
-(2) offer you this license which gives you legal permission to copy,
-distribute and/or modify the software.
-
-  Also, for each author's protection and ours, we want to make certain
-that everyone understands that there is no warranty for this free
-software.  If the software is modified by someone else and passed on, we
-want its recipients to know that what they have is not the original, so
-that any problems introduced by others will not reflect on the original
-authors' reputations.
-
-  Finally, any free program is threatened constantly by software
-patents.  We wish to avoid the danger that redistributors of a free
-program will individually obtain patent licenses, in effect making the
-program proprietary.  To prevent this, we have made it clear that any
-patent must be licensed for everyone's free use or not licensed at all.
-
-  The precise terms and conditions for copying, distribution and
-modification follow.
-
-                    GNU GENERAL PUBLIC LICENSE
-  TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
-
-  0. This License applies to any program or other work which contains
-a notice placed by the copyright holder saying it may be distributed
-under the terms of this General Public License.  The "Program", below,
-refers to any such program or work, and a "work based on the Program"
-means either the Program or any derivative work under copyright law:
-that is to say, a work containing the Program or a portion of it,
-either verbatim or with modifications and/or translated into another
-language.  (Hereinafter, translation is included without limitation in
-the term "modification".)  Each licensee is addressed as "you".
-
-Activities other than copying, distribution and modification are not
-covered by this License; they are outside its scope.  The act of
-running the Program is not restricted, and the output from the Program
-is covered only if its contents constitute a work based on the
-Program (independent of having been made by running the Program).
-Whether that is true depends on what the Program does.
-
-  1. You may copy and distribute verbatim copies of the Program's
-source code as you receive it, in any medium, provided that you
-conspicuously and appropriately publish on each copy an appropriate
-copyright notice and disclaimer of warranty; keep intact all the
-notices that refer to this License and to the absence of any warranty;
-and give any other recipients of the Program a copy of this License
-along with the Program.
-
-You may charge a fee for the physical act of transferring a copy, and
-you may at your option offer warranty protection in exchange for a fee.
-
-  2. You may modify your copy or copies of the Program or any portion
-of it, thus forming a work based on the Program, and copy and
-distribute such modifications or work under the terms of Section 1
-above, provided that you also meet all of these conditions:
-
-    a) You must cause the modified files to carry prominent notices
-    stating that you changed the files and the date of any change.
-
-    b) You must cause any work that you distribute or publish, that in
-    whole or in part contains or is derived from the Program or any
-    part thereof, to be licensed as a whole at no charge to all third
-    parties under the terms of this License.
-
-    c) If the modified program normally reads commands interactively
-    when run, you must cause it, when started running for such
-    interactive use in the most ordinary way, to print or display an
-    announcement including an appropriate copyright notice and a
-    notice that there is no warranty (or else, saying that you provide
-    a warranty) and that users may redistribute the program under
-    these conditions, and telling the user how to view a copy of this
-    License.  (Exception: if the Program itself is interactive but
-    does not normally print such an announcement, your work based on
-    the Program is not required to print an announcement.)
-
-These requirements apply to the modified work as a whole.  If
-identifiable sections of that work are not derived from the Program,
-and can be reasonably considered independent and separate works in
-themselves, then this License, and its terms, do not apply to those
-sections when you distribute them as separate works.  But when you
-distribute the same sections as part of a whole which is a work based
-on the Program, the distribution of the whole must be on the terms of
-this License, whose permissions for other licensees extend to the
-entire whole, and thus to each and every part regardless of who wrote it.
-
-Thus, it is not the intent of this section to claim rights or contest
-your rights to work written entirely by you; rather, the intent is to
-exercise the right to control the distribution of derivative or
-collective works based on the Program.
-
-In addition, mere aggregation of another work not based on the Program
-with the Program (or with a work based on the Program) on a volume of
-a storage or distribution medium does not bring the other work under
-the scope of this License.
-
-  3. You may copy and distribute the Program (or a work based on it,
-under Section 2) in object code or executable form under the terms of
-Sections 1 and 2 above provided that you also do one of the following:
-
-    a) Accompany it with the complete corresponding machine-readable
-    source code, which must be distributed under the terms of Sections
-    1 and 2 above on a medium customarily used for software interchange; or,
-
-    b) Accompany it with a written offer, valid for at least three
-    years, to give any third party, for a charge no more than your
-    cost of physically performing source distribution, a complete
-    machine-readable copy of the corresponding source code, to be
-    distributed under the terms of Sections 1 and 2 above on a medium
-    customarily used for software interchange; or,
-
-    c) Accompany it with the information you received as to the offer
-    to distribute corresponding source code.  (This alternative is
-    allowed only for noncommercial distribution and only if you
-    received the program in object code or executable form with such
-    an offer, in accord with Subsection b above.)
-
-The source code for a work means the preferred form of the work for
-making modifications to it.  For an executable work, complete source
-code means all the source code for all modules it contains, plus any
-associated interface definition files, plus the scripts used to
-control compilation and installation of the executable.  However, as a
-special exception, the source code distributed need not include
-anything that is normally distributed (in either source or binary
-form) with the major components (compiler, kernel, and so on) of the
-operating system on which the executable runs, unless that component
-itself accompanies the executable.
-
-If distribution of executable or object code is made by offering
-access to copy from a designated place, then offering equivalent
-access to copy the source code from the same place counts as
-distribution of the source code, even though third parties are not
-compelled to copy the source along with the object code.
-
-  4. You may not copy, modify, sublicense, or distribute the Program
-except as expressly provided under this License.  Any attempt
-otherwise to copy, modify, sublicense or distribute the Program is
-void, and will automatically terminate your rights under this License.
-However, parties who have received copies, or rights, from you under
-this License will not have their licenses terminated so long as such
-parties remain in full compliance.
-
-  5. You are not required to accept this License, since you have not
-signed it.  However, nothing else grants you permission to modify or
-distribute the Program or its derivative works.  These actions are
-prohibited by law if you do not accept this License.  Therefore, by
-modifying or distributing the Program (or any work based on the
-Program), you indicate your acceptance of this License to do so, and
-all its terms and conditions for copying, distributing or modifying
-the Program or works based on it.
-
-  6. Each time you redistribute the Program (or any work based on the
-Program), the recipient automatically receives a license from the
-original licensor to copy, distribute or modify the Program subject to
-these terms and conditions.  You may not impose any further
-restrictions on the recipients' exercise of the rights granted herein.
-You are not responsible for enforcing compliance by third parties to
-this License.
-
-  7. If, as a consequence of a court judgment or allegation of patent
-infringement or for any other reason (not limited to patent issues),
-conditions are imposed on you (whether by court order, agreement or
-otherwise) that contradict the conditions of this License, they do not
-excuse you from the conditions of this License.  If you cannot
-distribute so as to satisfy simultaneously your obligations under this
-License and any other pertinent obligations, then as a consequence you
-may not distribute the Program at all.  For example, if a patent
-license would not permit royalty-free redistribution of the Program by
-all those who receive copies directly or indirectly through you, then
-the only way you could satisfy both it and this License would be to
-refrain entirely from distribution of the Program.
-
-If any portion of this section is held invalid or unenforceable under
-any particular circumstance, the balance of the section is intended to
-apply and the section as a whole is intended to apply in other
-circumstances.
-
-It is not the purpose of this section to induce you to infringe any
-patents or other property right claims or to contest validity of any
-such claims; this section has the sole purpose of protecting the
-integrity of the free software distribution system, which is
-implemented by public license practices.  Many people have made
-generous contributions to the wide range of software distributed
-through that system in reliance on consistent application of that
-system; it is up to the author/donor to decide if he or she is willing
-to distribute software through any other system and a licensee cannot
-impose that choice.
-
-This section is intended to make thoroughly clear what is believed to
-be a consequence of the rest of this License.
-
-  8. If the distribution and/or use of the Program is restricted in
-certain countries either by patents or by copyrighted interfaces, the
-original copyright holder who places the Program under this License
-may add an explicit geographical distribution limitation excluding
-those countries, so that distribution is permitted only in or among
-countries not thus excluded.  In such case, this License incorporates
-the limitation as if written in the body of this License.
-
-  9. The Free Software Foundation may publish revised and/or new versions
-of the General Public License from time to time.  Such new versions will
-be similar in spirit to the present version, but may differ in detail to
-address new problems or concerns.
-
-Each version is given a distinguishing version number.  If the Program
-specifies a version number of this License which applies to it and "any
-later version", you have the option of following the terms and conditions
-either of that version or of any later version published by the Free
-Software Foundation.  If the Program does not specify a version number of
-this License, you may choose any version ever published by the Free Software
-Foundation.
-
-  10. If you wish to incorporate parts of the Program into other free
-programs whose distribution conditions are different, write to the author
-to ask for permission.  For software which is copyrighted by the Free
-Software Foundation, write to the Free Software Foundation; we sometimes
-make exceptions for this.  Our decision will be guided by the two goals
-of preserving the free status of all derivatives of our free software and
-of promoting the sharing and reuse of software generally.
-
-                            NO WARRANTY
-
-  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
-FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
-OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
-PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
-OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
-MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
-TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
-PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
-REPAIR OR CORRECTION.
-
-  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
-WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
-REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
-INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
-OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
-TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
-YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
-PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
-POSSIBILITY OF SUCH DAMAGES.
-
-                    END OF TERMS AND CONDITIONS
-
-            How to Apply These Terms to Your New Programs
-
-  If you develop a new program, and you want it to be of the greatest
-possible use to the public, the best way to achieve this is to make it
-free software which everyone can redistribute and change under these terms.
-
-  To do so, attach the following notices to the program.  It is safest
-to attach them to the start of each source file to most effectively
-convey the exclusion of warranty; and each file should have at least
-the "copyright" line and a pointer to where the full notice is found.
-
-    <one line to give the program's name and a brief idea of what it does.>
-    Copyright (C) <year>  <name of author>
-
-    This program is free software; you can redistribute it and/or modify
-    it under the terms of the GNU General Public License as published by
-    the Free Software Foundation; either version 2 of the License, or
-    (at your option) any later version.
-
-    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.  See the
-    GNU General Public License for more details.
-
-    You should have received a copy of the GNU General Public License
-    along with this program; if not, write to the Free Software
-    Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
-
-
-Also add information on how to contact you by electronic and paper mail.
-
-If the program is interactive, make it output a short notice like this
-when it starts in an interactive mode:
-
-    Gnomovision version 69, Copyright (C) year  name of author
-    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
-    This is free software, and you are welcome to redistribute it
-    under certain conditions; type `show c' for details.
-
-The hypothetical commands `show w' and `show c' should show the appropriate
-parts of the General Public License.  Of course, the commands you use may
-be called something other than `show w' and `show c'; they could even be
-mouse-clicks or menu items--whatever suits your program.
-
-You should also get your employer (if you work as a programmer) or your
-school, if any, to sign a "copyright disclaimer" for the program, if
-necessary.  Here is a sample; alter the names:
-
-  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
-  `Gnomovision' (which makes passes at compilers) written by James Hacker.
-
-  <signature of Ty Coon>, 1 April 1989
-  Ty Coon, President of Vice
-
-This General Public License does not permit incorporating your program into
-proprietary programs.  If your program is a subroutine library, you may
-consider it more useful to permit linking proprietary applications with the
-library.  If this is what you want to do, use the GNU Library General
-Public License instead of this License.

data/LICENSE-RUBY

@@ -1,60 +0,0 @@
-The Ruby License (http://www.ruby-lang.org/en/LICENSE.txt)
-----------------------------------------------------------
-
-You may redistribute this software and/or modify it under either the terms of
-the GPL (see the file GPL), or the conditions below:
-
-  1. You may make and give away verbatim copies of the source form of the
-     software without restriction, provided that you duplicate all of the
-     original copyright notices and associated disclaimers.
-
-  2. You may modify your copy of the software in any way, provided that
-     you do at least ONE of the following:
-
-       a) place your modifications in the Public Domain or otherwise
-          make them Freely Available, such as by posting said
-          modifications to Usenet or an equivalent medium, or by allowing
-          the author to include your modifications in the software.
-
-       b) use the modified software only within your corporation or
-          organization.
-
-       c) rename any non-standard executables so the names do not conflict
-          with standard executables, which must also be provided.
-
-       d) make other distribution arrangements with the author.
-
-  3. You may distribute the software in object code or executable
-     form, provided that you do at least ONE of the following:
-
-       a) distribute the executables and library files of the software,
-          together with instructions (in the manual page or equivalent)
-          on where to get the original distribution.
-
-       b) accompany the distribution with the machine-readable source of
-          the software.
-
-       c) give non-standard executables non-standard names, with
-          instructions on where to get the original software distribution.
-
-       d) make other distribution arrangements with the author.
-
-  4. You may modify and include the part of the software into any other
-     software (possibly commercial).  But some files in the distribution
-     are not written by the author, so that they are not under these terms.
-
-     For the list of those files and their copying conditions, see the
-     file LEGAL.
-
-  5. The scripts and library files supplied as input to or produced as
-     output from the software do not automatically fall under the
-     copyright of the software, but belong to whomever generated them,
-     and may be sold commercially, and may be aggregated with this
-     software.
-
-  6. THIS SOFTWARE IS PROVIDED "AS IS" AND WITHOUT ANY EXPRESS OR
-     IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
-     WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
-     PURPOSE.
-
-  

data/VERSION

@@ -1,7 +0,0 @@
-0.6.1 Florian's Mixes
-0.6.0 Florian's Onslaught
-0.5.0 First Release
-0.4.0 Raspberry
-0.3.0 ABC
-0.2.0 Succ
-0.1.0 TomsLib

data/doc/classes/Array.html

@@ -1,1267 +0,0 @@
-<?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 xmlns="http://www.w3.org/1999/xhtml" xml:lang="en" lang="en">
-<head>
-  <title>Class: Array</title>
-  <meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" />
-  <meta http-equiv="Content-Script-Type" content="text/javascript" />
-  <link rel="stylesheet" href=".././rdoc-style.css" type="text/css" media="screen" />
-  <script type="text/javascript">
-  // <![CDATA[
-
-  function popupCode( url ) {
-    window.open(url, "Code", "resizable=yes,scrollbars=yes,toolbar=no,status=no,height=150,width=400")
-  }
-
-  function toggleCode( id ) {
-    if ( document.getElementById )
-      elem = document.getElementById( id );
-    else if ( document.all )
-      elem = eval( "document.all." + id );
-    else
-      return false;
-
-    elemStyle = elem.style;
-    
-    if ( elemStyle.display != "block" ) {
-      elemStyle.display = "block"
-    } else {
-      elemStyle.display = "none"
-    }
-
-    return true;
-  }
-  
-  // Make codeblocks hidden by default
-  document.writeln( "<style type=\"text/css\">div.method-source-code { display: none }</style>" )
-  
-  // ]]>
-  </script>
-
-</head>
-<body>
-
-
-
-    <div id="classHeader">
-        <table class="header-table">
-        <tr class="top-aligned-row">
-          <td><strong>Class</strong></td>
-          <td class="class-name-in-header">Array</td>
-        </tr>
-        <tr class="top-aligned-row">
-            <td><strong>In:</strong></td>
-            <td>
-                <a href="../files/lib/facet/array/pull_rb.html">
-                lib/facet/array/pull.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/[]_rb.html">
-                lib/facet/array/[].rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/first&last_rb.html">
-                lib/facet/array/first&amp;last.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/head&tail_rb.html">
-                lib/facet/array/head&amp;tail.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/select!_rb.html">
-                lib/facet/array/select!.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/delete_values_rb.html">
-                lib/facet/array/delete_values.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/last_index_rb.html">
-                lib/facet/array/last_index.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/thru_rb.html">
-                lib/facet/array/thru.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/at_rand_rb.html">
-                lib/facet/array/at_rand.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/range_rb.html">
-                lib/facet/array/range.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/get_rb.html">
-                lib/facet/array/get.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/to_b_rb.html">
-                lib/facet/array/to_b.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/to_h_rb.html">
-                lib/facet/array/to_h.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/[[]]_rb.html">
-                lib/facet/array/[[]].rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/pos_rb.html">
-                lib/facet/array/pos.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/rotate_rb.html">
-                lib/facet/array/rotate.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/shuffle_rb.html">
-                lib/facet/array/shuffle.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/combinations_rb.html">
-                lib/facet/array/combinations.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/middle_rb.html">
-                lib/facet/array/middle.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/array/store_rb.html">
-                lib/facet/array/store.rb
-                </a>
-        <br />
-                <a href="../files/lib/facet/enumerable/each_slice_rb.html">
-                lib/facet/enumerable/each_slice.rb
-                </a>
-        <br />
-            </td>
-        </tr>
-
-        <tr class="top-aligned-row">
-            <td><strong>Parent:</strong></td>
-            <td>
-                <a href="Object.html">
-                Object
-               </a>
-            </td>
-        </tr>
-        </table>
-    </div>
-  <!-- banner header -->
-
-  <div id="bodyContent">
-
-
-
-  <div id="contextContent">
-
-
-
-   </div>
-
-    <div id="method-list">
-      <h3 class="section-bar">Methods</h3>
-
-      <div class="name-list">
-      <a href="#M000027">[]</a>&nbsp;&nbsp;
-      <a href="#M000049">[]</a>&nbsp;&nbsp;
-      <a href="#M000028">[]=</a>&nbsp;&nbsp;
-      <a href="#M000050">[]=</a>&nbsp;&nbsp;
-      <a href="#M000040">at_rand</a>&nbsp;&nbsp;
-      <a href="#M000042">at_rand!</a>&nbsp;&nbsp;
-      <a href="#M000033">body</a>&nbsp;&nbsp;
-      <a href="#M000056">combinations</a>&nbsp;&nbsp;
-      <a href="#M000036">delete_values</a>&nbsp;&nbsp;
-      <a href="#M000037">delete_values_at</a>&nbsp;&nbsp;
-      <a href="#M000062">each_by</a>&nbsp;&nbsp;
-      <a href="#M000057">each_combination</a>&nbsp;&nbsp;
-      <a href="#M000061">each_slice</a>&nbsp;&nbsp;
-      <a href="#M000058">each_unique_pair</a>&nbsp;&nbsp;
-      <a href="#M000029">first=</a>&nbsp;&nbsp;
-      <a href="#M000034">foot</a>&nbsp;&nbsp;
-      <a href="#M000046">get</a>&nbsp;&nbsp;
-      <a href="#M000031">head</a>&nbsp;&nbsp;
-      <a href="#M000045">index_range</a>&nbsp;&nbsp;
-      <a href="#M000030">last=</a>&nbsp;&nbsp;
-      <a href="#M000038">last_index</a>&nbsp;&nbsp;
-      <a href="#M000059">middle</a>&nbsp;&nbsp;
-      <a href="#M000043">pick</a>&nbsp;&nbsp;
-      <a href="#M000051">pos</a>&nbsp;&nbsp;
-      <a href="#M000041">rand_index</a>&nbsp;&nbsp;
-      <a href="#M000044">range</a>&nbsp;&nbsp;
-      <a href="#M000052">rotate</a>&nbsp;&nbsp;
-      <a href="#M000053">rotate!</a>&nbsp;&nbsp;
-      <a href="#M000035">select!</a>&nbsp;&nbsp;
-      <a href="#M000054">shuffle</a>&nbsp;&nbsp;
-      <a href="#M000055">shuffle!</a>&nbsp;&nbsp;
-      <a href="#M000060">store</a>&nbsp;&nbsp;
-      <a href="#M000032">tail</a>&nbsp;&nbsp;
-      <a href="#M000039">thru</a>&nbsp;&nbsp;
-      <a href="#M000047">to_b</a>&nbsp;&nbsp;
-      <a href="#M000048">to_h</a>&nbsp;&nbsp;
-      </div>
-    </div>
-
-  </div>
-
-
-    <!-- if includes -->
-
-    <div id="section">
-
-
-
-    <div id="aliases-list">
-      <h3 class="section-bar">External Aliases</h3>
-
-      <div class="name-list">
-                        <table summary="aliases">
-        <tr class="top-aligned-row context-row">
-          <td class="context-item-name">shift</td>
-          <td>-></td>
-          <td class="context-item-value">pull</td>
-        </tr>
-      <tr class="top-aligned-row context-row">
-        <td>&nbsp;</td>
-        <td colspan="2" class="context-item-desc">
-Alias for shift.
-
-<pre>
-  require 'facet/array/pull'
-
-  a=[1,2,3]
-  a.pull      #=&gt; 1
-  a           #=&gt; [2,3]
-</pre>
-</td>
-      </tr>
-        <tr class="top-aligned-row context-row">
-          <td class="context-item-name">unshift</td>
-          <td>-></td>
-          <td class="context-item-value">put</td>
-        </tr>
-      <tr class="top-aligned-row context-row">
-        <td>&nbsp;</td>
-        <td colspan="2" class="context-item-desc">
-Alias for unshift.
-
-<pre>
-  require 'facet/array/pull'
-
-  a=[1,2,3]
-  a.put(9)   #=&gt; [9,1,2,3]
-  a          #=&gt; [9,1,2,3]
-</pre>
-</td>
-      </tr>
-        <tr class="top-aligned-row context-row">
-          <td class="context-item-name">unshift</td>
-          <td>-></td>
-          <td class="context-item-value">first!</td>
-        </tr>
-      <tr class="top-aligned-row context-row">
-        <td>&nbsp;</td>
-        <td colspan="2" class="context-item-desc">
-Alias for unshift, which <em>pushes</em> an element onto the front of an
-array.
-
-<pre>
-  require 'facet/array/first&amp;last='
-
-  a = [&quot;a&quot;,&quot;y&quot;,&quot;z&quot;]
-  a.first! &quot;x&quot;
-  p a           #=&gt; [&quot;x&quot;,&quot;a&quot;,&quot;y&quot;,&quot;z&quot;]
-</pre>
-</td>
-      </tr>
-        <tr class="top-aligned-row context-row">
-          <td class="context-item-name">push</td>
-          <td>-></td>
-          <td class="context-item-value">last!</td>
-        </tr>
-      <tr class="top-aligned-row context-row">
-        <td>&nbsp;</td>
-        <td colspan="2" class="context-item-desc">
-Alias for push.
-
-<pre>
-  require 'facet/array/first&amp;last='
-
-  a = [1,2]
-  a.last! 3
-  p a           #=&gt; [1,2,3]
-</pre>
-</td>
-      </tr>
-                        </table>
-      </div>
-    </div>
-
-
-      
-
-
-    <!-- if method_list -->
-    <div id="methods">
-      <h3 class="section-bar">Public Class methods</h3>
-
-      <div id="method-M000056" class="method-detail">
-        <a name="M000056"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000056.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000056.html');return false;">
-          <span class="method-name">combinations</span><span class="method-args">(head, *rest)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Produces an array of arrays of all possible combinations of the given
-arrays in the position given. (Explain me better?)
-</p>
-<pre>
-  require 'facet/arrat/combinations'
-
-  a = %w|a b|
-  b = %w|a x|
-  c = %w|x y|
-  Array.combinations(a, b, c).each { |x| p x }
-</pre>
-<p>
-produces
-</p>
-<pre>
- [&quot;a&quot;, &quot;a&quot;, &quot;x&quot;]
- [&quot;a&quot;, &quot;a&quot;, &quot;y&quot;]
- [&quot;a&quot;, &quot;x&quot;, &quot;x&quot;]
- [&quot;a&quot;, &quot;x&quot;, &quot;y&quot;]
- [&quot;b&quot;, &quot;a&quot;, &quot;x&quot;]
- [&quot;b&quot;, &quot;a&quot;, &quot;y&quot;]
- [&quot;b&quot;, &quot;x&quot;, &quot;x&quot;]
- [&quot;b&quot;, &quot;x&quot;, &quot;y&quot;]
-</pre>
-        </div>
-      </div>
-
-      <h3 class="section-bar">Public Instance methods</h3>
-
-      <div id="method-M000027" class="method-detail">
-        <a name="M000027"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000027.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000027.html');return false;">
-          <span class="method-name">[]</span><span class="method-args">(*args)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Modifies #[] to accept a multiple indexes.
-</p>
-<pre>
-  require 'facet/array/[]'
-
-  a = ['a','b','c','d','e','f']
-
-  a[1]        #=&gt; 'b'
-  a[1,1]      #=&gt; ['b','b']
-  a[0,2,4]    #=&gt; ['a','c','e']
-  a[1,1,1]    #=&gt; ['b','b','b']
-</pre>
-<p>
-WARNING: Use with caution! This will cause other routines, which use the
-array[start,length] notation to no longer work. If you feel passinate about
-it, make sure all other routines use slice or facet&#8217;s own <a
-href="Array.html#M000046">get</a> method instead.
-</p>
-        </div>
-      </div>
-
-      <div id="method-M000049" class="method-detail">
-        <a name="M000049"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000049.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000049.html');return false;">
-          <span class="method-name">[]</span><span class="method-args">(*args)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Modifies #[] to accept an <a href="Array.html">Array</a> of indexes.
-</p>
-<pre>
-  require 'facet/array/[[]]'
-
-  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 id="method-M000028" class="method-detail">
-        <a name="M000028"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000028.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000028.html');return false;">
-          <span class="method-name">[]=</span><span class="method-args">(*args)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Add slicing to element assignment operator. If an <a
-href="Array.html">Array</a> is passed as the assignment then each element
-will be assigned to the corresponding index. The shorter of the two
-determine how many to assign.
-</p>
-<pre>
-  require &quot;facet/array/[]&quot;
-
-  h = [1,2,3]
-
-  h[0,1] = [10,11]       #=&gt; [10,11]
-  h                      #=&gt; [10,11,3]
-
-  h[0,1] = [12,13,14]    #=&gt; [12,13]
-  h                      #=&gt; [12,13,3]
-
-  h[0,1] = [15]          #=&gt; [15]
-  h                      #=&gt; [15,13,3]
-</pre>
-<p>
-If any other object is passed as assignment then all indexes will be
-assigned that same object.
-</p>
-<pre>
-  h[0,1] = 99            #=&gt; [99,99]
-  h                      #=&gt; [99,99,3]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000050" class="method-detail">
-        <a name="M000050"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000050.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000050.html');return false;">
-          <span class="method-name">[]=</span><span class="method-args">(*args)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Modifies #[]= to accept an <a href="Array.html">Array</a> of indexes for
-assignment.
-</p>
-<pre>
-  require 'facet/array/[[]]'
-
-  a = ['a','b','c','d']
-
-  a[[1]] = 'x'             #=&gt; ['x']
-  a                        #=&gt; ['a','x','c','d']
-
-  a[[1,-1]] = ['m','n']    #=&gt; ['m','n']
-  a                        #=&gt; ['a','m','c','n']
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000040" class="method-detail">
-        <a name="M000040"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000040.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000040.html');return false;">
-          <span class="method-name">at_rand</span><span class="method-args">( number=nil, exclusive=true )</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Return random <em>number</em> of value(s) from an <a
-href="Array.html">Array</a>. If the <em>number</em> of elements is not
-specified (or is <tt>nil</tt>) then returns a single element, otherwise
-returns a random array of elements. By defualt the 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>
-  require 'facet/array/at_rand'
-
-  [1, 2, 3, 4].at_rand           #=&gt; 2
-  [1, 2, 3, 4].at_rand(1)        #=&gt; [2]
-  [1, 2, 3, 4].at_rand(2)        #=&gt; [1,4]
-  [1, 2, 3, 4].at_rand(3)        #=&gt; [4,3,2]
-  [1, 2, 3, 4].at_rand(3,false)  #=&gt; [4,4,2]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000042" class="method-detail">
-        <a name="M000042"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000042.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000042.html');return false;">
-          <span class="method-name">at_rand!</span><span class="method-args">(number=nil)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Same as <a href="Array.html#M000040">at_rand</a>, but acts in place
-removing the element from the array. This is necessarily exclusive.
-</p>
-<pre>
-  require 'facet/array/at_rand'
-
-  a = [1,2,3,4]
-  a.at_rand!       #=&gt; 2
-  a                #=&gt; [1,3,4]
-
-  a = [1,2,3,4]
-  a.at_rand!(2)    #=&gt; [2,1]
-  a                #=&gt; [3,4]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000033" class="method-detail">
-        <a name="M000033"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000033.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000033.html');return false;">
-          <span class="method-name">body</span><span class="method-args">()</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Returns array of first element upto, but not including, the last element.
-</p>
-<pre>
-  [1,2,3].body  #=&gt; [1,2]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000036" class="method-detail">
-        <a name="M000036"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000036.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000036.html');return false;">
-          <span class="method-name">delete_values</span><span class="method-args">(*values)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Delete multiple values from array.
-</p>
-<pre>
-  require 'facet/array/delete_values'
-
-  a = [1,2,3,4]
-  a.delete_values(1,2)   #=&gt; [1,2]
-  a                      #=&gt; [3,4]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000037" class="method-detail">
-        <a name="M000037"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000037.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000037.html');return false;">
-          <span class="method-name">delete_values_at</span><span class="method-args">(*selectors)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Delete multiple values from array given indexes or index range.
-</p>
-<pre>
-  require 'facet/array/delete_values'
-
-  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 id="method-M000062" class="method-detail">
-        <a name="M000062"></a>
-
-        <div class="method-heading">
-          <span class="method-name">each_by</span><span class="method-args">(n=nil, &amp;yld)</span>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Alias for <a href="Array.html#M000061">each_slice</a>
-</p>
-        </div>
-      </div>
-
-      <div id="method-M000057" class="method-detail">
-        <a name="M000057"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000057.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000057.html');return false;">
-          <span class="method-name">each_combination</span><span class="method-args">(k=2) {|self.values_at(*idx)| ...}</span>
-          </a>
-        </div>
-      
-        <div class="method-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 id="method-M000061" class="method-detail">
-        <a name="M000061"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000061.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000061.html');return false;">
-          <span class="method-name">each_slice</span><span class="method-args">(n=nil, &amp;yld)</span>
-          </a>
-        </div>
-      
-        <div class="method-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>
-  require 'facet/array/each_slice'
-
-  [1, 2, 3, 4].each_slice(2){ |a,b| ... }
-</pre>
-<p>
-This is a specialized version <a
-href="Enumerable.html#M000360">Enumerable#each_slice</a> but optimized
-specifically for <a href="Array.html">Array</a>.
-</p>
-        </div>
-      </div>
-
-      <div id="method-M000058" class="method-detail">
-        <a name="M000058"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000058.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000058.html');return false;">
-          <span class="method-name">each_unique_pair</span><span class="method-args">(&amp;yld)</span>
-          </a>
-        </div>
-      
-        <div class="method-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#M000057">each_combination</a>(2){ &#8230; }</tt>.
-</p>
-        </div>
-      </div>
-
-      <div id="method-M000029" class="method-detail">
-        <a name="M000029"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000029.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000029.html');return false;">
-          <span class="method-name">first=</span><span class="method-args">(x)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Change the first element.
-</p>
-<pre>
-  require 'facet/array/first&amp;last='
-
-  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 id="method-M000034" class="method-detail">
-        <a name="M000034"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000034.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000034.html');return false;">
-          <span class="method-name">foot</span><span class="method-args">()</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Like last but returns the last element in an array.
-</p>
-<pre>
-  [1,2,3].foot  #=&gt; [3]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000046" class="method-detail">
-        <a name="M000046"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000046.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000046.html');return false;">
-          <span class="method-name">get</span><span class="method-args">( start, len=1 )</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Fetch values given a start index and a length.
-</p>
-<pre>
-  require 'facet/array/get'
-
-  [1,2,3,4].get(0,2)  #=&gt; [1,2]
-  [1,2,3,4].get(2,2)  #=&gt; [3,4]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000031" class="method-detail">
-        <a name="M000031"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000031.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000031.html');return false;">
-          <span class="method-name">head</span><span class="method-args">()</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Like first but returns the first element in an array.
-</p>
-<pre>
-  [1,2,3].head  #=&gt; [1]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000045" class="method-detail">
-        <a name="M000045"></a>
-
-        <div class="method-heading">
-          <span class="method-name">index_range</span><span class="method-args">(a=nil,z=nil)</span>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Alias for <a href="Array.html#M000044">range</a>
-</p>
-        </div>
-      </div>
-
-      <div id="method-M000030" class="method-detail">
-        <a name="M000030"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000030.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000030.html');return false;">
-          <span class="method-name">last=</span><span class="method-args">(x)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Change the last element.
-</p>
-<pre>
-  require 'facet/array/first&amp;last='
-
-  a = [1,2,5]
-  a.last = 3
-  p a           #=&gt; [1,2,3]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000038" class="method-detail">
-        <a name="M000038"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000038.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000038.html');return false;">
-          <span class="method-name">last_index</span><span class="method-args">()</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Returns the last index of the array. Returns nil is array has no elements.
-</p>
-<pre>
-  require 'facet/array/last_index'
-
-  [1,2,3,4,5].last_index  #=&gt; 4
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000059" class="method-detail">
-        <a name="M000059"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000059.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000059.html');return false;">
-          <span class="method-name">middle</span><span class="method-args">(offset=0)</span>
-          </a>
-        </div>
-      
-        <div class="method-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>
-  require 'facet/array/middle'
-
-  [1,2,3,4,5].middle        #=&gt; 3
-  [1,2,3,4,5,6].middle      #=&gt; 4
-  [1,2,3,4,5,6].middle(-1)  #=&gt; 3
-</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 id="method-M000043" class="method-detail">
-        <a name="M000043"></a>
-
-        <div class="method-heading">
-          <span class="method-name">pick</span><span class="method-args">(number=nil)</span>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Alias for <a href="Array.html#M000042">at_rand!</a>
-</p>
-        </div>
-      </div>
-
-      <div id="method-M000051" class="method-detail">
-        <a name="M000051"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000051.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000051.html');return false;">
-          <span class="method-name">pos</span><span class="method-args">(i)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Returns positive index of an element based on cardinal positions 1 to n and
-n to -1.
-</p>
-<pre>
-  require 'facet/array/pos'
-
-  [1,2,3,4,5].pos(1)   #=&gt; 0
-  [1,2,3,4,5].pos(-1)  #=&gt; 4
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000041" class="method-detail">
-        <a name="M000041"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000041.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000041.html');return false;">
-          <span class="method-name">rand_index</span><span class="method-args">( number=nil, exclusive=true )</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Return random index(es) from an <a href="Array.html">Array</a>. If the
-<em>number</em> of elements is not specified (or is <tt>nil</tt>) then
-returns just a single index.
-</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
-indexes are returned.
-</p>
-<pre>
-  require 'facet/array/at_rand'
-
-  [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;].rand_index           #=&gt; 1
-  [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;].rand_index           #=&gt; 2
-  [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;].rand_index(2)        #=&gt; [2,1]
-  [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;].rand_index(3)        #=&gt; [1,3,2]
-  [&quot;a&quot;, &quot;b&quot;, &quot;c&quot;, &quot;d&quot;].rand_index(3,false)  #=&gt; [4,3,4]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000044" class="method-detail">
-        <a name="M000044"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000044.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000044.html');return false;">
-          <span class="method-name">range</span><span class="method-args">(a=nil,z=nil)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Returns the index range between two elements. If no elements are given,
-returns the range from first to last.
-</p>
-<pre>
-  require 'facet/array/range'
-
-  ['a','b','c','d'].range            #=&gt; 0..3
-  ['a','b','c','d'].range('b','d')   #=&gt; 1..2
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000052" class="method-detail">
-        <a name="M000052"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000052.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000052.html');return false;">
-          <span class="method-name">rotate</span><span class="method-args">(n=1)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Rotates an array&#8217;s elements from back to front n times.
-</p>
-<pre>
-  require 'facet/array/rotate'
-
-  [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 id="method-M000053" class="method-detail">
-        <a name="M000053"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000053.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000053.html');return false;">
-          <span class="method-name">rotate!</span><span class="method-args">(n=1)</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Same as <a href="Array.html#M000052">rotate</a>, but acts in place.
-</p>
-<pre>
-  require 'facet/array/rotate'
-
-  a = [1,2,3]
-  a.rotate
-  a  #=&gt; [3,1,2]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000035" class="method-detail">
-        <a name="M000035"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000035.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000035.html');return false;">
-          <span class="method-name">select!</span><span class="method-args">( {|| ...}</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-As with select but modifies the <a href="Array.html">Array</a> in place.
-</p>
-<pre>
-  require 'facet/array/select!'
-
-  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 id="method-M000054" class="method-detail">
-        <a name="M000054"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000054.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000054.html');return false;">
-          <span class="method-name">shuffle</span><span class="method-args">()</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Randomize the order of an array.
-</p>
-<pre>
-  require 'facet/array/shuffle'
-
-  [1,2,3,4].shuffle  #=&gt; [2,4,1,3]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000055" class="method-detail">
-        <a name="M000055"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000055.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000055.html');return false;">
-          <span class="method-name">shuffle!</span><span class="method-args">()</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-As with <a href="Array.html#M000054">shuffle</a> but modifies the array in
-place. The algorithm used here is known as a Fisher-Yates shuffle.
-</p>
-<pre>
-  require 'facet/array/shuffle'
-
-  a = [1,2,3,4]
-  a.shuffle!
-  a  #=&gt; [2,4,1,3]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000060" class="method-detail">
-        <a name="M000060"></a>
-
-        <div class="method-heading">
-          <span class="method-name">store</span><span class="method-args">(*args)</span>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Alias for #[]=
-</p>
-        </div>
-      </div>
-
-      <div id="method-M000032" class="method-detail">
-        <a name="M000032"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000032.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000032.html');return false;">
-          <span class="method-name">tail</span><span class="method-args">()</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Returns an array from second element to last element.
-</p>
-<pre>
-  [1,2,3].foot  #=&gt; [2,3]
-</pre>
-        </div>
-      </div>
-
-      <div id="method-M000039" class="method-detail">
-        <a name="M000039"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000039.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000039.html');return false;">
-          <span class="method-name">thru</span><span class="method-args">( from, to )</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Fetch values from a start index thru an end index.
-</p>
-<pre>
-  require 'facet/array/upto'
-
-  [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 id="method-M000047" class="method-detail">
-        <a name="M000047"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000047.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000047.html');return false;">
-          <span class="method-name">to_b</span><span class="method-args">()</span>
-          </a>
-        </div>
-      
-        <div class="method-description">
-          <p>
-Boolean conversion for not empty?
-</p>
-        </div>
-      </div>
-
-      <div id="method-M000048" class="method-detail">
-        <a name="M000048"></a>
-
-        <div class="method-heading">
-          <a href="Array.src/M000048.html" target="Code" class="method-signature"
-            onclick="popupCode('Array.src/M000048.html');return false;">
-          <span class="method-name">to_h</span><span class="method-args">(values=nil)</span>
-          </a>
-        </div>
-      
-        <div class="method-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#M000048">to_h</a> expects the
-receiving array to be associative.
-</p>
-<pre>
-  require 'facet/array/to_h'
-
-  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>
-
-
-<div id="validator-badges">
-  <p><small><a href="http://validator.w3.org/check/referer">[Validate]</a></small></p>
-</div>
-
-</body>
-</html>