Do an in-place intersection like this:


require 'set'

s = (1..5).to_set
t = (4..8).to_set
s.reject! {|x| not t.include? x}  # => #<Set: {5, 4}>

1.	Create set with Set.new
2.	Create set with constant values
3.	Is it in a set
4.	Is it a subset
5.	Set length, size and empty?
6.	The intersection is the set of values that appear in both
7.	The union is the set of values that appear in either
8.	a-b: is the elements of a except for those also in b
9.	a^b is the set of values that appear in one set but not both: (a\|b)-(a&b)
10.	Add element to a set
11.	merge a range to a set
12.	Remove elements from a set
13.	Set subtraction
14.	Delete elements from a set with block
15.	Reject elements from a set
16.	Replace a set
17.	Clear a set
18.	Is it empty
19.	Each loop
20.	Map elements in a set
21.	Collect in place
22.	Convert set to array
23.	Inspect a set
24.	Compare two sets
25.	Classify set elements as even or odd
26.	Divide set
27.	Divide with block
28.	Flatten the subsets
29.	Add new method to set
30.	Partitioning or Classifying a Set
31.	Divide a set by value
32.	Divide a set by even and odd value
33.	Divide a set by its element's class
34.	Divide a set by absolute value
35.	Divide set into three sub sets
36.	Classify a set into three
37.	Convert a hash to set and divide
38.	Add set operation to Array
39.	Sort with block
40.	Set includes and membership

Do an in-place intersection like this: : Set « Collections « Ruby