|
282 | 282 | #include <string>
|
283 | 283 |
|
284 | 284 | struct C {
|
285 |
| - std::string s; // \tcode{std::string} is the standard library class\iref{string.classes} |
| 285 | + std::string s; // \tcode{std::string} is the standard library class\iref{string.classes} |
286 | 286 | };
|
287 | 287 |
|
288 | 288 | int main() {
|
|
2375 | 2375 |
|
2376 | 2376 | void h()
|
2377 | 2377 | {
|
2378 |
| - AB::g(); // \tcode{g} is declared directly in \tcode{AB}, therefore \tcode{S} is $\{ \tcode{AB::g()} \}$ and \tcode{AB::g()} is chosen |
| 2378 | + AB::g(); // \tcode{g} is declared directly in \tcode{AB}, therefore \tcode{S} is $\{ \tcode{AB::g()} \}$ and \tcode{AB::g()} is chosen |
2379 | 2379 |
|
2380 |
| - AB::f(1); // \tcode{f} is not declared directly in \tcode{AB} so the rules are applied recursively to \tcode{A} and \tcode{B}; |
2381 |
| - // namespace \tcode{Y} is not searched and \tcode{Y::f(float)} is not considered; |
2382 |
| - // \tcode{S} is $\{ \tcode{A::f(int)}, \tcode{B::f(char)} \}$ and overload resolution chooses \tcode{A::f(int)} |
| 2380 | + AB::f(1); // \tcode{f} is not declared directly in \tcode{AB} so the rules are applied recursively to \tcode{A} and \tcode{B}; |
| 2381 | + // namespace \tcode{Y} is not searched and \tcode{Y::f(float)} is not considered; |
| 2382 | + // \tcode{S} is $\{ \tcode{A::f(int)}, \tcode{B::f(char)} \}$ and overload resolution chooses \tcode{A::f(int)} |
2383 | 2383 |
|
2384 |
| - AB::f('c'); // as above but resolution chooses \tcode{B::f(char)} |
| 2384 | + AB::f('c'); // as above but resolution chooses \tcode{B::f(char)} |
2385 | 2385 |
|
2386 |
| - AB::x++; // \tcode{x} is not declared directly in \tcode{AB}, and is not declared in \tcode{A} or \tcode{B}, so the rules |
2387 |
| - // are applied recursively to \tcode{Y} and \tcode{Z}, \tcode{S} is $\{ \}$ so the program is ill-formed |
| 2386 | + AB::x++; // \tcode{x} is not declared directly in \tcode{AB}, and is not declared in \tcode{A} or \tcode{B}, so the rules |
| 2387 | + // are applied recursively to \tcode{Y} and \tcode{Z}, \tcode{S} is $\{ \}$ so the program is ill-formed |
2388 | 2388 |
|
2389 |
| - AB::i++; // \tcode{i} is not declared directly in \tcode{AB} so the rules are applied recursively to \tcode{A} and \tcode{B}, |
2390 |
| - // \tcode{S} is $\{ \tcode{A::i}, \tcode{B::i} \}$ so the use is ambiguous and the program is ill-formed |
| 2389 | + AB::i++; // \tcode{i} is not declared directly in \tcode{AB} so the rules are applied recursively to \tcode{A} and \tcode{B}, |
| 2390 | + // \tcode{S} is $\{ \tcode{A::i}, \tcode{B::i} \}$ so the use is ambiguous and the program is ill-formed |
2391 | 2391 |
|
2392 |
| - AB::h(16.8); // \tcode{h} is not declared directly in \tcode{AB} and not declared directly in \tcode{A} or \tcode{B} so the rules |
2393 |
| - // are applied recursively to \tcode{Y} and \tcode{Z}, \tcode{S} is $\{ \tcode{Y::h(int)}, \tcode{Z::h(double)} \}$ and |
2394 |
| - // overload resolution chooses \tcode{Z::h(double)} |
| 2392 | + AB::h(16.8); // \tcode{h} is not declared directly in \tcode{AB} and not declared directly in \tcode{A} or \tcode{B} so the rules |
| 2393 | + // are applied recursively to \tcode{Y} and \tcode{Z}, \tcode{S} is $\{ \tcode{Y::h(int)}, \tcode{Z::h(double)} \}$ and |
| 2394 | + // overload resolution chooses \tcode{Z::h(double)} |
2395 | 2395 | }
|
2396 | 2396 | \end{codeblock}
|
2397 | 2397 | \end{example}
|
|
0 commit comments