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
|
"""Test detection of redundant nested calls to min/max functions"""
# pylint: disable=redefined-builtin,unnecessary-lambda-assignment
min(1, min(2, 3)) # [nested-min-max]
max(1, max(2, 3)) # [nested-min-max]
min(min(1, 2), 3) # [nested-min-max]
min(min(min(1, 2), 3), 4) # [nested-min-max, nested-min-max]
min(1, max(2, 3))
min(1, 2, 3)
min(min(1, 2), min(3, 4)) # [nested-min-max]
min(len([]), min(len([1]), len([1, 2]))) # [nested-min-max]
orig_min = min
min = lambda *args: args[0]
min(1, min(2, 3))
orig_min(1, orig_min(2, 3)) # [nested-min-max]
# This is too complicated (for now) as there is no clear better way to write it
max(max(i for i in range(10)), 0)
max(max(max(i for i in range(10)), 0), 1)
# These examples can be improved by splicing
lst = [1, 2]
max(3, max(lst)) # [nested-min-max]
max(3, *lst)
nums = (1, 2,)
max(3, max(nums)) # [nested-min-max]
max(3, *nums)
nums = {1, 2}
max(3, max(nums)) # [nested-min-max]
max(3, *nums)
nums = {1: 2, 7: 10}
max(3, max(nums)) # [nested-min-max]
max(3, *nums)
max(3, max(nums.values())) # [nested-min-max]
max(3, *nums.values())
lst2 = [3, 7, 10]
max(3, max(nums), max(lst2)) # [nested-min-max]
|
