forked from rubocop/rubocop-performance
/
sort_reverse.rb
54 lines (45 loc) · 1.22 KB
/
sort_reverse.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
# frozen_string_literal: true
module RuboCop
module Cop
module Performance
# Identifies places where `sort { |a, b| b <=> a }`
# can be replaced by a faster `sort.reverse`.
#
# @example
# # bad
# array.sort { |a, b| b <=> a }
#
# # good
# array.sort.reverse
#
class SortReverse < Base
include SortBlock
extend AutoCorrector
MSG = 'Use `sort.reverse` instead.'
def on_block(node)
sort_with_block?(node) do |send, var_a, var_b, body|
replaceable_body?(body, var_b, var_a) do
register_offense(send, node)
end
end
end
def on_numblock(node)
sort_with_numblock?(node) do |send, arg_count, body|
next unless arg_count == 2
replaceable_body?(body, :_2, :_1) do
register_offense(send, node)
end
end
end
private
def register_offense(send, node)
range = sort_range(send, node)
add_offense(range) do |corrector|
replacement = 'sort.reverse'
corrector.replace(range, replacement)
end
end
end
end
end
end