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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
|
require 'date'
class Version
include ActiveModel::Model
include ActiveModel::Validations
include Kkuleomi::Store::Models::VersionImport
ATTRIBUTES = %i[id
created_at
updated_at
version
package
atom
sort_key
slot
subslot
eapi
keywords
masks
use
restrict
properties
metadata_hash].freeze
attr_accessor(*ATTRIBUTES)
validates :version, presence: true
def initialize(attr = {})
attr.each do |k, v|
if ATTRIBUTES.include?(k.to_sym)
send("#{k}=", v)
end
end
end
def attributes
@id = @atom
@created_at ||= DateTime.now
@updated_at = DateTime.now
ATTRIBUTES.each_with_object({}) do |attr, hash|
if (value = send(attr))
hash[attr] = value
end
end
end
alias to_hash attributes
# Returns the keywording state on a given architecture
#
# @param [String] arch Architecture to query
# @return [Symbol] :stable, :testing, :unavailable, :unknown
def keyword(arch)
@keyword_info_cache ||= parse_keywords keywords
if @keyword_info_cache[:arches].key? arch
@keyword_info_cache[:arches][arch]
else
if @keyword_info_cache[:exclude_all]
:unavailable
else
:unknown
end
end
end
# Returns the effective keyword on a given architecture, accounting for masks
#
# @param [String] arch Architecture to query
# @return [Symbol] Keyword status
def effective_keyword(arch)
if is_masked?(arch)
:masked
else
keyword(arch)
end
end
# Returns the masks that apply to the given architecture
#
def mask(arch)
masks.reject do |m|
if m['arch'] == '*'
false
else
m['arch'] != arch
end
end
end
# Checks the masks whether one sounds like a package removal.
def removal_pending?
return false if masks.empty?
masks.each do |m|
if m['reason'].include?('removal') || m['reason'].include?('Removal')
return true
end
end
false
end
def is_masked?(arch = nil)
!mask(arch).empty?
end
# Returns supported USE flags categorized by local, global, and USE_EXPAND
# Typically called in the import phase, not live
#
# @return [Hash]
def useflags
@useflags ||= calc_useflags
end
# Retrieves the most widely used USE flags by all versions
# Note that packages with many versions are over-represented
def self.get_popular_useflags(n = 50)
search(
query: { match_all: {} },
aggs: {
group_by_flag: {
terms: {
field: 'use',
size: n
}
}
},
size: 0
).response.aggregations['group_by_flag'].buckets
end
# Parses a keyword array and assigns tags for each arch
#
# @param [Array<String>] keywords Input keywords
# @return [Hash] Parsed keywords
def parse_keywords(keywords)
res = { exclude_all: false, arches: {} }
return res unless keywords
keywords.each do |kw|
if kw == '-*'
res[:exclude_all] = true
next
end
if kw.start_with? '-'
res[:arches][kw[1..-1]] = :unavailable
next
end
if kw.start_with? '~'
res[:arches][kw[1..-1]] = :testing
next
end
res[:arches][kw] = :stable
end
res
end
private
def calc_useflags
result = { local: [], global: [], use_expand: [] }
local_flag_map = UseflagRepository.local_for(atom.gsub("-#{version}", ''))
local_flags = local_flag_map.keys
use.sort.each do |flag|
if local_flags.include? flag
result[:local] << local_flag_map[flag].to_hsh
else
# TODO(arzano) we might find a cleaner solution here
# e.g. search for all use flags with matching name
# that haven't scope=local
useflags = UseflagRepository.find_all_by(:name, flag)
for useflag in useflags do
# This should not happen, but let's be sure
next unless useflag
if useflag.scope == 'global'
result[:global] << useflag.to_hsh
elsif useflag.scope == 'use_expand'
result[:use_expand] << useflag.to_hsh
end
end
end
end
result
end
end
|