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