Mega Code Archive
Search
.Net
ASP .Net
ASP .Net Tutorial
C#
C# Book
C# by API
C# Tutorial
VB.Net
VB.Net by API
VB.Net Tutorial
Visual C++ .Net
VisualBasic Script
Java
Java
Java Book
Java by API
Java Tutorial
Script
Flash ActionScript
Flex
JavaScript DHTML
JavaScript Reference
JavaScript Tutorial
Database
MSSQL
MSSQL Tutorial
MySQL
MySQL Tutorial
Oracle PLSQL
Oracle PLSQL Tutorial
PostgreSQL
Languages
Android
C
C Tutorial
C++
C++ Tutorial
Delphi
Perl
PHP
Python
Python Tutorial
Ruby
Silverlight
Office
MSOfficeExcel 2007 Tutorial
MSOfficePowerPoint 2007 Tutorial
MSOfficeWord 2007 Tutorial
Data
XML
XML Tutorial
Ruby
Collections 69 codes
Home
Ruby
Collections
1 A^b is the set of values that appear in one set but not both
2 A-b
3 Add cartesian to Enumerable
4 Add element to a set
5 Add new method to set
6 Add set operation to Array
7 Building a Histogram
8 Call each a number of times
9 Classify a set into three
10 Classify set elements as even or odd
11 Clear a set
12 Collect in place
13 Comparable module can provide the other basic comparison operators and between
14 Compare two sets
15 Comparison operator
16 Convert a hash to set and divide
17 Convert set to array
18 Create set with constant values
19 Create set with Set new
20 Create Your queue
21 Create Your stack
22 Create Your tree
23 Custom class based range
24 Define your own hash
25 Delete elements from a set with block
26 Divide a set by absolute value
27 Divide a set by even and odd value
28 Divide a set by its elements class
29 Divide a set by value
30 Divide set
31 Divide set into three sub sets
32 Divide with block
33 Do an in-place intersection like this
34 Each loop
35 Easing the Delegation Blues
36 Enumerable instance_methods sort
37 Extend Forwardable
38 Extending Forwardable delegates to hash
39 Flatten the subsets
40 Get Enumerable involved
41 Implementing Enumerable - Write One Method, Get 22 Free
42 Include Comparable
43 Infix
44 Inorder preorder postorder
45 Inspect a set
46 Is it a subset
47 Is it empty
48 Is it in a set
49 Loop through a tree
50 Map elements in a set
51 Merge a range to a set
52 Partitioning or Classifying a Set
53 Randomly each
54 Reject elements from a set
55 Remove elements from a set
56 Replace a set
57 Search a tree
58 Set includes and membership
59 Set length, size and empty
60 Set subtraction
61 Sort on two arrays
62 Sort with block
63 Sorting an Array by Frequency of Appearance
64 The intersection is the set of values that appear in both
65 The union is the set of values that appear in either
66 To array
67 To string
68 Writing an Iterator Over a Data Structure
69 Writing Block Methods that Classify or Collect