Index:

collect detect each_with_index entries find find_all grep include? map max member? min reject select sort to_a

---

The Enumerable mixin provides collection classes with several traversal and searching methods, and with the ability to sort. The class must provide a method each, which yields successive members of the collection. If Enumerable#max , #min, or #sort is used, the objects in the collection must also implement a meaningful <=> operator, as these methods rely on an ordering between members of the collection. Returns a new array with the results of running block once for every element in enumObj. Passes each entry in enumObj to block. Returns the first for which block is not false. Returns nil if no object matches. Calls block with two arguments, the item and its index, for each item in enumObj. Synonym for Enumerable#to_a . Synonym for Enumerable#detect . Returns an array containing all elements of enumObj for which block is not false (see also Enumerable#reject ). Returns an array of every element in enumObj for which Pattern === element. If the optional block is supplied, each matching element is passed to it, and the block's result is stored in the output array. Returns true if any member of enumObj equals anObject. Equality is tested using ==. Synonym for Enumerable#collect . Returns the object in enumObj with the maximum value. The first form assumes all objects implement Comparable; the second uses the block to return a <=> b. Synonym for Enumerable#include? . Returns the object in enumObj with the minimum value. The first form assumes all objects implement Comparable; the second uses the block to return a <=> b. Returns an array for all elements of enumObj for which block is false (see also Enumerable#find_all ). Synonym for Enumerable#find_all . Returns an array containing the items in enumObj sorted, either according to their own <=> method, or by using the results of the supplied block. The block should return -1, 0, or +1 depending on the comparison between a and b. The following code sorts some files on modification time. This sort is inefficient: it generates two new File objects during every comparison. A slightly better technique is to use the Kernel#test method to generate the modification times directly. This still generates many unnecessary Time objects. A more efficient technique is to cache the sort keys (modification times in this case) before the sort. Perl users often call this approach a Schwartzian Transform, after Randal Schwartz. We construct a temporary array, where each element is an array containing our sort key along with the filename. We sort this array, and then extract the filename from the result. Returns an array containing the items in enumObj.

---

Extracted from the book "Programming Ruby - The Pragmatic Programmer's Guide"
Copyright © 2001 by Addison Wesley Longman, Inc. This material may be distributed only subject to the terms and conditions set forth in the Open Publication License, v1.0 or later (the latest version is presently available at http://www.opencontent.org/openpub/)). Distribution of substantively modified versions of this document is prohibited without the explicit permission of the copyright holder. Distribution of the work or derivative of the work in any standard (paper) book form is prohibited unless prior permission is obtained from the copyright holder.