|
317 | 317 | #include <string>
|
318 | 318 |
|
319 | 319 | struct C {
|
320 |
| - std::string s; // \tcode{std::string} is the standard library class\iref{string.classes} |
| 320 | + std::string s; // \tcode{std::string} is the standard library class\iref{string.classes} |
321 | 321 | };
|
322 | 322 |
|
323 | 323 | int main() {
|
|
2619 | 2619 |
|
2620 | 2620 | void h()
|
2621 | 2621 | {
|
2622 |
| - AB::g(); // \tcode{g} is declared directly in \tcode{AB}, therefore \tcode{S} is $\{ \tcode{AB::g()} \}$ and \tcode{AB::g()} is chosen |
| 2622 | + AB::g(); // \tcode{g} is declared directly in \tcode{AB}, therefore \tcode{S} is $\{ \tcode{AB::g()} \}$ and \tcode{AB::g()} is chosen |
2623 | 2623 |
|
2624 |
| - AB::f(1); // \tcode{f} is not declared directly in \tcode{AB} so the rules are applied recursively to \tcode{A} and \tcode{B}; |
2625 |
| - // namespace \tcode{Y} is not searched and \tcode{Y::f(float)} is not considered; |
2626 |
| - // \tcode{S} is $\{ \tcode{A::f(int)}, \tcode{B::f(char)} \}$ and overload resolution chooses \tcode{A::f(int)} |
| 2624 | + AB::f(1); // \tcode{f} is not declared directly in \tcode{AB} so the rules are applied recursively to \tcode{A} and \tcode{B}; |
| 2625 | + // namespace \tcode{Y} is not searched and \tcode{Y::f(float)} is not considered; |
| 2626 | + // \tcode{S} is $\{ \tcode{A::f(int)}, \tcode{B::f(char)} \}$ and overload resolution chooses \tcode{A::f(int)} |
2627 | 2627 |
|
2628 |
| - AB::f('c'); // as above but resolution chooses \tcode{B::f(char)} |
| 2628 | + AB::f('c'); // as above but resolution chooses \tcode{B::f(char)} |
2629 | 2629 |
|
2630 |
| - AB::x++; // \tcode{x} is not declared directly in \tcode{AB}, and is not declared in \tcode{A} or \tcode{B}, so the rules |
2631 |
| - // are applied recursively to \tcode{Y} and \tcode{Z}, \tcode{S} is $\{ \}$ so the program is ill-formed |
| 2630 | + AB::x++; // \tcode{x} is not declared directly in \tcode{AB}, and is not declared in \tcode{A} or \tcode{B}, so the rules |
| 2631 | + // are applied recursively to \tcode{Y} and \tcode{Z}, \tcode{S} is $\{ \}$ so the program is ill-formed |
2632 | 2632 |
|
2633 |
| - AB::i++; // \tcode{i} is not declared directly in \tcode{AB} so the rules are applied recursively to \tcode{A} and \tcode{B}, |
2634 |
| - // \tcode{S} is $\{ \tcode{A::i}, \tcode{B::i} \}$ so the use is ambiguous and the program is ill-formed |
| 2633 | + AB::i++; // \tcode{i} is not declared directly in \tcode{AB} so the rules are applied recursively to \tcode{A} and \tcode{B}, |
| 2634 | + // \tcode{S} is $\{ \tcode{A::i}, \tcode{B::i} \}$ so the use is ambiguous and the program is ill-formed |
2635 | 2635 |
|
2636 |
| - 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 |
2637 |
| - // are applied recursively to \tcode{Y} and \tcode{Z}, \tcode{S} is $\{ \tcode{Y::h(int)}, \tcode{Z::h(double)} \}$ and |
2638 |
| - // overload resolution chooses \tcode{Z::h(double)} |
| 2636 | + 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 |
| 2637 | + // are applied recursively to \tcode{Y} and \tcode{Z}, \tcode{S} is $\{ \tcode{Y::h(int)}, \tcode{Z::h(double)} \}$ and |
| 2638 | + // overload resolution chooses \tcode{Z::h(double)} |
2639 | 2639 | }
|
2640 | 2640 | \end{codeblock}
|
2641 | 2641 | \end{example}
|
|
0 commit comments