-
Notifications
You must be signed in to change notification settings - Fork 10.4k
/
Copy pathSolutionFilteringTests.cpp
138 lines (105 loc) · 4.77 KB
/
SolutionFilteringTests.cpp
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
//===--- SolutionFilteringTests.cpp ---------------------------------------===//
//
// This source file is part of the Swift.org open source project
//
// Copyright (c) 2014 - 2020 Apple Inc. and the Swift project authors
// Licensed under Apache License v2.0 with Runtime Library Exception
//
// See https://swift.org/LICENSE.txt for license information
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
//
//===----------------------------------------------------------------------===//
#include "SemaFixture.h"
#include "swift/Sema/ConstraintSystem.h"
using namespace swift;
using namespace swift::unittest;
using namespace swift::constraints;
/// Make sure that minimization works as expected
/// and would remove solutions that score worse
/// than the best set even in ambiguity cases
/// (where there is more than one best solution).
TEST_F(SemaTest, TestFilteringBasedOnSolutionScore) {
Score bestScore{};
Score worseScore1{};
Score worseScore2{};
worseScore1.Data[SK_Unavailable] += 1;
worseScore2.Data[SK_Fix] += 1;
ConstraintSystem CS(DC, ConstraintSystemOptions());
// Let's test worse solutions in different positions
// in the list - beginning, middle, end.
// To make "best" solutions ambiguous, let's use a single
// type variable resolved into multiple distinct types.
auto *ambiguousVar = CS.createTypeVariable(
CS.getConstraintLocator({}), /*options=*/TVO_PrefersSubtypeBinding);
auto formSolution = [&](Score score, Type type) -> Solution {
Solution solution{CS, score};
solution.typeBindings[ambiguousVar] = type;
return solution;
};
// Nothing to remove
{
SmallVector<Solution, 4> solutions;
solutions.push_back(formSolution(bestScore, getStdlibType("String")));
solutions.push_back(formSolution(bestScore, getStdlibType("Int")));
auto best = CS.findBestSolution(solutions, /*minimize=*/true);
ASSERT_FALSE(best.has_value());
ASSERT_EQ(solutions.size(), 2u);
ASSERT_EQ(solutions[0].getFixedScore(), bestScore);
ASSERT_EQ(solutions[1].getFixedScore(), bestScore);
}
// Worst solutions are at the front
{
SmallVector<Solution, 4> solutions;
solutions.push_back(formSolution(worseScore1, getStdlibType("Int")));
solutions.push_back(formSolution(worseScore2, getStdlibType("Int")));
solutions.push_back(formSolution(bestScore, getStdlibType("String")));
solutions.push_back(formSolution(bestScore, getStdlibType("Int")));
auto best = CS.findBestSolution(solutions, /*minimize=*/true);
ASSERT_FALSE(best.has_value());
ASSERT_EQ(solutions.size(), 2u);
ASSERT_EQ(solutions[0].getFixedScore(), bestScore);
ASSERT_EQ(solutions[1].getFixedScore(), bestScore);
}
// Worst solutions are in the middle
{
SmallVector<Solution, 4> solutions;
solutions.push_back(formSolution(bestScore, getStdlibType("String")));
solutions.push_back(formSolution(worseScore1, getStdlibType("Int")));
solutions.push_back(formSolution(worseScore2, getStdlibType("Int")));
solutions.push_back(formSolution(bestScore, getStdlibType("Int")));
auto best = CS.findBestSolution(solutions, /*minimize=*/true);
ASSERT_FALSE(best.has_value());
ASSERT_EQ(solutions.size(), 2u);
ASSERT_EQ(solutions[0].getFixedScore(), bestScore);
ASSERT_EQ(solutions[1].getFixedScore(), bestScore);
}
// Worst solutions are at the end
{
SmallVector<Solution, 4> solutions;
solutions.push_back(formSolution(bestScore, getStdlibType("String")));
solutions.push_back(formSolution(bestScore, getStdlibType("Int")));
solutions.push_back(formSolution(worseScore1, getStdlibType("Int")));
solutions.push_back(formSolution(worseScore2, getStdlibType("Int")));
auto best = CS.findBestSolution(solutions, /*minimize=*/true);
ASSERT_FALSE(best.has_value());
ASSERT_EQ(solutions.size(), 2u);
ASSERT_EQ(solutions[0].getFixedScore(), bestScore);
ASSERT_EQ(solutions[1].getFixedScore(), bestScore);
}
// Worst solutions are spread out
{
SmallVector<Solution, 4> solutions;
solutions.push_back(formSolution(worseScore1, getStdlibType("Int")));
solutions.push_back(formSolution(bestScore, getStdlibType("String")));
solutions.push_back(formSolution(worseScore1, getStdlibType("Int")));
solutions.push_back(formSolution(worseScore2, getStdlibType("Int")));
solutions.push_back(formSolution(bestScore, getStdlibType("Int")));
solutions.push_back(formSolution(worseScore1, getStdlibType("Int")));
solutions.push_back(formSolution(worseScore2, getStdlibType("Int")));
auto best = CS.findBestSolution(solutions, /*minimize=*/true);
ASSERT_FALSE(best.has_value());
ASSERT_EQ(solutions.size(), 2u);
ASSERT_EQ(solutions[0].getFixedScore(), bestScore);
ASSERT_EQ(solutions[1].getFixedScore(), bestScore);
}
}