-
Notifications
You must be signed in to change notification settings - Fork 1
/
collection.rb
121 lines (90 loc) · 2.85 KB
/
collection.rb
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
require "rubygems/dependency"
module Gem
# Represents a searchable collection of specifications or infos
# (or anything that respons to +name+, +platform+, and +version+,
# really). This default implementation uses an Array as a backing
# store, but Gem::Source implementers may subclass it to provide
# more time and space efficient behavior.
class Collection
include Enumerable
attr_reader :entries
# Create a new instance with an optional Array of +entries+.
def initialize *entries
@entries = (entries.flatten || []).
sort_by! { |e| [e.name, e.version] }.reverse!
end
# Return a Hash containing the entries in this collection grouped
# by a property.
def by property
@grouped ||=
(grouped = Hash.new { |h,k| h[k] = [] }
each { |e| grouped[e.send property] << e }
grouped.each { |k, v| grouped[k] = self.class.new v }
grouped)
end
# Iterate through all entries. Instances of this class are
# Enumerable.
def each &block
@entries.each(&block)
end
# Is this collection empty?
def empty?
@entries.empty?
end
# The first entry in the collection.
def first
@entries.first
end
# Return a collection containing only the latest entries. Depends
# on entries being presorted.
def latest
latest = Hash.new { |h, k| h[k] = [] }
@entries.each { |e| latest[e.name] << e }
self.class.new latest.values.map { |a| a.first }.
sort_by { |e| e.version }
end
# Return a collection containing only prerelease entries.
def prerelease
@prerelease ||= self.class.new @entries.select { |e|
e.version.prerelease?
}
end
# Return a collection containing only released entries.
def released
@released ||= self.class.new @entries.reject { |e|
e.version.prerelease?
}
end
# Search this collection for entries matching +name+ and
# +requirements+. The last entry in +requirements+ may be a
# Hash. If the Hash contains a <tt>:platform</tt> key, only
# entries matching the specified platform will be returned.
def search name, *requirements
options = Hash === requirements.last ? requirements.pop : {}
dependency = Gem::Dependency.new(/#{name}/, *requirements)
self.class.new @entries.select { |e|
dependency.matches_spec?(e) &&
(!options[:platform] || options[:platform] == e.platform )
}
end
# :nodoc:
def == other
self.class === other && entries == other.entries
end
def size
@entries.size
end
alias_method :length, :size
alias_method :count, :size
def to_s
"#<#{self.class.name}: #{@entries.inspect}>"
end
def uniq
self.class.new @entries.uniq
end
def uniq!
@entries.uniq!
self
end
end
end