Document number: | WG21 N4457
Date: | 2015-04-13
Project: | Programming Language C++
Reference: | ISO/IEC IS 14882:2014
Reply to: | William M. Miller
| Edison Design Group, Inc.
| wmm@edg.com

## C++ Standard Core Language Active Issues, Revision 93

This document contains the C++ core language issues on which the Committee (INCITS PL22.16 + WG21) has not yet acted, that is, issues with status "Ready," "Tentatively Ready," "Review," "Drafting," and "Open." (See Issue Status below.)

This document is part of a group of related documents that together describe the issues that have been raised regarding the C++ Standard. The other documents in the group are:

- Closed Issues List, which contains the issues which the Committee has decided are not defects in the International Standard, including a brief rationale explaining the reason for the decision.
- Defect Reports List, which contains the issues that have been categorized by the Committee as Defect Reports, as well as other issues accepted by the Committee, along with their proposed resolutions.
- Table of Contents, which contains a summary listing of all issues in numerical order.
- Index by Section, which contains a summary listing of all issues arranged in the order of the sections of the Standard with which they deal most directly.
- Index by Status, which contains a summary listing of all issues grouped by status.

Section references in this document reflect the section numbering of document WG21 N4296.

The purpose of these documents is to record the disposition of issues that have come before the Core Language Working Group of the ANSI (INCITS PL22.16) and ISO (WG21) C++ Standard Committee.

Some issues represent potential defects in the ISO/IEC IS 14882:2014 document and corrected defects in the earlier 2011, 2003, and 1998 documents; others refer to text in the working draft for the next revision of the C++ language and not to any Standard text. Issues are not necessarily formal ISO Defect Reports (DRs). While some issues will eventually be elevated to DR status, others will be disposed of in other ways.

The most current public version of this document can be found at http://www.open-std.org/jtc1/sc22/wg21. Requests for further information about these documents should include the document number, reference ISO/IEC 14882:2014, and be submitted to the InterNational Committee for Information Technology Standards (INCITS), 1250 Eye Street NW, Suite 200, Washington, DC 20005, USA.

Information regarding C++ standardization can be found at http://isocpp.org/std.

### Revision History

Revision 93, 2015-04-13: Incorporated EWG decisions on issues 92, 203, 622, 822, 1077, 1259, 1272, 1564, 1577, 1582, 1586, 1643, 1754, 1798, 1826, and 1833. Moved issue 1657 to "accepted" status, reflecting adoption of paper N4266 at the Urbana meeting. Moved issue 1683 to "DRWP" status, reflecting approval of N4140 as the working paper at the November, 2014 meeting. Incorporated resolutions from the drafting review teleconference held 2015-04-06.

Revision 92, 2014-11-24: Changed all issues approved by the Committee since the April, 2013 Committee Draft to "C++14" status, to reflect the adoption of ISO/IEC 14882:2014. Moved issues 1299, 1651, 1893, and 1817 to "drafting" status, 1584 to "open" status, and 314, 343, 1710, 1794, and 1812 to "review" status in light of concerns that were raised with their proposed resolutions. Moved issue 1048 to "CD3" status to reflect the fact that it had been addressed by paper N3638, adopted at the April, 2013 (Bristol) meeting. Closed issues 550 and 1855 as duplicates. Reflected the actions of the November, 2014 (Urbana) meeting. Added new issues 1948, 1949, 1950, 1951, 1952, 1953, 1954, 1955, 1956, 1957, 1958, 1959, 1960, 1961, 1962, 1963, 1964, 1965, 1966, 1967, 1968, 1969, 1970, 1971, 1972, 1973, 1974, 1975, 1976, 1977, 1978, 1979, 1980, 1981, 1982, 1983, 1984, 1985, 1986, 1987, 1988, 1989, 1990, 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014, 2015, 2016, 2017, 2018, 2019, 2020, 2021, 2022, 2023, 2024, 2025, 2026, 2027, 2028, 2029, 2030, 2031, 2032, 2033, 2034, and 2035.

Revision 91, 2014-10-13: Incorporated deliberations of drafting review teleconferences held 2014-07-14 and 2014-10-06. Added new issue 1947.

Revision 90, 2014-07-07: Issue 1715 was returned to "drafting" status in light of an alternative suggestion for its resolution. Issue 1927 was closed as a duplicate of issue 1695. Reflected the deliberations of CWG at the 2014-06 (Rapperswil) meeting. Added new issues 1932, 1933, 1934, 1935, 1936, 1937, 1938, 1939, 1940, 1941, 1942, 1943, 1944, 1945, and 1946.

Revision 89, 2014-05-27: Issues 1351 1356 1465, 1590, 1639 1708, and 1810 were returned to "review" status for further discussion. Restored issue 1397 to "ready"; it had incorrectly been moved back to "drafting" because of a misunderstood comment. Added new issues 1866, 1867, 1868, 1869, 1870, 1871, 1872, 1873, 1874, 1875, 1876, 1877, 1878, 1879, 1880, 1881, 1882, 1883, 1884, 1885, 1886, 1887, 1888, 1889, 1890, 1891, 1892, 1893, 1894, 1895, 1896, 1897, 1898, 1899, 1900, 1901, 1902, 1903, 1904, 1905, 1906, 1907, 1908, 1909, 1910, 1911, 1912, 1913, 1914, 1915, 1916, 1917, 1918, 1919, 1920, 1921, 1922, 1923, 1924, 1925, 1926, 1927, 1928, 1929, 1930, and 1931.

- Revision 88, 2014-03-03: Changed the "FDIS" status to "C++11", reflecting having voted out a new DIS. Changed issues in "WP" and "DRWP" status to "CD3", reflecting the fact that their resolutions were contained in the Committee Draft approved for balloting at the April, 2013 meeting. Changed the status of issue 344 to "CD3" when it was noticed that it was resolved by the resolution of issue 1435. Changed the status of issue 1491 to "CD3" when it was noticed that it was resolved by the resolution of issue 1402. Reflected the deliberations of the February, 2014 (Issaquah) meeting. Added new issues 1837, 1838, 1839, 1840, 1841, 1842, 1843, 1844, 1845, 1846, 1847, 1848, 1849, 1850, 1851, 1852, 1853, 1854, 1855, 1856, 1857, 1858, 1859, 1860, 1861, 1862, 1863, 1864, and 1865.
- Revision 87, 2014-01-20: Incorporated the results of the drafting review teleconferences held 2013-11-25 and 2014-01-13. Changed status of issue 1469 to "extension", reflecting the consensus of the 2012-08-13 drafting review teleconference. Moved issue 1480 to "WP" status because it was rendered moot by the adoption of N3652 at the April, 2013 meeting. Added new issues 1796, 1797, 1798, 1799, 1800, 1801, 1802, 1803, 1804, 1805, 1806, 1807, 1808, 1809, 1810, 1811, 1812, 1813, 1814, 1815, 1816, 1817, 1818, 1819, 1820, 1821, 1822, 1823, 1824, 1825, 1826, 1827, 1828, 1829, 1830, 1831, 1832, 1833, 1834, 1835, and 1836.
- Revision 86, 2013-10-14: Reflected the deliberations of the September, 2013 (Chicago) meeting. Added new issues 1743, 1744, 1745, 1746, 1747, 1748, 1749, 1750, 1751, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 1764, 1765, 1766, 1767, 1768, 1769, 1770, 1771, 1772, 1773, 1774, 1775, 1776, 1777, 1778, 1779, 1780, 1781, 1782, 1783, 1784, 1785, 1786, 1787, 1788, 1789, 1790, 1791, 1792, 1793, 1794, and 1795.
- Revision 85, 2013-09-03: Incorporated the results of the drafting review teleconferences held 2013-06-24 and 2013-08-26. Changed the status of issue 583 to "DR" because it was (silently) addressed by N3624. Changed the status of issue 1531 to "DR" because it had been inadvertently overlooked in recording the motions of the April, 2013 meeting. Changed the status of issue 1597 to "accepted" because it is moot after the adoption of N3652. Returned issue 1609 to "open" status in light of additional discussion. Added new information to the description of issue 1335. Added new issues 1657, 1658, 1659, 1660, 1661, 1662, 1663, 1664, 1665, 1666, 1667, 1668, 1669, 1670, 1671, 1672, 1673, 1674, 1675, 1676, 1677, 1678, 1679, 1680, 1681, 1682, 1683, 1684, 1685, 1686, 1687, 1688, 1689, 1690, 1691, 1692, 1693, 1694, 1695, 1696, 1697, 1698, 1699, 1700, 1701, 1702, 1703, 1704, 1705, 1706, 1707, 1708, 1709, 1710, 1711, 1712, 1713, 1714, 1715, 1716, 1717, 1718, 1719, 1720, 1721, 1722, 1723, 1724, 1725, 1726, 1727, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 1740, 1741, and 1742.
- Revision 84, 2013-05-03: Incorporated the results of the drafting review teleconference held 2013-03-25 and the deliberations of the April, 2013 (Bristol) meeting. Changed issue 1568 to "dup" status. Changed the status of issue 1492 to "drafting" status, although it was approved as a DR at the meeting, because its resolution is to be given by another resolution that was not moved. Similarly, issues 1356 and 1465 were incorrectly moved as defect reports and have been returned to "review" status awaiting the adoption of issue 1351. Also, issue 1531 was moved as a DR but was lacking the proposed resolution in the document in the pre-meeting mailing, so it has been returned to "ready" status to be moved at the next meeting. Changed the resolutions of issues 1374 and 1543 to correct clerical errors transcribing the original proposed resolutions. Began the practice of marking proposed resolutions as "[SUPERSEDED]" when a newer one is added. Added new issues 1642, 1643, 1644, 1645, 1646, 1647, 1648, 1649, 1650, 1651, 1652, 1653, 1654, 1655, and 1656.
- Revision 83, 2013-03-18: Incorporated the results of the drafting review teleconference held 2013-02-04, including moving issue 1566 to "NAD" status. Moved issues 1417 and 1460 back to "review" status in light of new questions. Updated the “more information” link to refer to `isocpp.org`. Added new issues 1606, 1607, 1608, 1609, 1610, 1611, 1612, 1613, 1614, 1615, 1616, 1617, 1618, 1619, 1620, 1621, 1622, 1623, 1624, 1625, 1626, 1627, 1628, 1629, 1630, 1631, 1632, 1633, 1634, 1635, 1636, 1637, 1638, 1639, 1640, and 1641.
- Revision 82, 2013-01-14: Incorporated the results of the drafting review teleconference held 2012-12-10. Moved issues 903, 1213, 1358, 1492, 1508, and 1552 to "review" status to allow further consideration in light of subsequent discussion. Added new issues 1569, 1570, 1571, 1572, 1573, 1574, 1575, 1576, 1577, 1578, 1579, 1580, 1581, 1582, 1583, 1584, 1585, 1586, 1587, 1588, 1589, 1590, 1591, 1592, 1593, 1594, 1595, 1596, 1597, 1598, 1599, 1600, 1601, 1602, 1603, 1604, and 1605.
- Revision 81, 2012-11-03: Reflected the deliberations of the October, 2012 (Portland) meeting. Added new issues 1560, 1561, 1562, 1563, 1564, 1565, 1566, 1567, and 1568.
- Revision 80, 2012-09-24: Added remaining descriptions omitted from issues added in revision 77. Corrected status of issues 915, 1313, 1399, and 1437. Changed the status of issues 616, 903, 1318, 1358, and 1402 in light of additional discussion. Incorporated the results of the drafting review teleconference held 2012-08-13. Moved issue 321 to "dup" status. Moved issue 591 to "open" status after the discussion in "dup" issue 1526. Added additional examples to issue 203. Added new issues 1467, 1468, 1469, 1470, 1471, 1472, 1473, 1474, 1475, 1476, 1477, 1478, 1479, 1480, 1481, 1482, 1483, 1484, 1485, 1486, 1487, 1488, 1489, 1490, 1491, 1492, 1493, 1494, 1495, 1496, 1497, 1498, 1499, 1500, 1501, 1502, 1503, 1504, 1505, 1506, 1507, 1508, 1509, 1510, 1511, 1512, 1513, 1514, 1515, 1516, 1517, 1518, 1519, 1520, 1521, 1522, 1523, 1524, 1525, 1526, 1527, 1528, 1529, 1530, 1531, 1532, 1533, 1534, 1535, 1536, 1537, 1538, 1539, 1540, 1541, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1549, 1550, 1551, 1552, 1553, 1554, 1555, 1556, 1557, 1558, and 1559.
- Revision 79, 2012-02-27: Reflected deliberations at the February, 2012 (Kona) meeting. Added descriptions omitted from some issues added in revision 77. Moved issue 1427 to "NAD" status. Moved issue 1377 to "dup" status (with respect to issue 1279). Moved issue 1422 to "dup" status (with respect to issue 912). Added a new status, "concurrency", to track issues that will be considered and resolved by the Concurrency Working Group. Added new issues 1444, 1445, 1446, 1447, 1448, 1449, 1450, 1451, 1452, 1453, 1454, 1455, 1456, 1457, 1458, 1459, 1460, 1461, 1462, 1463, 1464, 1465, and 1466.
- Revision 78, 2012-01-17: Reflected the results of the December 5, 2011 teleconference. Changed the status of issues 496, 675, 739, 1268, 1269, 1287, and 1312 from "ready" to "review" in response to further discussion of the proposed resolutions. Added new issues 1370, 1371, 1372, 1373, 1374, 1375, 1376, 1377, 1378, 1379, 1380, 1381, 1382, 1383, 1384, 1385, 1386, 1387, 1388, 1389, 1390, 1391, 1392, 1393, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1402, 1403, 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, 1413, 1414, 1415, 1416, 1417, 1418, 1419, 1420, 1421, 1422, 1423, 1424, 1425, 1426, 1427, 1428, 1429, 1430, 1431, 1432, 1433, 1434, 1435, 1436, 1437, 1438, 1439, 1440, 1441, 1442, and 1443.
- Revision 77, 2011-09-06: Reflected the deliberations of the August, 2011 (Bloomington) meeting. Added new issues 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1280, 1281, 1282, 1283, 1284, 1285, 1286, 1287, 1288, 1289, 1290, 1291, 1292, 1293, 1294, 1295, 1296, 1297, 1298, 1299, 1300, 1301, 1302, 1303, 1304, 1305, 1306, 1307, 1308, 1309, 1310, 1311, 1312, 1313, 1314, 1315, 1316, 1317, 1318, 1319, 1320, 1321, 1322, 1323, 1324, 1325, 1326, 1327, 1328, 1329, 1330, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1339, 1340, 1341, 1342, 1343, 1344, 1345, 1346, 1347, 1348, 1349, 1350, 1351, 1352, 1353, 1354, 1355, 1356, 1357, 1358, 1359, 1360, 1361, 1362, 1363, 1364, 1365, 1366, 1367, 1368, and 1369. (Note that many of the preceding issues are missing descriptions. These will be provided in the next revision of the issues list.)
- Revision 76, 2011-04-10: Reflected the results of the March 7, 2011 teleconference and the March, 2011 (Madrid) meeting, including adding a new status, "FDIS," for issues that are resolved in the draft advanced at that meeting for FDIS balloting. In respect for ISO rules governing work during the balloting process, no new issues have been included in this version of the list.
- Revision 75, 2011-02-28: Reflected results of two between-meetings teleconferences, including moving a number of issues to "tentatively ready" status. Added drafting for a number of issues and moved them to "review" status. Reopened issue 109 in light of recent discussion. Moved issue 1028 back to "open" status after further analysis. Moved issues 1109 and 1127 to "DR" status, as they had been overlooked in the results of the November, 2010 (Batavia) meeting. Added new issues 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, and 1246.
- Revision 74, 2010-11-29: Reflected deliberations at the November, 2010 (Batavia) meeting. Added new issues 1211, 1212, 1213, 1214, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, and 1226.
- Revision 73, 2010-10-18: Moved issues 994 and 1058 back to "open" status for potential reconsideration. Added analysis to issue 1038. Moved issues 1125 and 1127 back to "drafting" status after further discussion revealed problems with the proposed resolution approved at the August, 2010 meeting. Moved issue 1167 to "review" status to allow consideration of extending the resolution to cover a new but related question. Reflected results of two between-meetings teleconferences, including moving a number of issues to "tentatively ready" status. Added new issues 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, and 1210,
- Revision 72, 2010-08-23: Reflected deliberations at the August, 2010 (Rapperswil) meeting. Added new issues 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1125, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1137, 1138, 1139, 1140, 1141, 1142, 1143, 1144, 1145, 1146, 1147, 1148, 1149, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1157, 1158, 1159, 1160, 1161, 1162, 1163, 1164, 1165, 1166, 1167, 1168, 1169, 1170, 1171, 1172, and 1173.
- Revision 71, 2010-08-07: Added new issues 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, and 1090.
- Revision 70, 2010-08-06: Reflected results of between-meetings teleconference, including moving a number of issues to "tentatively ready" status, updating proposed resolutions, and moving issues 341, 355, 472, and 529 to "drafting" status for more work. Changed issue 979 to "CD2" status, which was overlooked in the results of the March, 2010 meeting. Closed issues 1041, 1019, and 507 as duplicates of issues 924, 314, and 260, respectively.
- Revision 69, 2010-03-29: Reflected deliberations at the March, 2010 (Pittsburgh, PA) meeting. Placed all issues with "WP" status and newly-approved "DR" issues into "CD2" status, to reflect advancing the Final Committee Draft for balloting. Added new issues 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1032, 1033, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1065, 1066, 1067, and 1068.
- Revision 68, 2010-02-16: Reflected results of between-meeting teleconferences, including moving many issues to "tentatively ready" status and incorporating draft proposed resolutions for many others. Added new issues 999 and 1000.
- Revision 67, 2009-11-08: Reflected deliberations at the October, 2009 (Santa Cruz, CA) meeting. Added new issues 972, 973, 974, 975, 976, 977, 978, 979, 980, 981, 982, 983, 984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, and 998.
- Revision 66, 2009-09-29: Incorporated a new status, "tentatively ready", for issues whose resolutions were reviewed and approved by teleconference between meetings. Changed issue 378 to "CD1" status, as it was resolved by the resolution of issue 276. Added new issues 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 969, 970, and 971.
- Revision 65, 2009-08-03: Reflected deliberations from the Frankfurt, Germany (July, 2009) meeting. Added a new status, "concepts," for issues related to the concepts proposal that was removed from the working document and moved all concepts-related issues to that status, effectively closing them. Changed the presentation of proposed resolutions to use background colors in addition to font effects to identify changes (i.e., inserted and deleted text). Added new issues 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 937, 938, 939, 940, 941, 942, 943, 944, 945, 946, 947, and 948.
- Revision 64, 2009-06-19: Fixed incorrect cross-references in issues 867 and 868. Added proposed resolutions for issues 527, 587, 589, 604, 719, 732, and 770 and moved them to "review" status. Added discussion to issues 721, 760, 802, and 872. Added new issues 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 920, and 921.
- Revision 63, 2009-05-06: Closed issue 839 as a duplicate of issue 803. Added notes to the discussion of issues 325, 626, 667 690, 739, and 841. Moved issue 662 back to "open" status with additional discussion. Added new issues 843, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 870, 871, 872, 873, 874, 875, 876, 877, 878, 879, 880, 881, 882, 883, 884, 885, 886, 887, and 888.
- Revision 62, 2009-03-23: Reflected deliberations from the Summit, NJ (March, 2009) meeting. Marked issues directly related to National Body comments on the 2008-10 Committee Draft with a tag identifying the relevant comment; the tag is both printed in the issue body and reflected in the "Index by Status" document. Added new issues 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 801, 802, 803, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 822, 823, 824, 825, 826, 827, 828, 829, 830, 831, 832, 833, 834, 835, 836, 837, 838, 839, 840, 841, and 842.
- Revision 61, 2009-02-08: Provided a reference to a paper containing a proposed resolution for issues 695 and 699 and moved them to "review" status. Added new issues 749, 750, 751, 752, 753, 754, 755, 756, 757, 758, 759, 760, 761, 762, 763, 764, 765, and 766.
- Revision 60, 2008-12-09: Revised the resolution of issue 653 and moved to "review" status. Added new issues 724, 725, 726, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 739, 740, 741, 742, 743, 744, 745, 746, 747, and 748.
- Revision 59, 2008-10-05: Reflected deliberations from the San Francisco (September, 2008) meeting. Placed all issues with "WP" status and newly-approved "DR" issues into "CD1" status, to reflect advancing the Committee Draft for balloting. Added new proposed resolutions to issues 696, 704, and 705 and moved them to "review" status. Changed issue 265 to "dup" status in favor of issue 353, which was approved in 2003. Added new issues 710, 711, 712, 713, 714, 715, 716, 717, 718, 719, 720, 721, 722, and 723.
- Revision 58, 2008-08-25: Fixed some incorrect section references. Fixed the title of issue 692. Changed the status of issue 603 to "WP", as the paper that resolved it was approved in April, 2007. Moved issue 657 back to "review" status and added proposed wording. Added discussion to issues 693 and 697. Added or revised resolutions for issues 606, 614, 652, 685, and 694 and moved them to "review" status. Added new issues 704, 705, 706, 707, 708, and 709.
- Revision 57, 2008-07-27: Updated the status of issues 222, 309, and 632 to reflect actions at the June, 2008 meeting that were inadvertently omitted in the preceding revision. Added proposed wording for issue 683 and moved it to "review" status. Added new issues 697, 698, 699, 700, 701, 702, and 703.
- Revision 56, 2008-06-29: Reflected deliberations from the Sophia Antipolis (June, 2008) meeting. Added discussion to issues 507 and 527. Added proposed resolution for issue 653. Added new issues 695 and 696.
- Revision 55, 2008-05-18: Added proposed resolutions for issues 220, 257, 292, 341, 539, 554, 570, 571, 576, 597, 621, 624, 626, 633, 634, 639, and 642, and moved them to "review" status. Moved issue 155 to "dup" status in favor of issue 632, which was changed to "review" status in light of its connection with the initializer-list proposal. Moved issues 530 and 551 to "WP" status because they were resolved by the constexpr proposal. Moved issue 646 to "review" status because it appears to be "NAD". Changed issue 240 to "review" status (from "ready") in light of input from WG14 regarding a similar issue. Added new issues 685, 686, 687, 688, 689, 690, 691, 692, 693, and 694.
- Revision 54, 2008-03-17: Reflected deliberations from the Bellevue (February, 2008) meeting. Restructured references inside “definitions” sections (1.3 [intro.defs], 17.3 [definitions]) because the individual definitions are not sections. Returned issue 646 to "open" status (it was previously erroneously in "drafting" status). Moved issues 347, 512, and 236 to "review" status with a recommendation to close them as "NAD." Changed issues 220 and 256 back to "open" status and annotated them to indicate that they have been accepted by EWG and referred to CWG for action for C++0x. Changed issues 6 and 150 back to "open" status and annotated them to indicate that they have been accepted by EWG and referred to CWG for action, but not for C++0x. Closed issues 107, 168, 229, 294, and 359 as "NAD" to reflect the recommendation of EWG. Added new issues 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, and 684.
- Revision 53, 2008-02-03: Updated the proposed resolutions for issues 288 and 342. Updated the status of issues 199 and 430 to reflect actions at the Oxford (April, 2007) meeting. Added proposed resolutions and changed the status to "review" for issues 28, 111, 118, 141, 240, 276, 309, 355, 373, 378, 462, 485, 535, 574, 601, 608, 641, 645, and 651. Added new issues 667, 668, 669, 670, 671, and 672.
- Revision 52, 2007-12-09: Updated the status of issues 568 and 620 to reflect actions at the Toronto (July, 2007) meeting. Fixed a typographical error in the example for issue 606. Added new issues 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, and 666.
- Revision 51, 2007-10-09: Reflected deliberations from the Kona (October, 2007) meeting. Added new issues 652 and 653.
- Revision 50, 2007-09-09: Updated section reference numbers to use the numbering of the most recent working draft and added text identifying the document number of that draft at the beginning of each issues list document. Updated issue 475 with discussion regarding the point at which `std::uncaught_exception()` becomes `false`. Added new issues 642, 643, 644, 645, 646, 647, 648, 649, 650, and 651.
- Revision 49, 2007-08-05: Reflected deliberations from the Toronto (July, 2007) meeting. Added additional discussion to issues 219 and 339. Added new issues 637, 638, 639, 640, and 641.
- Revision 48, 2007-06-24: Added new issues 632, 633, 634, 635, and 636.
- Revision 47, 2007-05-06: Reflected deliberations from the Oxford (April, 2007) meeting. Added new issues 626, 627, 628, 629, 630, and 631.
- Revision 46, 2007-03-11: Added proposed wording to issue 495 and moved it to “review” status. Added new issues 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, and 625.
- Revision 45, 2007-01-14: Changed the status of issue 78 from TC1 to WP. Added new issues 603, 604, 605, 606, 607, 608, 609, 610, and 611.
- Revision 44, 2006-11-05: Reflected deliberations from the Portland (October, 2006) meeting. Added proposed wording for issues 288, 342, and 572, and moved them to “review” status. Added new issues 596, 597, 598, 599, 600, 601, and 602.
- Revision 43, 2006-09-09: Updated issues 218, 357, and 537 with additional discussion and proposed resolutions and moved them to “review” status; added issues 589, 590, 591, 592, 593, 594, and 595.
- Revision 42, 2006-06-23: Updated issues 408 and 561 with additional discussion; added a reference to a paper on the topic to issue 567; and added issues 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, and 588.
- Revision 41, 2006-04-22: Reflected deliberations from the Berlin (April, 2006) meeting. Added issues 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, and 577.
- Revision 40, 2006-02-24: Updated issue 540 to refer to paper J16/06-0022 = WG21 N1952 for its resolution. Updated issue 453 to note the need for additional drafting. Reopened issue 504 and broadened its scope to include object declarations as well. Updated issue 150 (in “extension” status) with additional commentary. Added issues 552, 553, 554, 555, 556, 557, 558, 559, 560, and 561.
- Revision 39, 2005-12-16: Updated issue 488 with additional discussion. Added issues 538, 539, 540, 541, 542, 543, 544, 545, 546, 547, 548, 549, 550, and 551.
- Revision 38, 2005-10-22: Reflected deliberations from the Mont Tremblant (October, 2005) meeting. Added isues 530, 531, 532, 533, 534, 535, 536, and 537.
- Revision 37, 2005-08-27: Added issues 523, 524, 525, 526, 527, 528, and 529.
- Revision 36, 2005-06-27: Reopened issue 484 for additional discussion. Added issues 517, 518, 519, 520, 521, and 522.
- Revision 35, 2005-05-01: Reflected deliberations from the Lillehammer (April, 2005) meeting. Updated issues 189 and 459 with additional discussion. Added new issues 504, 505, 506, 507, 508, 509, 510, 511, 512, 513, 514, 515, and 516.
- Revision 34: 2005-03-06: Closed issue 471 as NAD; updated issues 58, 232, 339, 407, and 494 with additional discussion; and added new issues 498, 499, 500, 501, 502, and 503.
- Revision 33: 2005-01-14: Updated issue 36 with additional discussion. Added new issues 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, and 497.
- Revision 32: 2004-11-07: Reflected deliberations from the Redmond (October, 2004) meeting. Added new issues 475, 476, 477, 478, 479, 480, 481, 482, 483, and 484.
- Revision 31: 2004-09-10: Updated issue 268 with comments from WG14; added comments and changed the status of issue 451 back to “open”; added discussion to issues 334, 341, 385, 399, and 430; and added new issues 470, 471, 472, 473, and 474.
- Revision 30: 2004-04-09: Reflected deliberations from the Sydney (March, 2004) meeting. Added issues 461-469, updated issues 39, 86, 257, 291, 391, 389, 435, 436, 437, 439, 441, 442, 446, 450, 453, and 458.
- Revision 29: 2004-02-13: Added issues 441-460, updated issues 39, 291, 306, 319, 389, 394, 413, and 417.
- Revision 28: 2003-11-15: Reflected deliberations from the Kona (October, 2003) meeting. Added issues 435-438.
- Revision 27: 2003-09-19: Added new issues 412-434, updated issues 54, 301, 372, 382, 391, and 399.
- Revision 26: 2003-04-25: Reflected deliberations from the Oxford (April, 2003) meeting. Added new issues 402-411.
- Revision 25: 2003-03-03: Added new issues 390-401, updated issue 214.
- Revision 24: 2002-11-08: Reflected deliberations from the Santa Cruz (October, 2002) meeting. Added new issues 379-389.
- Revision 23: 2002-09-10: Added new issues 355-378, updated issue 298 and issue 214.
- Revision 22: 2002-05-10: Reflected deliberations from the Curacao (April, 2002) meeting. Added issues 342-354.
- Revision 21: 2002-03-11: Added new issues 314-341, updated issues 132, 214, 244, 245, 254, 255, 283.
- Revision 20: 2001-11-09: Reflected deliberations from the Redmond (October, 2001) meeting. Added issue 313.
- Revision 19: 2001-09-12: Added new issues 289-308, updated issues 222, 261, 270.
- Revision 18: 2001-05-19: Reflected deliberations from the Copenhagen (April, 2001) meeting. Added new issues 282-288.
- Revision 17: 2001-04-29: Added new issues 276-81.
- Revision 16: 2001-03-27: Updated issue 138 to discuss the interaction of using-declarations and "forward declarations." Noted a problem with the proposed resolution of issue 139. Added some new discussion to issue 115. Added proposed resolution for issue 160. Updated address of C++ FAQ. Added new issues 265-275.
- Revision 15: 2000-11-18: Reflected deliberations from the Toronto (October, 2000) meeting; moved the discussion of empty and fully-initialized const objects from issue 78 into new issue 253; added new issues 254-264.
- Revision 14: 2000-10-21: Added issues 246-252; added an extra question to issue 221 and changed its status back to "review."
- Revision 13: 2000-09-16: Added issues 229-245; changed status of issue 106 to "review" because of problem detected in proposal; added wording for issues 87 and 216 and moved to "review" status; updated discussion of issues 5, 78, 198, 203, and 222.
- Revision 12: 2000-05-21: Reflected deliberations from the Tokyo (April, 2000) meeting; added new issues 222-228.
- Revision 11, 2000-04-13: Added proposed wording and moved issues 62, 73, 89, 94, 106, 121, 134, 142, and 145 to "review" status. Moved issue 13 from "extension" to "open" status because of recent additional discussion. Added new issues 217-221.
- Revision 10, 2000-03-21: Split the issues list and indices into multiple documents. Added further discussion to issues 84 and 87. Added proposed wording and moved issues 1, 69, 85, 98, 105, 113, 132, and 178 to "review" status. Added new issues 207-216.
- Revision 9, 2000-02-23: Incorporated decisions from the October, 1999 meeting of the Committee; added issues 174 through 206.
- Revision 8, 1999-10-13: Minor editorial changes to issues 90 and 24; updated issue 89 to include a related question; added issues 169, 170, 171, 172, and 173.
- Revision 7, 1999-09-14: Removed unneeded change to 14.7.3 [temp.expl.spec] paragraph 9 from issue 24; changed issue 85 to refer to 3.4.4 [basic.lookup.elab]; added issues 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, and 168.
- Revision 6, 1999-05-31: Moved issue 72 to "dup" status; added proposed wording and moved issue 90 to "review" status; updated issue 98 with additional question; added issues 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, and 121.
- Revision 5, 1999-05-24: Reordered issues by status; added revision history; first public version.

### Issue status

Issues progress through various statuses as the Core Language Working Group and, ultimately, the full PL22.16 and WG21 committees deliberate and act. For ease of reference, issues are grouped in these documents by their status. Issues have one of the following statuses:

Open: The issue is new or the working group has not yet formed an opinion on the issue. If a Suggested Resolution is given, it reflects the opinion of the issue's submitter, not necessarily that of the working group or the Committee as a whole.

Drafting: Informal consensus has been reached in the working group and is described in rough terms in a Tentative Resolution, although precise wording for the change is not yet available.

Review: Exact wording of a Proposed Resolution is now available for an issue on which the working group previously reached informal consensus.

Ready: The working group has reached consensus that a change in the working draft is required, the Proposed Resolution is correct, and the issue is ready to forward to the full Committee for ratification.

Tentatively Ready: Like "ready" except that the resolution was produced and approved by a subset of the working group membership between meetings. Persons not participating in these between-meeting activities are encouraged to review such resolutions carefully and to alert the working group with any problems that may be found.

DR: The full Committee has approved the item as a proposed defect report. The Proposed Resolution in an issue with this status reflects the best judgment of the Committee at this time regarding the action that will be taken to remedy the defect; however, the current wording of the Standard remains in effect until such time as a Technical Corrigendum or a revision of the Standard is issued by ISO.

Accepted: Like a DR except that the issue concerns the wording of the current Working Paper rather than that of the current International Standard.

TC1: A DR issue included in Technical Corrigendum 1. TC1 is a revision of the Standard issued in 2003.

CD1: A DR issue not resolved in TC1 but included in Committee Draft 1. CD1 was advanced for balloting at the September, 2008 WG21 meeting.

CD2: A DR issue not resolved in CD1 but included in the Final Committee Draft advanced for balloting at the March, 2010 WG21 meeting.

C++11: A DR issue not resolved in CD2 but included in ISO/IEC 14882:2011.

CD3: A DR/DRWP or Accepted/WP issue not resolved in C++11 but included in the Committee Draft advanceed for balloting at the April, 2013 WG21 meeting.

C++14: A DR/DRWP or Accepted/WP issue not resolved in CD3 but included in ISO/IEC 14882:2014.

DRWP: A DR issue whose resolution is reflected in the current Working Paper. The Working Paper is a draft for a future version of the Standard.

WP: An Accepted issue whose resolution is reflected in the current Working Paper.

Dup: The issue is identical to or a subset of another issue, identified in a Rationale statement.

NAD: The working group has reached consensus that the issue is not a defect in the Standard. A Rationale statement describes the working group's reasoning.

Extension: The working group has reached consensus that the issue is not a defect in the Standard but is a request for an extension to the language. The working group expresses no opinion on the merits of an issue with this status; however, the issue will be maintained on the list for possible future consideration as an extension proposal.

Concepts: The issue relates to the “Concepts” proposal that was removed from the working paper at the Frankfurt (July, 2009) meeting and hence is no longer under consideration.

Concurrency: The issue deals with concurrency and is to be handled by the Concurrency and Parallelism Study Group (SG1) within WG21.

### Issues with "Ready" Status

#### 1875. Reordering declarations in class scope

Section: 3.3.7 [basic.scope.class] Status: ready Submitter: Richard Smith Date: 2014-02-19

The rules for class scope in 3.3.7 [basic.scope.class] paragraph 1 include the following:

2. A name `N` used in a class `S` shall refer to the same declaration in its context and when re-evaluated in the completed scope of `S`. No diagnostic is required for a violation of this rule.

3. If reordering member declarations in a class yields an alternate valid program under (1) and (2), the program is ill-formed, no diagnostic is required.

The need for rule #3 is not clear; it would seem that any otherwise-valid reordering would have to violate rule #2 in order to yield a different interpretation. Taken literally, rule #3 would also apply to simply reordering nonstatic data members with no name dependencies at all. Can it be simply removed?

Proposed resolution (June, 2014):

Delete the third item of 3.3.7 [basic.scope.class] paragraph 1 and renumber the succeeding items:

3. If reordering member declarations in a class yields an alternate valid program under (1) and (2), the program is ill-formed, no diagnostic is required.

#### 1986. odr-use and delayed initialization

Section: 3.6.2 [basic.start.init] Status: ready Submitter: Richard Smith Date: 2014-08-21

The current wording of 3.6.2 [basic.start.init] allows deferral of static and thread_local initialization until a variable or function in the containing translation unit is odr-used. This requires implementations to avoid optimizing away the relevant odr-uses. We should consider relaxing the rule to allow for such optimizations.

Proposed resolution (November, 2014):

> For a variable `V` with thread or static storage duration, let `X` be the set of all variables with the same storage duration as `V` that are defined in the same translation unit as `V`. If the observable behavior of the abstract machine (1.8 [intro.object]) depends on the value of `V` through an evaluation E, and E is not sequenced before the end of the initialization of any variable in `X`, then the end of the initialization of all variables in `X` is sequenced before E.

There is also a problem (submitted by David Majnemer) if the odr-use occurs in a constexpr context that does not require the variable to be constructed. For example,

      struct A { A(); };
      thread_local A a;

      constexpr bool f() { return &a != nullptr; }

It doesn't seem possible to construct `a` before its odr-use in `f`.

There is implementation divergence in the handling of this example.

Notes from the November, 2014 meeting:

CWG determined that the second part of the issue (involving `constexpr`) is not a defect because the address of an object with thread storage duration is not a constant expression.

#### 1652. Object addresses in `constexpr` expressions

Section: 5.10 [expr.eq] Status: ready Submitter: Richard Smith Date: 2013-04-15

Pointer equality is defined by reference to the addresses of the objects designated by the pointer values, reflecting the implementation technique of most/all compilers. However, this definition is intrinsically a runtime property, and such a description is inappropriate with respect to `constexpr` expressions, which must deal with pointer comparisons without necessarily knowing the runtime layout of the objects involved. A better definition usable at compile time is needed.

Proposed resolution (November, 2014):

Change 5.10 [expr.eq] paragraph 2, converting the existing running text into bullets, as follows:

> If at least one of the operands is a pointer, pointer conversions (4.10 [conv.ptr]) and qualification conversions (4.4 [conv.qual]) are performed on both operands to bring them to their composite pointer type (Clause 5 [expr]). Comparing pointers is defined as follows: Two pointers compare equal

> - If one pointer represents the address of a complete object, and another pointer represents the address one past the last element of a different complete object [Footnote: An object that is not an array element is considered to belong to a single-element array for this purpose; see 5.3.1 [expr.unary.op]. —end footnote], the result of the comparison is unspecified.

> - Otherwise, if they the pointers are both null, both point to the same function, or both represent the same address (3.9.2 [basic.compound], they compare equal.

> - otherwise they Otherwise, the pointers compare unequal.

#### 1873. Protected member access from derived class friends

Section: 11.2 [class.access.base] Status: ready Submitter: Richard Smith Date: 2014-02-18

According to 11.2 [class.access.base] paragraph 5,

> A member `m` is accessible at the point R when named in class `N` if

> - ...

> - `m` as a member of `N` is protected, and R occurs in a member or friend of class `N`, or in a member or friend of a class `P` derived from `N`, where `m` as a member of `P` is public, private, or protected, or

> - ...

The granting of access via class `P` is troubling. At the least, there should be a restriction that `P` be visible at R. Alternatively, this portion of the rule could be removed altogether; this provision does not appear to be widely used in existing code and such references can be easily converted to use `P` instead of `N` for naming the member.

Notes from the June, 2014 meeting:

CWG noted that removing the `friend` provision would introduce an undesirable asymmetry between member functions of `P` and its friends. Instead, the intent is to require `P` to be a complete type at R.

Notes from the November, 2014 meeting:

Although the asymmetry is unfortunate, the difference between a reference in a member function and a reference in a friend is that the member function concretely determines which `P` is in view, while the friend could be befriended by a class that is a specialization of a class template and thus would require instantiations that would not otherwise occur. CWG thus decided simply to eliminate the friend case.

Proposed resolution, November, 2014:

Change bullet 5.3 of 11.2 [class.access.base] as follows:

> ...A member `m` is accessible at the point R when named in class `N` if

> - ...

> - `m` as a member of `N` is protected, and R occurs in a member or friend of class `N`, or in a member or friend of a class `P` derived from `N`, where `m` as a member of `P` is public, private, or protected, or

> - there exists...

#### 1309. Incorrect note regarding lookup of a member of the current instantiation

Section: 14.6.2.1 [temp.dep.type] Status: ready Submitter: Johannes Schaub Date: 2011-05-05

The note in 14.6.2.1 [temp.dep.type] paragraph 7 reads,

> [Note: the result of name lookup differs only when the member of the current instantiation was found in a non-dependent base class of the current instantiation and a member with the same name is also introduced by the substitution for a dependent base class of the current instantiation. —end note]

However, this is not correct. Consider the following example:

      struct Y { int X; };

      template<typename T>
      struct A : Y {
       enum B : int;
       void f() { A::X; } // finds Y::X here!
      };

      template<typename T>
      enum A<T>::B : int {
       X // introduces member A::X into A<T>!
      };

      void g() { A<int> a; a.f(); }

`A::X` is a member of the current instantiation, so paragraph 7 requires it to be looked up again when instantiating and to give a diagnostic if the lookup differs from the lookup in the definition context. The note incorrectly indicates that this can only happen if the conflicting name was introduced by a dependent base class.

Proposed resolution (August, 2011) [SUPERSEDED]:

Change 14.6.2.1 [temp.dep.type] paragraph 7 as follows:

> ...If the result of this lookup differs from the result of name lookup in the template definition context, name lookup is ambiguous. [Note: the result of name lookup differs only when the member of the current instantiation was found in a non-dependent base class of the current instantiation and a member with the same name is also introduced by the substitution for a dependent base class of the current instantiation. —end note] [Example:

>       struct A {
>         int m;
>       };

>       struct B {
>         int m;
>       };

>       template<typename T>
>       struct C : A, T {
>         int f() { return this->m; } // finds A::m in the template definition context
>       };

>       int g(C<B> cb) {
>         return cb.f();              // error: finds both A::m and B::m in the template instantiation context
>       }

> —end example]

Notes from the December, 2011 teleconference:

Changes to the exposition were suggested and the issue returned to "drafting" status.

Proposed resolution (November, 2014):

Change 14.6.2.1 [temp.dep.type] paragraph 7 as follows:

> ...If the result of this lookup differs from the result of name lookup in the template definition context, name lookup is ambiguous. [Note: the result of name lookup differs only when the member of the current instantiation was found in a non-dependent base class of the current instantiation and a member with the same name is also introduced by the substitution for a dependent base class of the current instantiation. —end note] [Example:

>       struct A {
>         int m;
>       };

>       struct B {
>         int m;
>       };

>       template<typename T>
>       struct C : A, T {
>         int f() { return this->m; }  // finds A::m in the template definition context
>       };

>       template int C<B>::f();        // error: finds both A::m and B::m

> —end example]

### Issues with "Tentatively Ready" Status

#### 1999. Representation of source characters as universal-character-names

Section: 2.2 [lex.phases] Status: tentatively ready Submitter: Richard Smith Date: 2014-09-09

According to 2.2 [lex.phases] paragraph 1, first phase,

> Any source file character not in the basic source character set (2.3 [lex.charset]) is replaced by the universal-character-name that designates that character. (An implementation may use any internal encoding, so long as an actual extended character encountered in the source file, and the same extended character expressed in the source file as a universal-character-name (i.e., using the `\uXXXX` notation), are handled equivalently except where this replacement is reverted in a raw string literal.)

This wording is obviously not intended to exclude the use of characters with code points larger than `0xffff`, but the reference to “the `\uXXXX` notation” might suggest that the `\Uxxxxxxxx` form is not allowed.

Proposed resolution (April, 2015):

Change 2.2 [lex.phases] paragraph 1 number 1 as follows:

> ...(An implementation may use any internal encoding, so long as an actual extended character encountered in the source file, and the same extended character expressed in the source file as a universal-character-name (i.e. e.g., using the `\uXXXX` notation), are handled equivalently except where this replacement is reverted in a raw string literal.)

#### 1963. Implementation-defined identifier characters

Section: 2.10 [lex.name] Status: tentatively ready Submitter: Richard Smith Date: 2014-07-07

The grammar in 2.10 [lex.name] includes the production,

identifier-nondigit:

nondigit
universal-character-name
other implementation-defined characters

The rule for “other implementation-defined characters” is a holdover from before the introduction of universal-character-names, intended to allow the use of non-ASCII national characters in identifiers. However, since all characters outside the basic source character set are now conceptually mapped to universal-character-names in translation phase 1, there is no longer a need for such a provision and it should be removed.

Proposed resolution (April, 2015):

Change the grammar in 2.10 [lex.name] as follows:

identifier-nondigit:

nondigit
universal-character-name
other implementation-defined-characters

#### 1926. Potential results of subscript operator

Section: 3.2 [basic.def.odr] Status: tentatively ready Submitter: Marcel Wid Date: 2014-05-13

The definition of the potential results of an expression in 3.2 [basic.def.odr] paragraph 2 do not, but should, include the subscript operator.

Proposed resolution (November, 2014):

Change 3.2 [basic.def.odr] paragraph 2 as follows:

> ...The set of potential results of an expression `e` is defined as follows:

> - If `e` is an id-expression (5.1.1 [expr.prim.general]), the set contains only `e`.

> - If `e` is a subscripting operation (5.2.1 [expr.sub]) with an array operand, the set contains that operand.

> - If `e` is a class member access...

#### 1886. Language linkage for `main()`

Section: 3.6.1 [basic.start.main] Status: tentatively ready Submitter: Richard Smith Date: 2014-03-04

There does not appear to be any restriction on giving `main()` an explicit language linkage, but it should probably be either ill-formed or conditionally-supported.

Proposed resolution (November, 2014):

1. Change 3.6.1 [basic.start.main] paragraph 2 as follows:

> An implementation shall not predefine the `main` function. This function shall not be overloaded. It Its type shall have C++ language linkage and it shall have a declared return type of type `int`, but otherwise its type is implementation-defined. An implementation shall allow both...

2. Change 3.6.1 [basic.start.main] paragraph 3 as follows:

> The function `main` shall not be used within a program. The linkage (3.5 [basic.link]) of `main` is implementation-defined. A program that defines `main` as deleted or that declares `main` to be `inline`, `static`, or `constexpr` is ill-formed. The `main` function shall not be declared with a linkage-specification (7.5 [dcl.link]). A program that declares a variable `main` at global scope or that declares the name `main` with C language linkage (in any namespace) is ill-formed. The name `main` is not otherwise reserved...

#### 1956. Reuse of storage of automatic variables

Section: 3.7.3 [basic.stc.auto] Status: tentatively ready Submitter: Daniel Krügler Date: 2014-06-29

According to 3.7.3 [basic.stc.auto] paragraph 3,

> If a variable with automatic storage duration has initialization or a destructor with side effects, it shall not be destroyed before the end of its block, nor shall it be eliminated as an optimization even if it appears to be unused, except that a class object or its copy/move may be eliminated as specified in 12.8 [class.copy].

This is intended to be a requirement for the implementation, but it could be read as prohibiting the reuse of the storage of an automatic variable by the program using a placement new-expression.

Proposed resolution (November, 2014):

Change 3.7.3 [basic.stc.auto] paragraph 3 as follows:

> If a variable with automatic storage duration has initialization or a destructor with side effects, it an implementation shall not be destroyed destroy it before the end of its block, nor shall it be eliminated eliminate it as an optimization, even if it appears to be unused, except that a class object or its copy/move may be eliminated as specified in 12.8 [class.copy].

#### 1951. Cv-qualification and literal types

Section: 3.9 [basic.types] Status: tentatively ready Submitter: Richard Smith Date: 2014-06-19

3.9 [basic.types] paragraph 10 isn't clear whether a const-qualified class type can be a literal type, and the same for `const void`.

Proposed resolution (April, 2015):

Change 3.9 [basic.types] paragraph 10 as follows:

> A type is a literal type if it is:

> - possibly cv-qualified `void`; or

> - a scalar type; or

> - a reference type; or

> - an array of literal type; or

> - a possibly cv-qualified class type (Clause 9 [class]) that has all of the following properties:

> - ...

#### 1929. `template` keyword following namespace nested-name-specifier

Section: 5.1.1 [expr.prim.general] Status: tentatively ready Submitter: David Krauss Date: 2014-05-15

It is not clear whether the `template` keyword should be accepted in an example like

      template<typename> struct s {};
      ::template s<void> q; // innocuous disambiguation?

Although it is accepted by the grammar, the verbiage in 5.1.1 [expr.prim.general] paragraph 10 does not mention the possibility, while the preceding paragraph dealing with class qualification calls it out explicitly.

Notes from the June, 2014 meeting:

CWG agreed that this usage should be accepted.

Proposed resolution (November, 2014):

Change 5.1.1 [expr.prim.general] paragraph 10 as follows (the base wording is as modified by issue 1887):

> The nested-name-specifier `::` names the global namespace. A nested-name-specifier that names a namespace (7.3 [basic.namespace]), optionally followed by the keyword `template` (14.2 [temp.names]), and then followed by the name of a member of that namespace (or the name of a member of a namespace made visible by a using-directive), is a qualified-id...

#### 1942. Incorrect reference to trailing-return-type

Section: 5.1.2 [expr.prim.lambda] Status: tentatively ready Submitter: Mike Miller Date: 2014-06-16

According to 5.1.2 [expr.prim.lambda] paragraph 4,

> If a lambda-expression does not include a lambda-declarator, it is as if the lambda-declarator were `()`. The lambda return type is `auto`, which is replaced by the trailing-return-type if provided...

trailing-return-type is a syntactic nonterminal that includes the `->` and thus cannot be used directly to refer to the type. It should instead say something like, ...the type specified by the trailing-return-type.

The reference in 8.3.5 [dcl.fct] paragraph 2, “...returning trailing-return-type” should be similarly adjusted.

Proposed resolution (November, 2014):

1. Change 5.1.2 [expr.prim.lambda] paragraph 4 as follows:

> If a lambda-expression does not include a lambda-declarator, it is as if the lambda-declarator were `()`. The lambda return type is `auto`, which is replaced by the type specified by the trailing-return-type if provided and/or deduced from `return` statements as described in 7.1.6.4 [dcl.spec.auto]. [Example:...

2. Change 8.3.5 [dcl.fct] paragraph 2 as follows:

> The type of the declarator-id in `D` is “derived-declarator-type-list function of (parameter-declaration-clause) cv-qualifier-seqopt ref-qualifieropt returning trailing-return-type `U`”, where `U` is the type specified by the trailing-return-type. The optional attribute-specifier-seq...

#### 1920. Qualification mismatch in pseudo-destructor-name

Section: 5.2.4 [expr.pseudo] Status: tentatively ready Submitter: David Majnemer Date: 2014-05-01

An example like

      typedef int T;
      typedef const T CT;

      void blah2(T *a) {
       a->CT::~T();
      }

is ill-formed, because 5.2.4 [expr.pseudo] paragraph 2 requires that the two type-names in the qualified-id be the same type. The corresponding case for a real destructor, however, is allowed because of the provision in 9.1 [class.name] paragraph 5 ignoring cv-qualifiers in a typedef-name referring to a class type. The specification for pseudo-destructors should be adjusted accordingly.

Proposed resolution (November, 2014):

Change 5.2.4 [expr.pseudo] paragraph 2 as follows:

> ...The cv-unqualified versions of the object type and of the type designated by the pseudo-destructor-name shall be the same type. Furthermore, the two type-names in a pseudo-destructor-name of the form

> nested-name-specifieropt type-name `:: ~` type-name

> shall designate the same scalar type (ignoring cv-qualification).

#### 1971. Unclear disambiguation of destructor and `operator~`

Section: 5.3.1 [expr.unary.op] Status: tentatively ready Submitter: Hubert Tong Date: 2014-07-15

There is language in 5.3.1 [expr.unary.op] paragraph 10 to disambiguate destructor references from references to `operator~`:

> There is an ambiguity in the unary-expression `~X()`, where `X` is a class-name or decltype-specifier. The ambiguity is resolved in favor of treating `~` as a unary complement rather than treating `~X` as referring to a destructor.

However, it is not clear whether this is intended to apply to an example like,

      struct X {
        X(int);
        operator int();
        void foo() {
          ~X(0);
        }
      };

where the form of reference has an apparent argument.

Proposed resolution (November, 2014):

Change 5.3.1 [expr.unary.op] paragraph 10 as follows:

> The operand of `~` shall have integral or unscoped enumeration type; the result is the one's complement of its operand. Integral promotions are performed. The type of the result is the type of the promoted operand. There is an ambiguity in the unary-expression `~X()`, where `X` is in the grammar when `~` is followed by a class-name or decltype-specifier. The ambiguity is resolved in favor of by treating `~` as a the unary complement operator rather than treating `~X` as referring to as the start of an unqualified-id naming a destructor. [Note: Because the grammar does not permit an operator to follow the `.`, `->`, or `::` tokens, a `~` followed by a class-name or decltype-specifier in a member access expression or qualified-id is unambiguously parsed as a destructor name. —end note]

#### 1925. Bit-field prvalues

Section: 5.19 [expr.comma] Status: tentatively ready Submitter: Richard Smith Date: 2014-05-12

According to 5.19 [expr.comma] paragraph 1,

> The type and value of the result are the type and value of the right operand; the result is of the same value category as its right operand, and is a bit-field if its right operand is a glvalue and a bit-field.

The description of a bit-field result seems to indicate that the operand might not be a glvalue but could still be a bit-field. There doesn't appear to be a normative prohibition against prvalue bit-fields, so one should presumably be added, and this wording should be adjusted to remove the suggestion that such a thing might exist.

Proposed resolution (November, 2014):

1. Change 3.10 [basic.lval] paragraph 2 as follows:

> Whenever a glvalue appears in a context where a prvalue is expected, the glvalue is converted to a prvalue; see 4.1 [conv.lval], 4.2 [conv.array], and 4.3 [conv.func]. [Note: An attempt to bind an rvalue reference to an lvalue is not such a context; see 8.5.3 [dcl.init.ref]. —end note] [Note: There are no prvalue bit-fields; if a bit-field is converted to a prvalue (4.1 [conv.lval]), a prvalue of the type of the bit-field is created, which might then be promoted (4.5 [conv.prom]). —end note]

2. Change 5.19 [expr.comma] paragraph 1 as follows:

> ...The type and value of the result are the type and value of the right operand; the result is of the same value category as its right operand, and is a bit-field if its right operand is a glvalue and a bit-field. If the value...

#### 1952. Constant expressions and library undefined behavior

Section: 5.20 [expr.const] Status: tentatively ready Submitter: Daniel Krügler Date: 2014-06-22

According to bullet 2.5 of 5.20 [expr.const],

> A conditional-expression `e` is a core constant expression unless the evaluation of `e`, following the rules of the abstract machine (1.9 [intro.execution]), would evaluate one of the following expressions:

> - ...

> - an operation that would have undefined behavior [Note: including, for example, signed integer overflow (Clause 5 [expr]), certain pointer arithmetic (5.7 [expr.add]), division by zero (5.6 [expr.mul]), or certain shift operations (5.8 [expr.shift]) —end note];

> - ...

The definition of “operation” is unclear. In particular, is it intended to include use of library components that are specified to produce undefined behavior, such as use of the `offsetof` macro when applied to a non-standard-layout class?

Proposed resolution (April, 2015):

1. Change 5.20 [expr.const] bullet 2.5 as follows:

- an operation that would have undefined behavior as specified in Clauses 1 [intro] through 16 [cpp] of this International Standard [Note: including, for example, signed integer overflow (Clause 5 [expr]), certain pointer arithmetic (5.7 [expr.add]), division by zero (5.6 [expr.mul]), or certain shift operations (5.8 [expr.shift]) —end note];

2. Add the following at the end of 5.20 [expr.const] paragraph 2:

> If `e` satisfies the constraints of a core constant expression, but evaluation of `e` would evaluate an operation that has undefined behavior as specified in Clauses 17 [library] through 30 [thread] of this International Standard, it is unspecified whether `e` is a core constant expression.

#### 1247. Restriction on alias name appearing in type-id

Section: 7.1.3 [dcl.typedef] Status: tentatively ready Submitter: James Widman Date: 2011-02-26

With the resolution of issue 1044, there is no need to say that the name of the alias cannot appear in the type-id of the declaration.

Proposed resolution (April, 2015):

Change 7.1.3 [dcl.typedef] paragraph 2 as follows:

> A typedef-name can also be introduced by an alias-declaration. The identifier following the `using` keyword becomes a typedef-name and the optional attribute-specifier-seq following the identifier appertains to that typedef-name. It has the same semantics as if it were introduced by the `typedef` specifier. In particular, it does not define a new type and it shall not appear in the type-id. [Example:...

#### 1958. `decltype(auto)` with parenthesized initializer

Section: 7.1.6.4 [dcl.spec.auto] Status: tentatively ready Submitter: Vinny Romano Date: 2014-06-30

According to 7.1.6.4 [dcl.spec.auto] paragraph 7,

> If the placeholder is the `decltype(auto)` type-specifier, the declared type of the variable or return type of the function shall be the placeholder alone. The type deduced for the variable or return type is determined as described in 7.1.6.2 [dcl.type.simple], as though the initializer had been the operand of the `decltype`.

This is problematic when the parenthesized form of initializer is used, e.g.,

      int i;
      decltype(auto) x(i);

the specification would deduce the type as `decltype((i))`, or `int&`. The wording should be clarified that the expression and not the entire initializer is considered to be the operand of `decltype`.

Proposed resolution (April, 2015):

Change 7.1.6.4 [dcl.spec.auto] paragraph 7 as follows:

> ...If the placeholder is the `decltype(auto)` type-specifier, the declared type of the variable or return type of the function shall be the placeholder alone. The type deduced for the variable or return type is determined as described in 7.1.6.2 [dcl.type.simple], as though the initializer initializer-clause or expression-list of the initializer or the expression of the `return` statement had been the operand of the decltype. [Example:

>       int i;
>       int&& f();
>       auto           x2a(i);    // decltype(x2a) is int
>       decltype(auto) x2d(i);    // decltype(x2d) is int
>       auto           x3a = i;   // decltype(x3a) is int
>       decltype(auto) x3d = i;   // decltype(x3d) is int
>       ...

#### 1966. Colon following enumeration elaborated-type-specifier

Section: 7.2 [dcl.enum] Status: tentatively ready Submitter: Daveed Vandevoorde Date: 2014-07-08

The resolution of issue 1514 was intended to apply whenever `enum` identifier appears; however, the fact that the disambiguation rule appears in the description of the enum-specifier makes it unclear that it is intended to apply in other contexts such as:

      enum E { e1 };
      void f() {
        false ? new enum E : int();
      }

Proposed resolution (April, 2015):

Change 7.2 [dcl.enum] paragraph 1 as follows:

> A `:` following “`enum` identifier” within the decl-specifier-seq of a member-declaration is parsed as part of an enum-base. [Note: This resolves a potential ambiguity between the declaration of an enumeration with an enum-base and the declaration of an unnamed bit-field of enumeration type...

#### 1888. Implicitly-declared default constructors and `explicit`

Section: 12.1 [class.ctor] Status: tentatively ready Submitter: Daniel Krügler Date: 2014-03-04

It used to be clear that an implicitly-declared default constructor is not `explicit`. That has been inadvertently lost due to other changes, so this specification should be added to 12.1 [class.ctor] in parallel with the similar statement in 12.8 [class.copy] paragraph 3.

Proposed resolution (November, 2014):

1. Change 12.1 [class.ctor] paragraph 4 as follows:

> A default constructor for a class `X` is a constructor of class `X` that can be called without an argument. If there is no user-declared constructor for class `X`, a non-`explicit` constructor having no parameters is implicitly declared as defaulted (8.4 [dcl.fct.def]). An implicitly-declared default constructor...

2. Change 12.3.1 [class.conv.ctor] paragraph 3 as follows:

> A non-explicit copy/move constructor (12.8 [class.copy]) is a converting constructor. [Note: An implicitly-declared copy/move constructor is not an explicit constructor; it may be called for implicit type conversions. —end note]

3. Change 12.8 [class.copy] paragraph 7 as follows:

> If the class definition does not explicitly declare a copy constructor, a non-`explicit` one is declared implicitly. If the class...

4. Change 12.8 [class.copy] paragraph 9 as follows:

> If the definition of a class `X` does not explicitly declare a move constructor, a non-`explicit` one will be implicitly declared as defaulted if and only if...

#### 1978. Redundant description of explicit constructor use

Section: 12.3.1 [class.conv.ctor] Status: tentatively ready Submitter: Geoffrey Romer Date: 2014-07-22

The conditions under which an `explicit` constructor will be used are given in 12.3.1 [class.conv.ctor] paragraph 2:

> An explicit constructor constructs objects just like non-explicit constructors, but does so only where the direct-initialization syntax (8.5 [dcl.init]) or where casts (5.2.9 [expr.static.cast], 5.4 [expr.cast]) are explicitly used. A default constructor may be an explicit constructor; such a constructor will be used to perform default-initialization or value-initialization (8.5 [dcl.init]).

The existence of this wording in normative text is confusing and should probably simply say that `explicit` constructors are used in direct initialization, with cross-references to 8.5 [dcl.init] and 13.3.1.4 [over.match.copy], possibly as a note.

Proposed resolution (April, 2015):

Change 12.3.1 [class.conv.ctor] paragraph 2 as follows:

> [Note: An explicit constructor constructs objects just like non-explicit constructors, but does so only where the direct-initialization syntax (8.5 [dcl.init]) or where casts (5.2.9 [expr.static.cast], 5.4 [expr.cast]) are explicitly used; see also 13.3.1.4 [over.match.copy]. A default constructor may be an explicit constructor; such a constructor will be used to perform default-initialization or value-initialization (8.5 [dcl.init]). [Example: ... —end example] —end note]

#### 1916. “Same cv-unqualified type”

Section: 12.8 [class.copy] Status: tentatively ready Submitter: Richard Smith Date: 2014-04-18

12.8 [class.copy] paragraph 31 uses the phrase, “same cv-unqualified type,” twice. This is ambiguous, potentially either requiring that the types not be cv-qualified or meaning that cv-qualification should be ignored. The latter meaning is intended and the phrase should be replaced accordingly.

Proposed resolution (November, 2014):

Change 12.8 [class.copy] paragraph 31 as follows:

> ...This elision of copy/move operations, called copy elision, is permitted in the following circumstances (which may be combined to eliminate multiple copies):

> 1. in a `return` statement in a function with a class return type, when the expression expression is the name of a non-volatile automatic object (other than a function or catch-clause parameter or a variable introduced by the exception-declaration of a handler (15.3 [except.handle])) with the same cv-unqualified type (ignoring cv-qualification) as the function return type, the copy/move operation can be omitted by constructing the automatic object directly into the function's return value

> 2. in a throw-expression...

> 3. when a temporary class object that has not been bound to a reference (12.2 [class.temporary]) would be copied/moved to a class object with the same cv-unqualified type (ignoring cv-qualification), the copy/move operation can be omitted by constructing the temporary object directly into the target of the omitted copy/move

> 4. when the exception-declaration...

#### 1967. Temporary lifetime and move-elision

Section: 12.8 [class.copy] Status: tentatively ready Submitter: Richard Smith Date: 2014-07-11

When copy elision is performed, the lifetime of the merged object ends at the later of the times the two objects' lifetimes would have ended. If the copy elision is done using a move constructor, however, it might make sense to assume that the moved-from object's lifetime is no longer interesting and the lifetime should be that of the moved-to object.

Proposed resolution (April, 2015):

Change 12.8 [class.copy] paragraph 31 as follows:

> When certain criteria are met, an implementation is allowed to omit the copy/move construction of a class object, even if the constructor selected for the copy/move operation and/or the destructor for the object have side effects. In such cases, the implementation treats the source and target of the omitted copy/move operation as simply two different ways of referring to the same object, and. If the first parameter of the selected constructor is an rvalue reference to the object's type, the destruction of that object occurs when the target would have been destroyed; otherwise, the destruction occurs at the later of the times when the two objects would have been destroyed without the optimization.122 This elision of copy/move operations, called copy elision, is permitted...

#### 1922. Injected class template names and default arguments

Section: 14.6.1 [temp.local] Status: tentatively ready Submitter: Hubert Tong Date: 2014-05-05

Use of the injected-class-name of a class template with a template-argument-list that relies on default arguments is not clearly specified in the current wording of the Standard. In particular, according to 14.1 [temp.param] paragraph 10,

> The set of default template-arguments available for use with a template declaration or definition is obtained by merging the default arguments from the definition (if in scope) and all declarations in scope in the same way default function arguments are (8.3.6 [dcl.fct.default]).

However, the injected-class-name hides the template declarations, so it is not clear whether the default arguments are available at that point or not.

Proposed resolution (November, 2014):

Change 14.1 [temp.param] paragraph 10 as follows:

> The set of default template-arguments available for use with a template declaration or definition is obtained by merging the default arguments from the definition (if in scope) and all prior declarations in scope of the template in the same way default function arguments are (8.3.6 [dcl.fct.default]). [Example:...

#### 1988. Ambiguity between dependent and non-dependent bases in implicit member access

Section: 14.6.2.1 [temp.dep.type] Status: tentatively ready Submitter: Richard Smith Date: 2014-08-22

According to 14.6.2.1 [temp.dep.type] paragraph 7,

> If, for a given set of template arguments, a specialization of a template is instantiated that refers to a member of the current instantiation with a qualified-id or class member access expression, the name in the qualified-id or class member access expression is looked up in the template instantiation context. If the result of this lookup differs from the result of name lookup in the template definition context, name lookup is ambiguous. [Note: the result of name lookup differs only when the member of the current instantiation was found in a non-dependent base class of the current instantiation and a member with the same name is also introduced by the substitution for a dependent base class of the current instantiation. —end note]

It is not clear whether this applies to an example like,

       struct A { int n; };
       struct B { int n; };
       template<typename T> struct C : T, B {
         int f() { return n; }
       };
       int k = C<A>().f();

since the reference to `n` is transformed into a class member access expression, per 9.3.1 [class.mfct.non-static] paragraph 3.

Notes from the November, 2014 meeting:

The transformation to a member access expression or qualified-id should be performed only in the instantiated function, not when processing the template definition.

Proposed resolution (April, 2015):

1. Change 9.3.1 [class.mfct.non-static] paragraph 3 as follows:

> When an id-expression (5.1 [expr.prim]) that is not part of a class member access syntax (5.2.5 [expr.ref]) and not used to form a pointer to member (5.3.1 [expr.unary.op]) is used in a member of class `X` in a context where `this` can be used (5.1.1 [expr.prim.general]), if name lookup (3.4 [basic.lookup]) resolves the name in the id-expression to a non-static non-type member of some class `C`, and if either the id-expression is potentially evaluated or `C` is `X` or a base class of `X`, the id-expression is transformed into a class member access expression (5.2.5 [expr.ref]) using `(*this)` (9.3.2 [class.this]) as the postfix-expression to the left of the `.` operator. [Note: If `C` is not `X` or a base class of `X`, the class member access expression is ill-formed. —end note] Similarly during name lookup, when an unqualified-id (5.1 [expr.prim]) used in the definition of a member function for class `X` resolves to a `static` member, an enumerator or a nested type of class `X` or of a base class of `X`, the unqualified-id is transformed into a qualified-id (5.1 [expr.prim]) in which the nested-name-specifier names the class of the member function. These transformations do not apply in the template definition context (14.6.2.1 [temp.dep.type]). [Example:...

2. Change the example in 14.6.2.1 [temp.dep.type] paragraph 7, as modified by the resolution of issue 1309, as follows:

>       struct A {
>         int m;
>       };

>       struct B {
>         int m;
>       };

>       template<typename T>
>       struct C : A, T {
>         int f() { return this->m; }// finds A::m in the template definition context
>         int g() { return m; }      // finds A::m in the template definition context
>       };

>       template int C<B>::f();      // error: finds both A::m and B::m
>       template int C<B>::g();      // OK: transformation to class member access syntax
>                                    // does not occur in the template definition context; see 9.3.1 [class.mfct.non-static]

#### 1899. Value-dependent constant expressions

Section: 14.6.2.3 [temp.dep.constexpr] Status: tentatively ready Submitter: Richard Smith Date: 2014-03-22

14.6.2.3 [temp.dep.constexpr] paragraph 1 begins,

> Except as described below, a constant expression is value-dependent if...

However, this terminology is misleading, because “constant expression” is now defined in terms of evaluation, and a value-dependent expression cannot be evaluated.

Proposed resolution (November, 2014):

1. Change 14.6.2.1 [temp.dep.type] paragraph 8 as follows:

> A type is dependent if it is

> - ...

> - an array type constructed from any whose element type is dependent type or whose size bound (if any) is specified by a constant expression that is value-dependent,

> - ...

2. Change 14.6.2.3 [temp.dep.constexpr] paragraph 1 as follows:

> Except as described below, a constant an expression used in a context where a constant expression is required is value-dependent if any subexpression is value-dependent.

### Issues with "Review" Status

#### 554. Definition of “declarative region” and “scope”

Section: 3.3 [basic.scope] Status: review Submitter: Gabriel Dos Reis Date: 29 December 2005

The various uses of the term “declarative region” throughout the Standard indicate that the term is intended to refer to the entire block, class, or namespace that contains a given declaration. For example, 3.3 [basic.scope] paragraph 2 says, in part:

> [Example: in

>         int j = 24;
>         int main()
>         {
>             int i = j, j;
>             j = 42;
>         }

> The declarative region of the first `j` includes the entire example... The declarative region of the second declaration of `j` (the `j` immediately before the semicolon) includes all the text between `{` and `}`...

However, the actual definition given for “declarative region” in 3.3 [basic.scope] paragraph 1 does not match this usage:

> Every name is introduced in some portion of program text called a declarative region, which is the largest part of the program in which that name is valid, that is, in which that name may be used as an unqualified name to refer to the same entity.

Because (except in class scope) a name cannot be used before it is declared, this definition contradicts the statement in the example and many other uses of the term throughout the Standard. As it stands, this definition is identical to that of the scope of a name.

The term “scope” is also misused. The scope of a declaration is defined in 3.3 [basic.scope] paragraph 1 as the region in which the name being declared is valid. However, there is frequent use of the phrase “the scope of a class,” not referring to the region in which the class's name is valid but to the declarative region of the class body, and similarly for namespaces, functions, exception handlers, etc. There is even a mention of looking up a name “in the scope of the complete postfix-expression” (3.4.5 [basic.lookup.classref] paragraph 3), which is the exact inverse of the scope of a declaration.

This terminology needs a thorough review to make it logically consistent. (Perhaps a discussion of the scope of template parameters could also be added to section 3.3 [basic.scope] at the same time, as all other kinds of scopes are described there.)

Proposed resolution (November, 2006):

1. Change 3.3 [basic.scope] paragraph 1 as follows:

> Every name is introduced in some portion of program text called a declarative region, which is the largest part of the program in which that name is valid, that is, in which that name may be used as an unqualified name to refer to the same entity a statement, block, function declarator, function-definition, class, handler, template-declaration, template-parameter-list of a template template-parameter, or namespace. In general, each particular name is valid may be used as an unqualified name to refer to the entity of its declaration or to the label only within some possibly discontiguous portion of program text called its scope. To determine the scope of a declaration...

2. Change 3.3 [basic.scope] paragraph 3 as follows:

> The names declared by a declaration are introduced into the scope in which the declaration occurs declarative region that directly encloses the declaration, except that declaration-statements, function parameter names in the declarator of a function-definition, exception-declarations (3.3.3 [basic.scope.block]), the presence of a `friend` specifier (11.3 [class.friend]), certain uses of the elaborated-type-specifier (7.1.6.3 [dcl.type.elab]), and using-directives (7.3.4 [namespace.udir]) alter this general behavior.

3. Change 3.3.3 [basic.scope.block] paragraphs 1-3 and add a new paragraph 4 before the existing paragraph 4 as follows:

> A name declared in a block (6.3 [stmt.block]) is local to that block. Its potential scope begins at its point of declaration (3.3.2 [basic.scope.pdecl]) and ends at the end of its declarative region. The declarative region of a name declared in a declaration-statement is the directly enclosing block (6.3 [stmt.block]). Such a name is local to the block.

> The potential scope declarative region of a function parameter name (including one appearing in the declarator of a function-definition or in a lambda-parameter-declaration-clause) or of a function-local predefined variable in a function definition (8.4 [dcl.fct.def]) begins at its point of declaration. If the function has a function-try-block the potential scope of a parameter or of a function-local predefined variable ends at the end of the last associated handler, otherwise it ends at the end of the outermost block of the function definition. A parameter name is the entire function definition or lambda-expression. Such a name is local to the function definition and shall not be redeclared in the any outermost block of the function definition nor in the outermost block of any handler associated with a function-try-block function-body (including handlers of a function-try-block) or lambda-expression.

> The name in a `catch` exception-declaration The declarative region of a name declared in an exception-declaration is its entire handler. Such a name is local to the handler and shall not be redeclared in the outermost block of the handler.

> The potential scope of any local name begins at its point of declaration (3.3.2 [basic.scope.pdecl]) and ends at the end of its declarative region.

4. Change 3.3.5 [basic.funscope] as indicated:

> Labels (6.1 [stmt.label]) have function scope and may be used anywhere in the function in which they are declared except in members of local classes (9.8 [class.local]) of that function. Only labels have function scope.

5. Change 6.7 [stmt.dcl] paragraph 1 as follows:

> A declaration statement introduces one or more new identifiers names into a block; it has the form

> declaration-statement:
> block-declaration

> [Note: If an identifier a name introduced by a declaration was previously declared in an outer block, the outer declaration is hidden for the remainder of the block, after which it resumes its force (3.3.10 [basic.scope.hiding]). —end note]

[Drafting notes: This resolution deals almost exclusively with the unclear definition of “declarative region.” I've left the ambiguous use of “scope” alone for now. However sections 3.3.x all have headings reading “xxx scope,” but they don't mean the scope of a declaration but the different kinds of declarative regions and their effects on the scope of declarations contained therein. To me, it looks like most of 3.4 should refer to “declarative region” and not to “scope.”

The change to 6.7 fixes an “identifier” misuse (e.g., `extern T operator+(T,T);` at block scope introduces a name but not an identifier) and removes normative redundancy.]

#### 2011. Unclear effect of reference capture of reference

Section: 5.1.2 [expr.prim.lambda] Status: review Submitter: Ville Voutilainen Date: 2014-09-28

The Standard refers to capturing “entities,” and a reference is an entity. However, it is not clear what capturing a reference by reference would mean. In particular, 5.1.2 [expr.prim.lambda] paragraph 16 says,

> It is unspecified whether additional unnamed non-static data members are declared in the closure type for entities captured by reference.

If a reference captured by reference is not represented by a member, it is hard to see how something like the following example could work:

      #include <functional>
      #include <iostream>

      std::function<void()> make_function(int& x) {
        return [&]{ std::cout << x << std::endl; };
      }

      int main() {
        int i = 3;
        auto f = make_function(i);
        i = 5;
        f();
      }

Should this be undefined behavior or should it print `5`?

Proposed resolution (November, 2014):

1. Change 5.1.2 [expr.prim.lambda] paragraph 18 as follows:

> Every id-expression within the compound-statement of a lambda-expression that is an odr-use (3.2 [basic.def.odr]) of an entity captured by copy is transformed into an access to the corresponding unnamed data member of the closure type. [Note: An id-expression that is not an odr-use refers to the original entity, never to a member of the closure type. Furthermore, such an id-expression does not cause the implicit capture of the entity. —end note] If `this` is captured, each odr-use of `this` is transformed into an access to the corresponding unnamed data member of the closure type, cast (5.4 [expr.cast]) to the type of `this`. [Note: The cast ensures that the transformed expression is a prvalue. —end note] An id-expression within the compound-statement of a lambda-expression that is an odr-use of a reference captured by reference refers to the entity to which the captured reference is bound and not to the captured reference. [Note: Such odr-uses are not invalidated by the end of the captured reference's lifetime. —end note] [Example:

>       void f(const int*);
>       void g() {
>         const int N = 10;
>         [=] {
>         int arr[N]; // OK: not an odr-use, refers to automatic variable
>         f(&N);      // OK: causes N to be captured; &N points to the
>                     // corresponding member of the closure type
>         };
>       }
>       auto h(int &r) {
>         return [&]() {
>           ++r;      // Valid after h returns if the lifetime of the
>                     // object to which r is bound has not ended
>         };
>       }

> —end example]

2. Change 5.1.2 [expr.prim.lambda] paragraph 23 as follows:

> [Note: If an a non-reference entity is implicitly or explicitly captured by reference, invoking the function call operator of the corresponding lambda-expression after the lifetime of the entity has ended is likely to result in undefined behavior. —end note]

#### 1930. init-declarator-list vs member-declarator-list

Section: 7.1.1 [dcl.stc] Status: review Submitter: Richard Smith Date: 2014-05-19

According to 7.1.1 [dcl.stc] paragraph 1,

> If a storage-class-specifier appears in a decl-specifier-seq, there can be no `typedef` specifier in the same decl-specifier-seq and the init-declarator-list of the declaration shall not be empty...

This obviously should apply to `mutable` but does not because `mutable` applies to member-declarator-lists, not init-declarator-lists. Similarly, in 7.1.6.1 [dcl.type.cv] paragraph 1,

> If a cv-qualifier appears in a decl-specifier-seq, the init-declarator-list of the declaration shall not be empty.

this should apply to member declarations as well.

Proposed resolution (November, 2014):

1. Change 7.1.1 [dcl.stc] paragraph 1 as follows:

> ...If a storage-class-specifier appears in a decl-specifier-seq, there can be no `typedef` specifier in the same decl-specifier-seq and the init-declarator-list or member-declarator-list of the declaration shall not be empty (except for an anonymous union declared in a named namespace or in the global namespace at namespace scope, which shall be declared `static` (9.5 [class.union])). The storage-class-specifier applies...

2. Change 7.1.6.1 [dcl.type.cv] paragraph 1 as follows:

> ...If a cv-qualifier appears in a decl-specifier-seq, the init-declarator-list or member-declarator-list of the declaration shall not be empty. [Note:...

Additional note, November, 2014:

The preceding resolution, which was advanced to "tentatively ready" status during the review session following the November, 2014 (Urbana) meeting, introduces an apparently unintentional conflict with 9.5 [class.union] paragraph 6 regarding the requirements for anonymous unions in unnamed namespaces and has been returned to "review" status to allow further discussion.

#### 1710. Missing `template` keyword in class-or-decltype

Section: 10 [class.derived] Status: review Submitter: Richard Smith Date: 2013-07-03

A class-or-decltype is used as a base-specifier and as a mem-initializer-id that names a base class. It is specified in 10 [class.derived] paragraph 1 as:

class-or-decltype:

nested-name-specifieropt class-name
decltype-specifier

Consequently, a declaration like

      template<typename T> struct D : T::template B<int>::template C<int> {};

is ill-formed, although most implementations accept it; some actually require the use of the `template` keyword, although the relevant wording in 14.2 [temp.names] paragraph 4 only requires it in a qualified-id, not in a class-or-decltype. It would probably be good to add a production like

nested-name-specifier `template` simple-template-id

to the definition of class-or-decltype and explicitly mention those contexts in 14.2 [temp.names] as not requiring use of the `template` keyword.

Additional note (January, 2014):

This is effectively issues 314 and 343.

See also issue 1812.

Proposed resolution (February, 2014):

1. Change 9 [class] paragraph 3 as follows:

> If a class is marked with the class-virt-specifier `final` and it appears as a base-type-specifier class-or-decltype in a base-clause (Clause 10 [class.derived]), the program is ill-formed. Whenever a class-key is followed...

2. Change the grammar in 10 [class.derived] paragraph 1 as follows:

base-specifier:

attribute-specifier-seqopt base-type-specifier class-or-decltype
attribute-specifier-seqopt `virtual` access-specifieropt base-type-specifier class-or-decltype
attribute-specifier-seqopt access-specifier `virtual` opt base-type-specifier class-or-decltype

class-or-decltype:

nested-name-specifieropt class-name
nested-name-specifier `template` simple-template-id
decltype-specifier

base-type-specifier:

class-or-decltype

access-specifier:

...

3. Delete paragraph 4 and change paragraph 5 of 14.2 [temp.names] as follows, splitting paragraph 5 into two paragraphs and moving the example from paragraph 4 into paragraph 5:

> When the name of a member template specialization appears after `.` or `->` in a postfix-expression or after a nested-name-specifier in a qualified-id, and the object expression of the postfix-expression is type-dependent or the nested-name-specifier in the qualified-id refers to a dependent type, but the name is not a member of the current instantiation (14.6.2.1 [temp.dep.type]), the member template name must be prefixed by the keyword `template`. Otherwise the name is assumed to name a non-template. [Example: ... —end example]

> A name prefixed by the keyword `template` shall be a template-id or the name shall refer to a class template or alias template. [Note: The keyword `template` may not be applied to non-template members of class templates. —end note] The nested-name-specifier (5.1.1 [expr.prim.general]) of

> - a class-head-name (Clause 9 [class]) or enum-head (7.2 [dcl.enum]) (if any) or

> - a qualified-id in a declarator-id (Clause 8 [dcl.decl]),

> or a nested-name-specifier directly contained in such a nested-name-specifier (recursively), shall not be of the form

> nested-name-specifier `template` simple-template-id `::`

> [Note: That is, a simple-template-id shall not be prefixed by the keyword `template` in these cases. —end note]

> The keyword `template` is optional in a typename-specifier (14.6 [temp.res]), elaborated-type-specifier (7.1.6.3 [dcl.type.elab]), using-declaration (7.3.3 [namespace.udecl]), or class-or-decltype (Clause 10 [class.derived]), and in recursively directly-contained nested-name-specifiers thereof. In these contexts, a `<` token is always assumed to introduce a template-argument-list. [Note: Thus, if the preceding name is not a template-name, the program is ill-formed. —end note] In other contexts, when the name of a member template specialization appears after a nested-name-specifier that denotes a dependent type, but the name is not a member of the current instantiation, the member template name shall be prefixed by the keyword `template`. Similarly, when the name of a member template specialization appears after `.` or `->` in a postfix-expression (5.2 [expr.post]) and the object expression of the postfix-expression is type-dependent, but the name is not a member of the current instantiation (14.6.2.1 [temp.dep.type]), the member template name shall be prefixed by the keyword `template`. Otherwise, the name is assumed to name a non-template. [Example:

>         <From original paragraph 4>

> —end example] [Note: As is the case with the `typename` prefix...

This resolution also resolves issues 314, 343, 1794, and 1812.

Additional note, November, 2014:

Concerns have been expressed over the clarity and organization of the proposed resolution, so the issue has been moved back to "review" status to allow CWG to address these concerns.

#### 314. `template` in base class specifier

Section: 14.2 [temp.names] Status: review Submitter: Mark Mitchell Date: 23 Aug 2001

The EDG front-end accepts:

    template <typename T>
    struct A {
      template <typename U>
      struct B {};
    };

    template <typename T>
    struct C : public A<T>::template B<T> {
    };

It rejects this code if the base-specifier is spelled `A<T>::B<T>`.

However, the grammar for a base-specifier does not allow the `template` keyword.

Suggested resolution:

It seems to me that a consistent approach to the solution that looks like it will be adopted for issue 180 (which deals with the `typename` keyword in similar contexts) would be to assume that `B` is a template if it is followed by a "<". After all, an expression cannot appear in this context.

Notes from the 4/02 meeting:

We agreed that `template` must be allowed in this context. The syntax needs to be changed. We also opened the related issue 343.

Additional note (August, 2010):

The same considerations apply to mem-initializer-ids, as noted in issue 1019.

Additional note (January, 2014):

See also issue 1710.

Proposed resolution (February, 2014):

This issue is resolved by the resolution of issue 1710.

#### 343. Make `template` optional in contexts that require a type

Section: 14.2 [temp.names] Status: review Submitter: Steve Adamczyk Date: 23 April 2002

By analogy with `typename`, the keyword `template` used to indicate that a dependent name will be a template name should be optional in contexts where a type is required, e.g., base class lists. We could also consider member and parameter declarations.

This was suggested by issue 314.

Additional note (January, 2014):

See also issue 1710.

Proposed resolution (February, 2014):

This issue is resolved by the resolution of issue 1710.

#### 1794. `template` keyword and alias templates

Section: 14.2 [temp.names] Status: review Submitter: Jonathan Caves Date: 2013-10-04

The current wording of 14.2 [temp.names] paragraph 5 is:

> A name prefixed by the keyword template shall be a template-id or the name shall refer to a class template.

Presumably this should also allow `template` before alias templates. For example,

      template<template<typename> class Template>
      struct Internal {
              template<typename Arg>
              using Bind = Template<Arg>;
      };

      template<template<typename> class Template, typename Arg>
      using Instantiate = Template<Arg>;

      template<template<typename> class Template, typename Argument>
      using Bind = Instantiate<Internal<Template>::template Bind, Argument>;

Proposed resolution (February, 2014):

This issue is resolved by the resolution of issue 1710.

#### 1812. Omission of `template` in a typename-specifier

Section: 14.2 [temp.names] Status: review Submitter: Daveed Vandevoorde Date: 2013-11-18

According to 14.2 [temp.names] paragraph 4,

> When the name of a member template specialization appears after . or -> in a postfix-expression or after a nested-name-specifier in a qualified-id, and the object expression of the postfix-expression is type-dependent or the nested-name-specifier in the qualified-id refers to a dependent type, but the name is not a member of the current instantiation (14.6.2.1 [temp.dep.type]), the member template name must be prefixed by the keyword template. Otherwise the name is assumed to name a non-template.

This does not seem necessary in a typename-specifier; a `<` following a qualified-id in a typename-specifier could safely be assumed to begin a template argument list, so the `template` keyword should be optional in this case. Some implementations already do not enforce this requirement.

See also issue 1710.

Proposed resolution (February, 2014):

This issue is resolved by the resolution of issue 1710.

#### 2008. Default template-arguments underspecified

Section: 14.3 [temp.arg] Status: review Submitter: Andrew Sutton Date: 2014-09-23

Proposed resolution, November, 2014:

Add the following as a new paragraph after 14.3 [temp.arg] paragraph 7:

> When the template in a template-id is an overloaded function template...

> When a simple-template-id does not name a function, a default template-argument is implicitly instantiated (14.7.1 [temp.inst]) in a context that requires the value of that default argument. [Example:

>       template<typename T, typename U = int> struct S { };
>       S<bool>* p; // the type of p is S<bool, int>*

> The default argument for `U` is instantiated to form the type `S<bool, int>*`, but the definition of that class template specialization is not implicitly instantiated (14.7.1 [temp.inst]); it is not used in a context that requires a complete type. —end example]

Notes from the November, 2014 meeting:

The preceding was extracted from the wording of the Concepts Lite draft Technical Specification.

#### 1955. `#elif` with invalid controlling expression

Section: 16.1 [cpp.cond] Status: review Submitter: Jonathan Wakely Date: 2014-06-25

An `#elif` is treated differently from an `#else` followed immediately by an `#if`: assuming the preceding `#if`'s condition was `true`, the condition in the second `#if` need not be a valid expression, while the condition in the `#elif` directive, though not evaluated, still must be syntactically correct.

C DR 412 changes that for C; C++ should make the corresponding change.

Proposed resolution (November, 2014):

Change 16.1 [cpp.cond] paragraph 6 as follows:

> Each directive's condition is checked in order. If it evaluates to false (zero), the group that it controls is skipped: directives are processed only through the name that determines the directive in order to keep track of the level of nested conditionals; the rest of the directives' preprocessing tokens are ignored, as are the other preprocessing tokens in the group. Only the first group whose control condition evaluates to true (nonzero) is processed; any following groups are skipped and their controlling directives are processed as if they were in a group that is skipped. If none of the conditions...

### Issues with "Drafting" Status

#### 1938. Should hosted/freestanding be implementation-defined?

Section: 1.4 [intro.compliance] Status: drafting Submitter: Richard Smith Date: 2014-06-09

Whether an implementation is hosted or freestanding is only required to be documented by the value of the `__STDC_HOSTED__` macro (16.8 [cpp.predefined]). Should this characteristic be classified as implementation-defined, thus requiring documentation?

#### 1343. Sequencing of non-class initialization

Section: 1.9 [intro.execution] Status: drafting Submitter: Johannes Schaub Date: 2011-08-12

The current wording does not indicate that initialization of a non-class object is a full-expression, but presumably should do so.

Additional note, April, 2013:

There is implementation variance in the treatment of the following example:

      struct A {
        A() { puts("ctor"); }
        A(const A&) { puts("copy"); }
        const A&get() const { return *this; }
        ~A() { puts("dtor"); }
      };
      struct B { B(A, A) {} };

      typedef A A2[2];
      A2 a = { A().get(), A().get() };
      B b = { A().get(), A().get() };
      int c = (A2{ A().get(), A().get() }, 0);
      int d = (B{ A().get(), A().get() }, 0);

      int main() {}

Additional note (February, 2014):

Aggregate initialization could also involve more than one full-expression, so the limitation above to “initialization of a non-class object” is not correct.

#### 1949. “sequenced after” instead of “sequenced before”

Section: 1.9 [intro.execution] Status: drafting Submitter: Richard Smith Date: 2014-06-18

The term “sequenced after” is used in both the core and library clauses instead of the more-correct “sequenced before.”

#### 1332. Handling of invalid universal-character-names

Section: 2.3 [lex.charset] Status: drafting Submitter: Mike Miller Date: 2011-06-20

According to 2.3 [lex.charset] paragraph 2,

> The character designated by the universal-character-name `\UNNNNNNNN` is that character whose character short name in ISO/IEC 10646 is `NNNNNNNN`; the character designated by the universal-character-name `\uNNNN` is that character whose character short name in ISO/IEC 10646 is `0000NNNN`. If the hexadecimal value for a universal-character-name corresponds to a surrogate code point (in the range 0xD800-0xDFFF, inclusive), the program is ill-formed. Additionally, if the hexadecimal value for a universal-character-name outside the c-char-sequence, s-char-sequence, or r-char-sequence of a character or string literal corresponds to a control character (in either of the ranges 0x00-0x1F or 0x7F-0x9F, both inclusive) or to a character in the basic source character set, the program is ill-formed.

It is not specified what should happen if the hexadecimal value does not designate a Unicode code point: is that undefined behavior or does it make the program ill-formed?

As an aside, a note should be added explaining why these requirements apply to to an r-char-sequence when, as the footnote at the end of the paragraph explains,

> A sequence of characters resembling a universal-character-name in an r-char-sequence (2.13.5 [lex.string]) does not form a universal-character-name.

#### 369. Are `new`/`delete` identifiers or preprocessing-op-or-punc?

Section: 2.4 [lex.pptoken] Status: drafting Submitter: Martin v. Loewis Date: 30 July 2002

2.4 [lex.pptoken] paragraph 2 specifies that there are 5 categories of tokens in phases 3 to 6. With 2.12 [lex.operators] paragraph 1, it is unclear whether `new` is an identifier or a preprocessing-op-or-punc; likewise for `delete`. This is relevant to answer the question whether

    #define delete foo

is a well-formed control-line, since that requires an identifier after the `define` token.

(See also issue 189.)

#### 1655. Line endings in raw string literals

Section: 2.4 [lex.pptoken] Status: drafting Submitter: Mike Miller Date: 2013-04-26

According to 2.4 [lex.pptoken] paragraph 3,

> If the input stream has been parsed into preprocessing tokens up to a given character:

> - If the next character begins a sequence of characters that could be the prefix and initial double quote of a raw string literal, such as `R"`, the next preprocessing token shall be a raw string literal. Between the initial and final double quote characters of the raw string, any transformations performed in phases 1 and 2 (trigraphs, universal-character-names, and line splicing) are reverted; this reversion shall apply before any d-char, r-char, or delimiting parenthesis is identified.

However, phase 1 is defined as:

> Physical source file characters are mapped, in an implementation-defined manner, to the basic source character set (introducing new-line characters for end-of-line indicators) if necessary. The set of physical source file characters accepted is implementation-defined. Trigraph sequences (_N4140_.2.4 [lex.trigraph]) are replaced by corresponding single-character internal representations. Any source file character not in the basic source character set (2.3 [lex.charset]) is replaced by the universal-character-name that designates that character.

The reversion described in 2.4 [lex.pptoken] paragraph 3 specifically does not mention the replacement of physical end-of-line indicators with new-line characters. Is it intended that, for example, a CRLF in the source of a raw string literal is to be represented as a newline character or as the original characters?

#### 2000. header-name outside `#include` directive

Section: 2.4 [lex.pptoken] Status: drafting Submitter: Richard Smith Date: 2014-09-09

The “max munch” rule could be read to require the characters `<int>` in `vector<int>` to be parsed as a header-name rather than as three distinct tokens. 2.8 [lex.header] paragraph 1 says,

> Header name preprocessing tokens shall only appear within a `#include` preprocessing directive (16.2 [cpp.include]).

However, that is not sufficiently clear that header-names are only to be recognized in that context.

#### 1901. punctuator referenced but not defined

Section: 2.6 [lex.token] Status: drafting Submitter: Richard Smith Date: 2014-03-25

The syntactic nonterminal punctuator appears in the grammar for token in 2.6 [lex.token], but it is nowhere defined. It should be merged with operator and given an appropriate list of tokens as a definition for the merged term.

#### 189. Definition of operator and punctuator

Section: 2.12 [lex.operators] Status: drafting Submitter: Mike Miller Date: 20 Dec 1999

The nonterminals operator and punctuator in 2.6 [lex.token] are not defined. There is a definition of the nonterminal operator in 13.5 [over.oper] paragraph 1, but it is apparent that the two nonterminals are not the same: the latter includes keywords and multi-token operators and does not include the nonoverloadable operators mentioned in paragraph 3.

There is a definition of preprocessing-op-or-punc in 2.12 [lex.operators] , with the notation that

> Each preprocessing-op-or-punc is converted to a single token in translation phase 7 (2.1).

However, this list doesn't distinguish between operators and punctuators, it includes digraphs and keywords (can a given token be both a keyword and an operator at the same time?), etc.

Suggested resolution:

1. Change 13.5 [over.oper] to use the term overloadable-operator.
2. Change 2.6 [lex.token] to use the term operator-token instead of operator (since there are operators that are keywords and operators that are composed of more than one token).
3. Change 2.12 [lex.operators] to define the nonterminals operator-token and punctuator.

Additional note (April, 2005):

The resolution for this problem should also address the fact that `sizeof` and `typeid` (and potentially others like `decltype` that may be added in the future) are described in some places as “operators” but are not listed in 13.5 [over.oper] paragraph 3 among the operators that cannot be overloaded.

(See also issue 369.)

#### 1924. Definition of “literal” and kinds of literals

Section: 2.13 [lex.literal] Status: drafting Submitter: Saeed Amrollah Boyouki Date: 2014-05-12

The term “literal” is used without definition except the implicit connection with the syntactic nonterminal literal. The relationships of English terms to syntactic nonterminals (such as “integer literal” and integer-literal) should be examined throughout 2.13 [lex.literal] and its subsections.

#### 1656. Encoding of numerically-escaped characters

Section: 2.13.3 [lex.ccon] Status: drafting Submitter: Mike Miller Date: 2013-04-30

According to 2.13.3 [lex.ccon] paragraph 4,

> The escape `\ooo` consists of the backslash followed by one, two, or three octal digits that are taken to specify the value of the desired character. The escape `\xhhh` consists of the backslash followed by `x` followed by one or more hexadecimal digits that are taken to specify the value of the desired character. There is no limit to the number of digits in a hexadecimal sequence. A sequence of octal or hexadecimal digits is terminated by the first character that is not an octal digit or a hexadecimal digit, respectively. The value of a character literal is implementation-defined if it falls outside of the implementation-defined range defined for `char` (for literals with no prefix), `char16_t` (for literals prefixed by `'u'`), `char32_t` (for literals prefixed by `'U'`), or `wchar_t` (for literals prefixed by `'L'`).

It is not clearly stated whether the “desired character” being specified reflects the source or the target encoding. This particularly affects UTF-8 string literals (2.13.5 [lex.string] paragraph 7):

> A string literal that begins with `u8`, such as `u8"asdf"`, is a UTF-8 string literal and is initialized with the given characters as encoded in UTF-8.

For example, assuming the source encoding is Latin-1, is `u8"\xff"` supposed to specify a three-byte string whose first two bytes are `0xc3 0xbf` (the UTF-8 encoding of `\u00ff`) or a two-byte string whose first byte has the value `0xff`? (At least some current implementations assume the latter interpretation.)

Notes from the September, 2013 meeting:

The second interpretation (that the escape sequence specifies the execution-time code unit) is intended.

#### 1859. UTF-16 in `char16_t` string literals

Section: 2.13.5 [lex.string] Status: drafting Submitter: Richard Smith Date: 2014-02-12

The resolution of issue 1802 clarified that `char16_t` string literals can contain surrogate pairs, in contrast to `char16_t` character literals. However, there is no explicit requirement that `char16_t` literals be encoded as UTF-16, although that is explicitly stated for `char16_t` character literals, so it's not clear what the value is required to be in the surrogate-pair case.

#### 1723. Multicharacter user-defined character literals

Section: 2.13.8 [lex.ext] Status: drafting Submitter: Mike Miller Date: 2013-07-31

According to 2.13.3 [lex.ccon] paragraph 1, a multicharacter literal like `'ab'` is conditionally-supported and has type `int`.

According to 2.13.8 [lex.ext] paragraph 6,

> If L is a user-defined-character-literal, let ch be the literal without its ud-suffix. S shall contain a literal operator (13.5.8 [over.literal]) whose only parameter has the type of ch and the literal L is treated as a call of the form

> `operator ""` X`(`ch`)`

A user-defined-character-literal like `'ab'_foo` would thus require a literal operator

`operator "" _foo(int)`

However, that is not one of the signatures permitted by 13.5.8 [over.literal] paragraph 3.

Should multicharacter user-defined-character-literals be conditionally-supported? If so, 13.5.8 [over.literal] paragraph 3 should be adjusted accordingly. If not, a note in 2.13.8 [lex.ext] paragraph 6 saying explicitly that they are not supported would be helpful.

#### 1735. Out-of-range literals in user-defined-literals

Section: 2.13.8 [lex.ext] Status: drafting Submitter: Mike Miller Date: 2013-08-12

The description of the numeric literals occurring as part of user-defined-integer-literals and user-defined-floating-literals in 2.13.8 [lex.ext] says nothing about whether they are required to satisfy the same constraints as literals that are not part of a user-defined-literal. In particular, because it is the spelling, not the value, of the literal that is used for raw literal operators and literal operator templates, there is no particular reason that they should be restricted to the maximum values and precisions that apply to ordinary literals (and one could imagine that this would be a good notation for allowing literals of extended-precision types).

Is this relaxation of limits intended to be required, or is it a quality-of-implementation issue? Should something be said, either normatively or non-normatively, about this question?

#### 1529. Nomenclature for variable vs reference non-static data member

Section: 3 [basic] Status: drafting Submitter: Daniel Krügler Date: 2012-07-24

According to 3 [basic] paragraph 6,

> A variable is introduced by the declaration of a reference other than a non-static data member or of an object.

In other words, non-static data members of reference type are not variables. This complicates the wording in a number of places, where the text refers to “variable or data member,” presumably to cover the reference case, but that phrasing could lead to the mistaken impression that all data members are not variables. It would be better if either there were a term for the current phrase “variable or data member” or if there were a less-unwieldy term for “non-static data member of reference type” that could be used in place of “data member” in the current phrasing.

#### 1581. When are `constexpr` member functions defined?

Section: 3.2 [basic.def.odr] Status: drafting Submitter: Richard Smith Date: 2012-10-29

Clause 12 [special] is perfectly clear that special member functions are only implicitly defined when they are odr-used. This creates a problem for constant expressions in unevaluated contexts:

       struct duration {
         constexpr duration() {}
         constexpr operator int() const { return 0; }
       };
       // duration d = duration(); // #1
       int n = sizeof(short{duration(duration())});

The issue here is that we are not permitted to implicitly define `constexpr duration::duration(duration&&)` in this program, so the expression in the initializer list is not a constant expression (because it invokes a `constexpr` function which has not been defined), so the braced initializer contains a narrowing conversion, so the program is ill-formed.

If we uncomment line #1, the move constructor is implicitly defined and the program is valid. This spooky action at a distance is extremely unfortunate. Implementations diverge on this point.

There are also similar problems with implicit instantiation of `constexpr` functions. It is not clear which contexts require their instantiation. For example:

      template<int N> struct U {};
      int g(int);
      template<typename T> constexpr int h(T) { return T::error; }
      template<typename T> auto f(T t) -> U<g(T()) + h(T())> {}
      int f(...);
      int k = f(0);

There are at least two different ways of modeling the current rules:

- `constexpr` function instantiation is triggered by constant expression evaluation. In that case, the validity of the above program depends on the order in which that evaluation proceeds:

- If the LHS of the `+` is evaluated first, the program might be valid, because the implementation might bail out evaluation before triggering the ill-formed instantiation of `h<int>`.

- If the RHS is evaluated first, the program is invalid, because the instantiation fails.

- `constexpr` function instantiation is triggered whenever a `constexpr` function is referenced from an expression which could be evaluated (note that this is not the same as being potentially-evaluated)

These two approaches can be distinguished by code like this:

      int k = sizeof(U<0 && h(0)>);

Under the first approach, this code is valid; under the second, it is ill-formed.

A possible approach to resolving this issue would be to change the definition of “potentially-evaluated” such that template arguments, array bounds, and braced-init-lists (and any other expressions which are constant evaluated) are always potentially-evaluated, even if they appear within an unevaluated context, and to change 14.7.1 [temp.inst] paragraph 3 to say simply that function template specializations are implicitly instantiated when they are odr-used.

A related question is whether putatively `constexpr` constructors must be instantiated in order to determine whether their class is a literal type or not. See issue 1358.

Jason Merrill:

I'm concerned about unintended side-effects of such a large change to “potentially-evaluated;” I would prefer something that only affects `constexpr`.

It occurs to me that this is parallel to issue 1330: just like we want to instantiate exception specifiers for calls in unevaluated context, we also want to instantiate `constexpr` functions. I think we should define some other term to say when there's a reference to a declaration, and then say that the declaration is odr-used when that happens in potentially-evaluated context.

Notes from the April, 2013 meeting:

An additional question was raised about whether `constexpr` functions should be instantiated as a result of appearing within unevaluated subexpressions of constant expressions. For example:

      #include <type_traits>

      template <class T> constexpr T f(T t) { return +t; }

      struct A { };

      template <class T>
      decltype(std::is_scalar<T>::value ? T::fail : f(T()))
        g() { }

      template <class T>
      void g(...);

      int main()
      {
        g<A>();
      }

If `constexpr` instantiation happens during constant expression evaluation, `f<A>` is never instantiated and the program is well-formed. If `constexpr` instantiation happens during parsing, `f<A>` is instantiated and the program is ill-formed.

#### 1849. Variable templates and the ODR

Section: 3.2 [basic.def.odr] Status: drafting Submitter: Richard Smith Date: 2014-02-03

The description in 3.2 [basic.def.odr] paragraph 6 of when entities can be multiply-declared in a program does not, but should, discuss variable templates.

#### 1897. ODR vs alternative tokens

Section: 3.2 [basic.def.odr] Status: drafting Submitter: Hubert Tong Date: 2014-03-21

According to 2.5 [lex.digraph] paragraph 2,

> In all respects of the language, each alternative token behaves the same, respectively, as its primary token, except for its spelling.

However, the primary and alternative tokens are different tokens, which runs afoul of the ODR requirement in 3.2 [basic.def.odr] paragraph 6 that the definitions consist of the “same sequence of tokens.” This wording should be amended to allow for use of primary and alternative tokens.

#### 2020. Inadequate description of odr-use of implicitly-invoked functions

Section: 3.2 [basic.def.odr] Status: drafting Submitter: Richard Smith Date: 2014-10-08

According to 3.2 [basic.def.odr] paragraph 3,

> A function whose name appears as a potentially-evaluated expression is odr-used if it is the unique lookup result or the selected member of a set of overloaded functions (3.4 [basic.lookup], 13.3 [over.match], 13.4 [over.over]), unless it is a pure virtual function and its name is not explicitly qualified. [Note: This covers calls to named functions (5.2.2 [expr.call]), operator overloading (Clause 13 [over]), user-defined conversions (12.3.2 [class.conv.fct]), allocation function for placement new (5.3.4 [expr.new]), as well as non-default initialization (8.5 [dcl.init]). A constructor selected to copy or move an object of class type is odr-used even if the call is actually elided by the implementation (12.8 [class.copy]). —end note] An allocation or deallocation function for a class is odr-used by a new expression appearing in a potentially-evaluated expression as specified in 5.3.4 [expr.new] and 12.5 [class.free]. A deallocation function for a class is odr-used by a delete expression appearing in a potentially-evaluated expression as specified in 5.3.5 [expr.delete] and 12.5 [class.free].

There are a couple of problems with this specification. First, contrary to the note, the names of overloaded operators, conversion functions, etc., do not appear in potentially-evaluated expressions, so the normative text does not make the note true. Also, the “as specified in” references do not cover odr-use explicitly, only the invocation of the functions.

One possible way of addressing these deficiencies would be a blanket rule like,

> A function is odr-used if it is invoked by a potentially-evaluated expression.

(The existing wording about appearing in a potentially-evaluated expression would still be needed for non-call references.)

#### 555. Pseudo-destructor name lookup

Section: 3.4 [basic.lookup] Status: drafting Submitter: Krzysztof Zelechowski Date: 26 January 2006

The Standard does not completely specify how to look up the type-name(s) in a pseudo-destructor-name (5.2 [expr.post] paragraph 1, 5.2.4 [expr.pseudo]), and what information it does have is incorrect and/or in the wrong place. Consider, for instance, 3.4.5 [basic.lookup.classref] paragraphs 2-3:

> If the id-expression in a class member access (5.2.5 [expr.ref]) is an unqualified-id, and the type of the object expression is of a class type `C` (or of pointer to a class type `C`), the unqualified-id is looked up in the scope of class `C`. If the type of the object expression is of pointer to scalar type, the unqualified-id is looked up in the context of the complete postfix-expression.

> If the unqualified-id is `~`type-name, and the type of the object expression is of a class type `C` (or of pointer to a class type `C`), the type-name is looked up in the context of the entire postfix-expression and in the scope of class `C`. The type-name shall refer to a class-name. If type-name is found in both contexts, the name shall refer to the same class type. If the type of the object expression is of scalar type, the type-name is looked up in the scope of the complete postfix-expression.

There are at least three things wrong with this passage with respect to pseudo-destructors:

1. A pseudo-destructor call (5.2.4 [expr.pseudo]) is not a “class member access”, so the statements about scalar types in the object expressions are vacuous: the object expression in a class member access is required to be a class type or pointer to class type (5.2.5 [expr.ref] paragraph 2).

2. On a related note, the lookup for the type-name(s) in a pseudo-destructor name should not be described in a section entitled “Class member access.”

3. Although the class member access object expressions are carefully allowed to be either a class type or a pointer to a class type, paragraph 2 mentions only a “pointer to scalar type” (disallowing references) and paragraph 3 deals only with a “scalar type,” presumably disallowing pointers (although it could possibly be a very subtle way of referring to both non-class pointers and references to scalar types at once).

The other point at which lookup of pseudo-destructors is mentioned is 3.4.3 [basic.lookup.qual] paragraph 5:

> If a pseudo-destructor-name (5.2.4 [expr.pseudo]) contains a nested-name-specifier, the type-names are looked up as types in the scope designated by the nested-name-specifier.

Again, this specification is in the wrong location (a pseudo-destructor-name is not a qualified-id and thus should not be treated in the “Qualified name lookup” section).

Finally, there is no place in the Standard that describes the lookup for pseudo-destructor calls of the form `p->T::~T()` and `r.T::~T()`, where `p` and `r` are a pointer and reference to scalar, respectively. To the extent that it gives any guidance at all, 3.4.5 [basic.lookup.classref] deals only with the case where the `~` immediately follows the `.` or `->`, and 3.4.3 [basic.lookup.qual] deals only with the case where the pseudo-destructor-name contains a nested-name-specifier that designates a scope in which names can be looked up.

See document J16/06-0008 = WG21 N1938 for further discussion of this and related issues, including 244, 305, 399, and 414.

Proposed resolution (June, 2008):

1. Add a new paragraph following 5.2 [expr.post] paragraph 2 as follows:

> When a postfix-expression is followed by a dot `.` or arrow `->` operator, the interpretation depends on the type `T` of the expression preceding the operator. If the operator is `.`, `T` shall be a scalar type or a complete class type; otherwise, `T` shall be a pointer to a scalar type or a pointer to a complete class type. When `T` is a (pointer to) a scalar type, the postfix-expression to which the operator belongs shall be a pseudo-destructor call (5.2.4 [expr.pseudo]); otherwise, it shall be a class member access (5.2.5 [expr.ref]).

2. Change 5.2.4 [expr.pseudo] paragraph 2 as follows:

> The left-hand side of the dot operator shall be of scalar type. The left-hand side of the arrow operator shall be of pointer to scalar type. This scalar type The type of the expression preceding the dot operator, or the type to which the expression preceding the arrow operator points, is the object type...

3. Change 5.2.5 [expr.ref] paragraph 2 as follows:

> For the first option (dot) the type of the first expression (the object expression) shall be “class object” (of a complete type) is a class type. For the second option (arrow) the type of the first expression (the pointer expression) shall be “pointer to class object” (of a complete type) is a pointer to a class type. In these cases, the id-expression shall name a member of the class or of one of its base classes.

4. Add a new paragraph following 3.4 [basic.lookup] paragraph 2 as follows:

> In a pseudo-destructor-name that does not include a nested-name-specifier, the type-names are looked up as types in the context of the complete expression.

5. Delete the last sentence of 3.4.5 [basic.lookup.classref] paragraph 2:

> If the id-expression in a class member access (5.2.5 [expr.ref]) is an unqualified-id, and the type of the object expression is of a class type `C`, the unqualified-id is looked up in the scope of class `C`. If the type of the object expression is of pointer to scalar type, the unqualified-id is looked up in the context of the complete postfix-expression.

Notes from the August, 2011 meeting:

The proposed resolution must be updated with respect to the current wording of the WP.

#### 192. Name lookup in parameters

Section: 3.4.1 [basic.lookup.unqual] Status: drafting Submitter: Alan Nash Date: 6 Jan 2000

The description of name lookup in the parameter-declaration-clause of member functions in 3.4.1 [basic.lookup.unqual] paragraphs 7-8 is flawed in at least two regards.

First, both paragraphs 7 and 8 apply to the parameter-declaration-clause of a member function definition and give different rules for the lookup. Paragraph 7 applies to names "used in the definition of a class `X` outside of a member function body...," which includes the parameter-declaration-clause of a member function definition, while paragraph 8 applies to names following the function's declarator-id (see the proposed resolution of issue 41), including the parameter-declaration-clause.

Second, paragraph 8 appears to apply to the type names used in the parameter-declaration-clause of a member function defined inside the class definition. That is, it appears to allow the following code, which was not the intent of the Committee:

        struct S {
            void f(I i) { }
            typedef int I;
        };

Additional note, January, 2012:

brace-or-equal-initializers for non-static data members are intended effectively as syntactic sugar for mem-initializers in constructor definitions; the lookup should be the same.

#### 1906. Name lookup in member `friend` declaration

Section: 3.4.1 [basic.lookup.unqual] Status: drafting Submitter: Richard Smith Date: 2014-03-30

According to 3.4.1 [basic.lookup.unqual] paragraph 10,

> In a `friend` declaration naming a member function, a name used in the function declarator and not part of a template-argument in the declarator-id is first looked up in the scope of the member function's class (10.2 [class.member.lookup]). If it is not found, or if the name is part of a template-argument in the declarator-id, the look up is as described for unqualified names in the definition of the class granting friendship.

The corresponding specification for non-`friend` declarations in paragraph 8 applies the class-scope lookup only to names that follow the declarator-id. The same should be true in `friend` declarations.

#### 1828. nested-name-specifier ambiguity

Section: 3.4.3 [basic.lookup.qual] Status: drafting Submitter: Richard Smith Date: 2014-01-08

Issue 125 concerned an example like

      friend A::B::C();

which might be parsed as either

      friend A (::B::C)();

or

      friend A::B (::C)();

Its resolution attempted to make such constructs unambiguously ill-formed by allowing any identifier, not just namespaces and types, to appear in a nested-name-specifier, apparently on the assumption that `C` in this case would become part of an ill-formed nested-name-specifier instead of being taken as the unqualified-id in a qualified-id. Unfortunately, the current specification does not implement that intent, leaving both parses as valid possibilities.

A different approach might be to adjust the specification of the lookup of names appearing in nested-name-specifiers from

> If a `::` scope resolution operator in a nested-name-specifier is not preceded by a decltype-specifier, lookup of the name preceding that `::` considers only namespaces, types, and templates whose specializations are types. If the name found does not designate a namespace or a class, enumeration, or dependent type, the program is ill-formed.

to

> Lookup of an identifier followed by a `::` scope resolution operator considers only namespaces, types, and templates whose specializations are types. If an identifer, template-id, or decltype-specifier is followed by a `::` scope resolution operator, the name shall designate a namespace, class, enumeration, or dependent type, and shall form part of a nested-name-specifier.

This approach would also remove the need for deferred lookup for template-ids and thus resolve issue 1771.

#### 156. Name lookup for conversion functions

Section: 3.4.5 [basic.lookup.classref] Status: drafting Submitter: Derek Inglis Date: 18 Aug 1999

Paragraph 7 of 3.4.5 [basic.lookup.classref] says,

> If the id-expression is a conversion-function-id, its conversion-type-id shall denote the same type in both the context in which the entire postfix-expression occurs and in the context of the class of the object expression (or the class pointed to by the pointer expression).

Does this mean that the following example is ill-formed?

        struct A { operator int(); } a;
        void foo() {
          typedef int T;
          a.operator T(); // 1) error T is not found in the context
    		      // of the class of the object expression?
        }

The second bullet in paragraph 1 of 3.4.3.1 [class.qual] says,

> a conversion-type-id of an operator-function-id is looked up both in the scope of the class and in the context in which the entire postfix-expression occurs and shall refer to the same type in both contexts

How about:

        struct A { typedef int T; operator T(); };
        struct B : A { operator T(); } b;
        void foo() {
          b.A::operator T(); // 2) error T is not found in the context
    			 // of the postfix-expression?
        }

Is this interpretation correct? Or was the intent for this to be an error only if `T` was found in both scopes and referred to different entities?

If the intent was for these to be errors, how do these rules apply to template arguments?

        template <class T1> struct A { operator T1(); }
        template <class T2> struct B : A<T2> {
          operator T2();
          void foo() {
    	T2 a = A<T2>::operator T2(); // 3) error? when instantiated T2 is not
    				     // found in the scope of the class
    	T2 b = ((A<T2>*)this)->operator T2(); // 4) error when instantiated?
          }
        }

(Note bullets 2 and 3 in paragraph 1 of 3.4.3.1 [class.qual] refer to postfix-expression. It would be better to use qualified-id in both cases.)

Erwin Unruh: The intent was that you look in both contexts. If you find it only once, that's the symbol. If you find it in both, both symbols must be "the same" in some respect. (If you don't find it, its an error).

Mike Miller: What's not clear to me in these examples is whether what is being looked up is `T` or `int`. Clearly the `T` has to be looked up somehow, but the "name" of a conversion function clearly involves the base (non-typedefed) type, not typedefs that might be used in a definition or reference (cf 3 [basic] paragraph 7 and 12.3 [class.conv] paragraph 5). (This is true even for types that must be written using typedefs because of the limited syntax in conversion-type-ids — e.g., the "name" of the conversion function in the following example

        typedef void (*pf)();
        struct S {
    	operator pf();
        };

is `S::operator void(*)()`, even though you can't write its name directly.)

My guess is that this means that in each scope you look up the type named in the reference and form the canonical operator name; if the name used in the reference isn't found in one or the other scope, the canonical name constructed from the other scope is used. These names must be identical, and the conversion-type-id in the canonical operator name must not denote different types in the two scopes (i.e., the type might not be found in one or the other scope, but if it's found in both, they must be the same type).

I think this is all very vague in the current wording.

#### 682. Missing description of lookup of template aliases

Section: 3.4.5 [basic.lookup.classref] Status: drafting Submitter: Daveed Vandevoorde Date: 1 March, 2008

3.4.5 [basic.lookup.classref] does not mention template aliases as the possible result of the lookup but should do so.

#### 1089. Template parameters in member selections

Section: 3.4.5 [basic.lookup.classref] Status: drafting Submitter: Daveed Vandevoorde Date: 2010-06-29

In an example like

        template<typename T> void f(T p)->decltype(p.T::x);

The nested-name-specifier `T::` looks like it refers to the template parameter. However, if this is instantiated with a type like

        struct T { int x; };
        struct S: T { };

the reference will be ambiguous, since it is looked up in both the context of the expression, finding the template parameter, and in the class, finding the base class injected-class-name, and this could be a deduction failure. As a result, the same declaration with a different parameter name

        template<typename U> void f(U p)->decltype(p.U::x);

is, in fact, not a redeclaration because the two can be distinguished by SFINAE.

It would be better to add a new lookup rule that says that if a name in a template definition resolves to a template parameter, that name is not subject to further lookup at instantiation time.

#### 1291. Looking up a conversion-type-id

Section: 3.4.5 [basic.lookup.classref] Status: drafting Submitter: Daveed Vandevoorde Date: 2011-04-10

The Standard talks about looking up a conversion-type-id as if it were an identifier (3.4.5 [basic.lookup.classref] paragraph 7), but that is not exactly accurate. Presumably it should talk instead about looking up names (if any) appearing in the type-specifier-seq of the conversion-type-id.

#### 1835. Dependent member lookup before `<`

Section: 3.4.5 [basic.lookup.classref] Status: drafting Submitter: Richard Smith Date: 2014-01-17

According to 3.4.5 [basic.lookup.classref] paragraph 1,

> In a class member access expression (5.2.5 [expr.ref]), if the ``. or `->` token is immediately followed by an identifier followed by a `<`, the identifier must be looked up to determine whether the `<` is the beginning of a template argument list (14.2 [temp.names]) or a less-than operator. The identifier is first looked up in the class of the object expression. If the identifier is not found, it is then looked up in the context of the entire postfix-expression and shall name a class template.

Given

       template<typename T> T end(T);
       template<typename T>
       bool Foo(T it) {
         return it->end < it->end;
       }

since `it` is dependent and thus `end` cannot be looked up in the class of the object expression, it is looked up in the context of the postfix-expression. This lookup finds the function template, making the expression ill-formed.

One possibility might be to limit the lookup to the class of the object expression when the object expression is dependent.

#### 1908. Dual destructor lookup and template-ids

Section: 3.4.5 [basic.lookup.classref] Status: drafting Submitter: Hubert Tong Date: 2014-03-31

According to 3.4.5 [basic.lookup.classref] paragraph 3,

> If the unqualified-id is `~`type-name, the type-name is looked up in the context of the entire postfix-expression. If the type `T` of the object expression is of a class type `C`, the type-name is also looked up in the scope of class `C`. At least one of the lookups shall find a name that refers to (possibly cv-qualified) `T`.

This would apply to an example like

      namespace K {
        template <typename T, typename U = char> struct A { };
        A<short> *a;
      }

      template <typename T> using A = K::A<short, T>;

      int main() {
        K::a->~A<char>();
      }

Current implementations, however, only apply the dual lookup when the type-name is not a template-id. The specification should be changed to reflect current practice.

#### 426. Identically-named variables, one internally and one externally linked, allowed?

Section: 3.5 [basic.link] Status: drafting Submitter: Steve Adamczyk Date: 2 July 2003

An example in 3.5 [basic.link] paragraph 6 creates two file-scope variables with the same name, one with internal linkage and one with external.

      static void f();
      static int i = 0;                       //1
      void g() {
              extern void f();                // internal linkage
              int i;                          //2: i has no linkage
              {
                      extern void f();        // internal linkage
                      extern int i;           //3: external linkage
              }
      }

Is this really what we want? C99 has 6.2.2.7/7, which gives undefined behavior for having an identifier appear with internal and external linkage in the same translation unit. C++ doesn't seem to have an equivalent.

Notes from October 2003 meeting:

We agree that this is an error. We propose to leave the example but change the comment to indicate that line //3 has undefined behavior, and elsewhere add a normative rule giving such a case undefined behavior.

Proposed resolution (October, 2005):

Change 3.5 [basic.link] paragraph 6 as indicated:

> ...Otherwise, if no matching entity is found, the block scope entity receives external linkage. If, within a translation unit, the same entity is declared with both internal and external linkage, the behavior is undefined.

> [Example:

>         static void f();
>         static int i = 0;            // 1
>         void g () {
>             extern void f ();        // internal linkage
>             int i;                   // 2: i has no linkage
>             {
>                 extern void f ();    // internal linkage
>                 extern int i;        // 3: external linkage
>             }
>         }

> There are three objects named `i` in this program. The object with internal linkage introduced by the declaration in global scope (line `//1` ), the object with automatic storage duration and no linkage introduced by the declaration on line `//2`, and the object with static storage duration and external linkage introduced by the declaration on line `//3`. Without the declaration at line `//2`, the declaration at line `//3` would link with the declaration at line `//1`. But because the declaration with internal linkage is hidden, `//3` is given external linkage, resulting in a linkage conflict. —end example]

Notes frum the April 2006 meeting:

According to 3.5 [basic.link] paragraph 9, the two variables with linkage in the proposed example are not “the same entity” because they do not have the same linkage. Some other formulation will be needed to describe the relationship between those two variables.

Notes from the October 2006 meeting:

The CWG decided that it would be better to make a program with this kind of linkage mismatch ill-formed instead of having undefined behavior.

#### 1839. Lookup of block-scope `extern` declarations

Section: 3.5 [basic.link] Status: drafting Submitter: Hubert Tong Date: 2014-01-18

According to 3.5 [basic.link] paragraph 6,

> The name of a function declared in block scope and the name of a variable declared by a block scope `extern` declaration have linkage. If there is a visible declaration of an entity with linkage having the same name and type, ignoring entities declared outside the innermost enclosing namespace scope, the block scope declaration declares that same entity and receives the linkage of the previous declaration. If there is more than one such matching entity, the program is ill-formed.

It is not clear how declarations that are in the lexical scope of the block-scope declaration but not members of the nearest enclosing namespace (see 7.3.1 [namespace.def] paragraph 6) should be treated. (For example, the definition of the function in which the block `extern` appears might be defined in an enclosing namespace, with a visible declaration of the name in that namespace, or it might be a member function of a class containing a member function of the name being declared.) Should such declarations be produce an error or should the lexically-nearer declaration simply be ignored? There is implementation divergence on this point.

#### 1884. Unclear requirements for same-named external-linkage entities

Section: 3.5 [basic.link] Status: drafting Submitter: Richard Smith Date: 2014-02-27

According to 3.5 [basic.link] paragraph 9,

> Two names that are the same (Clause 3 [basic]) and that are declared in different scopes shall denote the same variable, function, type, enumerator, template or namespace if

> - both names have external linkage or else both names have internal linkage and are declared in the same translation unit; and

> - both names refer to members of the same namespace or to members, not by inheritance, of the same class; and

> - when both names denote functions, the parameter-type-lists of the functions (8.3.5 [dcl.fct]) are identical; and

> - when both names denote function templates, the signatures (14.5.6.1 [temp.over.link]) are the same.

This is not as clear as it should be. The intent is that this rule prevents declaring a name with extenal linkage to be, for instance, a type in one translation unit and a namespace in a different translation unit. It has instead been read as begging the question of what it means for two entities to be the same. The wording should be tweaked to make the intention clear. Among other things, it should be clarified that "declared in" refers to the namespace of which the name is a member, not the lexical scope in which the declaration appears (which affects friend declarations, block-scope `extern` declarations, and elaborated-type-specifiers).

There is a similar restriction in 3.3.1 [basic.scope.declarative] paragraph 4 dealing with declarations within a single declarative region, while 3.5 [basic.link] paragraph 9 deals with names that are associated via linkage. The relationship between these complementary requirements may need to be clarified as well.

#### 2026. Zero-initialization and `constexpr`

Section: 3.6 [basic.start] Status: drafting Submitter: Jason Merrill Date: 2014-10-20

According to 3.6.2 [basic.start.init] paragraph 2,

> Variables with static storage duration (3.7.1 [basic.stc.static]) or thread storage duration (3.7.2 [basic.stc.thread]) shall be zero-initialized (8.5 [dcl.init]) before any other initialization takes place.

Does this apply to constant initialization as well? For example, should the following be well-formed, relying on the presumed zero-initialization preceding the constant initialization?

      constexpr int i = i;
      struct s {
        constexpr s() : v(v) { }
        int v;
      };
      constexpr s s1;

Notes from the November, 2014 meeting:

CWG agreed that constant initialization should be considered as happening instead of zero initialization in these cases, making the declarations ill-formed.

#### 1294. Side effects in dynamic/static initialization

Section: 3.6.2 [basic.start.init] Status: drafting Submitter: Daniel Krügler Date: 2011-04-08

According to 3.6.2 [basic.start.init] paragraph 3,

> An implementation is permitted to perform the initialization of a non-local variable with static storage duration as a static initialization even if such initialization is not required to be done statically, provided that

> - the dynamic version of the initialization does not change the value of any other object of namespace scope prior to its initialization, and

> - the static version of the initialization produces the same value in the initialized variable as would be produced by the dynamic initialization if all variables not required to be initialized statically were initialized dynamically.

This does not consider side effects of the initialization in this determination, only the values of namespace-scope variables.

#### 1677. Constant initialization via aggregate initialization

Section: 3.6.2 [basic.start.init] Status: drafting Submitter: Daniel Krügler Date: 2013-05-05

The resolution of issue 1489 added wording regarding value initialization to 3.6.2 [basic.start.init] paragraph 2 in an attempt to clarify the status of an example like

      int a[1000]{};

However, this example is aggregate initialization, not value initialization. Also, now that we allow brace-or-equal-initializers in aggregates, this wording also needs to be updated to allow an aggregate with constant non-static data member initializers to qualify for constant initialization.

#### 1634. Temporary storage duration

Section: 3.7 [basic.stc] Status: drafting Submitter: Richard Smith Date: 2013-03-04

According to 3.7 [basic.stc] paragraph 2,

> Static, thread, and automatic storage durations are associated with objects introduced by declarations (3.1 [basic.def]) and implicitly created by the implementation (12.2 [class.temporary]).

The apparent intent of the reference to 12.2 [class.temporary] is that a temporary whose lifetime is extended to be that of a reference with one of those storage durations is considered also to have that storage duration. This interpretation is buttressed by use of the phrase “an object with the same storage duration as the temporary” (twice) in 12.2 [class.temporary] paragraph 5.

There are two problems, however: first, the specification of lifetime extension of temporaries (also in 12.2 [class.temporary] paragraph 5) does not say anything about storage duration. Also, nothing is said in either of these locations about the storage duration of a temporary whose lifetime is not extended.

The latter point is important because 3.8 [basic.life] makes a distinction between the lifetime of an object and the acquisition and release of the storage the object occupies, at least for objects with non-trivial initialization and/or a non-trivial destructor. The assumption is made in 12.2 [class.temporary] and elsewhere that the storage in which a temporary is created is no longer available for reuse, as specified in 3.8 [basic.life], after the lifetime of the temporary has ended, but this assumption is not explicitly stated. One way to make that assumption explicit would be to define a storage duration for temporaries whose lifetime is not extended.

#### 1676. `auto` return type for allocation and deallocation functions

Section: 3.7.4.1 [basic.stc.dynamic.allocation] Status: drafting Submitter: Richard Smith Date: 2013-05-04

Do we need explicit language to forbid `auto` as the return type of allocation and deallocation functions?

(See also issue 1669.)

#### 1910. “Shall” requirement applied to runtime behavior

Section: 3.7.4.1 [basic.stc.dynamic.allocation] Status: drafting Submitter: Richard Smith Date: 2014-04-12

According to 3.7.4.1 [basic.stc.dynamic.allocation] paragraph 3,

> If an allocation function declared with a non-throwing exception-specification (15.4 [except.spec]) fails to allocate storage, it shall return a null pointer. Any other allocation function that fails to allocate storage shall indicate failure only by throwing an exception (15.1 [except.throw]) of a type that would match a handler (15.3 [except.handle]) of type `std::bad_alloc` (18.6.2.1 [bad.alloc]).

The use of the word “shall” to constrain runtime behavior is inappropriate, as it normally identifies cases requiring a compile-time diagnostic.

#### 2019. Member references omitted from description of storage duration

Section: 3.7.5 [basic.stc.inherit] Status: drafting Submitter: David Krauss Date: 2014-10-08

According to 3.7.5 [basic.stc.inherit] paragraph 1,

> The storage duration of member subobjects, base class subobjects and array elements is that of their complete object (1.8 [intro.object]).

This wording does not cover member references, which should also have the same storage duration as the object of which they are a member.

#### 1027. Type consistency and reallocation of scalar types

Section: 3.8 [basic.life] Status: drafting Submitter: Gabriel Dos Reis Date: 2010-02-03

Is the following well-formed?

        int f() {
            int i = 3;
            new (&i) float(1.2);
            return i;
        }

The wording that is intended to prevent such shenanigans, 3.8 [basic.life] paragraphs 7-9, doesn't quite apply here. In particular, paragraph 7 reads,

> If, after the lifetime of an object has ended and before the storage which the object occupied is reused or released, a new object is created at the storage location which the original object occupied, a pointer that pointed to the original object, a reference that referred to the original object, or the name of the original object will automatically refer to the new object and, once the lifetime of the new object has started, can be used to manipulate the new object, if:

> - the storage for the new object exactly overlays the storage location which the original object occupied, and

> - the new object is of the same type as the original object (ignoring the top-level cv-qualifiers), and...

The problem here is that this wording only applies “after the lifetime of an object has ended and before the storage which the object occupied is reused;” for an object of a scalar type, its lifetime only ends when the storage is reused or released (paragraph 1), so it appears that these restrictions cannot apply to such objects.

(See also issues 1116 and 1338.)

Proposed resolution (August, 2010):

This issue is resolved by the resolution of issue 1116.

#### 1116. Aliasing of union members

Section: 3.8 [basic.life] Status: drafting Submitter: US Date: 2010-08-02
N3092 comment US 27

Related to issue 1027, consider:

        int f() {
          union U { double d; } u1, u2;
          (int&)u1.d = 1;
          u2 = u1;
          return (int&)u2.d;
        }

Does this involve undefined behavior? 3.8 [basic.life] paragraph 4 seems to say that it's OK to clobber `u1` with an `int` object. Then union assignment copies the object representation, possibly creating an `int` object in `u2` and making the return statement well-defined. If this is well-defined, compilers are significantly limited in the assumptions they can make about type aliasing. On the other hand, the variant where `U` has an array of `unsigned char` member must be well-defined in order to support `std::aligned_storage`.

Suggested resolution: Clarify that this case is undefined, but that adding an array of `unsigned char` to union `U` would make it well-defined — if a storage location is allocated with a particular type, it should be undefined to create an object in that storage if it would be undefined to access the stored value of the object through the allocated type.

(See also issues 1027 and 1338.)

Proposed resolution (August, 2010):

1. Change 3.8 [basic.life] paragraph 1 as follows:

> ...The lifetime of an object of type `T` begins when storage with the proper alignment and size for type `T` is obtained, and either:

> - storage with the proper alignment and size for type `T` is obtained, and

> - if the object has non-trivial initialization, its initialization is complete., or

> - if `T` is trivially copyable, the object representation of another `T` object is copied into the storage.

> The lifetime of an object of type `T` ends...

2. Change 3.8 [basic.life] paragraph 4 as follows:

> A program may end the lifetime of any object by reusing the storage which the object occupies or by explicitly calling the destructor for an object of a class type with a non-trivial destructor. For an object of a class type with a non-trivial destructor, the program is not required to call the destructor explicitly before the storage which the object occupies is reused or released; however, if there is no explicit call to the destructor or if a delete-expression (5.3.5 [expr.delete]) is not used to release the storage, the destructor shall not be implicitly called and any program that depends on the side effects produced by the destructor has undefined behavior. If a program obtains storage for an object of a particular type `A` (e.g. with a variable definition or new-expression) and later reuses that storage for an object of another type `B` such that accessing the stored value of the `B` object through a glvalue of type `A` would have undefined behavior (3.10 [basic.lval]), the behavior is undefined. [Example:

>       int i;
>       (double&)i = 1.0; // undefined behavior

>       struct S { unsigned char alignas(double) ar[sizeof (double)]; } s;
>       (double&)s = 1.0; // OK, can access stored double through s because it has an unsigned char subobject

> —end example]

3. Change 3.10 [basic.lval] paragraph 10 as follows:

> If a program attempts to access the stored value of an object through a glvalue of other than one of the following types the behavior is undefined52:

> - the dynamic type of the object,

> - a cv-qualified version of the dynamic type of the object,

> - a type similar (as defined in 4.4 [conv.qual]) to the dynamic type of the object,

> - a type that is the signed or unsigned type corresponding to the dynamic type of the object,

> - a type that is the signed or unsigned type corresponding to a cv-qualified version of the dynamic type of the object,

> - a `char` or `unsigned char` type,

> - an aggregate or union type that includes one of the aforementioned types among its elements, bases, or non-static data members (including, recursively, an element, base, or non-static data member of a subaggregate, base, or contained union),.

> - a type that is a (possibly cv-qualified) base class type of the dynamic type of the object,

> - a `char` or `unsigned char` type.

This resolution also resolves issue 1027.

Additional note (August, 2012):

Concerns have been raised regarding the interaction of this change with facilities like `std::aligned_storage` and memory pools. Care must be taken to achieve the proper balance between supporting type-based optimization techniques and allowing practical storage management.

Additional note (January, 2013):

Several questions have been raised about the wording above . In particular:

1. Since aggregates and unions cannot have base classes, why are base classes mentioned?

2. Since unions can now have special member functions, is it still valid to assume that they alias all their member types?

3. Shouldn't standard-layout classes also be considered and not just aggregates?

Additional note, February, 2014:

According to 1.8 [intro.object] paragraph 1, an object (i.e., a “region of storage”) is created by one of only three means:

> An object is created by a definition (3.1 [basic.def]), by a new-expression (5.3.4 [expr.new]) or by the implementation (12.2 [class.temporary]) when needed. The properties of an object are determined when the object is created.

This does not allow for obtaining the storage in other ways, such as via `malloc`, in determining the lifetime of an object with vacuous initialization (3.8 [basic.life] paragraph 1).

In addition, 3.8 [basic.life] paragraph 1 does not require the storage obtained for an object of type `T` to be accessed via an lvalue of type `T` in order to be considered an object of that type. The treatment of “effective type” by C may be helpful here.

#### 1284. Should the lifetime of an array be independent of that of its elements?

Section: 3.8 [basic.life] Status: drafting Submitter: Gabriel Dos Reis Date: 2011-04-02

The note in 3.8 [basic.life] paragraph 2 reads,

> [Note: The lifetime of an array object starts as soon as storage with proper size and alignment is obtained, and its lifetime ends when the storage which the array occupies is reused or released. 12.6.2 [class.base.init] describes the lifetime of base and member subobjects. —end note]

This wording reflects an earlier version of paragraph 1 that deferred the start of an object's lifetime only for initialization of objects of class type. The note simply emphasized the implication that that the lifetime of a POD type or an array began immediately, even if lifetime of an array's elements began later.

The decomposition of POD types removed the mention of PODs, leaving only the array types, and when the normative text was changed to include aggregates whose members have non-trivial initialization, the note was overlooked.

It is not clear whether it would be better to update the note to emphasize the distinction between aggregates with non-trivial initialization and those without or to delete it entirely.

A possible related normative change to consider is whether the specification of paragraph 1 is sufficiently clear with respect to multidimensional arrays. The current definition of “non-trivial initialization” is:

> An object is said to have non-trivial initialization if it is of a class or aggregate type and it or one of its members is initialized by a constructor other than a trivial default constructor.

Presumably the top-level array of an N-dimensional array whose ultimate element type is a class type with non-trivial initialization would also have non-trivial initialization, but it's not clear that this wording says that.

A more radical change that came up in the discussion was whether the undefined behavior resulting from an lvalue-to-rvalue conversion of an uninitialized object in 4.1 [conv.lval] paragraph 1 would be better dealt with as a lifetime violation instead.

#### 1530. Member access in out-of-lifetime objects

Section: 3.8 [basic.life] Status: drafting Submitter: Howard Hinnant Date: 2012-07-26

According to 3.8 [basic.life] paragraphs 5 and 6, a program has undefined behavior if a pointer or glvalue designating an out-of-lifetime object

> is used to access a non-static data member or call a non-static member function of the object

It is not clear what the word “access” means in this context. A reasonable interpretation might be using the pointer or glvalue as the left operand of a class member access expression; alternatively, it might mean to read or write the value of that member, allowing a class member access expression that is used only to form an address or bind a reference.

This needs to be clarified. A relevant consideration is the recent adoption of the resolution of issue 597, which eased the former restriction on simple address manipulations involving out-of-lifetime objects: if base-class offset calculations are now allowed, why not non-static data member offset calculations?

(See also issue 1531 for other uses of the term “access.”)

Additional note (January, 2013):

A related question is the meaning of the phrase “before the constructor begins execution” in 12.7 [class.cdtor] paragraph 1 means:

> For an object with a non-trivial constructor, referring to any non-static member or base class of the object before the constructor begins execution results in undefined behavior.

For example:

      struct DerivedMember { ... };

      struct Base {
        Base(DerivedMember const&);
      };

      struct Derived : Base {
        DerivedMember x;
        Derived() : Base(x) {}
      };

      Derived a;

Is the reference to `Derived::x` in the mem-initializer valid?

Additional note (March, 2013):

This clause is phrased in terms of the execution of the constructor. However, it is possible for an aggregate to have a non-trivial default constructor and be initialized without executing a constructor. The wording needs to be updated to allow for non-constructor initialization to avoid appearing to imply undefined behavior for an example like:

      struct X {
        std::string s;
      } x = {};
      std::string t = x.s;  // No constructor called for x: undefined behavior?

#### 1776. Replacement of class objects containing reference members

Section: 3.8 [basic.life] Status: drafting Submitter: Finland Date: 2013-09-24
N3690 comment FI 15

The rules given in 3.8 [basic.life] paragraph 7 for when an object's lifetime can be ended and a new object created in its storage include the following restriction:

> the type of the original object is not const-qualified, and, if a class type, does not contain any non-static data member whose type is const-qualified or a reference type

The intent of this restriction is to permit optimizers to rely upon the original values of `const` and reference members in their analysis of subsequent code. However, this makes it difficult to implement certain desirable functionality such as `optional<T>`; see this discussion for more details.

This rule should be reconsidered, at least as far as it applies to unions. If it is decided to keep the rule, acceptable programming techniques for writing safe code when replacing such objects should be outlined in a note.

(See also issue 1404, which will become moot if the restriction is lifted.)

#### 1853. Defining “allocated storage”

Section: 3.8 [basic.life] Status: drafting Submitter: Jeffrey Yasskin Date: 2014-02-09

The term “allocated storage” is used in several places in the Standard to refer to memory in which an object may be created (dynamic, static, or automatic storage), but it has no formal definition.

#### 1701. Array vs sequence in object representation

Section: 3.9 [basic.types] Status: drafting Submitter: Lawrence Crowl Date: 2013-06-14

According to 3.9 [basic.types] paragraph 4,

> The object representation of an object of type `T` is the sequence of N `unsigned char` objects taken up by the object of type `T`, where N equals `sizeof(T)`.

However, it is not clear that a “sequence” can be indexed, as an array can and as is required for the implementation of `memcpy` and similar code.

Additional note, November, 2014:

An additional point of concern has been raised as to whether it is appropriate to refer to the constituent bytes of an object as being “objects” themselves, along with the interaction of this specification with copying or not copying parts of the object representation that do not participate in the value representation of the object (“padding” bytes).

#### 2006. Cv-qualified `void` types

Section: 3.9.2 [basic.compound] Status: drafting Submitter: Richard Smith Date: 2014-09-16

According to 3.9.2 [basic.compound] paragraph 3,

> The type of a pointer to `void` or a pointer to an object type is called an object pointer type. [Note: A pointer to `void` does not have a pointer-to-object type, however, because `void` is not an object type. —end note]

This wording excludes cv-qualified `void` types. There are other references in the Standard to “`void` type” that are apparently intended to include cv-qualified versions as well.

#### 636. Dynamic type of objects and aliasing

Section: 3.10 [basic.lval] Status: drafting Submitter: Gabriel Dos Reis Date: 23 May 2007

The aliasing rules given in 3.10 [basic.lval] paragraph 10 rely on the concept of “dynamic type.” The problem is that the dynamic type of an object often cannot be determined (or even sufficiently constrained) at the point at which an optimizer needs to be able to determine whether aliasing might occur or not. For example, consider the function

        void foo(int* p, double* q) {
            *p = 42;
            *q = 3.14;
        }

An optimizer, on the basis of the existing aliasing rules, might decide that an `int*` and a `double*` cannot refer to the same object and reorder the assignments. This reordering, however, could result in undefined behavior if the function `foo` is called as follows:

       void goo() {
          union {
             int i;
             double d;
          } t;

          t.i = 12;

          foo(&t.i, &t.d);

          cout << t.d << endl;
       };

Here, the reference to `t.d` after the call to `foo` will be valid only if the assignments in `foo` are executed in the order in which they were written; otherwise, the union will contain an `int` object rather than a `double`.

One possibility would be to require that if such aliasing occurs, it be done only via member names and not via pointers.

Notes from the July, 2007 meeting:

This is the same issue as C's DR236. The CWG expressed a desire to address the issue the same way C99 does. The issue also occurs in C++ when placement new is used to end the lifetime of one object and start the lifetime of a different object occupying the same storage.

#### 1211. Misaligned lvalues

Section: 3.11 [basic.align] Status: drafting Submitter: David Svoboda Date: 2010-10-20

3.11 [basic.align] speaks of “alignment requirements,” and 3.7.4.1 [basic.stc.dynamic.allocation] requires the result of an allocation function to point to “suitably aligned” storage, but there is no explicit statement of what happens when these requirements are violated (presumably undefined behavior).

#### 1981. Implicit contextual conversions and `explicit`

Section: 4 [conv] Status: drafting Submitter: Richard Smith Date: 2014-08-08

According to 4 [conv] paragraph 5,

> Certain language constructs require conversion to a value having one of a specified set of types appropriate to the construct. An expression `e` of class type `E` appearing in such a context is said to be contextually implicitly converted to a specified type `T` and is well-formed if and only if `e` can be implicitly converted to a type `T` that is determined as follows: `E` is searched for conversion functions whose return type is cv `T` or reference to cv `T` such that `T` is allowed by the context. There shall be exactly one such `T`.

This description leaves open two questions: first, can `explicit` conversion functions be used for this conversion? Second, assuming that they cannot, is the restriction to “exactly one such `T`” enforced before or after exclusion of `explicit` conversion functions?

Notes from the November, 2014 meeting:

CWG felt that `explicit` conversion functions should be removed from consideration before determining the set of types for the conversion.

#### 617. Lvalue-to-rvalue conversions of uninitialized `char` objects

Section: 4.1 [conv.lval] Status: drafting Submitter: Alan Stokes Date: 6 February 2007

According to 4.1 [conv.lval] paragraph 1, applying the lvalue-to-rvalue conversion to any uninitialized object results in undefined behavior. However, character types are intended to allow any data, including uninitialized objects and padding, to be copied (hence the statements in 3.9.1 [basic.fundamental] paragraph 1 that “For character types, all bits of the object representation participate in the value representation” and in 3.10 [basic.lval] paragraph 15 that `char` and `unsigned char` types can alias any object). The lvalue-to-rvalue conversion should be permitted on uninitialized objects of character type without evoking undefined behavior.

#### 170. Pointer-to-member conversions

Section: 4.11 [conv.mem] Status: drafting Submitter: Mike Stump Date: 16 Sep 1999

The descriptions of explicit (5.2.9 [expr.static.cast] paragraph 9) and implicit (4.11 [conv.mem] paragraph 2) pointer-to-member conversions differ in two significant ways:

1. In a `static_cast`, a conversion in which the class in the target pointer-to-member type is a base of the class in which the member is declared is permitted and required to work correctly, as long as the resulting pointer-to-member is eventually dereferenced with an object whose dynamic type contains the member. That is, the class of the target pointer-to-member type is not required to contain the member referred to by the value being converted. The specification of implicit pointer-to-member conversion is silent on this question.

   (This situation cannot arise in an implicit pointer-to-member conversion where the source value is something like `&X::f`, since you can only implicitly convert from pointer-to-base-member to pointer-to-derived-member. However, if the source value is the result of an explicit "up-cast," the target type of the conversion might still not contain the member referred to by the source value.)

2. The target type in a `static_cast` is allowed to be more cv-qualified than the source type; in an implicit conversion, however, the cv-qualifications of the two types are required to be identical.

The first difference seems like an oversight. It is not clear whether the latter difference is intentional or not.

(See also issue 794.)

#### 536. Problems in the description of id-expressions

Section: 5.1.1 [expr.prim.general] Status: drafting Submitter: Mike Miller Date: 13 October 2005

There are at least a couple of problems in the description of the various id-expressions in 5.1.1 [expr.prim.general]:

1. Paragraph 4 embodies an incorrect assumption about the syntax of qualified-ids:

   > The operator `::` followed by an identifier, a qualified-id, or an operator-function-id is a primary-expression.

   The problem here is that the `::` is actually part of the syntax of qualified-id; consequently, “`::` followed by... a qualified-id” could be something like “`:: ::i`,” which is ill-formed. Presumably this should say something like, “A qualified-id with no nested-name-specifier is a primary-expression.”

2. More importantly, some kinds of id-expressions are not described by 5.1.1 [expr.prim.general]. The structure of this section is that the result, type, and lvalue-ness are specified for each of the cases it covers:

   - paragraph 4 deals with qualified-ids that have no nested-name-specifier

   - paragraph 7 deals with bare identifiers and with qualified-ids containing a nested-name-specifier that names a class

   - paragraph 8 deals with qualified-ids containing a nested-name-specifier that names a namespace

   This treatment leaves unspecified all the non-identifier unqualified-ids (operator-function-id, conversion-function-id, and template-id), as well as (perhaps) “`::` template-id” (it's not clear whether the “`::` followed by a qualified-id” case is supposed to apply to template-ids or not). Note also that the proposed resolution of issue 301 slightly exacerbates this problem by removing the form of operator-function-id that contains a tmeplate-argument-list; as a result, references like “`::operator+<X>`” are no longer covered in 5.1.1 [expr.prim.general].

#### 1836. Use of class type being defined in trailing-return-type

Section: 5.1.1 [expr.prim.general] Status: drafting Submitter: Mike Miller Date: 2014-01-17

According to 5.1.1 [expr.prim.general] paragraph 3,

> Unlike the object expression in other contexts, `*this` is not required to be of complete type for purposes of class member access (5.2.5 [expr.ref]) outside the member function body.

Is this special treatment of member access expressions intended to apply only to `*this`, or does it apply to other ways of specifying the class being defined in the object expression? For example,

      struct S {
        int i;
        auto f1() -> decltype((*this).i);      // okay
        auto f2(S& This) -> decltype(This.i);  // okay?
        auto f3() -> decltype(((S*)0)->i);     // okay?
      };

There is implementation divergence on this question.

If the intent is to allow object expressions other than `*this` to have the current class type, this specification should be moved from 5.1.1 [expr.prim.general] to 5.2.5 [expr.ref] paragraph 2, which is where the general requirement for complete object expression types is found.

On a related point, the note immediately following the above-cited passage is not quite correct:

> [Note: only class members declared prior to the declaration are visible. —end note]

This does not apply when the member is a “member of an unknown specialization,” per 14.6.2.1 [temp.dep.type] paragraph 5 bullet 3 sub-bullet 1; for example,

      template<typename T> struct S : T {
        auto f() -> decltype(this->x);
      };

Here `x` is presumed to be a member of the dependent base `T` and is not “declared prior to the declaration” that refers to it.

#### 1837. Use of `this` in `friend` and local class declarations

Section: 5.1.1 [expr.prim.general] Status: drafting Submitter: Hubert Tong Date: 2014-01-13

The description of the use of `this` found in 5.1.1 [expr.prim.general] paragraphs 3 and 4 allow it to appear in the declaration of a non-static member function following the optional cv-qualifier-seq and in the brace-or-equal-initializer of a non-static data member; all other uses are prohibited. These restrictions appear to allow questionable uses of `this` in several contexts. For example:

      template <typename T>
      struct Fish { static const bool value = true; };

      struct Other {
        int p();
        auto q() -> decltype(p()) *;
      };

      class Outer {
        // The following declares a member function of class Other.
        // Is this interpreted as Other* or Outer*?
        friend auto Other::q() -> decltype(this->p()) *;
        int g();
        int f() {
         extern void f(decltype(this->g()) *);
         struct Inner {
           // The following are all within the declaration of Outer::f().
           // Is this Outer* or Inner*?
           static_assert(Fish<decltype(this->g())>::value, "");
           enum { X = Fish<decltype(this->f())>::value };
           struct Inner2 : Fish<decltype(this->g())> { };
           friend void f(decltype(this->g()) *);
           friend auto Other::q() -> decltype(this->p()) *;
         };
         return 0;
        }
      };

      struct A {
       int f();
       bool b = [] {
        struct Local {
         static_assert(sizeof this->f() == sizeof(int), ""); // A or Local?
        };
       };
      };

There is implementation divergence on the treatment of these examples.

#### 1249. Cv-qualification of nested lambda capture

Section: 5.1.2 [expr.prim.lambda] Status: drafting Submitter: James Widman Date: 2011-03-02

Consider the following example:

        void f(int i) {
          auto l1 = [i] {
            auto l2 = [&i] {
              ++i;    // Well-formed?
            };
          };
        }

Because the `l1` lambda is not marked as `mutable`, its `operator()` is `const`; however, it is not clear from the wording of 5.1.2 [expr.prim.lambda] paragraph 16 whether the captured member of the enclosing lambda is considered `const` or not.

#### 1468. `typeid`, overload resolution, and implicit lambda capture

Section: 5.1.2 [expr.prim.lambda] Status: drafting Submitter: Doug Gregor Date: 2012-02-08

According to 5.1.2 [expr.prim.lambda] paragraph 11, a variable is implicitly captured if it is odr-used. In the following example,

      struct P {
       virtual ~P();
      };

      P &f(int&);
      int f(const int&);

      void g(int x) {
       [=] {
        typeid(f(x));
       };
      }

`x` is only odr-used if the operand of `typeid` is a polymorphic lvalue; otherwise, the operand is unevaluated (5.2.8 [expr.typeid] paragraphs 2-3). Whether the operand is a polymorphic lvalue depends on overload resolution in this case, which depends on whether `x` is captured or not: if `x` is captured, since the lambda is not `mutable`, the type of `x` in the body of the lambda is `const int`, while if it is not captured, it is just `int`. However, the `const int` version of `f` returns `int` and the `int` version of `f` returns a polymorphic lvalue, leading to a conundrum: `x` is only captured if it is not captured, and vice versa.

Notes from the October, 2012 meeting:

The approach favored by CWG was to specify that the operand of `typeid` is considered to be odr-used for the purpose of determining capture.

#### 1722. Should lambda to function pointer conversion function be `noexcept`?

Section: 5.1.2 [expr.prim.lambda] Status: drafting Submitter: Ville Voutilainen Date: 2013-07-31

According to 5.1.2 [expr.prim.lambda] paragraph 6,

> The closure type for a non-generic lambda-expression with no lambda-capture has a public non-virtual non-explicit const conversion function to pointer to function with C++ language linkage (7.5 [dcl.link]) having the same parameter and return types as the closure type's function call operator.

This does not specify whether the conversion function is `noexcept(true)` or `noexcept(false)`. It might be helpful to nail that down.

#### 1913. `decltype((x))` in lambda-expressions

Section: 5.1.2 [expr.prim.lambda] Status: drafting Submitter: Dinka Ranns Date: 2014-04-15

According to 5.1.2 [expr.prim.lambda] paragraph 19,

> Every occurrence of `decltype((x))` where `x` is a possibly parenthesized id-expression that names an entity of automatic storage duration is treated as if `x` were transformed into an access to a corresponding data member of the closure type that would have been declared if `x` were an odr-use of the denoted entity.

This formulation is problematic because it assumes that `x` can be captured and, if captured, would result in a member of the closure class. The former is not true if the lambda has no capture-default, and the latter is not guaranteed if the capture-default is `&`.

#### 1937. Incomplete specification of function pointer from lambda

Section: 5.1.2 [expr.prim.lambda] Status: drafting Submitter: Richard Smith Date: 2014-06-05

According to 5.1.2 [expr.prim.lambda] paragraph 6,

> The closure type for a non-generic lambda-expression with no lambda-capture has a public non-virtual non-explicit const conversion function to pointer to function with C ++ language linkage (7.5 [dcl.link]) having the same parameter and return types as the closure type's function call operator. The value returned by this conversion function shall be the address of a function that, when invoked, has the same effect as invoking the closure type's function call operator.

This does not mention the object for which the function call operator would be invoked (although since there is no capture, presumably the function call operator makes no use of the object pointer). This could be addressed by relating the behavior of the function call operator to a notional temporary, or the function call operator for such closure classes could be made static.

#### 1973. Which parameter-declaration-clause in a lambda-expression?

Section: 5.1.2 [expr.prim.lambda] Status: drafting Submitter: Dinka Ranns Date: 2014-07-16

According to 5.1.2 [expr.prim.lambda] paragraph 5,

> The closure type for a non-generic lambda-expression has a public inline function call operator (13.5.4 [over.call]) whose parameters and return type are described by the lambda-expression's parameter-declaration-clause and trailing-return-type respectively.

This is insufficiently precise because the trailing-return-type might itself contain a parameter-declaration-clause. (The same problem also occurs for generic lambdas later in the same paragraph.)

#### 1646. decltype-specifiers, abstract classes, and deduction failure

Section: 5.2.2 [expr.call] Status: drafting Submitter: Jason Merrill Date: 2013-03-28

According to 5.2.2 [expr.call] paragraph 11,

> If a function call is a prvalue of object type:

> - if the function call is either

> - the operand of a decltype-specifier or

> - the right operand of a comma operator that is the operand of a decltype-specifier,

> a temporary object is not introduced for the prvalue. The type of the prvalue may be incomplete. [Note: as a result, storage is not allocated for the prvalue and it is not destroyed; thus, a class type is not instantiated as a result of being the type of a function call in this context. This is true regardless of whether the expression uses function call notation or operator notation (13.3.1.2 [over.match.oper]). —end note] [Note: unlike the rule for a decltype-specifier that considers whether an id-expression is parenthesized (7.1.6.2 [dcl.type.simple]), parentheses have no special meaning in this context. —end note]

> - otherwise, the type of the prvalue shall be complete.

Thus, an example like

      template <class T> struct A: T { };
      template <class T> A<T> f(T) { return A<T>(); };
      decltype(f(42)) *p;

is well-formed. However, a function template specialization in which the return type is an abstract class should be a deduction failure, per 14.8.2 [temp.deduct] paragraph 8, last bullet:

- ...

- Attempting to create a function type in which a parameter type or the return type is an abstract class type (10.4 [class.abstract]).

The requirement that the return type in a function call in a decltype-specifier not be instantiated prevents the detection of this deduction failure in an example like:

      template <class T> struct A { virtual void f() = 0; };
      template <class T> A<T> f(T) { return A<T>(); };
      decltype(f(42)) *p;

It is not clear how this should be resolved.

(See also issue 1640.)

#### 1880. When are parameter objects destroyed?

Section: 5.2.2 [expr.call] Status: drafting Submitter: Hubert Tong Date: 2014-02-25

According to 5.2.2 [expr.call] paragraph 4,

> The lifetime of a parameter ends when the function in which it is defined returns. The initialization and destruction of each parameter occurs within the context of the calling function.

This presumably means that the destruction of the parameter object occurs before the end of the full-expression, unlike temporaries. This is not what current implementations do, however. It is not clear that a change to treat parameter objects like temporaries, to match existing practice, would be an improvement, however, as it would result in ABI breakage for implementations that destroy parameters in the called function.

See also issue 1935 for a related question regarding the handling of arguments to a placement allocation function and placement deallocation function.

Notes from the June, 2014 meeting:

WG decided to make it unspecified whether parameter objects are destroyed immediately following the call or at the end of the full-expression to which the call belongs. This approach also resolves issue 1935.

#### 1521. `T{`expr`}` with reference types

Section: 5.2.3 [expr.type.conv] Status: drafting Submitter: Steve Adamczyk Date: 2012-07-10

According to 5.2.3 [expr.type.conv] paragraph 4,

> Similarly, a simple-type-specifier or typename-specifier followed by a braced-init-list creates a temporary object of the specified type direct-list-initialized (8.5.4 [dcl.init.list]) with the specified braced-init-list, and its value is that temporary object as a prvalue.

This wording does not handle the case where `T` is a reference type: it is not possible to create a temporary object of that type, and presumably the result would be an xvalue, not a prvalue.

#### 1893. Function-style cast with braced-init-lists and empty pack expansions

Section: 5.2.3 [expr.type.conv] Status: drafting Submitter: Richard Smith Date: 2014-03-13

[Moved to DR at the November, 2014 meeting.]

According to 5.2.3 [expr.type.conv] paragraph 1,

> A simple-type-specifier (7.1.6.2 [dcl.type.simple]) or typename-specifier (14.6 [temp.res]) followed by a parenthesized expression-list constructs a value of the specified type given the expression list. If the expression list is a single expression, the type conversion expression is equivalent (in definedness, and if defined in meaning) to the corresponding cast expression (5.4 [expr.cast]). If the type specified is a class type, the class type shall be complete. If the expression list specifies more than a single value, the type shall be a class with a suitably declared constructor (8.5 [dcl.init], 12.1 [class.ctor]), and the expression `T(x1, x2, ...)` is equivalent in effect to the declaration `T t(x1, x2, ...);` for some invented temporary variable `t`, with the result being the value of `t` as a prvalue.

This does not cover the cases when the expression-list contains a single braced-init-list (which is neither an expression nor more than a single value) or if it contains no expressions as the result of an empty pack expansion.

Proposed resolution (June, 2014):

This issue is resolved by the resolution of issue 1299.

#### 232. Is indirection through a null pointer undefined behavior?

Section: 5.3.1 [expr.unary.op] Status: drafting Submitter: Mike Miller Date: 5 Jun 2000

At least a couple of places in the IS state that indirection through a null pointer produces undefined behavior: 1.9 [intro.execution] paragraph 4 gives "dereferencing the null pointer" as an example of undefined behavior, and 8.3.2 [dcl.ref] paragraph 4 (in a note) uses this supposedly undefined behavior as justification for the nonexistence of "null references."

However, 5.3.1 [expr.unary.op] paragraph 1, which describes the unary "*" operator, does not say that the behavior is undefined if the operand is a null pointer, as one might expect. Furthermore, at least one passage gives dereferencing a null pointer well-defined behavior: 5.2.8 [expr.typeid] paragraph 2 says

> If the lvalue expression is obtained by applying the unary * operator to a pointer and the pointer is a null pointer value (4.10 [conv.ptr]), the `typeid` expression throws the `bad_typeid` exception (18.7.3 [bad.typeid]).

This is inconsistent and should be cleaned up.

Bill Gibbons:

At one point we agreed that dereferencing a null pointer was not undefined; only using the resulting value had undefined behavior.

For example:

        char *p = 0;
        char *q = &*p;

Similarly, dereferencing a pointer to the end of an array should be allowed as long as the value is not used:

        char a[10];
        char *b = &a[10];   // equivalent to "char *b = &*(a+10);"

Both cases come up often enough in real code that they should be allowed.

Mike Miller:

I can see the value in this, but it doesn't seem to be well reflected in the wording of the Standard. For instance, presumably `*p` above would have to be an lvalue in order to be the operand of "`&`", but the definition of "lvalue" in 3.10 [basic.lval] paragraph 2 says that "an lvalue refers to an object." What's the object in `*p`? If we were to allow this, we would need to augment the definition to include the result of dereferencing null and one-past-the-end-of-array.

Tom Plum:

Just to add one more recollection of the intent: I was very happy when (I thought) we decided that it was only the attempt to actually fetch a value that creates undefined behavior. The words which (I thought) were intended to clarify that are the first three sentences of the lvalue-to-rvalue conversion, 4.1 [conv.lval]:

> An lvalue (3.10 [basic.lval]) of a non-function, non-array type `T` can be converted to an rvalue. If `T` is an incomplete type, a program that necessitates this conversion is ill-formed. If the object to which the lvalue refers is not an object of type `T` and is not an object of a type derived from `T`, or if the object is uninitialized, a program that necessitates this conversion has undefined behavior.

In other words, it is only the act of "fetching", of lvalue-to-rvalue conversion, that triggers the ill-formed or undefined behavior. Simply forming the lvalue expression, and then for example taking its address, does not trigger either of those errors. I described this approach to WG14 and it may have been incorporated into C 1999.

Mike Miller:

If we admit the possibility of null lvalues, as Tom is suggesting here, that significantly undercuts the rationale for prohibiting "null references" -- what is a reference, after all, but a named lvalue? If it's okay to create a null lvalue, as long as I don't invoke the lvalue-to-rvalue conversion on it, why shouldn't I be able to capture that null lvalue as a reference, with the same restrictions on its use?

I am not arguing in favor of null references. I don't want them in the language. What I am saying is that we need to think carefully about adopting the permissive approach of saying that it's all right to create null lvalues, as long as you don't use them in certain ways. If we do that, it will be very natural for people to question why they can't pass such an lvalue to a function, as long as the function doesn't do anything that is not permitted on a null lvalue.

If we want to allow `&*(p=0)`, maybe we should change the definition of "`&`" to handle dereferenced null specially, just as `typeid` has special handling, rather than changing the definition of lvalue to include dereferenced nulls, and similarly for the array_end+1 case. It's not as general, but I think it might cause us fewer problems in the long run.

Notes from the October 2003 meeting:

See also issue 315, which deals with the call of a static member function through a null pointer.

We agreed that the approach in the standard seems okay: `p = 0; *p;` is not inherently an error. An lvalue-to-rvalue conversion would give it undefined behavior.

Proposed resolution (October, 2004):

(Note: the resolution of issue 453 also resolves part of this issue.)

1. Add the indicated words to 3.10 [basic.lval] paragraph 2:

   > An lvalue refers to an object or function or is an empty lvalue (5.3.1 [expr.unary.op]).

2. Add the indicated words to 5.3.1 [expr.unary.op] paragraph 1:

   > The unary `*` operator performs indirection: the expression to which it is applied shall be a pointer to an object type, or a pointer to a function type and the result is an lvalue referring to the object or function to which the expression points, if any. If the pointer is a null pointer value (4.10 [conv.ptr]) or points one past the last element of an array object (5.7 [expr.add]), the result is an empty lvalue and does not refer to any object or function. An empty lvalue is not modifiable. If the type of the expression is “pointer to `T`,” the type of the result is “`T`.” [Note: a pointer to an incomplete type (other than cv void) can be dereferenced. The lvalue thus obtained can be used in limited ways (to initialize a reference, for example); this lvalue must not be converted to an rvalue, see 4.1 [conv.lval].—end note]

3. Add the indicated words to 4.1 [conv.lval] paragraph 1:

   > If the object to which the lvalue refers is not an object of type `T` and is not an object of a type derived from `T`, or if the object is uninitialized, or if the lvalue is an empty lvalue (5.3.1 [expr.unary.op]), a program that necessitates this conversion has undefined behavior.

4. Change 1.9 [intro.execution] as indicated:

   > Certain other operations are described in this International Standard as undefined (for example, the effect of dereferencing the null pointer division by zero).

Note (March, 2005):

The 10/2004 resolution interacts with the resolution of issue 73. We added wording to 3.9.2 [basic.compound] paragraph 3 to the effect that a pointer containing the address one past the end of an array is considered to “point to” another object of the same type that might be located there. The 10/2004 resolution now says that it would be undefined behavior to use such a pointer to fetch the value of that object. There is at least the appearance of conflict here; it may be all right, but it at needs to be discussed further.

Notes from the April, 2005 meeting:

The CWG agreed that there is no contradiction between this direction and the resolution of issue 73. However, “not modifiable” is a compile-time concept, while in fact this deals with runtime values and thus should produce undefined behavior instead. Also, there are other contexts in which lvalues can occur, such as the left operand of `.` or `.*`, which should also be restricted. Additional drafting is required.

(See also issue 1102.)

#### 1653. Removing deprecated increment of `bool`

Section: 5.3.2 [expr.pre.incr] Status: drafting Submitter: Bjarne Stroustrup Date: 2013-04-19

The preincrement (5.3.2 [expr.pre.incr]) and postincrement (5.2.6 [expr.post.incr]) operators can be applied to operands of type `bool`, setting the operand to `true`, but this use is deprecated. Can it now be removed altogether?

#### 901. Deleted `operator delete`

Section: 5.3.4 [expr.new] Status: drafting Submitter: John Spicer Date: 20 May, 2009

It is not clear from 5.3.4 [expr.new] whether a deleted `operator delete` is referenced by a new-expression in which there is no initialization or in which the initialization cannot throw an exception, rendering the program ill-formed. (The question also arises as to whether such a new-expression constitutes a “use” of the deallocation function in the sense of 3.2 [basic.def.odr].)

Notes from the July, 2009 meeting:

The rationale for defining a deallocation function as deleted would presumably be to prevent such objects from being freed. Treating the new-expression as a use of such a deallocation function would mean that such objects could not be created in the first place. There is already an exemption from freeing an object if “a suitable deallocation function [cannot] be found;” a deleted deallocation function should be treated similarly.

#### 1935. Reuse of placement arguments in deallocation

Section: 5.3.4 [expr.new] Status: drafting Submitter: Hubert Tong Date: 2014-06-04

The description in 5.3.4 [expr.new] paragraph 23 regarding calling a deallocation function following an exception during the initialization of an object resulting from a placement new-expression says,

> If a placement deallocation function is called, it is passed the same additional arguments as were passed to the placement allocation function, that is, the same arguments as those specified with the new-placement syntax. If the implementation is allowed to make a copy of any argument as part of the call to the allocation function, it is allowed to make a copy (of the same original value) as part of the call to the deallocation function or to reuse the copy made as part of the call to the allocation function. If the copy is elided in one place, it need not be elided in the other.

This seems curious, as it allows reuse of a parameter object that presumably is destroyed immediately upon the return of the allocation function (but see issue 1880 for a question about the timing of such destructions).

Notes from the November, 2014 meeting:

The resolution for issue 1880 should mostly resolve this issue. The resolution should handle the case in which an object can only be constructed into the parameter object and neither copied nor moved.

#### 1992. `new (std::nothrow) int[N]` can throw

Section: 5.3.4 [expr.new] Status: drafting Submitter: Martin Sebor Date: 2014-08-27

According to 5.3.4 [expr.new] paragraph 7,

> If the expression, after converting to `std::size_t`, is a core constant expression and the expression is erroneous, the program is ill-formed. Otherwise, a new-expression with an erroneous expression does not call an allocation function and terminates by throwing an exception of a type that would match a handler (15.3 [except.handle]) of type `std::bad_array_new_length` (18.6.2.2 [new.badlength]).

> This wording makes no provision for an expression like

>       new (std::nothrow) int[N]

> which most programmers would intuitively expect not to throw an exception under any condition.

#### 242. Interpretation of old-style casts

Section: 5.4 [expr.cast] Status: drafting Submitter: Mike Miller Date: 30 Aug 2000

The meaning of an old-style cast is described in terms of `const_cast`, `static_cast`, and `reinterpret_cast` in 5.4 [expr.cast] paragraph 5. Ignoring `const_cast` for the moment, it basically says that if the conversion performed by a given old-style cast is one of those performed by `static_cast`, the conversion is interpreted as if it were a `static_cast`; otherwise, it's interpreted as if it were a `reinterpret_cast`, if possible. The following example is given in illustration:

        struct A {};
        struct I1 : A {};
        struct I2 : A {};
        struct D : I1, I2 {};
        A *foo( D *p ) {
    	return (A*)( p ); // ill-formed static_cast interpretation
        }

The obvious intent here is that a derived-to-base pointer conversion is one of the conversions that can be performed using `static_cast`, so `(A*)(p)` is equivalent to `static_cast<A*>(p)`, which is ill-formed because of the ambiguity.

Unfortunately, the description of `static_cast` in 5.2.9 [expr.static.cast] does NOT support this interpretation. The problem is in the way 5.2.9 [expr.static.cast] lists the kinds of casts that can be performed using `static_cast`. Rather than saying something like "All standard conversions can be performed using `static_cast`," it says

> An expression e can be explicitly converted to a type `T` using a `static_cast` of the form `static_cast<T>(e)` if the declaration "`T t(e);`" is well-formed, for some invented temporary variable `t`.

Given the declarations above, the hypothetical declaration

        A* t(p);

is NOT well-formed, because of the ambiguity. Therefore the old-style cast `(A*)(p)` is NOT one of the conversions that can be performed using `static_cast`, and `(A*)(p)` is equivalent to `reinterpret_cast<A*>(p)`, which is well-formed under 5.2.10 [expr.reinterpret.cast] paragraph 7.

Other situations besides ambiguity which might raise similar questions include access violations, casting from virtual base to derived, and casting pointers-to-members when virtual inheritance is involved.

#### 2013. Pointer subtraction in large array

Section: 5.7 [expr.add] Status: drafting Submitter: Jason Merrill Date: 2014-10-02

The common code sequence used by most implementations for pointer subtraction involves subtracting the pointer values to determine the number of bytes and then shifting to scale for the size of the array element. This produces incorrect results when the difference in bytes is larger than can be represented by a `ptrdiff_t`. For example, assuming a 32-bit `ptrdiff_t`:

      int *a, *b;
      a = malloc(0x21000000 * sizeof(int));
      b = a + 0x21000000;
      printf("%lx\n", (long)(b - a));

This will typically print e1000000 instead of 21000000.

Getting the right answer would require using a more expensive code sequence. It would be better to make this undefined behavior.

#### 1857. Additional questions about bits

Section: 5.8 [expr.shift] Status: drafting Submitter: Tony Van Eerd Date: 2014-02-12

The resolution of issue 1796 addressed only the relationship of “bits” with the null character value. The values and arrangements of bits within an object are also mentioned in other contexts; these should also be considered for revision. For example, 5.8 [expr.shift] paragraph 2 says,

> The value of `E1 << E2` is `E1` left-shifted `E2` bit positions; vacated bits are zero-filled.

This appears to place constraints on the bit representation, which (as noted in issue 1796) is not accessible to the program. A similar statement appears in paragraph 3 for `>>`.

The specification of the bitwise operations in 5.11 [expr.bit.and], 5.12 [expr.xor], and 5.13 [expr.or] uses the undefined term “bitwise” in describing the operations, without specifying whether it is the value or object representation that is in view.

Part of the resolution of this might be to define “bit” (which is otherwise currently undefined in C++) as a value of a given power of 2.

Notes from the June, 2014 meeting:

CWG decided to reformulate the description of the operations themselves to avoid references to bits, splitting off the larger questions of defining “bit” and the like to issue 1943 for further consideration.

#### 1895. Deleted conversions in conditional operator operands

Section: 5.16 [expr.cond] Status: drafting Submitter: Richard Smith Date: 2014-03-17

In an example like,

      struct B;
      struct A { A(); A(B&) = delete; operator B&(); };
      struct B : A {} b;
      B &c = true ? A() : b;

the rules of 5.16 [expr.cond] paragraph 3 make this ambiguous: `A()` can be implicitly converted to the type “lvalue reference to `B`,” and `b` satisfies the constraints to be converted to an `A` prvalue (it's of a type derived from `A` and the cv-qualifiers are okay). Bullet 3 bullet 1 is clear that we do not actually try to create an `A` temporary from `b`, so we don't notice that it invokes a deleted constructor and rule out that conversion.

If the deleted conversion is in the other sense, the result is unambiguous:

      struct B;
      struct A { A(); A(B&); operator B&() = delete; };
      struct B : A {} b;
      B &c = true ? A() : b;

`A()` can no longer be implicitly converted to the type “lvalue reference to `B`”: since the declaration `B &t = A();` is not well formed (it invokes a deleted function), there is no implicit conversion. So we unambiguously convert the third operand to an `A` prvalue.

These should presumably either both be valid or both invalid. EDG and gcc call both ambiguous.

Notes from the June, 2014 meeting:

The wording should be changed to handle the convertibility test more like overload resolution: the conversion "exists" if the conversion function is declared, but is ill-formed if it would actually be used.

#### 1932. Bit-field results of conditional operators

Section: 5.16 [expr.cond] Status: drafting Submitter: Richard Smith Date: 2014-02-21

According to 5.16 [expr.cond] paragraph 3,

> if the second and third operand have different types and either has (possibly cv-qualified) class type, or if both are glvalues of the same value category and the same type except for cv-qualification, an attempt is made to convert each of those operands to the type of the other. The process for determining whether an operand expression `E1` of type `T1` can be converted to match an operand expression `E2` of type `T2` is defined as follows:

> - If E2 is an lvalue: `E1` can be converted to match `E2` if `E1` can be implicitly converted (Clause 4 [conv]) to the type “lvalue reference to `T2`”, subject to the constraint that in the conversion the reference must bind directly (8.5.3 [dcl.init.ref]) to an lvalue.

If two bit-field glvalues have exactly the same scalar type, paragraph 3 does not apply (two non-class operands must differ in at least cv-qualification). For an example like

      struct S {
        int i:3;
        const int j:4;
      } s;
      int k = true ? s.i : s.j;

the condition is satisfied. The intent is that `S::i` can be converted to `const int` but `S::j` cannot be converted to `int`, so the result should be a bit-field lvalue of type `const int`. However, the test for convertibility is phrased in terms of direct reference binding, which is inapplicable to bit-fields, resulting in neither conversion succeeding, leading to categorizing the expression as ambiguous.

#### 1542. Compound assignment of braced-init-list

Section: 5.18 [expr.ass] Status: drafting Submitter: Mike Miller Date: 2012-08-21

The specification of 5.18 [expr.ass] paragraph 9 is presumably intended to allow use of a braced-init-list as the operand of a compound assignment operator as well as a simple assignment operator, although the normative wording does not explicitly say so. (The example in that paragraph does include

      complex<double> z;
      z += { 1, 2 };      // meaning z.operator+=({1,2})

for instance, which could be read to imply compound assignment operators for scalar types as well.)

However, the details of how this is to be implemented are not clear. Paragraph 7 says,

> The behavior of an expression of the form `E1` op `=` `E2` is equivalent to `E1 = E1` op `E2` except that `E1` is evaluated only once.

Applying this pattern literally to a braced-init-list yields invalid code: `x += {1}` would become `x = x + {1}`, which is non-syntactic.

Another problem is how to apply the prohibition against narrowing conversions to a compound assignment. For example,

      char c;
      c += {1};

would presumably always be a narrowing error, because after integral promotions, the type of `c+1` is `int`. The similar issue 1078 was classified as "NAD" because the workaround was simply to add a cast to suppress the error; however, there is no place to put a similar cast in a compound assignment.

Notes from the October, 2012 meeting:

The incorrect description of the meaning of a compound assignment with a braced-init-list should be fixed by CWG. The question of whether it makes sense to apply narrowing rules to such assignments is better addressed by EWG.

#### 1255. Definition problems with `constexpr` functions

Section: 5.20 [expr.const] Status: drafting Submitter: Nikolay Ivchenkov Date: 2011-03-08

The current wording of the Standard is not sufficiently clear regarding the interaction of class scope (which treats the bodies of member functions as effectively appearing after the class definition is complete) and the use of `constexpr` member functions within the class definition in contexts requiring constant expressions. For example, an array bound cannot use a `constexpr` member function that relies on the completeness of the class or on members that have not yet been declared, but the current wording does not appear to state that.

Additional note (October, 2013):

This question also affects function return type deduction (the `auto` specifier) in member functions. For example, the following should presumably be prohibited, but the current wording is not clear:

      struct S {
        static auto f() {
          return 42;
        }
        auto g() -> decltype(f()) {
          return f();
        }
      };

#### 1452. Value-initialized objects may be constants

Section: 5.20 [expr.const] Status: drafting Submitter: Richard Smith Date: 2011-12-24

Some classes that would produce a constant when initialized by value-initialization are not considered literal types. For example:

       struct A { int a; }; // non-constexpr default constructor
       struct B : A {};     // non-literal type

#### 1626. `constexpr` member functions in brace-or-equal-initializers

Section: 5.20 [expr.const] Status: drafting Submitter: Daveed Vandevoorde Date: 2013-02-19

The Standard should make clear that a `constexpr` member function cannot be used in a constant expression until its class is complete. For example:

      template<typename T> struct C {
        template<typename T2> static constexpr bool _S_chk() {
          return false;
        }
        static const bool __value = _S_chk<int>();
      };

      C<double> c;

Current implementations accept this, although they reject the corresponding non-template case:

      struct C {
        static constexpr bool _S_chk() { return false; }
        static const bool __value = _S_chk();
      };

      C c;

Presumably the template case should be handled consistently with the non-template case.

#### 2004. Unions with mutable members in constant expressions

Section: 5.20 [expr.const] Status: drafting Submitter: Richard Smith Date: 2014-09-16

In an example like

      union U { int a; mutable int b; };
      constexpr U u1 = {1};
      int k = (u1.b = 2);
      constexpr U u2 = u1; // ok!!

The initialization of `u2` is not disqualified by the current wording of the Standard because the copy is done via the object representation, not formally involving an lvalue-to-rvalue conversion. A restriction should be added to 5.20 [expr.const] forbidding the evaluation of a defaulted copy/move construction/assignment on a class type that has any variant mutable subobjects.

#### 2022. Copy elision in constant expressions

Section: 5.20 [expr.const] Status: drafting Submitter: Jason Merrill Date: 2014-10-16

Consider the following example:

      struct A {
        void *p;
        constexpr A(): p(this) {}
      };

      constexpr A a;		// well-formed
      constexpr A b = A();          // ?

The declaration of `a` seems well-formed because the address of `a` is constant.

The declaration of `b`, however, seems to depend on whether copy elision is performed. If it is, the declaration is the equivalent of `a`; if not, however, this creates a temporary and initializes `p` to the address of that temporary, making the initialization non-constant and the declaration ill-formed.

It does not seem desirable for the well-formedness of the program to depend on whether the implementation performs an optional copy elision.

Notes from the November, 2014 meeting:

CWG decided to leave it unspecified whether copy elision is performed in cases like this and to add a note to 12.8 [class.copy] to make clear that that outcome is intentional.

#### 1274. Common nonterminal for expression and braced-init-list

Section: 6.5.4 [stmt.ranged] Status: drafting Submitter: Daniel Krügler Date: 2011-03-25

It would be helpful to have a single grammar term for expression and braced-init-list, which often occur together in the text. In particular, 6.5.4 [stmt.ranged] paragraph 1 allows both, but the description of `__RangeT` refers only to the expression case; such errors would be less likely if the common term were available.

#### 1523. Point of declaration in range-based `for`

Section: 6.5.4 [stmt.ranged] Status: drafting Submitter: John Spicer Date: 2012-07-16

According to the general rule for declarations in 3.3.2 [basic.scope.pdecl] paragraph 1,

> The point of declaration for a name is immediately after its complete declarator (Clause 8 [dcl.decl]) and before its initializer (if any), except as noted below.

However, the rewritten expansion of the range-based `for` statement in 6.5.4 [stmt.ranged] paragraph 1 contradicts this general rule, so that the index variable is not visible in the range-init:

      for (int i : {i}) ;   // error: i not in scope

(See also issue 1498 for another question regarding the rewritten form of the range-based `for`.)

Notes from the October, 2012 meeting:

EWG is discussing issue 900 and the outcome of that discussion should be taken into consideration in addressing this issue.

Notes from the April, 2013 meeting:

The approach favored by CWG for resolving this issue is to change the point of declaration of the variable in the for-range-declaration to be after the `)`.

#### 1680. Including `<initializer_list>` for range-based `for`

Section: 6.5.4 [stmt.ranged] Status: drafting Submitter: Richard Smith Date: 2013-05-13

A simple example like

      int main() {
        int k = 0;
        for (auto x : { 1, 2, 3 })
          k += x;
        return k;
      }

requires that the `<initializer_list>` header be included, because the expansion of the range-based `for` involves a declaration of the form

      auto &&__range = { 1, 2, 3 };

and a braced-init-list causes `auto` to be deduced as a specialization of `std::initializer_list`. This seems unnecessary and could be eliminated by specifying that `__range` has an array type for cases like this.

(It should be noted that EWG is considering a proposal to change `auto` deduction for cases involving braced-init-lists, so resolution of this issue should be coordinated with that effort.)

Notes from the September, 2013 meeting:

CWG felt that this issue should be resolved by using the array variant of the range-based `for` implementation.

#### 2017. Flowing off end is not equivalent to no-expression return

Section: 6.6.3 [stmt.return] Status: drafting Submitter: Richard Smith Date: 2014-10-06

According to 6.6.3 [stmt.return] paragraph 2,

> Flowing off the end of a function is equivalent to a `return` with no value...

This is not correct, since a `return` with no value is ill-formed in a value-returning function but flowing off the end results in undefined behavior.

#### 1223. Syntactic disambiguation and trailing-return-types

Section: 6.8 [stmt.ambig] Status: drafting Submitter: Michael Wong Date: 2010-11-08

Because the restriction that a trailing-return-type can appear only in a declaration with “the single type-specifier `auto`” (8.3.5 [dcl.fct] paragraph 2) is a semantic, not a syntactic, restriction, it does not influence disambiguation, which is “purely syntactic” (6.8 [stmt.ambig] paragraph 3). Consequently, some previously unambiguous expressions are now ambiguous. For example:

    struct A {
      A(int *);
      A *operator()(void);
      int B;
    };

    int *p;
    typedef struct BB { int C[2]; } *B, C;

    void foo() {
    // The following line becomes invalid under C++0x:
      A (p)()->B;  // ill-formed function declaration

    // In the following,
    // - B()->C is either type-id or class member access expression
    // - B()->C[1] is either type-id or subscripting expression
    // N3126 subclause 8.2 [dcl.ambig.res] does not mention an ambiguity
    // with these forms of expression
      A a(B ()->C);  // function declaration or object declaration
      sizeof(B ()->C[1]);  // sizeof(type-id) or sizeof on an expression
    }

Notes from the March, 2011 meeting:

CWG agreed that the presence of `auto` should be considered in disambiguation, even though it is formally handled semantically rather than syntactically.

#### 1616. Disambiguation parsing and template parameters

Section: 6.8 [stmt.ambig] Status: drafting Submitter: Johannes Schaub Date: 2013-02-01

According to 6.8 [stmt.ambig] paragraph 3,

> The disambiguation is purely syntactic; that is, the meaning of the names occurring in such a statement, beyond whether they are type-names or not, is not generally used in or changed by the disambiguation. Class templates are instantiated as necessary to determine if a qualified name is a type-name. Disambiguation precedes parsing, and a statement disambiguated as a declaration may be an ill-formed declaration. If, during parsing, a name in a template parameter is bound differently than it would be bound during a trial parse, the program is ill-formed. No diagnostic is required. [Note: This can occur only when the name is declared earlier in the declaration. —end note]

The statement about template parameters is confusing (and not helped by the fact that the example that follows illustrates the general rule for declarations and does not involve any template parameters). It is attempting to say that a program is ill-formed if a template argument of a class template specialization has a different value in the two parses. With `decltype` this can now apply to other kinds of templates as well, so the wording should be clarified and made more general.

#### 1990. Ambiguity due to optional decl-specifier-seq

Section: 7 [dcl.dcl] Status: drafting Submitter: Hubert Tong Date: 2014-08-27

In an example like

      void f() {
        f();  // #1
      }

The statement at #1 is ambiguous and can be parsed as either an expression or as a declaration. The problem is the fact that the decl-specifier-seq in a simple-declaration is optional.

#### 1872. Instantiations of `constexpr` templates that cannot appear in constant expressions

Section: 7.1.5 [dcl.constexpr] Status: drafting Submitter: Richard Smith Date: 2014-02-17

According to 7.1.5 [dcl.constexpr] paragraph 6,

> If the instantiated template specialization of a `constexpr` function template or member function of a class template would fail to satisfy the requirements for a `constexpr` function or `constexpr` constructor, that specialization is still a `constexpr` function or `constexpr` constructor, even though a call to such a function cannot appear in a constant expression.

The restriction on appearing in a constant expression assumes the previous wording that made such a specialization non-`constexpr`, and a call to a non-`constexpr` function cannot appear in a constant expression. With the current wording, however, there is no normative restriction against calls to such specializations. 5.20 [expr.const] should be updated to include such a prohibition.

#### 1348. Use of `auto` in a trailing-return-type

Section: 7.1.6.4 [dcl.spec.auto] Status: drafting Submitter: Richard Smith Date: 2011-08-16

It is not clear whether the `auto` specifier can appear in a trailing-return-type.

#### 1670. `auto` as conversion-type-id

Section: 7.1.6.4 [dcl.spec.auto] Status: drafting Submitter: Richard Smith Date: 2013-04-26
N3690 comment FI 4

The current wording allows something like

      struct S {
        operator auto() { return 0; }
      } s;

If it is intended to be permitted, the details of its handling are not clear. Also, a similar syntax has been discussed as a possible future extension for dealing with proxy types in deduction which, if adopted, could cause confusion.

Additional note, November, 2013:

Doubt was expressed during the 2013-11-25 drafting review teleconference as to the usefulness of this provision. It is therefore being left open for further consideration after C++14 is finalized.

Notes from the February, 2014 meeting:

CWG continued to express doubt as to the usefulness of this construct but felt that if it is permitted, the rules need clarification.

#### 1868. Meaning of “placeholder type”

Section: 7.1.6.4 [dcl.spec.auto] Status: drafting Submitter: Dawn Perchik Date: 2014-02-13

7.1.6 [dcl.type] paragraph 2 describes the `auto` specifier as “a placeholder for a type to be deduced.” Elsewhere, the Standard refers to the type represented by the `auto` specifier as a “placeholder type.” This usage has been deemed confusing by some, requiring either a definition of one or both terms or rewording to avoid them.

#### 1485. Out-of-class definition of member unscoped opaque enumeration

Section: 7.2 [dcl.enum] Status: drafting Submitter: Richard Smith Date: 2012-03-26

The scope in which the names of enumerators are entered for a member unscoped opaque enumeration is not clear. According to 7.2 [dcl.enum] paragraph 10,

> Each enum-name and each unscoped enumerator is declared in the scope that immediately contains the enum-specifier.

In the case of a member opaque enumeration defined outside its containing class, however, it is not clear whether the enumerator names are declared in the class scope or in the lexical scope containing the definition. Declaring them in the class scope would be a violation of 9.2 [class.mem] paragraph 1:

> The member-specification in a class definition declares the full set of members of the class; no member can be added elsewhere.

Declaring the names in the lexical scope containing the definition would be contrary to the example in 14.5.1.4 [temp.mem.enum] paragraph 1:

      template<class T> struct A {
        enum E : T;
      };
      A<int> a;
      template<class T> enum A<T>::E : T { e1, e2 };
      A<int>::E e = A<int>::e1;

There also appear to be problems with the rules for dependent types and members of the current instantiation.

#### 1636. Bits required for negative enumerator values

Section: 7.2 [dcl.enum] Status: drafting Submitter: Hyman Rosen Date: 2013-03-07

According to 7.2 [dcl.enum] paragraph 7,

> For an enumeration whose underlying type is fixed, the values of the enumeration are the values of the underlying type. Otherwise, for an enumeration where emin is the smallest enumerator and emax is the largest, the values of the enumeration are the values in the range bmin to bmax, defined as follows: Let K be 1 for a two's complement representation and 0 for a one's complement or sign-magnitude representation. bmax is the smallest value greater than or equal to max(|emin|-K,|emax|) and equal to 2M-1, where M is a non-negative integer. bmin is zero if emin is non-negative and -(bmax+K) otherwise. The size of the smallest bit-field large enough to hold all the values of the enumeration type is max(M,1) if bmin is zero and M+1 otherwise.

The result of these calculations is that the number of bits required for

      enum { N = -1, Z = 0 }

is 1, but the number required for

      enum { N = -1 }

is 2. This is surprising. This could be fixed by changing |emax| to emax.

#### 1638. Declaring an explicit specialization of a scoped enumeration

Section: 7.2 [dcl.enum] Status: drafting Submitter: Richard Smith Date: 2013-03-12

There is no syntax currently for declaring an explicit specialization of a member scoped enumeration. A declaration (not a definition) of such an explicit specialization most resembles an opaque-enum-declaration, but the grammar for that requires that the name be a simple identifier, which will not be the case for an explicit specialization of a member enumeration. This could be remedied by adding a nested-name-specifier to the grammar with a restriction that a nested-name-specifier only appear in an explicit specialization.

#### 1917. decltype-qualified enumeration names

Section: 7.2 [dcl.enum] Status: drafting Submitter: Daveed Vandevoorde Date: 2014-04-25

8.3 [dcl.meaning] paragraph 1 and 9 [class] paragraph 11 prohibit decltype-qualified declarators and class names, respectively. There is no such prohibition in 7.2 [dcl.enum] for enumeration names. Presumably that is an oversight that should be rectified.

#### 138. Friend declaration name lookup

Section: 7.3.1.2 [namespace.memdef] Status: drafting Submitter: Martin von Loewis Date: 14 Jul 1999

7.3.1.2 [namespace.memdef] paragraph 3 says,

> If a `friend` declaration in a non-local class first declares a class or function the friend class or function is a member of the innermost enclosing namespace... When looking for a prior declaration of a class or a function declared as a `friend`, scopes outside the innermost enclosing namespace scope are not considered.

It is not clear from this passage how to determine whether an entity is "first declared" in a `friend` declaration. One question is whether a using-declaration influences this determination. For instance:

        void foo();
        namespace A{
          using ::foo;
          class X{
    	friend void foo();
          };
        }

Is the `friend` declaration a reference to `::foo` or a different `foo`?

Part of the question involves determining the meaning of the word "synonym" in 7.3.3 [namespace.udecl] paragraph 1:

> A using-declaration introduces a name into the declarative region in which the using-declaration appears. That name is a synonym for the name of some entity declared elsewhere.

Is "`using ::foo;`" the declaration of a function or not?

More generally, the question is how to describe the lookup of the name in a `friend` declaration.

John Spicer: When a declaration specifies an unqualified name, that name is declared, not looked up. There is a mechanism in which that declaration is linked to a prior declaration, but that mechanism is not, in my opinion, via normal name lookup. So, the friend always declares a member of the nearest namespace scope regardless of how that name may or may not already be declared there.

Mike Miller: 3.4.1 [basic.lookup.unqual] paragraph 7 says:

> A name used in the definition of a class `X` outside of a member function body or nested class definition shall be declared in one of the following ways:... [Note: when looking for a prior declaration of a class or function introduced by a `friend` declaration, scopes outside of the innermost enclosing namespace scope are not considered.]

The presence of this note certainly implies that this paragraph describes the lookup of names in `friend` declarations.

John Spicer: It most certainly does not. If that section described the friend lookup it would yield the incorrect results for the friend declarations of `f` and `g` below. I don't know why that note is there, but it can't be taken to mean that that is how the friend lookup is done.

        void f(){}
        void g(){}
        class B {
            void g();
        };
        class A : public B {
            void f();
            friend void f(); // ::f not A::f
            friend void g(); // ::g not B::g
        };

Mike Miller: If so, the lookups for friend functions and classes behave differently. Consider the example in 3.4.4 [basic.lookup.elab] paragraph 3:

        struct Base {
            struct Data;         // OK: declares nested Data
            friend class Data;   // OK: nested Data is a friend
        };

If the `friend` declaration is not a reference to `::foo`, there is a related but separate question: does the `friend` declaration introduce a conflicting (albeit "invisible") declaration into namespace `A`, or is it simply a reference to an as-yet undeclared (and, in this instance, undeclarable) `A::foo`? Another part of the example in 3.4.4 [basic.lookup.elab] paragraph 3 is related:

        struct Data {
            friend struct Glob;  // OK: Refers to (as yet) undeclared Glob
                                 // at global scope.
        };

John Spicer: You can't refer to something that has not yet been declared. The friend is a declaration of `Glob`, it just happens to declare it in a such a way that its name cannot be used until it is redeclared.

(A somewhat similar question has been raised in connection with issue 36. Consider:

        namespace N {
            struct S { };
        }
        using N::S;
        struct S;          // legal?

According to 9.1 [class.name] paragraph 2,

> A declaration consisting solely of class-key identifier ; is either a redeclaration of the name in the current scope or a forward declaration of the identifier as a class name.

Should the elaborated type declaration in this example be considered a redeclaration of `N::S` or an invalid forward declaration of a different class?)

(See also issues 95, 136, 139, 143, 165, and 166, as well as paper J16/00-0006 = WG21 N1229.)

#### 386. Friend declaration of name brought in by using-declaration

Section: 7.3.3 [namespace.udecl] Status: drafting Submitter: Herb Sutter Date: 8 Oct 2002

The following came up recently on comp.lang.c++.moderated (edited for brevity):

      namespace N1 {
        template<typename T> void f( T* x ) {
          // ... other stuff ...
          delete x;
        }
      }

      namespace N2 {
        using N1::f;

        template<> void f<int>( int* ); // A: ill-formed

        class Test {
          ~Test() { }
          friend void f<>( Test* x );   // B: ill-formed?
        };
      }

I strongly suspect, but don't have standardese to prove, that the friend declaration in line B is ill-formed. Can someone show me the text that allows or disallows line B?

Here's my reasoning: Writing "using" to pull the name into namespace N2 merely allows code in N2 to use the name in a call without qualification (per 7.3.3 [namespace.udecl]). But just as declaring a specialization must be done in the namespace where the template really lives (hence line A is ill-formed), I suspect that declaring a specialization as a friend must likewise be done using the original namespace name, not obliquely through a "using". I see nothing in 7.3.3 [namespace.udecl] that would permit this use. Is there?

Andrey Tarasevich: 14.5.4 [temp.friend] paragraph 2 seems to get pretty close: "A friend declaration that is not a template declaration and in which the name of the friend is an unqualified 'template-id' shall refer to a specialization of a function template declared in the nearest enclosing namespace scope".

Herb Sutter: OK, thanks. Then the question in this is the word "declared" -- in particular, we already know we cannot declare a specialization of a template in any other namespace but the original one.

John Spicer: This seems like a simple question, but it isn't.

First of all, I don't think the standard comments on this usage one way or the other.

A similar example using a namespace qualified name is ill-formed based on 8.3 [dcl.meaning] paragraph 1:

      namespace N1 {
            void f();
      }

      namespace N2 {
            using N1::f;
            class A {
                    friend void N2::f();
            };
      }

Core issue 138 deals with this example:

      void foo();
      namespace A{
        using ::foo;
        class X{
          friend void foo();
        };
      }

The proposed resolution (not yet approved) for issue 138 is that the friend declares a new foo that conflicts with the using-declaration and results in an error.

Your example is different than this though because the presence of the explicit argument list means that this is not declaring a new f but is instead using a previously declared f.

One reservation I have about allowing the example is the desire to have consistent rules for all of the "declaration like" uses of template functions. Issue 275 (in DR status) addresses the issue of unqualified names in explicit instantiation and explicit specialization declarations. It requires that such declarations refer to templates from the namespace containing the explicit instantiation or explicit specialization. I believe this rule is necessary for those directives but is not really required for friend declarations -- but there is the consistency issue.

Notes from April 2003 meeting:

This is related to issue 138. John Spicer is supposed to update his paper on this topic. This is a new case not covered in that paper. We agreed that the B line should be allowed.

#### 1713. Linkage of variable template specializations

Section: 7.5 [dcl.link] Status: drafting Submitter: Richard Smith Date: 2013-07-08

Given a namespace-scope declaration like

      template<typename T> T var = T();

should `T<const int>` have internal linkage by virtue of its const-qualified type? Or should it inherit the linkage of the template?

Notes from the February, 2014 meeting:

CWG noted that linkage is by name, and a specialization of a variable template does not have a name separate from that of the variable template, thus the specialization will have the linkage of the template.

#### 1817. Linkage specifications and nested scopes

Section: 7.5 [dcl.link] Status: drafting Submitter: Richard Smith Date: 2013-12-04

According to 7 [dcl.dcl] paragraph 2,

> Unless otherwise stated, utterances in Clause 7 [dcl.dcl] about components in, of, or contained by a declaration or subcomponent thereof refer only to those components of the declaration that are not nested within scopes nested within the declaration.

This contradicts the intent of 7.5 [dcl.link] paragraph 4, which says,

> In a linkage-specification, the specified language linkage applies to the function types of all function declarators, function names with external linkage, and variable names with external linkage declared within the linkage-specification.

Also, one of the comments in the example in paragraph 4 is inconsistent with the intent:

      extern "C" {
        static void f4(); // the name of the function f4 has
                          // internal linkage (not C language
                          // linkage) and the function's type
                          // has C language linkage.
      }

      extern "C" void f5() {
        extern void f4(); // OK: Name linkage (internal)
                          // and function type linkage (C
                          // language linkage) gotten from
                          // previous declaration.
      }

The language linkage for the block-scope declaration of `f4` is presumably determined by the fact that it appears in a C-linkage function, not by the previous declaration.

Proposed resolution (February, 2014):

Change 7.5 [dcl.link] paragraph 4 as follows:

> Linkage specifications nest. When linkage specifications nest, the innermost one determines the language linkage. A linkage specification does not establish a scope. A linkage-specification shall occur only in namespace scope (3.3 [basic.scope]). In a linkage-specification, the specified language linkage applies to the function types of all function declarators, function names with external linkage, and variable names with external linkage declared within the linkage-specification, including those appearing in scopes nested inside the linkage specification and not inside a nested linkage-specification. [Example:

> ...

>       extern "C" {
>         static void f4(); // the name of the function f4 has
>                           // internal linkage (not C language
>                           // linkage) and the function's type
>                           // has C language linkage.
>       }

>       extern "C" void f5() {
>         extern void f4(); // OK: Name linkage (internal)
>                           // and function type linkage (C
>                           // language linkage) gotten from
>                           // previous declaration.; function type
>                           // linkage (C language
>                           // linkage) gotten
>                           // from linkage specification
>       }

Additional note, November, 2014:

The issue has been returned to "drafting" status to clarify the circumstances under which a preceding declaration supplies the language linkage for a declaration (for example, not when the declaration uses a typedef, which carries the language linkage, but only when the declaration uses a function declarator).

#### 1706. `alignas` pack expansion syntax

Section: 7.6.1 [dcl.attr.grammar] Status: drafting Submitter: Daveed Vandevoorde Date: 2013-06-26

The grammar for alignment-specifier in 7.6.1 [dcl.attr.grammar] paragraph 1 is:

alignment-specifier:

`alignas (` type-id `...`opt`)`
`alignas (` assignment-expression `...`opt`)`

where the ellipsis indicates pack expansion. Naively, one would expect that the expansion would result in forms like

        alignas()
        alignas(1, 2)
        alignas(int, double)

but none of those forms is given any meaning by the current wording. Instead, 14.5.3 [temp.variadic] paragraph 4 says,

> In an alignment-specifier (7.6.2 [dcl.align]); the pattern is the alignment-specifier without the ellipsis.

Presumably this means that something like `alignas(T...)` would expand to something like

        alignas(int) alignas(double)

This is counterintuitive and should be reexamined.

See also messages 24016 through 24021.

Notes from the February, 2014 meeting:

CWG decided to change the pack expansion of `alignas` so that the type-id or assignment-expression is repeated inside the parentheses and to change the definition of `alignas` to accept multiple arguments with the same meaning as multiple `alignas` specifiers.

#### 2027. Unclear requirements for multiple `alignas` specifiers

Section: 7.6.2 [dcl.align] Status: drafting Submitter: Steve Clamage Date: 2014-10-20

The description of alignment-specifiers is unclear. For example, 7.6.2 [dcl.align] bullet 2.2 says,

> if the constant expression evaluates to a fundamental alignment, the alignment requirement of the declared entity shall be the specified fundamental alignment

However, paragraph 4 says,

> When multiple alignment-specifiers are specified for an entity, the alignment requirement shall be set to the strictest specified alignment.

meaning that a less-strict alignment will be ignored, rather than being the alignment of the entity, and presumably meaning that no diagnostic is required for an insufficiently-strict alignment if a more stringent requirement is also supplied.

#### 1342. Order of initialization with multiple declarators

Section: 8 [dcl.decl] Status: drafting Submitter: Alberto Ganesh Barbati Date: 2011-08-11

It is not clear what, if anything, in the existing specification requires that the initialization of multiple init-declarators within a single declaration be performed in declaration order.

#### 1488. abstract-pack-declarators in type-ids

Section: 8.1 [dcl.name] Status: drafting Submitter: Richard Smith Date: 2012-03-28

The grammar for type-id in 9.1 [class.name] paragraph 1 has two problems. First, the fact that we allow an abstract-pack-declarator makes some uses of type-id (template arguments, alignment specifiers, exception-specifications) ambiguous: `T...` could be parsed either as a type-id, including the ellipsis, or as the type-id `T` with a following ellipsis. There does not appear to be any rule to disambiguate these parses.

The other problem is that we do not allow parentheses in an abstract-pack-declarator, which makes

      template<typename...Ts> void f(Ts (&...)[4]);

ill-formed because `(&...)()` is not an abstract-pack-declarator. There is implementation variance on this point.

#### 1900. Do `friend` declarations count as “previous declarations”?

Section: 8.3 [dcl.meaning] Status: drafting Submitter: Hubert Tong Date: 2014-03-25

Issue 1477 assumes that a name declared only in a `friend` declaration can be defined outside its namespace using a qualified-id, but the normative passages in 8.3 [dcl.meaning] paragraph 1 and 7.3.1.2 [namespace.memdef] paragraph 2 do not settle the question definitively, and there is implementation variance. A clearer statement of intent is needed.

#### 453. References may only bind to “valid” objects

Section: 8.3.2 [dcl.ref] Status: drafting Submitter: Gennaro Prota Date: 18 Jan 2004

8.3.2 [dcl.ref] paragraph 4 says:

> A reference shall be initialized to refer to a valid object or function. [Note: in particular, a null reference cannot exist in a well-defined program, because the only way to create such a reference would be to bind it to the "object" obtained by dereferencing a null pointer, which causes undefined behavior ...]

What is a "valid" object? In particular the expression "valid object" seems to exclude uninitialized objects, but the response to Core Issue 363 clearly says that's not the intent. This is an example (overloading construction on constness of *this) by John Potter, which I think is supposed to be legal C++ though it binds references to objects that are not initialized yet:

     struct Fun {
        int x, y;
        Fun (int x, Fun const&) : x(x), y(42) { }
        Fun (int x, Fun&) : x(x), y(0) { }
      };
      int main () {
        const Fun f1 (13, f1);
        Fun f2 (13, f2);
        cout << f1.y << " " << f2.y << "\n";
      }

Suggested resolution: Changing the final part of 8.3.2 [dcl.ref] paragraph 4 to:

> A reference shall be initialized to refer to an object or function. From its point of declaration on (see 3.3.2 [basic.scope.pdecl]) its name is an lvalue which refers to that object or function. The reference may be initialized to refer to an uninitialized object but, in that case, it is usable in limited ways (3.8 [basic.life], paragraph 6) [Note: On the other hand, a declaration like this:

>         int & ref = *(int*)0;

> is ill-formed because ref will not refer to any object or function ]

I also think a "No diagnostic is required." would better be added (what about something like int& r = r; ?)

Proposed Resolution (October, 2004):

(Note: the following wording depends on the proposed resolution for issue 232.)

Change 8.3.2 [dcl.ref] paragraph 4 as follows:

> A reference shall be initialized to refer to a valid object or function. If an lvalue to which a reference is directly bound designates neither an existing object or function of an appropriate type (8.5.3 [dcl.init.ref]), nor a region of memory of suitable size and alignment to contain an object of the reference's type (1.8 [intro.object], 3.8 [basic.life], 3.9 [basic.types]), the behavior is undefined. [Note: in particular, a null reference cannot exist in a well-defined program, because the only way to create such a reference would be to bind it to the “object” empty lvalue obtained by dereferencing a null pointer, which causes undefined behavior. As does not designate an object or function. Also, as described in 9.6 [class.bit], a reference cannot be bound directly to a bit-field. ]

> The name of a reference shall not be used in its own initializer. Any other use of a reference before it is initialized results in undefined behavior. [Example:

>       int& f(int&);
>       int& g();

>       extern int& ir3;
>       int* ip = 0;

>       int& ir1 = *ip;     // undefined behavior: null pointer
>       int& ir2 = f(ir3);  // undefined behavior: ir3 not yet initialized
>       int& ir3 = g();
>       int& ir4 = f(ir4);  // ill-formed: ir4 used in its own initializer

> —end example]

Rationale: The proposed wording goes beyond the specific concerns of the issue. It was noted that, while the current wording makes cases like `int& r = r;` ill-formed (because `r` in the initializer does not "refer to a valid object"), an inappropriate initialization can only be detected, if at all, at runtime and thus "undefined behavior" is a more appropriate treatment. Nevertheless, it was deemed desirable to continue to require a diagnostic for obvious compile-time cases.

It was also noted that the current Standard does not say anything about using a reference before it is initialized. It seemed reasonable to address both of these concerns in the same wording proposed to resolve this issue.

Notes from the April, 2005 meeting:

The CWG decided that whether to require an implementation to diagnose initialization of a reference to itself should be handled as a separate issue (504) and also suggested referring to “storage” instead of “memory” (because 1.8 [intro.object] defines an object as a “region of storage”).

Proposed Resolution (April, 2005):

(Note: the following wording depends on the proposed resolution for issue 232.)

Change 8.3.2 [dcl.ref] paragraph 4 as follows:

> A reference shall be initialized to refer to a valid object or function. If an lvalue to which a reference is directly bound designates neither an existing object or function of an appropriate type (8.5.3 [dcl.init.ref]), nor a region of storage of suitable size and alignment to contain an object of the reference's type (1.8 [intro.object], 3.8 [basic.life], 3.9 [basic.types]), the behavior is undefined. [Note: in particular, a null reference cannot exist in a well-defined program, because the only way to create such a reference would be to bind it to the “object” empty lvalue obtained by dereferencing a null pointer, which causes undefined behavior. As does not designate an object or function. Also, as described in 9.6 [class.bit], a reference cannot be bound directly to a bit-field. ]

> Any use of a reference before it is initialized results in undefined behavior. [Example:

>       int& f(int&);
>       int& g();

>       extern int& ir3;
>       int* ip = 0;

>       int& ir1 = *ip;     // undefined behavior: null pointer
>       int& ir2 = f(ir3);  // undefined behavior: ir3 not yet initialized
>       int& ir3 = g();
>       int& ir4 = f(ir4);  // undefined behavior: ir4 used in its own initializer

> —end example]

Note (February, 2006):

The word “use” in the last paragraph of the proposed resolution was intended to refer to the description in 3.2 [basic.def.odr] paragraph 2. However, that section does not define what it means for a reference to be “used,” dealing only with objects and functions. Additional drafting is required to extend 3.2 [basic.def.odr] paragraph 2 to apply to references.

Additional note (May, 2008):

The proposed resolution for issue 570 adds wording to define “use” for references.

Note, January, 2012:

The resolution should also probably deal with the fact that the “one-past-the-end” address of an array does not designate a valid object (even if such a pointer might “point to” an object of the correct type, per 3.9.2 [basic.compound]) and thus is not suuitable for the lvalue-to-rvalue conversion.

#### 1640. Array of abstract instance of class template

Section: 8.3.4 [dcl.array] Status: drafting Submitter: Richard Smith Date: 2013-03-14

According to 8.3.4 [dcl.array] paragraph 1, an array declarator whose element type is an abstract class is ill-formed. However, if the element type is a class template specialization, it may not be known that the class is abstract; because forming an array of an incomplete type is permitted (3.9 [basic.types] paragraphs 5-6), the class template is not required to be instantiated in order to use it as an element type. The expected handling if the class template is later instantiated is unclear; should the compiler issue an error about the earlier array array type at the point at which the class template is instantiated?

This also affects overload resolution:

      template<typename> struct Abstract {
        virtual void f() = 0;
        typedef int type;
      };
      template<typename T> char &abstract_test(T[1]);      // #1
      template<typename T> char (&abstract_test(...))[2];  // #2
      // Abstract<int>::type n;
      static_assert(sizeof(abstract_test<Abstract<int>>(nullptr)) == 2, "");

Overload resolution will select #1 and fail the assertion; if the commented line is uncommented, there is implementation variance, but presumably #2 should be selected and satisfy the assertion.

These effects of completing the type are troublesome. Would it be better to allow array types of abstract element type and simply prohibit creation of objects of such arrays?

(See also issue 1646.)

#### 1001. Parameter type adjustment in dependent parameter types

Section: 8.3.5 [dcl.fct] Status: drafting Submitter: Jason Merrill Date: 2009-11-08

According to 8.3.5 [dcl.fct] paragraph 5, top-level cv-qualifiers on parameter types are deleted when determining the function type. It is not clear how or whether this adjustment should be applied to parameters of function templates when the parameter has a dependent type, however. For example:

        template<class T> struct A {
           typedef T arr[3];
        };

        template<class T> void f(const typename A<T>::arr) { } // #1

        template void f<int>(const A<int>::arr);

        template <class T> struct B {
           void g(T);
        };

        template <class T> void B<T>::g(const T) { } // #2

If the `const` in #1 is dropped, `f<int>` has a parameter type of `A*` rather than the `const A*` specified in the explicit instantiation. If the `const` in #2 is not dropped, we fail to match the definition of `B::g` to its declaration.

Rationale (November, 2010):

The CWG agreed that this behavior is intrinsic to the different ways cv-qualification applies to array types and non-array types.

Notes, January, 2012:

Additional discussion of this issue arose regarding the following example:

        template<class T> struct A {
          typedef double Point[2];
          virtual double calculate(const Point point) const = 0;
        };

        template<class T> struct B : public A<T> {
          virtual double calculate(const typename A<T>::Point point) const {
            return point[0];
          }
        };

        int main() {
          B<int> b;
          return 0;
        }

The question is whether the member function in `B<int>` has the same type as that in `A<int>`: is the parameter-type-list instantiated directly (i.e., using the adjusted types) or regenerated from the individual parameter types?

(See also issue 1322.)

#### 1668. Parameter type determination still not clear enough

Section: 8.3.5 [dcl.fct] Status: drafting Submitter: Daniel Krügler Date: 2013-04-25

According to 8.3.5 [dcl.fct] paragraph 5,

> The type of a function is determined using the following rules. The type of each parameter (including function parameter packs) is determined from its own decl-specifier-seq and declarator. After determining the type of each parameter, any parameter of type “array of `T`” or “function returning `T`” is adjusted to be “pointer to `T`” or “pointer to function returning `T`,” respectively. After producing the list of parameter types, any top-level cv-qualifiers modifying a parameter type are deleted when forming the function type. The resulting list of transformed parameter types and the presence or absence of the ellipsis or a function parameter pack is the function's parameter-type-list. [Note: This transformation does not affect the types of the parameters. For example, `int(*)(const int p, decltype(p)*)` and `int(*)(int, const int*)` are identical types. —end note]

This is not sufficiently clear to specify the intended handling of an example like

      void f(int a[10], decltype(a) *p );

Should the type of `p` be `int(*)[10]` or `int**`? The latter is the intended result, but the phrase “after determining the type of each parameter” makes it sound as if the adjustments are performed after all the parameter types have been determined from the decl-specifier-seq and declarator instead of for each parameter individually.

See also issue 1444.

#### 325. When are default arguments parsed?

Section: 8.3.6 [dcl.fct.default] Status: drafting Submitter: Nathan Sidwell Date: 27 Nov 2001

The standard is not precise enough about when the default arguments of member functions are parsed. This leads to confusion over whether certain constructs are legal or not, and the validity of certain compiler implementation algorithms.

8.3.6 [dcl.fct.default] paragraph 5 says "names in the expression are bound, and the semantic constraints are checked, at the point where the default argument expression appears"

However, further on at paragraph 9 in the same section there is an example, where the salient parts are

      int b;
      class X {
        int mem2 (int i = b); // OK use X::b
        static int b;
      };

which appears to contradict the former constraint. At the point the default argument expression appears in the definition of X, X::b has not been declared, so one would expect ::b to be bound. This of course appears to violate 3.3.7 [basic.scope.class] paragraph 1(2) "A name N used in a class S shall refer to the same declaration in its context and when reevaluated in the complete scope of S. No diagnostic is required."

Furthermore 3.3.7 [basic.scope.class] paragraph 1(1) gives the scope of names declared in class to "consist not only of the declarative region following the name's declarator, but also of .. default arguments ...". Thus implying that X::b is in scope in the default argument of X::mem2 previously.

That previous paragraph hints at an implementation technique of saving the token stream of a default argument expression and parsing it at the end of the class definition (much like the bodies of functions defined in the class). This is a technique employed by GCC and, from its behaviour, in the EDG front end. The standard leaves two things unspecified. Firstly, is a default argument expression permitted to call a static member function declared later in the class in such a way as to require evaluation of that function's default arguments? I.e. is the following well formed?

      class A {
        static int Foo (int i = Baz ());
        static int Baz (int i = Bar ());
        static int Bar (int i = 5);
     };

If that is well formed, at what point does the non-sensicalness of

      class B {
        static int Foo (int i = Baz ());
        static int Baz (int i = Foo());
      };

become detected? Is it when B is complete? Is it when B::Foo or B::Baz is called in such a way to require default argument expansion? Or is no diagnostic required?

The other problem is with collecting the tokens that form the default argument expression. Default arguments which contain template-ids with more than one parameter present a difficulty in determining when the default argument finishes. Consider,

      template <int A, typename B> struct T { static int i;};
      class C {
        int Foo (int i = T<1, int>::i);
      };

The default argument contains a non-parenthesized comma. Is it required that this comma is seen as part of the default argument expression and not the beginning of another of argument declaration? To accept this as part of the default argument would require name lookup of T (to determine that the '<' was part of a template argument list and not a less-than operator) before C is complete. Furthermore, the more pathological

      class D {
        int Foo (int i = T<1, int>::i);
        template <int A, typename B> struct T {static int i;};
      };

would be very hard to accept. Even though T is declared after Foo, T is in scope within Foo's default argument expression.

Suggested resolution:

Append the following text to 8.3.6 [dcl.fct.default] paragraph 8.

> The default argument expression of a member function declared in the class definition consists of the sequence of tokens up until the next non-parenthesized, non-bracketed comma or close parenthesis. Furthermore such default argument expressions shall not require evaluation of a default argument of a function declared later in the class.

This would make the above A, B, C and D ill formed and is in line with the existing compiler practice that I am aware of.

Notes from the October, 2005 meeting:

The CWG agreed that the first example (`A`) is currently well-formed and that it is not unreasonable to expect implementations to handle it by processing default arguments recursively.

Additional notes, May, 2009:

Presumably the following is ill-formed:

        int f(int = f());

However, it is not clear what in the Standard makes it so. Perhaps there needs to be a statement to the effect that a default argument only becomes usable after the complete declarator of which it is a part.

Notes from the August, 2011 meeting:

In addition to default arguments, commas in template argument lists also cause problems in initializers for nonstatic data members:

        struct S {
          int n = T<a,b>(c);  // ill-formed declarator for member b
                              // or template argument?
        };

(This is from #16 of the `IssuesFoundImplementingC0x.pdf` document on the Bloomington wiki.

Additional notes (August, 2011):

See also issues 1352 and 361.

Notes from the February, 2012 meeting:

It was decided to handle the question of parsing an initializer like `T<a,b>(c)` (a template-id or two declarators) in this issue and the remaining questions in issue 361. For this issue, a template-id will only be recognized if there is a preceding declaration of a template.

#### 1580. Default arguments in explicit instantiations

Section: 8.3.6 [dcl.fct.default] Status: drafting Submitter: Daveed Vandevoorde Date: 2012-10-29

It is not clear, either from 8.3.6 [dcl.fct.default] or 14.7.2 [temp.explicit], whether it is permitted to add a default argument in an explicit instantiation of a function template:

      template<typename T> void f(T, int) { }
      template void f<int>(int, int=0);  // Permitted?

Notes from the April, 2013 meeting:

The intent is to prohibit default arguments in explicit instantiations.

#### 1733. Return type and value for `operator=` with ref-qualifier

Section: 8.4.2 [dcl.fct.def.default] Status: drafting Submitter: James Widman Date: 2013-08-09

8.4.2 [dcl.fct.def.default] paragraph 1 specifies that an explicitly-defaulted function shall

> have the same declared function type (except for possibly differing ref-qualifiers and except that in the case of a copy constructor or copy assignment operator, the parameter type may be “reference to non-const `T`”, where `T` is the name of the member function's class) as if it had been implicitly declared...

This allows an example like

      struct A {
        A& operator=(A const&) && = default;
      };

but forbids

      struct B {
        B&& operator=(B const&) && = default;
      };

which seems backward.

In addition, 12.8 [class.copy] paragraph 22 only specifies the return value for implicitly-declared copy/move assignment operators, not for explicitly-defaulted ones.

#### 1854. Disallowing use of implicitly-deleted functions

Section: 8.4.2 [dcl.fct.def.default] Status: drafting Submitter: Richard Smith Date: 2014-02-11

The resolution of issue 1778 means that whether an explicitly-defaulted function is deleted or not cannot be known until the end of the class definition. As a result, new rules are required to disallow references (in, e.g., `decltype`) to explicitly-defaulted functions that might later become deleted.

Notes from the June, 2014 meeting:

The approach favored by CWG was to make any reference to an explicitly-defaulted function ill-formed if it occurs prior to the end of the class definition.

#### 2015. odr-use of deleted virtual functions

Section: 8.4.3 [dcl.fct.def.delete] Status: drafting Submitter: David Majnemer Date: 2014-10-05

It is not clear that the odr-use of a virtual function described in 3.2 [basic.def.odr] paragraph 3 is exempt from the prohibition against referring to a deleted function (8.4.3 [dcl.fct.def.delete] paragraph 2).

#### 253. Why must empty or fully-initialized const objects be initialized?

Section: 8.5 [dcl.init] Status: drafting Submitter: Mike Miller Date: 11 Jul 2000

Paragraph 9 of 8.5 [dcl.init] says:

> If no initializer is specified for an object, and the object is of (possibly cv-qualified) non-POD class type (or array thereof), the object shall be default-initialized; if the object is of const-qualified type, the underlying class type shall have a user-declared default constructor. Otherwise, if no initializer is specified for an object, the object and its subobjects, if any, have an indeterminate initial value; if the object or any of its subobjects are of const-qualified type, the program is ill-formed.

What if a const POD object has no non-static data members? This wording requires an empty initializer for such cases:

        struct Z {
            // no data members
            operator int() const { return 0; }
        };

        void f() {
            const Z z1;         // ill-formed: no initializer
            const Z z2 = { };   // well-formed
        }

Similar comments apply to a non-POD const object, all of whose non-static data members and base class subobjects have default constructors. Why should the class of such an object be required to have a user-declared default constructor?

(See also issue 78.)

Additional note (February, 2011):

This issue should be brought up again in light of constexpr constructors and non-static data member initializers.

Notes from the August, 2011 meeting:

If the implicit default constructor initializes all subobjects, no initializer should be required.

#### 1997. Placement new and previous initialization

Section: 8.5 [dcl.init] Status: drafting Submitter: Jason Merrill Date: 2014-09-08

Given the following example,

      #include <new>

      int main() {
        unsigned char buf[sizeof(int)] = {};
        int *ip = new (buf) int;
        return *ip; // 0 or undefined?
      }

Should the preceding initializsation of the buffer carry over to the value of `*ip`? According to 8.5 [dcl.init] paragraph 12,

> When storage for an object with automatic or dynamic storage duration is obtained, the object has an `indeterminate value`, and if no initialization is performed for the object, that object retains an indeterminate value until that value is replaced (5.18 [expr.ass]).

In this case, no new storage is being obtained for the `int` object created by the new-expression.

#### 1622. Empty aggregate initializer for union

Section: 8.5.1 [dcl.init.aggr] Status: drafting Submitter: Daveed Vandevoorde Date: 2013-02-14

According to 8.5.1 [dcl.init.aggr] paragraph 15,

> When a union is initialized with a brace-enclosed initializer, the braces shall only contain an initializer-clause for the first non-static data member of the union.

This would appear to preclude using `{}` as the initializer for a union, which would otherwise have reasonable semantics. Is there a reason for this restriction?

Also, paragraph 7 reads,

> If there are fewer initializer-clauses in the list than there are members in the aggregate, then each member not explicitly initialized shall be initialized from an empty initializer list (8.5.4 [dcl.init.list]).

There should presumably be special treatment for unions, so that only a single member is initialized in such cases.

(See also issue 1460.)

#### 1304. Omitted array bound with string initialization

Section: 8.5.2 [dcl.init.string] Status: drafting Submitter: Nikolay Ivchenkov Date: 2011-04-26

The example in 8.5.2 [dcl.init.string] paragraph 1 says,

>       char msg[] = "Syntax error on line %s\n";

> shows a character array whose members are initialized with a string-literal. Note that because `'\n'` is a single character and because a trailing `'\0'` is appended, `sizeof(msg)` is `25`.

However, there appears to be no normative specification of how the size of the array is to be calculated.

#### 1414. Binding an rvalue reference to a reference-unrelated lvalue

Section: 8.5.3 [dcl.init.ref] Status: drafting Submitter: Mike Miller Date: 2011-11-09

Currently an attempt to bind an rvalue reference to a reference-unrelated lvalue succeeds, binding the reference to a temporary initialized from the lvalue by copy-initialization. This appears to be intentional, as the accompanying example contains the lines

        int i3 = 2;
        double&& rrd3 = i3;  // rrd3 refers to temporary with value 2.0

This violates the expectations of some who expect that rvalue references can be initialized only with rvalues. On the other hand, it is parallel with the handling of an lvalue reference-to-const (and is handled by the same wording). It also can add efficiency without requiring existing code to be rewritten: the implicitly-created temporary can be moved from, just as if the call had been rewritten to create a prvalue temporary from the lvalue explicitly.

On a related note, assuming the binding is permitted, the intent of the overload tiebreaker found in 13.3.3.2 [over.ics.rank] paragraph 3 is not clear:

- Standard conversion sequence `S1` is a better conversion sequence than standard conversion sequence `S2` if

- ...

- `S1` and `S2` are reference bindings (8.5.3 [dcl.init.ref]) and neither refers to an implicit object parameter of a non-static member function declared without a ref-qualifier, and `S1` binds an rvalue reference to an rvalue and `S2` binds an lvalue reference.

At question is what “to an rvalue” means here. If it is referring to the value category of the initializer itself, before conversions, then the supposed performance advantage of the binding under discussion does not occur because the competing rvalue and lvalue reference overloads will be ambiguous:

        void f(int&&);    // #1
        void f(const int&);
        void g(double d) {
            f(d);         // ambiguous: #1 does not bind to an rvalue
        }

On the other hand, if “to an rvalue” refers to the actual object to which the reference is bound, i.e., to the temporary in the case under discussion, the phrase would seem to be vacuous because an rvalue reference can never bind directly to an lvalue.

Notes from the February, 2012 meeting:

CWG agreed that the binding rules are correct, allowing creation of a temporary when binding an rvalue reference to a non-reference-related lvalue. The phrase “to an rvalue” in 13.3.3.2 [over.ics.rank] paragraph 3 is a leftover from before binding an rvalue reference to an lvalue was prohibited and should be removed. A change is also needed to handle the following case:

        void f(const char (&)[1]);         // #1
        template<typename T> void f(T&&);  // #2
        void g() {
          f("");                           //calls #2, should call #1
        }

Additional note (October, 2012):

Removing “to an rvalue,” as suggested, would have the effect of negating the preference for binding a function lvalue to an lvalue reference instead of an rvalue reference because the case would now fall under the preceding bullet of 13.3.3.2 [over.ics.rank] paragraph 3 bullet 1, sub-bullets 4 and 5:

> Two implicit conversion sequences of the same form are indistinguishable conversion sequences unless one of the following rules applies:

> - Standard conversion sequence `S1` is a better conversion sequence than standard conversion sequence `S2` if

> - ...

> - `S1` and `S2` are reference bindings (8.5.3 [dcl.init.ref]) and neither refers to an implicit object parameter of a non-static member function declared without a ref-qualifier, and `S1` binds an rvalue reference to an rvalue and `S2` binds an lvalue reference... or, if not that,

> - `S1` and `S2` are reference bindings (8.5.3 [dcl.init.ref]) and `S1` binds an lvalue reference to a function lvalue and `S2` binds an rvalue reference to a function lvalue.

Presumably if the suggested resolution is adopted, the order of these two bullets should be inverted.

#### 1827. Reference binding with ambiguous conversions

Section: 8.5.3 [dcl.init.ref] Status: drafting Submitter: Hubert Tong Date: 2014-01-07

In the following case,

      struct A {
        operator int &&() const;
        operator int &&() volatile;
        operator long();
      };

      int main() {
        int &&x = A();
      }

the conversion for direct binding cannot be used because of the ambiguity, so indirect binding is used, which allows the use of the conversion to `long` in creating the temporary.

Is this intended? There is implementation variation.

Notes from the February, 2014 meeting:

CWG agreed that an ambiguity like this should make the initialization ill-formed instead of falling through to do indirect binding.

#### 1518. Explicit default constructors and copy-list-initialization

Section: 8.5.4 [dcl.init.list] Status: drafting Submitter: Richard Smith Date: 2012-07-08

Consider the following example:

      struct A {
       explicit A() = default;
      };

      struct B : A {
       explicit B() = default;
      };

      struct C {
       explicit C();
      };

      struct D : A {
       C c;
       explicit D() = default;
      };

      template<typename T> void f() {
       T t = {};
      }
      template<typename T> void g() {
       void x(T t);
       x({});
      }

The question is whether `f<B>`, f`<C>`, `f<D>`, `g<B>`, `g<C>`, and `g<D>` are well-formed or ill-formed.

The crux here is whether 13.3.1.7 [over.match.list] is the governing law in each of these cases. If it is, the initialization is ill-formed, because copy-list-initialization has selected an explicit constructor. The standard seems clear that `f<A>` and `g<A>` are valid (because `A` is an aggregate, so 13.3.1.7 [over.match.list] is not reached nor applicable), `f<B>` is valid (because value-initialization does not call the default constructor, so 13.3.1.7 [over.match.list] is not reached), and that `g<B>`, `g<C>`, and `g<D>` are ill-formed (because 13.3.1.7 [over.match.list] is reached from 13.3.3.1.5 [over.ics.list] and selects an explicit constructor). The difference between `f<B>` and `g<B>` is troubling.

For `f<C>` and `f<D>`, it's not clear whether the default constructor call within value-initialization within list-initialization uses 13.3.1.7 [over.match.list] — but some form of overload resolution seems to be implied, since presumably we want to apply SFINAE to variadic constructor templates, diagnose classes which have multiple default constructors through the addition of default arguments, and the like.

It has been suggested that perhaps we are supposed to reach 13.3.1.7 [over.match.list] for an empty initializer list for a non-aggregate class with a default constructor only when we're coming from 13.3.3.1.5 [over.ics.list], and not when 8.5.4 [dcl.init.list] delegates to value-initialization. That would make all the `f`s valid, but `g<B>`, `g<C>`, and `g<D>` ill-formed.

12.3.1 [class.conv.ctor] paragraph 2 says explicit constructors are only used for direct-initialization or casts, which argues for at least `f<C>`, `f<D>`, `g<C>` and `g<D>` being ill-formed.

#### 1565. Copy elision and lifetime of `initializer_list` underlying array

Section: 8.5.4 [dcl.init.list] Status: drafting Submitter: Steve Adamczyk Date: 2012-10-10

If an `initializer_list` object is copied and the copy is elided, is the lifetime of the underlying array object extended? E.g.,

      void f() {
        std::initializer_list<int> L =
            std::initializer_list<int>{1, 2, 3}; // Lifetime of array extended?
      }

The current wording is not clear.

Notes from the October, 2012 meeting:

The consensus of CWG was that the behavior should be the same, regardless of whether the copy is elided or not.

#### 1496. Triviality with deleted and missing default constructors

Section: 9.1 [class.name] Status: drafting Submitter: Daniel Krügler Date: 2012-04-25

A default constructor that is defined as deleted is trivial, according to 12.1 [class.ctor] paragraph 5. This means that, according to 9 [class] paragraph 6, such a class can be trivial. If, however, the class has no default constructor because it has a user-declared constructor, the class is not trivial. Since both cases prevent default construction of the class, it is not clear why there is a difference in triviality between the cases.

Notes from the October, 2012 meeting:

It was observed that this issue was related to issue 1344, as the current specification allows adding a default constructor by adding default arguments to the definition of a constructor. The resolution of that issue should also resolve this one.

Notes from the September, 2013 meeting:

It was decided to resolve issue 1344 separately from this issue, so this issue now requires its own resolution.

#### 1341. Bit-field initializers

Section: 9.2 [class.mem] Status: drafting Submitter: James Widman Date: 2011-08-10

The grammar for member-declarator (9.2 [class.mem]) does not, but should, allow for a brace-or-equal-initializer on a bit-field declarator.

#### 1803. opaque-enum-declaration as member-declaration

Section: 9.2 [class.mem] Status: drafting Submitter: Peter Sommerlad Date: 2013-10-31

According to 9.2 [class.mem] paragraph 1,

> A member shall not be declared twice in the member-specification, except that a nested class or member class template can be declared and then later defined, and except that an enumeration can be introduced with an opaque-enum-declaration and later redeclared with an enum-specifier.

However, the grammar for member-declaration does not have a production that allows an opaque-enum-declaration.

#### 1890. Member type depending on definition of member function

Section: 9.2 [class.mem] Status: drafting Submitter: Hubert Tong Date: 2014-03-07

Consider an example like:

      struct A {
        struct B {
          auto foo() { return 0; }
        };
        decltype(B().foo()) x;
      };

There does not appear to be a prohibition of cases like this, where the type of a member depends on the definition of a member function.

(See also issues 1360 and 1397.)

#### 1983. Inappropriate use of virt-specifier

Section: 9.2 [class.mem] Status: drafting Submitter: Richard Smith Date: 2014-08-11

The restriction in 9.2 [class.mem] paragraph 8 that a virt-specifier may appear only in the declaration of a virtual function is insufficient to rule out examples like the following:

      struct A { virtual void f(); };
      struct B { friend void A::f() final; };

      template<typename T> struct C { virtual void f() {} };
      template void C<int>::f() final;
      template<> void C<char>::f() final;

One possibility might be to require that a virt-specifier appear only on the first declaration of a function.

#### 1283. Static data members of classes with typedef name for linkage purposes

Section: 9.4.2 [class.static.data] Status: drafting Submitter: Mike Miller Date: 2011-03-29

According to 9.4.2 [class.static.data] paragraph 4,

> Unnamed classes and classes contained directly or indirectly within unnamed classes shall not contain static data members.

There is no such restriction on member functions, and there is no rationale for this difference, given that both static data members and member functions can be defined outside a unnamed class with a typedef name for linkage purposes. (Issue 406 acknowledged the lack of rationale by removing the specious note in 9.4.2 [class.static.data] that attempted to explain the restriction but left the normative prohibition in place.)

It would be more consistent to remove the restriction for classes with a typedef name for linkage purposes.

Additional note (August, 2012):

It was observed that, since no definition of a `const` static data member is required if it is not odr-used, there is no reason to prohibit such members in an unnamed class even without a typedef name for linkage purposes.

#### 1721. Diagnosing ODR violations for static data members

Section: 9.4.2 [class.static.data] Status: drafting Submitter: Mike Miller Date: 2013-07-31

Describing the handling of static data members with brace-or-equal-initializers, 9.4.2 [class.static.data] paragraph 3 says,

> The member shall still be defined in a namespace scope if it is odr-used (3.2 [basic.def.odr]) in the program and the namespace scope definition shall not contain an initializer.

The word “shall” implies a required diagnostic, but this is describing an ODR violation (the static data member might be defined in a different translation unit) and thus should be “no diagnostic required.”

#### 1404. Object reallocation in unions

Section: 9.5 [class.union] Status: drafting Submitter: Nikolay Ivchenkov Date: 2011-10-19

According to 9.5 [class.union] paragraph 4,

> [Note: In general, one must use explicit destructor calls and placement new operators to change the active member of a union. —end note] [Example: Consider an object `u` of a union type `U` having non-static data members `m` of type `M` and `n` of type `N`. If `M` has a non-trivial destructor and `N` has a non-trivial constructor (for instance, if they declare or inherit virtual functions), the active member of `u` can be safely switched from `m` to `n` using the destructor and placement new operator as follows:

>       u.m.~M();
>       new (&u.n)  N;

> —end example]

This pattern is only “safe” if the original object that is being destroyed does not involve any const-qualified or reference types, i.e., satisfies the requirements of 3.8 [basic.life] paragraph 7, bullet 3:

- the type of the original object is not const-qualified, and, if a class type, does not contain any non-static data member whose type is const-qualified or a reference type

Although paragraph 4 of 9.5 [class.union] is a note and an example, it should at least refer to the lifetime issues described in 3.8 [basic.life].

Additional note (October, 2013):

See also issue 1776, which suggests possibly changing the restriction in 3.8 [basic.life]. If such a change is made, this issue may become moot.

#### 1702. Rephrasing the definition of “anonymous union”

Section: 9.5 [class.union] Status: drafting Submitter: Richard Smith Date: 2013-06-17

9.5 [class.union] paragraph 5 defines an anonymous union as follows:

> A union of the form

> `union {` member-specification `} ;`

> is called an anonymous union; it defines an unnamed object of unnamed type.

It is obviously intended that a declaration like

        static union { int i; float f; };

is a declaration of that form (cf paragraph 6, which requires the `static` keyword for anonymous unions declared in namespace scope). However, it would be clearer if the definition were recast in more descriptive terms, e.g.,

> An anonymous union is an unnamed class that is defined with the class-key `union` in a simple-declaration in which the init-declarator-list is omitted. Such a simple-declaration is treated as if it contained a single declarator declaring an unnamed variable of the union's type.

(Note that this definition would require some additional tweaking to apply to class member anonymous union declarations, since simple-declarations are not included as member-declarations.)

As a related point, it is not clear how the following examples are to be treated, and there is implementation variance on some:

       void f() { thread_local union { int a; }; }
       void g() { extern union { int b; }; }
       thread_local union { int c; }; // static is implied by thread_local
       static thread_local union { int d; };
       static const union { int e = 0; }; // is e const? Clang says yes, gcc says no
       static constexpr union { int f = 0; };

#### 1801. Kind of expression referring to member of anonymous union

Section: 9.5 [class.union] Status: drafting Submitter: David Majnemer Date: 2013-10-24

It is not clear whether naming a member of a global anonymous union should be considered an id-expression or implicitly a member access expression. For example, given

      static union {
        int i;
      };

      template <int &> struct S {};
      S<i> V;

is the last line well-formed? There is implementation variance on this question.

Notes from the February, 2014 meeting:

CWG agreed that the example should be ill-formed.

#### 1860. What is a “direct member?”

Section: 9.5 [class.union] Status: drafting Submitter: Dawn Perchik Date: 2014-02-13

The term “direct member” is used in 9.5 [class.union] paragraph 8 but is not defined. It might be better to refer to the class's member-specification instead.

#### 1861. Values of a bit-field

Section: 9.6 [class.bit] Status: drafting Submitter: Hubert Tong Date: 2014-02-13

The resolution of issue 1816 left many aspects of bit-fields unspecified, including whether a signed bit field has a sign bit and the meaning of the bit-field width. Also, the requirement in 3.9.1 [basic.fundamental] paragraph 1 that

> For narrow character types, all bits of the object representation participate in the value representation.

should not apply to oversize character-typed bit-fields.

Notes from the June, 2014 meeting:

CWG decided to address only the issue of oversized bit-fields of narrow character types at this time, splitting off the more general questions regarding bit-fields to issue 1943.

#### 952. Insufficient description of “naming class”

Section: 11.2 [class.access.base] Status: drafting Submitter: James Widman Date: 7 August, 2009

The access rules in 11.2 [class.access.base] do not appear to handle references in nested classes and outside of nonstatic member functions correctly. For example,

        struct A {
            typedef int I;    // public
        };
        struct B: private A { };
        struct C: B {
            void f() {
                I i1;         // error: access violation
            }
            I i2;             // OK
            struct D {
                I i3;         // OK
                void g() {
                    I i4;     // OK
                }
            };
        };

The reason for this discrepancy is that the naming class in the reference to `I` is different in these cases. According to 11.2 [class.access.base] paragraph 5,

> The access to a member is affected by the class in which the member is named. This naming class is the class in which the member name was looked up and found.

In the case of `i1`, the reference to `I` is subject to the transformation described in 9.3.1 [class.mfct.non-static] paragraph 3:

> Similarly during name lookup, when an unqualified-id (5.1 [expr.prim]) used in the definition of a member function for class `X` resolves to a `static` member, an enumerator or a nested type of class `X` or of a base class of `X`, the unqualified-id is transformed into a qualified-id (5.1 [expr.prim]) in which the nested-name-specifier names the class of the member function.

As a result, the reference to `I` in the declaration of `i1` is transformed to `C::I`, so that the naming class is `C`, and `I` is inacessible in `C`. In the remaining cases, however, the transformation does not apply. Thus, the naming class of `I` in these references is `A`, and `I` is publicly accessible in `A`.

Presumably either the definition of “naming class” must be changed or the transformation of unqualified-ids must be broadened to include all uses within the scope of a class and not just within nonstatic member functions (and following the declarator-id in the definition of a static member, per 9.4 [class.static] paragraph 4).

#### 1699. Does befriending a class befriend its friends?

Section: 11.3 [class.friend] Status: drafting Submitter: David Krauss Date: 2013-06-12

According to 11.3 [class.friend] paragraph 2,

> Declaring a class to be a friend implies that the names of private and protected members from the class granting friendship can be accessed in the base-specifiers and member declarations of the befriended class.

A `friend` declaration is a member-declaration, but it is not clear how far the granting of friendship goes in a `friend` declaration. For example:

      class c {
        class n {};
        friend struct s;
      };

      struct s {
        friend class c::n;          // #1
        friend c::n g();            // #2
        friend void f() { c::n(); } // #3
      };

In particular, if a friend function is defined inside the class definition, as in #3, does its definition have access to the private and protected members of the befriending class? Implementations vary on this point.

#### 472. Casting across protected inheritance

Section: 11.4 [class.protected] Status: drafting Submitter: Mike Miller Date: 16 Jun 2004

Does the restriction in 11.4 [class.protected] apply to upcasts across protected inheritance, too? For instance,

        struct B {
            int i;
        };
        struct I: protected B { };
        struct D: I {
            void f(I* ip) {
                B* bp = ip;    // well-formed?
                bp->i = 5;     // aka "ip->i = 5;"
            }
        };

I think the rationale for the 11.4 [class.protected] restriction applies equally well here — you don't know whether `ip` points to a `D` object or not, so `D::f` can't be trusted to treat the protected `B` subobject consistently with the policies of its actual complete object type.

The current treatment of “accessible base class” in 11.2 [class.access.base] paragraph 4 clearly makes the conversion from `I*` to `B*` well-formed. I think that's wrong and needs to be fixed. The rationale for the accessibility of a base class is whether “an invented public member” of the base would be accessible at the point of reference, although we obscured that a bit in the reformulation; it seems to me that the invented member ought to be considered a non-static member for this purpose and thus subject to 11.4 [class.protected].

(See also issues 385 and 471.).

Notes from October 2004 meeting:

The CWG tentatively agreed that casting across protective inheritance should be subject to the additional restriction in 11.4 [class.protected].

Proposed resolution (April, 2011)

Change 11.2 [class.access.base] paragraph 4 as follows:

> A base class `B` of `N` is accessible at R, if

> - an invented public member of `B` would be a public member of `N`, or

> - R occurs in a member or friend of class `N`, and an invented public member of `B` would be a private or protected member of `N`, or

> - R occurs in a member or friend of a class `P` derived from `N`, and an invented public member of `B` would be a private or (but not a protected [Footnote: A protected invented member is disallowed here for the same reason the additional check of 11.4 [class.protected] is applied to member access: it would allow casting a pointer to a derived class to a protected base class that might be a subobject of an object of a class that is different from the class context in which the reference occurs. —end footnote]) member of `P`, or

> - there exists a class `S` such that `B` is a base class of `S` accessible at R and `S` is a base class of `N` accessible at R.

> [Example:

>         class B {
>         public:
>           int m;
>         };

>         class S: private B {
>           friend class N;
>         };
>         class N: private S {
>           void f() {
>             B* p = this;    // OK because class S satisfies the fourth condition
>                             // above: B is a base class of N accessible in f() because
>                             // B is an accessible base class of S and S is an accessible
>                             // base class of N.
>           }
>         };

>         class N2: protected B { };

>         class P2: public N2 {
>           void f2(N2* n2p) {
>             B* bp = n2p;    // error: invented member would be protected and naming
>                             // class N2 not the same as or derived from the referencing
>                             // class P2
>             n2p->m = 0;     // error (cf 11.4 [class.protected]) for the same reason
>           }
>         };

> —end example]

#### 1883. Protected access to constructors in mem-initializers

Section: 11.4 [class.protected] Status: drafting Submitter: Daveed Vandevoorde Date: 2014-02-26

According to 11.4 [class.protected] paragraph 1, except when forming a pointer to member,

> All other accesses involve a (possibly implicit) object expression (5.2.5 [expr.ref]).

It is not clear that this is strictly true for the invocation of a base class constructor from a mem-initializer. A wording tweak may be advisable.

#### 1353. Array and variant members and deleted special member functions

Section: 12.1 [class.ctor] Status: drafting Submitter: Sean Hunt Date: 2011-08-16

The specification of when a defaulted special member function is to be defined as deleted sometimes overlooks variant and array members.

#### 1360. `constexpr` defaulted default constructors

Section: 12.1 [class.ctor] Status: drafting Submitter: Richard Smith Date: 2011-08-16

According to 12.1 [class.ctor] paragraph 6, a defaulted default constructor is `constexpr` if the corresponding user-written constructor would satisfy the `constexpr` requirements. However, the requirements apply to the definition of a constructor, and a defaulted constructor is defined only if it is odr-used, leaving it indeterminate at declaration time whether the defaulted constructor is `constexpr` or not.

(See also issue 1358.)

Additional notes (February, 2013):

As an example of this issue, consider:

      struct S {
        int i = sizeof(S);
      };

You can't determine the value of the initializer, and thus whether the initializer is a constant expression, until the class is complete, but you can't complete the class without declaring the default constructor, and whether that constructor is `constexpr` or not depends on whether the member initializer is a constant expression.

A similar issue arises with the following example:

      struct A {
        int x = 37;
        struct B { int x = 37; } b;
        B b2[2][3] = { { } };
      };

This introduces an order dependency that is not specified in the current text: determining whether the default constructor of `A` is `constexpr` requires first determining the characteristics of the initializer of `B::x` and whether `B::B()` is `constexpr` or not.

The problem is exacerbated with class templates, since the current direction of CWG is to instantiate member initializers only when they are needed (see issue 1396). For a specific example:

      struct S;
      template<class T> struct X {
        int i = T().i;
      };
      unsigned n = sizeof(X<S>); // Error?
      struct S { int i; };

This also affects determining whether a class template specialization is a literal type or not; presumably getting the right answer to that requires instantiating the class and all its nonstatic data member initializers.

See also issues 1397 and 1594.

Notes from the September, 2013 meeting:

This issue should be resolved together with issue 1397.

Proposed resolution (May, 2014):

Change 12.1 [class.ctor] paragraphs 4-5 as follows:

> A defaulted default constructor for class `X` is defined as deleted if:

> - ...

> - any potentially constructed subobject has a type with a destructor that is deleted or inaccessible from the defaulted default constructor.

> An implicitly-declared default constructor is `constexpr` if:

> - `X` has no virtual bases; and

> - for each non-variant non-static data member or base class subobject `M`, either `M` is initialized via brace-or-equal-initializer or default-initialization of `M` uses a `constexpr` constructor; and

> - if `X` is a union having variant members, or, if `X` is a non-union-class, for each anonymous union member having variant members, exactly one non-static data member is initialized via brace-or-equal-initializer.

> A default constructor is trivial if it is not user-provided and if:

> - ...

> - for all the non-static data members of its class that are of class type (or array thereof), each such class has a trivial default constructor.

> Otherwise, the default constructor is non-trivial.

> A default constructor that is defaulted and not defined as deleted is implicitly defined when it is odr-used (3.2 [basic.def.odr]) to create an object of its class type (1.8 [intro.object]) or when it is explicitly defaulted after its first declaration. The implicitly-defined default constructor performs the set of initializations of the class that would be performed by a user-written default constructor for that class with no ctor-initializer (12.6.2 [class.base.init]) and an empty compound-statement. If that user-written default constructor would be ill-formed, the program is ill-formed. If that user-written default constructor would satisfy the requirements of a `constexpr` constructor (7.1.5 [dcl.constexpr]), the implicitly-defined default constructor is `constexpr`. Before the defaulted default constructor for a class is implicitly defined, all the non-user-provided default constructors for its base classes and its non-static data members shall have been implicitly defined. [Note:...

Additional notes, May, 2014:

The proposed resolution inadvertently allows a defaulted default constructor of a class with virtual bases to be `constexpr`. It has been updated with a change addressing that oversight and returned to "review" status.

See also issue 1890.

#### 1623. Deleted default union constructor and member initializers

Section: 12.1 [class.ctor] Status: drafting Submitter: Vinny Romano Date: 2013-02-15

According to 12.1 [class.ctor] paragraph 5,

> A defaulted default constructor for class `X` is defined as deleted if:

> - `X` is a union-like class that has a variant member with a non-trivial default constructor,

> - ...

> - `X` is a union and all of its variant members are of const-qualified type (or array thereof),

> - `X` is a non-union class and all members of any anonymous union member are of const-qualified type (or array thereof),

> - ...

Because the presence of a non-static data member initializer is the moral equivalent of a mem-initializer, these rules should probably be modified not to define the generated constructor as deleted when a union member has a non-static data member initializer. (Note the non-normative references in 9.5 [class.union] paragraphs 2-3 and 7.1.6.1 [dcl.type.cv] paragraph 2 that would also need to be updated if this restriction is changed.)

It would also be helpful to add a requirement to 9.5 [class.union] requiring either a non-static data member initializer or a user-provided constructor if all the members of the union have const-qualified types.

On a more general note, why is the default constructor defined as deleted just because a member has a non-trivial default constructor? The union itself doesn't know which member is the active one, and default construction won't initialize any members (assuming no brace-or-equal-initializer). It is up to the “owner” of the union to control the lifetime of the active member (if any), and requiring a user-provided constructor is forcing a design pattern that doesn't make sense. Along the same lines, why is the default destructor defined as deleted just because a member has a non-trivial destructor? I would agree with this restriction if it only applied when the union also has a user-provided constructor.

See also issues 1460, 1562, 1587, and 1621.

#### 1299. “Temporary objects” vs “temporary expressions”

Section: 12.2 [class.temporary] Status: drafting Submitter: Johannes Schaub Date: 2011-04-16

The Standard is insufficiently precise in dealing with temporaries. It is not always clear when the term “temporary” is referring to an expression whose result is a prvalue and when it is referring to a temporary object.

(See also issue 1568.)

Proposed resolution (February, 2014):

The resolution is contained in document N3918.

This resolution also resolves issues 1651 and 1893.

Additional note, November, 2014:

Concerns have been raised that the meaning of “corresponding temporary object” is not clear enough in the proposed wording. In addition, N3918 says that it resolves issue 1300, but that issue is 1) marked as a duplicate of issue 914 and 2) the subject of continuing deliberations in EWG. This issue is being returned to "review" status to allow CWG to address these concerns.

#### 1651. Lifetime extension of temporary via reference to subobject

Section: 12.2 [class.temporary] Status: drafting Submitter: Richard Smith Date: 2013-04-15

The resolution of issues 616 and 1213, making the result of a member access or subscript expression applied to a prvalue an xvalue, means that binding a reference to such a subobject of a temporary does not extend the temporary's lifetime. 12.2 [class.temporary] should be revised to ensure that it does.

Proposed resolution (February, 2014):

This issue is resolved by the resolution of issue 1299.

#### 1697. Lifetime extension and copy elision

Section: 12.2 [class.temporary] Status: drafting Submitter: Richard Smith Date: 2013-06-01

In an example like,

      struct S { ~S(); };
      struct X { X(); X(const X&); };
      struct T { S &&s; X x; };
      void f();
      void g() { T t = T{ {}, {} }; f(); }

it appears that the current wording allows two ways of handling this:

1. The copy to `t` in `g` is not elided. `X(const X&)` is called, then `~S()` is called, then `f()` is called.

2. The copy to `t` in `g` is elided, so the temporary and `t` are the same object. Thus, the `S` object's lifetime is extended to the lifetime of the reference `t.s`, so first `f()` is called, then `~S()` is called (and `X(const X&)` is not called).

However, EDG and g++ produce a third behavior: they do not call `X(const X&)`, but they destroy the `S()` temporary at the end of its full-expression. The current wording does not appear to permit this behavior, but it seems preferable that lifetime extension does not depend on whether copy elision is done.

#### 1726. Declarator operators and conversion function

Section: 12.3.2 [class.conv.fct] Status: drafting Submitter: James Widman Date: 2013-08-02

Presumably the following example is intended to be ill-formed:

      struct A {
        (*operator int*());
      };
      A a;
      int *x = a; // Ok?

It is not clear, however, which rule is supposed to reject such a member-declaration.

#### 2016. Confusing wording in description of conversion function

Section: 12.3.2 [class.conv.fct] Status: drafting Submitter: Daniel Krügler Date: 2014-10-05

The statement in 12.3.1 [class.conv.ctor] paragraph 1,

> No return type can be specified.

is confusing, since a conversion operator has a return type. It would be more precise to phrase the restriction in terms of the permissible decl-specifiers in the function's decl-specifier-seq. The next sentence is also problematic,

> If a conversion function is a member function, the type of the conversion function (8.3.5 [dcl.fct]) is “function taking no parameter returning conversion-type-id”.

as it implies that a conversion function might not be a member function.

#### 399. Destructor lookup redux

Section: 12.4 [class.dtor] Status: drafting Submitter: John Spicer Date: 17 Jan 2003

Mark Mitchell raised a number of issues related to the resolution of issue 244 and of destructor lookup in general.

Issue 244 says:

> ... in a qualified-id of the form:
> ::opt nested-name-specifieropt class-name :: ~ class-name
> the second class-name is looked up in the same scope as the first.

But if the reference is "`p->X::~X()`", the first class-name is looked up in two places (normal lookup and a lookup in the class of p). Does the new wording mean:

1. You look up the second class-name in the scope that you found the first one.
2. You look up the second class-name using the same kind of lookup that found the first one (normal vs. class).
3. If you did a dual lookup for the first you do a dual lookup for the second.

This is a test case that illustrates the issue:

      struct A {
        typedef A C;
      };

      typedef A B;

      void f(B* bp) {
        bp->B::~B();  // okay B found by normal lookup
        bp->C::~C();  // okay C found by class lookup
        bp->B::~C();  // B found by normal lookup C by class -- okay?
        bp->C::~B();  // C found by class lookup B by normal -- okay?
      }

A second issue concerns destructor references when the class involved is a template class.

      namespace N {
        template <typename T> struct S {
          ~S();
        };
      }

      void f(N::S<int>* s) {
        s->N::S<int>::~S();
      }

The issue here is that the grammar uses "~class-name" for destructor names, but in this case S is a template name when looked up in N.

Finally, what about cases like:

      template <typename T> void f () {
        typename T::B x;
        x.template A<T>::template B<T>::~B();
      }

When parsing the template definition, what checks can be done on "~B"?

Sandor Mathe adds :

The standard correction for issue 244 (now in DR status) is still incomplete.

Paragraph 5 of 3.4.3 [basic.lookup.qual] is not applicable for p->T::~T since there is no nested-name-specifier. Section 3.4.5 [basic.lookup.classref] describes the lookup of p->~T but p->T::~T is still not described. There are examples (which are non-normative) that illustrate this sort of lookup but they still leave questions unanswered. The examples imply that the name after ~ should be looked up in the same scope as the name before the :: but it is not stated. The problem is that the name to the left of the :: can be found in two different scopes. Consider the following:

      struct S {
        struct C { ~C() { } };
      };

      typedef S::C D;

      int main() {
        D* p;
        p->C::~D();  // valid?
      }

Should the destructor call be valid? If there were a nested name specifier, then D should be looked for in the same scope as C. But here, C is looked for in 2 different ways. First, it is searched for in the type of the left hand side of -> and it is also looked for in the lexical context. It is found in one or if both, they must match. So, C is found in the scope of what p points at. Do you only look for D there? If so, this is invalid. If not, you would then look for D in the context of the expression and find it. They refer to the same underlying destructor so this is valid. The intended resolution of the original defect report of the standard was that the name before the :: did not imply a scope and you did not look for D inside of C. However, it was not made clear whether this was to be resolved by using the same lookup mechanism or by introducing a new form of lookup which is to look in the left hand side if that is where C was found, or in the context of the expression if that is where C was found. Of course, this begs the question of what should happen when it is found in both? Consider the modification to the above case when C is also found in the context of the expression. If you only look where you found C, is this now valid because it is in 1 of the two scopes or is it invalid because C was in both and D is only in 1?

      struct S {
        struct C { ~C() { } };
      };

      typedef S::C D;
      typedef S::C C;

      int main() {
        D* p;
        p->C::~D();  // valid?
      }

I agree that the intention of the committee is that the original test case in this defect is broken. The standard committee clearly thinks that the last name before the last :: does not induce a new scope which is our current interpretation. However, how this is supposed to work is not defined. This needs clarification of the standard.

Martin Sebor adds this example (September 2003), along with errors produced by the EDG front end:

    namespace N {
        struct A { typedef A NA; };
        template <class T> struct B { typedef B NB; typedef T BT; };
        template <template <class> class T> struct C { typedef C NC; typedef T<A> CA; };
    }

    void foo (N::A *p)
    {
        p->~NA ();
        p->NA::~NA ();
    }

    template <class T>
    void foo (N::B<T> *p)
    {
        p->~NB ();
        p->NB::~NB ();
    }

    template <class T>
    void foo (typename N::B<T>::BT *p)
    {
        p->~BT ();
        p->BT::~BT ();
    }

    template <template <class> class T>
    void foo (N::C<T> *p)
    {
        p->~NC ();
        p->NC::~NC ();
    }

    template <template <class> class T>
    void foo (typename N::C<T>::CA *p)
    {
        p->~CA ();
        p->CA::~CA ();
    }

    Edison Design Group C/C++ Front End, version 3.3 (Sep  3 2003 11:54:55)
    Copyright 1988-2003 Edison Design Group, Inc.

    "t.cpp", line 16: error: invalid destructor name for type "N::B<T>"
          p->~NB ();
              ^

    "t.cpp", line 17: error: qualifier of destructor name "N::B<T>::NB" does not
              match type "N::B<T>"
          p->NB::~NB ();
                  ^

    "t.cpp", line 30: error: invalid destructor name for type "N::C<T>"
          p->~NC ();
              ^

    "t.cpp", line 31: error: qualifier of destructor name "N::C<T>::NC" does not
              match type "N::C<T>"
          p->NC::~NC ();
                  ^

    4 errors detected in the compilation of "t.cpp".

John Spicer: The issue here is that we're unhappy with the destructor names when doing semantic analysis of the template definitions (not during an instantiation).

My personal feeling is that this is reasonable. After all, why would you call p->~NB for a class that you just named as N::B<T> and you could just say p->~B?

Additional note (September, 2004)

The resolution for issue 244 removed the discussion of `p->N::~S`, where `N` is a namespace-name. However, the resolution did not make this construct ill-formed; it simply left the semantics undefined. The meaning should either be defined or the construct made ill-formed.

See also issues 305 and 466.

Additional note, November, 2014:

Here are some additional examples that should be addressed by the resolution of this issue:

       namespace N {
         template<typename T> struct E {};
         typedef E<int> F;
       }
       namespace M {
         typedef N::F H;
       }
       void g(N::F f) {
         typedef N::F G;
         f.G::~E(); // #1
         f.G::~F(); // #2
         f.G::~G(); // #3
         f.N::F::~E(); // #4
         f.N::F::~F(); // #5
         f.N::F::~G(); // #6
         f.M::H::~E(); // #7
         f.M::H::~F(); // #8
         f.M::H::~G(); // #9
         f.M::H::~H(); // #10
       }

#### 1977. Contradictory results of failed destructor lookup

Section: 12.4 [class.dtor] Status: drafting Submitter: Gabriel Dos Reis Date: 2014-07-21

According to 12.4 [class.dtor] paragraph 12,

> At the point of definition of a virtual destructor (including an implicit definition (12.8 [class.copy])), the non-array deallocation function is looked up in the scope of the destructor's class (10.2 [class.member.lookup]), and, if no declaration is found, the function is looked up in the global scope. If the result of this lookup is ambiguous or inaccessible, or if the lookup selects a placement deallocation function or a function with a deleted definition (8.4 [dcl.fct.def]), the program is ill-formed. [Note: This assures that a deallocation function corresponding to the dynamic type of an object is available for the delete-expression (12.5 [class.free]). —end note]

However, bullet 5.3 of that section says that such a lookup failure causes the destructor to be defined as deleted, rather than making the program ill-formed. It appears that paragraph 12 was overlooked when deleted functions were added to the language. See also 12.5 [class.free] paragraph 7.

#### 255. Placement deallocation functions and lookup ambiguity

Section: 12.5 [class.free] Status: drafting Submitter: Mike Miller Date: 26 Oct 2000

Paragraph 4 of 12.5 [class.free] speaks of looking up a deallocation function. While it is an error if a placement deallocation function alone is found by this lookup, there seems to be an assumption that a placement deallocation function and a usual deallocation function can both be declared in a given class scope without creating an ambiguity. The normal mechanism by which ambiguity is avoided when functions of the same name are declared in the same scope is overload resolution; however, there is no mention of overload resolution in the description of the lookup. In fact, there appears to be nothing in the current wording that handles this case. That is, the following example appears to be ill-formed, according to the current wording:

        struct S {
            void operator delete(void*);
            void operator delete(void*, int);
        };
        void f(S* p) {
            delete p;    // ill-formed: ambiguous operator delete
        }

Suggested resolution (Mike Miller, March 2002):

I think you might get the right effect by replacing the last sentence of 12.5 [class.free] paragraph 4 with something like:

> After removing all placement deallocation functions, the result of the lookup shall contain an unambiguous and accessible deallocation function.

Additional notes (October, 2012):

This issue should be reconsidered in list of paper N3396, as it would add additional overloads for allocation and deallocation functions.

The term “usual deallocation function” is defined in 3.7.4.2 [basic.stc.dynamic.deallocation] paragraph 2; perhaps it could be used to good effect in 5.3.5 [expr.delete] paragraph 7. The specifications in 12.5 [class.free] paragraphs 4 and 5 should probably also be moved into 5.3.5 [expr.delete].

#### 1621. Member initializers in anonymous unions

Section: 12.6.2 [class.base.init] Status: drafting Submitter: Daveed Vandevoorde Date: 2013-02-12

The effect of a non-static data member initializer in an anonymous union is not clearly described in the current wording. Consider the following example:

      struct A {
        struct B {
          union {
            int x = 37;
          };
          union {
            int y = x + 47;  // Well-formed?
          };
        } a;
      };

Does an anonymous union have a constructor that applies a non-static data member initializer? Or is the initialization performed by the constructor of the class in which the anonymous union appears? In particular, is the reference to `x` in the initializer for `y` well-formed or not? If the initialization of `y` is performed by `B`'s constructor, there is no problem because `B::x` is a member of the object being initialized. If an anonymous union has its own constructor, `B::x` is just a member of the containing class and is a reference to a non-static data member without an object, which is ill-formed. Implementations currently appear to take the latter interpretation and report an error for that initializer.

As a further example, consider:

      union {       // #1
        union {     // #2
          union {   // #3
            int y = 32;
          };
        };
      } a { } ;

One interpretation might be that union #3 has a non-trivial default constructor because of the initializer of `y`, which would give union #2 a deleted default constructor, which would make the example ill-formed.

As yet another example, consider:

      union {
        union {
          int x;
        };
        union {
          int y = 3;
        };
        union {
          int z;
        };
      } a { };

Assuming the current proposed resolution of issue 1502, what is the correct interpretation of this code? Is it well-formed, and if so, what initialization is performed?

Finally, consider

      struct S {
        union { int x = 1; };
        union { int y = 2; };
      } s{};

Does this violate the prohibition of aggregates containing member initializers in 8.5.1 [dcl.init.aggr] paragraph 1?

See also issues 1460, 1562, 1587, and 1623.

#### 1517. Unclear/missing description of behavior during construction/destruction

Section: 12.7 [class.cdtor] Status: drafting Submitter: Daniel Krügler Date: 2012-07-07

The current wording of 12.7 [class.cdtor] paragraph 4 does not describe the behavior of calling a virtual function in a mem-initializer for a base class, only for a non-static data member. Also, the changes for issue 1202 should have been, but were not, applied to the description of the behavior of `typeid` and `dynamic_cast` in paragraphs 5 and 6.

In addition, the resolution of issue 597 allowing the out-of-lifetime conversion of pointers/lvalues to non-virtual base classes, should have been, but were not, applied to paragraph 3.

Proposed resolution (August, 2013):

1. Change 12.7 [class.cdtor] paragraph 1 as follows:

> For an object with a non-trivial constructor, referring to any non-static member or virtual base class of the object before the constructor begins execution results in undefined behavior. For an object with a non-trivial destructor, referring to any non-static member or virtual base class of the object after the destructor finishes execution results in undefined behavior. [Example:

>       struct X { int i; };
>       struct Y : X { Y(); };                       // non-trivial
>       struct A { int a; };
>       struct B : public virtual A { int j; Y y; }; // non-trivial

>       extern B bobj;
>       B* pb = &bobj;                               // OK
>       int* p1 = &bobj.a;                           // undefined, refers to base class member
>       int* p2 = &bobj.y.i;                         // undefined, refers to member's member

>       A* pa = &bobj;                               // undefined, upcast to a virtual base class type
>       B bobj;                                      // definition of bobj

>       extern X xobj;
>       int* p3 = &xobj.i;                           //OK, X is a trivial class
>       X xobj;

2. Change 12.7 [class.cdtor] paragraphs 3-6 as follows:

> To explicitly or implicitly convert a pointer (a glvalue) referring to an object of class `X` to a pointer (reference) to a direct or indirect virtual base class `B` of `X`, the construction of `X` and the construction of all of its direct or indirect bases that directly or indirectly derive from for which `B` is a direct or indirect virtual base shall have started and the destruction of these classes shall not have completed, otherwise the conversion results in undefined behavior. To form a pointer to (or access the value of) a direct non-static member...

> Member functions, including virtual functions (10.3 [class.virtual]), can be called during construction or destruction (12.6.2 [class.base.init]). When a virtual function is called directly or indirectly from a constructor or from a destructor, including during the construction or destruction of the class's non-static data members, and the object to which the call applies is the object (call it `x`) under construction or destruction, the function called is the final overrider in the constructor's or destructor's class and not one overriding it in a more-derived class. If the virtual function call uses an explicit class member access (5.2.5 [expr.ref]) and the object expression refers to the complete object of x or one of that object's base class subobjects but not to `x` or one of its base class subobjects, the behavior is undefined. The period of construction of an object or subobject whose type is a class type `C` begins immediately after the construction of all its base class subobjects is complete and concludes when the last constructor of class `C` exits. The period of destruction of an object or subobject whose type is a class type `C` begins when the destructor for `C` begins execution and concludes immediately before beginning the destruction of its base class subobjects. A polymorphic operation is a virtual function call (5.2.2 [expr.call]), the `typeid` operator (5.2.8 [expr.typeid]) when applied to a glvalue of polymorphic type, or the `dynamic_cast` operator (5.2.7 [expr.dynamic.cast]) when applied to a pointer to or glvalue of a polymorphic type. A polymorphic operand is the object expression in a virtual function call or the operand of a polymorphic `typeid` or `dynamic_cast`.

> During the period of construction or period of destruction of an object or subobject whose type is a class type `C` (call it `x`), the effect of performing a polymorphic operation in which the polymorphic operand designates `x` or a base class subobject thereof is as if the dynamic type of the object were class `C`. [Footnote: This is true even if `C` is an abstract class, which cannot be the type of a most-derived object. —end footnote] If a polymorphic operand refers to an object or subobject having class type `C` before its period of construction begins or after its period of destruction is complete, the behavior is undefined. [Note: This includes the evaluation of an expression appearing in a mem-initializer of `C` in which the mem-initializer-id designates `C` or one of its base classes. —end note] [Example:

>       struct V {
>         V();
>         V(int);
>         virtual void f();
>         virtual void g();
>       };

>       struct A : virtual V {
>         virtual void f();
>         virtual int h();
>         A() : V(h()) { }     // undefined behavior: virtual function h called
>                              // before A's period of construction begins
>       };

>       struct B : virtual V {
>         virtual void g();
>         B(V*, A*);
>       };

>       struct D : A, B {
>         virtual void f();
>         virtual void g();
>         D() : B((A*)this, this) { }
>       };

>       B::B(V* v, A* a) {
>         f();                 // calls V::f, not A::f
>         g();                 // calls B::g, not D::g
>         v->g();              // v is base of B, the call is well-defined, calls B::g
>         a->f();              // undefined behavior, a's type not a base of B
>         typeid(*this);       // type_info for B
>         typeid(*v);          // well-defined: *v has type V, a base of B,
>                              // so its period of construction is complete;
>                              // yields type_info for B
>         typeid(*a);          // undefined behavior: A is not a base of B,
>                              // so its period of construction has not begun
>         dynamic_cast<B*>(v); // well-defined: v has type V*, V is a base of B,
>                              // so its period of construction is complete;
>                              // results in this
>         dynamic_cast<B*>(a); // undefined behavior: A is not a base of B,
>                              // so its period of construction has not begun
>       }

> —end example]

> The `typeid` operator (5.2.8 [expr.typeid]) can be used during construction or destruction (12.6.2 [class.base.init]). When `typeid` is used in a constructor (including the mem-initializer or brace-or-equal-initializer for a non-static data member) or in a destructor, or used in a function called (directly or indirectly) from a constructor or destructor, if the operand of `typeid` refers to the object under construction or destruction, `typeid` yields the `std::type_info` object representing the constructor or destructor's class. If the operand of `typeid` refers to the object under construction or destruction and the static type of the operand is neither the constructor or destructor's class nor one of its bases, the result of `typeid` is undefined.

> `dynamic_cast`s (5.2.7 [expr.dynamic.cast]) can be used during construction or destruction (12.6.2 [class.base.init]). When a `dynamic_cast` is used in a constructor (including the mem-initializer or brace-or-equal-initializer for a non-static data member) or in a destructor, or used in a function called (directly or indirectly) from a constructor or destructor, if the operand of the `dynamic_cast` refers to the object under construction or destruction, this object is considered to be a most derived object that has the type of the constructor or destructor's class. If the operand of the `dynamic_cast` refers to the object under construction or destruction and the static type of the operand is not a pointer to or object of the constructor or destructor's own class or one of its bases, the `dynamic_cast` results in undefined behavior. [Example:

>       struct V {
>         virtual void f();
>       };

>       struct A : virtual V { };

>       struct B : virtual V {
>         B(V*, A*);
>       };

>       struct D : A, B {
>         D() : B((A*)this, this) { }
>       };

>       B::B(V* v, A* a) {
>         typeid(*this);       // type_info for B
>         typeid(*v);          // well-defined: *v has type V, a base of B
>                              // yields type_info for B
>         typeid(*a);          // undefined behavior: type A not a base of B
>         dynamic_cast<B*>(v); // well-defined: v of type V*, V base of B
>                              // results in B*
>         dynamic_cast<B*>(a); // undefined behavior,
>                              // a has type A*, A not a base of B

> —end example]

#### 1092. Cycles in overload resolution during instantiation

Section: 12.8 [class.copy] Status: drafting Submitter: Jason Merrill Date: 2010-07-15

Moving to always doing overload resolution for determining exception specifications and implicit deletion creates some unfortunate cycles:

        template<typename T> struct A {
           T t;
        };

        template <typename T> struct B {
           typename T::U u;
        };

        template <typename T> struct C {
           C(const T&);
        };

        template <typename T> struct D {
           C<B<T> > v;
        };

        struct E {
           typedef A<D<E> > U;
        };

        extern A<D<E> > a;
        A<D<E> > a2(a);

If declaring the copy constructor for `A<D<E>>` is part of instantiating the class, then we need to do overload resolution on `D<E>`, and thus `C<B<E>>`. We consider `C(const B<E>&)`, and therefore look to see if there's a conversion from `C<B<E>>` to `B<E>`, which instantiates `B<E>`, which fails because it has a field of type `A<D<E>>` which is already being instantiated.

Even if we wait until `A<D<E>>` is considered complete before finalizing the copy constructor declaration, declaring the copy constructor for `B<E>` will want to look at the copy constructor for `A<D<E>>`, so we still have the cycle.

I think that to avoid this cycle we need to short-circuit consideration of `C(const T&)` somehow. But I don't see how we can do that without breaking

        struct F {
           F(F&);
        };

        struct G;
        struct G2 {
           G2(const G&);
        };

        struct G {
           G(G&&);
           G(const G2&);
        };

        struct H: F, G { };

        extern H h;
        H h2(h);

Here, since `G`'s move constructor suppresses the implicit copy constructor, the defaulted `H` copy constructor calls `G(const G2&)` instead. If the move constructor did not suppress the implicit copy constructor, I believe the implicit copy constructor would always be viable, and therefore a better match than a constructor taking a reference to another type.

So perhaps the answer is to reconsider that suppression and then disqualify any constructor taking (a reference to) a type other than the constructor's class from consideration when looking up a subobject constructor in an implicitly defined constructor. (Or assignment operator, presumably.)

Another possibility would be that when we're looking for a conversion from `C<B<E>>` to `B<E>` we could somehow avoid considering, or even declaring, the `B<E>` copy constructor. But that seems a bit dodgy.

Additional note (October, 2010):

An explicitly declared move constructor/op= should not suppress the implicitly declared copy constructor/op=; it should cause it to be deleted instead. This should prevent a member function taking a (reference to) an un-reference-related type from being chosen by overload resolution in a defaulted member function.

And we should clarify that member functions taking un-reference-related types are not even considered during overload resolution in a defaulted member function, to avoid requiring their parameter types to be complete.

#### 1499. Missing case for deleted move assignment operator

Section: 12.8 [class.copy] Status: drafting Submitter: John Spicer Date: 2012-04-27

Bullet 4 of 12.8 [class.copy] paragraph 23 says that a defaulted copy/move assignment operator is defined as deleted if the class has

> a non-static data member of class type `M` (or array thereof) that cannot be copied/moved because overload resolution (13.3 [over.match]), as applied to `M`'s corresponding assignment operator, results in an ambiguity or a function that is deleted or inaccessible from the defaulted assignment operator

The intent of this is that if overload resolution fails to find a corresponding copy/move assignment operator that can validly be called to copy/move a member, the class's assignment operator will be defined as deleted. However, this wording does not cover an example like the following:

      struct A {
        A();
      };

      struct B {
        B();
        const A a;
      };

      typedef B& (B::*pmf)(B&&);

      pmf p =&B::operator=;

Here, the problem is simply that overload resolution failed to find a callable function, which is not one of the cases listed in the current wording. A similar problem exists for base classes in the fifth bullet.

Additional note (January, 2013):

A similar omission exists in paragraph 11 for copy constructors.

#### 1548. Copy/move construction and conversion functions

Section: 12.8 [class.copy] Status: drafting Submitter: Nikolay Ivchenkov Date: 2012-09-02

The current wording of 12.8 [class.copy] paragraph 31 refers only to constructors and destructors:

> When certain criteria are met, an implementation is allowed to omit the copy/move construction of a class object, even if the constructor selected for the copy/move operation and/or the destructor for the object have side effects.

However, in some cases (e.g., `auto_ptr`) a conversion function is also involved in the copying, and it could presumably also have visible side effects that would be eliminated by copy elision. (Some additional contexts that may also require changes in this regard are mentioned in the resolution of issue 535.)

Additional note (September, 2012):

The default arguments of an elided constructor can also have side effects and should be mentioned, as well; however, the elision should not change the odr-use status of functions and variables appearing in those default arguments.

#### 1590. Bypassing non-copy/move constructor copying

Section: 12.8 [class.copy] Status: drafting Submitter: Richard Smith Date: 2012-11-26

Copy initialization in some cases uses constructors that are not copy/move constructors (e.g., a specialization of a constructor template might be selected by overload resolution, or in copy-list-initialization, any constructor could be selected). Some ABIs require that an object of certain class types be passed in a register (effectively using the trivial copy/move constructor), even if the class has a non-trivial constructor that would be selected to do the copy. The Standard should be changed to permit this usage.

Proposed resolution (April, 2013):

Add the following as a new paragraph following 12.8 [class.copy] paragraph 1:

> When an object of class type `X` is passed to or returned from a function, if `X` has a trivial, accessible copy or move constructor that is not deleted, and `X` has no non-trivial copy constructors, move constructors, or destructors, implementations are permitted to perform an additional copy or move of the object using the trivial constructor (even if it would not be selected by overload resolution to perform a copy or move of the object). [Note: This latitude is granted to allow objects of class type to be passed to or returned from functions in registers. —end note]

See also issue 1928.

Additional note, May, 2014:

Questions have been raised regarding this resolution. In particular, the interaction of the “extra copy” with copy elision, lifetime, and access checking context are not specified. In addition, some concern has also been expressed regarding the requirement that the trivial copy/move constructor be accessible. The issue is being returned to "review" status for discussion of these points.

Notes from the June, 2014 meeting:

CWG felt that the requirements for accessibility should be removed, in line with the idea making all access `opublic` in a program should not change its semantics. Similarly, the prohibition of non-trivial functions was not desirable. The approach should be to recognize the extra copy as a temporary object and deal explicitly with its lifetime.

#### 1594. Lazy declaration of special members vs overload errors

Section: 12.8 [class.copy] Status: drafting Submitter: Richard Smith Date: 2012-12-06

The implicit declaration of a special member function sometimes requires overload resolution, in order to select a special member to use for base classes and non-static data members. This can be required to determine whether the member is or would be deleted, and whether the member is trivial, for instance. The standard appears to require such overload resolution be performed at the end of the definition of the class, but in practice, implementations perform it lazily. This optimization appears to be non-conforming, in the case where overload resolution would hit an error. In order to enable this optimization, such errors should be “no diagnostic required.”

Additional note (March, 2013):

See also issue 1360.

Notes from the September, 2013 meeting:

The problem with this approach is that hard errors (not in the immediate context) can occur, affecting portability. There are some cases, such as a virtual assignment operator in the base class, where lazy evaluation cannot be done, so it cannot be mandated.

#### 1734. Nontrivial deleted copy functions

Section: 12.8 [class.copy] Status: drafting Submitter: James Widman Date: 2013-08-09

The intent was for PODs in C++11 to be a superset of C++03 PODs. Consequently, in the following example, `C` should be a POD but isn't:

      struct A {
        const int m;
        A& operator=(A const&) = default; // deleted and trivial, so A is a
                                          // POD, as it would be in 2003
                                          // without this explicit op= decl
      };
      static_assert(__is_trivially_copyable(A), "");

      struct B {
        int i;
        B& operator=(B &) & = default;      // non-trivial
        B& operator=(B const&) & = default; // trivial
      };

      struct C {
        const B m;
        C& operator=(C const& r) = default; // deleted (apparently), but non-trivial (apparently)
        /* Notionally:
          C& operator=(C const& r) {
            (*this).m.operator=(r.m);
            return *this;
          }
        */
      };
      static_assert(!__is_trivially_copyable(C), "");

This is because of the following text from 12.8 [class.copy] paragraph 25:

> for each non-static data member of `X` that is of class type (or array thereof), the assignment operator selected to copy/move that member is trivial;

In this case, overload resolution fails, so no assignment operator is selected, so `C::operator=(const C&)` is non-trivial.

(See also issue 1928.)

Additional note, November, 2014:

See paper N4148.

#### 1645. Identical inheriting constructors via default arguments

Section: 12.9 [class.inhctor] Status: drafting Submitter: Richard Smith Date: 2013-03-18

For an example like

      struct A {
        constexpr A(int, float = 0);
        explicit A(int, int = 0);
        A(int, int, int = 0) = delete;
      };

      struct B : A {
        using A::A;
      };

it is not clear from 12.9 [class.inhctor] what should happen: is `B::B(int)` `constexpr` and/or `explicit`? Is `B::B(int, int)` `explicit` and/or deleted? Although the rationale given in the note in paragraph 7,

> If two using-declarations declare inheriting constructors with the same signatures, the program is ill-formed (9.2 [class.mem], 13.1 [over.load]), because an implicitly-declared constructor introduced by the first using-declaration is not a user-declared constructor and thus does not preclude another declaration of a constructor with the same signature by a subsequent using-declaration.

might be thought to apply, paragraph 1 talks about a set of candidate constructors based on their parameter types, so presumably such a set would contain only a single declaration of `A::A(int)` and one for `A::A(int, int)`. The constructor characteristics of that declaration, however, are not specified.

One possibility might be to declare such a constructor, resulting from the transformation of more than one base class constrctor, to be deleted, so there would be an error only if it were used.

Notes from the April, 2013 meeting:

CWG agreed with the direction of defining such constructors as deleted.

Additional note, June, 2014:

See issue 1941 for an alternative approach to this problem.

#### 1715. Access and inherited constructor templates

Section: 12.9 [class.inhctor] Status: drafting Submitter: Daveed Vandevoorde Date: 2013-07-16

Consider the following example:

      template<class T> struct S {
      private:
        typedef int X;
        friend struct B;
      };

      struct B {
        template<class T> B(T, typename T::X);
      };

      struct D: B {
        using B::B;
      };

      S<int> s;
      B b(s, 2); // Okay, thanks to friendship.
      D d(s, 2); // Error: friendship is not inherited.

My understanding is that the construction of `d` fails because `typename T::X` expands to `S<int>::X` in this case, and that is not accessible from `D`.

However, I'm not sure that makes sense from a usability perspective. The user of `D` just wanted to be able to wrap class `B`, and the fact that friendship was granted to `B` to enable its constructor parameter seems like just an implementation detail that `D` shouldn't have to cope with.

Would it perhaps be better to suspend access checking during the instantiation of inheriting member function template declarations (not definitions), since real access problems (e.g., the selection of a private constructor) would presumably be revealed when doing the full instantiation?

Proposed resolution (February, 2014):

Change 12.9 [class.inhctor] paragraph 4 as follows:

> A constructor so declared has the same access as the corresponding constructor in `X`. It is deleted if the corresponding constructor in `X` is deleted (8.4 [dcl.fct.def] 8.4.3 [dcl.fct.def.delete]). While performing template argument substitution (14.8.2 [temp.deduct]) for constructor templates so declared, name lookup, overload resolution, and access checking are performed in the context of the corresponding constructor template of `X`. [Example:

>        struct B {
>          template<class T> B(T, typename T::Q);
>        };

>        class S {
>          using Q = int;
>          template<class T>
>          friend B::B(T, typename T::Q);
>        };

>        struct D : B {
>          using B::B;
>        };

>        B b(S(), 1); // OK: B::B is a friend of S
>        D d(S(), 2); // OK: access control is in the context of B::B

> —end example] An inheriting constructor shall not be explicitly instantiated (14.7.2 [temp.explicit]) or explicitly specialized (14.7.3 [temp.expl.spec]).

Additional note (June, 2014):

This issue is being returned to "review" status in light of a suggestion for an alternative approach to the problem; see issue 1941.

#### 1736. Inheriting constructor templates in a local class

Section: 12.9 [class.inhctor] Status: drafting Submitter: Daveed Vandevoorde Date: 2013-08-13

A local class cannot, according to 14.5.2 [temp.mem] paragraph 2, have member templates. Presumably, then, an example like the following is ill-formed:

      struct S {
        template<class T> S(T) {
          struct L: S {
            using S::S;
          };
        }
      };

It is accepted by current implementations, however. Does something need to be said about this case in 12.9 [class.inhctor], either to explicitly allow or forbid it, or is the restriction in 14.5.2 [temp.mem] sufficient?

#### 1941. SFINAE and inherited constructor default arguments

Section: 12.9 [class.inhctor] Status: drafting Submitter: David Krauss Date: 2014-06-12

Default arguments are a common mechanism for applying SFINAE to constructors. However, default arguments are not carried over when base class constructors are inherited; instead, an overload set of constructors with various numbers of arguments is created in the derived class. This seems problematic.

One possibility would be to change the mechanism for how constructors are inherited; a using-declaration might actually introduce the base class constructors into the derived class, as other using-declarations do, and if a base class constructor were selected, the remaining derived class members would be default-initialized.

This approach would also address issues 1645, as duplicated constructors would simply fail during overload resolution, and 1715, since there would be no synthesized constructors for which access checking would be needed.

The effect of such an approach on ABIs, including mangling, would need to be considered.

See also issue 1959.

#### 1959. Inadvertently inherited copy constructor

Section: 12.9 [class.inhctor] Status: drafting Submitter: David Krauss Date: 2014-06-30

Consider the following example:

      struct a {
        a() = default;
        a( a const & ) { std::cout << "copy\n"; }
        template< typename t >
        a( t ) { std::cout << "convert\n"; }
      };

      struct b : a {
        using a::a;
      };

      a x;
      b y = x;

The copy constructor is invoked by the inherited constructor template, making it effectively inherited, contrary to the intent of 12.9 [class.inhctor] paragraph 3. `std::function` is affected by this issue.

A kernel of a resolution might be to inherit the copy and move constructors as deleted. Then they will be more specialized than any template, and the user won't get conversion-from-base behavior unless they explicitly declare it. However, reference binding in overload resolution is a potential gap. Something like `b::b( a & ) = delete` with a non-const parameter would not add safety if it's not chosen.

See also issue 1941.

#### 1252. Overloading member function templates based on dependent return type

Section: 13.1 [over.load] Status: drafting Submitter: Nikolay Ivchenkov Date: 2011-03-06

The Standard does not allow overloading of member functions that differ only in their return type (cf `enable_if`).

#### 1898. Use of “equivalent” in overload resolution

Section: 13.2 [over.dcl] Status: drafting Submitter: Hubert Tong Date: 2014-03-21

The normative text of 13.2 [over.dcl] relies on the term “equivalent,” for which it refers to 13.1 [over.load], but the term appears there only in non-normative text. The resolution of this issue should be coordinated with that of issue 1668.

#### 1278. Incorrect treatment of contrived object

Section: 13.3.1.1.1 [over.call.func] Status: drafting Submitter: Nikolay Ivchenkov Date: 2011-03-27

Footnote 127 of 13.3.1.1.1 [over.call.func] paragraph 3 reads,

> An implied object argument must be contrived to correspond to the implicit object parameter attributed to member functions during overload resolution. It is not used in the call to the selected function. Since the member functions all have the same implicit object parameter, the contrived object will not be the cause to select or reject a function.

It is not true that “the member functions all have the same implicit object parameter.” This statement does not take into account member functions brought into the class by using-declarations or cv-qualifiers and ref-qualifiers on the non-static member functions:

        struct B
        {
          char f();         // B &
        };

        struct D : B
        {
          using B::f;
          long f();         // D &

          char g() const;   // D const &
          long g();         // D &

          char h() &;       // D &
          long h() &&;      // D &&
        };

        int main()
        {
          // D::f() has better match than B::f()
          decltype(D().f()) *p1 = (long *)0;

          // D::g() has better match than D::g() const
          decltype(D().g()) *p2 = (long *)0;

          // D::h() & is not viable function
          // D::h() && is viable function
          decltype(D().h()) *p3 = (long *)0;
        }

The value category of a contrived object expression is not specified by the rules and, probably, cannot be properly specified in presence of ref-qualifiers, so the statement “the contrived object will not be the cause to select or reject a function” should be normative rather than informative:

        struct X
        {
          static void f(double) {}
          void f(int) & {}
          void f(int) && {}
        };

        int main()
        {
          X::f(0); // ???
        }

#### 2007. Argument-dependent lookup for `operator=`

Section: 13.3.1.2 [over.match.oper] Status: drafting Submitter: Richard Smith Date: 2014-09-23

Consider an example like:

      template<typename T> struct A { typename T::error e; };
      template<typename T> struct B { };
      B<A<void>> b1, &b2 = (b1 = b1);

If the assignment operator performs argument-dependent lookup, `A<void>` will be an associated class and will be instantiated, producing an error. Similar questions apply to the other member-only overloaded operators, `operator->` and `operator[]`. Bullet 3.2 of 13.3.1.2 [over.match.oper] should be changed not to perform unqualified lookup for these operators.

#### 2028. Converting constructors in rvalue reference initialization

Section: 13.3.1.6 [over.match.ref] Status: drafting Submitter: Mitsuru Kariya Date: 2014-10-25

Consider the following example:

      struct T {
        T() {}
        T(struct S&) {}
      };

      struct S {
        operator T() { return T(); }
      };

      int main()
      {
        S s;
        T&& t(s);  // #1
      }

Because there are two possible conversions from `S` to `T`, one by conversion function and the other by converting constructor, one might expect that the initialization at #1 would be ambiguous. However, 13.3.1.6 [over.match.ref] (used in the relevant bullet of 8.5.3 [dcl.init.ref], paragraph 5.2.1.2) only deals with conversion functions and ignores converting constructors.

Notes from the November, 2014 meeting:

CWG agreed that 8.5.3 [dcl.init.ref] should be changed to consider converting constructors in this case.

#### 455. Partial ordering and non-deduced arguments

Section: 13.3.3 [over.match.best] Status: drafting Submitter: Rani Sharoni Date: 19 Jan 2004

It's not clear how overloading and partial ordering handle non-deduced pairs of corresponding arguments. For example:

    template<typename T>
    struct A { typedef char* type; };

    template<typename T> char* f1(T, typename A<T>::type);  // #1
    template<typename T> long* f1(T*, typename A<T>::type*); // #2

    long* p1 = f1(p1, 0); // #3

I thought that #3 is ambiguous but different compilers disagree on that. Comeau C/C++ 4.3.3 (EDG 3.0.3) accepted the code, GCC 3.2 and BCC 5.5 selected #1 while VC7.1+ yields ambiguity.

I intuitively thought that the second pair should prevent overloading from triggering partial ordering since both arguments are non-deduced and has different types - (char*, char**). Just like in the following:

    template<typename T> char* f2(T, char*);   // #3
    template<typename T> long* f2(T*, char**); // #4

    long* p2 = f2(p2, 0); // #5

In this case all the compilers I checked found #5 to be ambiguous. The standard and DR 214 is not clear about how partial ordering handle such cases.

I think that overloading should not trigger partial ordering (in step 13.3.3 [over.match.best]/1/5) if some candidates have non-deduced pairs with different (specialized) types. In this stage the arguments are already adjusted so no need to mention it (i.e. array to pointer). In case that one of the arguments is non-deuced then partial ordering should only consider the type from the specialization:

    template<typename T> struct B { typedef T type; };

    template<typename T> char* f3(T, T);                   // #7
    template<typename T> long* f3(T, typename B<T>::type); // #8

    char* p3 = f3(p3, p3); // #9

According to my reasoning #9 should yield ambiguity since second pair is (T, long*). The second type (i.e. long*) was taken from the specialization candidate of #8. EDG and GCC accepted the code. VC and BCC found an ambiguity.

John Spicer: There may (or may not) be an issue concerning whether nondeduced contexts are handled properly in the partial ordering rules. In general, I think nondeduced contexts work, but we should walk through some examples to make sure we think they work properly.

Rani's description of the problem suggests that he believes that partial ordering is done on the specialized types. This is not correct. Partial ordering is done on the templates themselves, independent of type information from the specialization.

Notes from October 2004 meeting:

John Spicer will investigate further to see if any action is required.

(See also issue 885.)

#### 1536. Overload resolution with temporary from initializer list

Section: 13.3.3.1.5 [over.ics.list] Status: drafting Submitter: Mike Miller Date: 2012-08-14

In determining the implicit conversion sequence for an initializer list argument passed to a reference parameter, the intent is that a temporary of the appropriate type will be created and bound to the reference, as reflected in 13.3.3.1.5 [over.ics.list] paragraph 5:

> Otherwise, if the parameter is a reference, see 13.3.3.1.4 [over.ics.ref]. [Note: The rules in this section will apply for initializing the underlying temporary for the reference. —end note]

However, 13.3.3.1.4 [over.ics.ref] deals only with expression arguments, not initializer lists:

> When a parameter of reference type binds directly (8.5.3 [dcl.init.ref]) to an argument expression, the implicit conversion sequence is the identity conversion, unless the argument expression has a type that is a derived class of the parameter type, in which case the implicit conversion sequence is a derived-to-base Conversion (13.3.3.1 [over.best.ics])... If the parameter binds directly to the result of applying a conversion function to the argument expression, the implicit conversion sequence is a user-defined conversion sequence (13.3.3.1.2 [over.ics.user]), with the second standard conversion sequence either an identity conversion or, if the conversion function returns an entity of a type that is a derived class of the parameter type, a derived-to-base Conversion.

> When a parameter of reference type is not bound directly to an argument expression, the conversion sequence is the one required to convert the argument expression to the underlying type of the reference according to 13.3.3.1 [over.best.ics]. Conceptually, this conversion sequence corresponds to copy-initializing a temporary of the underlying type with the argument expression. Any difference in top-level cv-qualification is subsumed by the initialization itself and does not constitute a conversion.

(Note in particular that the reference binding refers to 8.5.3 [dcl.init.ref], which also does not handle initializer lists, and not to 8.5.4 [dcl.init.list].)

Either 13.3.3.1.4 [over.ics.ref] needs to be revised to handle binding references to initializer list arguments or 13.3.3.1.5 [over.ics.list] paragraph 5 needs to be clearer on how the expression specification is intended to be applied to initializer lists.

#### 1789. Array reference vs array decay in overload resolution

Section: 13.3.3.2 [over.ics.rank] Status: drafting Submitter: Faisal Vali Date: 2013-10-01

The current rules make an example like

      template<class T, size_t N> void foo(T (&)[N]);
      template<class T> void foo(T *t);

      int arr[3]{1, 2, 3};
      foo(arr);

ambiguous, even though the first is an identity match and the second requires an lvalue transformation. Is this desirable?

#### 1989. Insufficient restrictions on parameters of postfix operators

Section: 13.5 [over.oper] Status: drafting Submitter: Richard Smith Date: 2014-08-30

According to 13.5.7 [over.inc] paragraph 1,

> The user-defined function called `operator++` implements the prefix and postfix `++` operator. If this function is a non-static member function with no parameters, or a non-member function with one parameter, it defines the prefix increment operator `++` for objects of that type. If the function is a non-static member function with one parameter (which shall be of type `int`) or a non-member function with two parameters (the second of which shall be of type `int`), it defines the postfix increment operator `++` for objects of that type.

According to 13.5 [over.oper] paragraph 8,

> Operator functions cannot have more or fewer parameters than the number required for the corresponding operator, as described in the rest of this subclause.

This does not rule out an `operator++` with more than two parameters, however, since there is no corresponding operator.

One possibility might be to add a sentence like,

> A function named `operator++` shall declare either a prefix or postfix increment operator.

#### 205. Templates and static data members

Section: 14 [temp] Status: drafting Submitter: Mike Miller Date: 11 Feb 2000

Static data members of template classes and of nested classes of template classes are not themselves templates but receive much the same treatment as template. For instance, 14 [temp] paragraph 1 says that templates are only "classes or functions" but implies that "a static data member of a class template or of a class nested within a class template" is defined using the template-declaration syntax.

There are many places in the clause, however, where static data members of one sort or another are overlooked. For instance, 14 [temp] paragraph 6 allows static data members of class templates to be declared with the `export` keyword. I would expect that static data members of (non-template) classes nested within class templates could also be exported, but they are not mentioned here.

Paragraph 8, however, overlooks static data members altogether and deals only with "templates" in defining the effect of the `export` keyword; there is no description of the semantics of defining a static data member of a template to be exported.

These are just two instances of a systematic problem. The entire clause needs to be examined to determine which statements about "templates" apply to static data members, and which statements about "static data members of class templates" also apply to static data members of non-template classes nested within class templates.

(The question also applies to member functions of template classes; see issue 217, where the phrase "non-template function" in 8.3.6 [dcl.fct.default] paragraph 4 is apparently intended not to include non-template member functions of template classes. See also issue 108, which would benefit from understanding nested classes of class templates as templates. Also, see issue 249, in which the usage of the phrase "member function template" is questioned.)

Notes from the 4/02 meeting:

Daveed Vandevoorde will propose appropriate terminology.

#### 1444. Type adjustments of non-type template parameters

Section: 14.1 [temp.param] Status: drafting Submitter: Johannes Schaub Date: 2012-01-15

The type adjustment of template non-type parameters described in 14.1 [temp.param] paragraph 8 appears to be underspecified. For example, implementations vary in their treatment of

      template<typename T, T[T::size]> struct A {};
      int dummy;
      A<int, &dummy> a;

and

      template<typename T, T[1]> struct A;
      template<typename T, T*> struct A {};
      int dummy;
      A<int, &dummy> a;

See also issues 1322 and 1668.

#### 1635. How similar are template default arguments to function default arguments?

Section: 14.1 [temp.param] Status: drafting Submitter: Richard Smith Date: 2013-03-06

Default function arguments are instantiated only when needed. Is the same true of default template arguments? For example, is the following well-formed?

      #include <type_traits>

      template<class T>
      struct X {
        template<class U = typename T::type>
        static void foo(int){}
        static void foo(...){}
      };

      int main(){
        X<std::enable_if<false>>::foo(0);
      }

Also, is the effect on lookup the same? E.g.,

      struct S {
        template<typename T = U> void f();
        struct U {};
      };

#### 1478. `template` keyword for dependent template template arguments

Section: 14.2 [temp.names] Status: drafting Submitter: Johannes Schaub Date: 2012-03-10

According to 14.2 [temp.names] paragraph 4,

> When the name of a member template specialization appears after `.` or `->` in a postfix-expression or after a nested-name-specifier in a qualified-id, and the object expression of the postfix-expression is type-dependent or the nested-name-specifier in the qualified-id refers to a dependent type, but the name is not a member of the current instantiation (14.6.2.1 [temp.dep.type]), the member template name must be prefixed by the keyword `template`.

In other words, the `template` keyword is only required when forming a template-id. However, current compilers reject an example like:

      template<typename T, template<typename> class U = T::X> struct A;

and require the `template` keyword before `X`. Should the rule be amended to require the `template` keyword in cases like this?

#### 1729. Matching declarations and definitions of variable templates

Section: 14.5 [temp.decls] Status: drafting Submitter: Larisse Voufo Date: 2013-08-05

The relationship between declarations and definitions of variable templates is not clear. For example:

      template<typename T> auto var0 = T();  // #1a.
      template<typename T> extern T var0;    // #1b.

      template<typename T> T var1;           // #2a.
      template<typename T> extern auto var1; // #2b.
      template<typename T> extern T var1;    // #2c.
      template<typename T> T var1;           // #2d.

Questions:

1. When is a variable template declaration a definition and when a non-defining declaration?

2. What declarations are valid?

3. Should `auto` declarations be allowed?

4. To what extent, if any, do these involve type matching?

5. How are types matched, especially in the presence of `auto`?

#### 1730. Can a variable template have an unnamed type?

Section: 14.5 [temp.decls] Status: drafting Submitter: Larisse Voufo Date: 2013-08-05

Is it permitted for a variable template to have an unnamed type?

#### 1432. Newly-ambiguous variadic template expansions

Section: 14.5.3 [temp.variadic] Status: drafting Submitter: Daniel Krügler Date: 2011-12-17

With the new core rules in regard to variadic pack expansions the library specification of the traits template `common_type` is now broken, the reason is that it is defined as a series of specializations of the primary template

        template <class ...T>
        struct common_type;

The broken one is this pair:

      template <class T, class U>
      struct common_type<T, U> {
       typedef decltype(true ? declval<T>() : declval<U>()) type;
      };

      template <class T, class U, class... V>
      struct common_type<T, U, V...> {
       typedef typename common_type<typename common_type<T, U>::type, V...>::type type;
      };

With the new rules both specializations would now be ambiguous for an instantiation like `common_type<X, Y>`.

(See also issue 1395.)

Notes from the October, 2012 meeting:

It is possible that 14.5.5.2 [temp.class.order] may resolve this problem.

#### 1545. `friend` function templates defined in class templates

Section: 14.5.4 [temp.friend] Status: drafting Submitter: Daniel Krügler Date: 2012-08-25

The status of an example like the following is not clear:

       template<class> struct x {
         template<class T>
         friend bool operator==(x<T>, x<T>) { return false; }
      };

      int main() {
        x<int> x1;
        x<double> x2;
        x1 == x1;
        x2 == x2;
      }

Such a `friend` definition is permitted by 14.5.4 [temp.friend] paragraph 2:

> A friend function template may be defined within a class or class template...

Paragraph 4 appears to be related, but deals only with friend functions, not friend function templates:

> When a function is defined in a friend function declaration in a class template, the function is instantiated when the function is odr-used. The same restrictions on multiple declarations and definitions that apply to non-template function declarations and definitions also apply to these implicit definitions.

#### 1862. Determining “corresponding members” for friendship

Section: 14.5.4 [temp.friend] Status: drafting Submitter: Richard Smith Date: 2014-02-13

During the discussion of issue 1804, it was noted that the process of determining whether a member of an explicit or partial specialization corresponds to a member of the primary template is not well specified. In particular, it should be clarified that the primary template should not be instantiated during this process; instead, the template arguments from the specialization should simply be substituted into the member declaration.

#### 1315. Restrictions on non-type template arguments in partial specializations

Section: 14.5.5 [temp.class.spec] Status: drafting Submitter: Johannes Schaub Date: 2011-05-12

The rationale for the restriction in 14.5.5 [temp.class.spec] paragraph 8, first bullet is not clear:

- A partially specialized non-type argument expression shall not involve a template parameter of the partial specialization except when the argument expression is a simple identifier. [Example:

      template <int I, int J> struct A {};
      template <int I> struct A<I+5, I*2> {}; // error
      template <int I, int J> struct B {};
      template <int I> struct B<I, I> {};     // OK

—end example]

In the example, it's clear that `I` is non-deducible, but this rule prevents plausible uses like:

      template <int I, int J> struct A {};
      template <int I> struct A<I, I*2> {};

#### 1647. Type agreement of non-type template arguments in partial specializations

Section: 14.5.5 [temp.class.spec] Status: drafting Submitter: John Spicer Date: 2013-04-04

The Standard appears to be silent on whether the types of non-type template arguments in a partial specialization must be the same as those of the primary template or whether conversions are permitted. For example,

      template<char...> struct char_values {};
      template<int C1, char C3>
      struct char_values<C1, 12, C3> {
        static const unsigned value = 1;
      };
      int check0[char_values<1, 12, 3>::value == 1? 1 : -1];

The closest the current wording comes to dealing with this question is 14.5.5 [temp.class.spec] paragraph 8 bullet 1:

- A partially specialized non-type argument expression shall not involve a template parameter of the partial specialization except when the argument expression is a simple identifier.

In this example, one might think of the first template argument in the partial specialization as `(char)C1`, which would violate the requirement, but that reasoning is tenuous.

It would be reasonable to require the types to match in cases like this. If this kind of usage is allowed it could get messy if the primary template were `int...` and the partial specialization had a parameter that was `char` because not all of the possible values from the primary template could be represented in the parameter of the partial specialization. A similar issue exists if the primary template takes `signed char` and the partial specialization takes `unsigned int`.

There is implementation variance in the treatment of this example.

#### 1711. Missing specification of variable template partial specializations

Section: 14.5.5 [temp.class.spec] Status: drafting Submitter: Richard Smith Date: 2013-07-08

It appears that partial specializations of variable templates are intended to be supported, as 14.3.3 [temp.arg.template] paragraph 2 says,

> Any partial specializations (14.5.5 [temp.class.spec]) associated with the primary class template or primary variable template are considered when a specialization based on the template template-parameter is instantiated.

However, there is no explicit specification for how they are to be handled, and the wording in 14.5.5 [temp.class.spec] and its subsections explicitly applies only to partial specializations of class templates.

#### 549. Non-deducible parameters in partial specializations

Section: 14.5.5.1 [temp.class.spec.match] Status: drafting Submitter: Martin Sebor Date: 18 November 2005

In the following example, the template parameter in the partial specialization is non-deducible:

        template <class T> struct A { typedef T U; };
        template <class T> struct C { };
        template <class T> struct C<typename A<T>::U> { };

Several compilers issue errors for this case, but there appears to be nothing in the Standard that would make this ill-formed; it simply seems that the partial specialization will never be matched, so the primary template will be used for all specializations. Should it be ill-formed?

(See also issue 1246.)

Notes from the April, 2006 meeting:

It was noted that there are similar issues for constructors and conversion operators with non-deducible parameters, and that they should probably be dealt with similarly.

#### 1755. Out-of-class partial specializations of member templates

Section: 14.5.5.3 [temp.class.spec.mfunc] Status: drafting Submitter: Richard Smith Date: 2013-09-19

According to 14.5.5.3 [temp.class.spec.mfunc] paragraph 2,

> If a member template of a class template is partially specialized, the member template partial specializations are member templates of the enclosing class template; if the enclosing class template is instantiated (14.7.1 [temp.inst], 14.7.2 [temp.explicit]), a declaration for every member template partial specialization is also instantiated as part of creating the members of the class template specialization.

Does this imply that only partial specializations of member templates that are declared before the enclosing class is instantiated are considered? For example, in

      template<typename A> struct X { template<typename B> struct Y; };
      template struct X<int>;
      template<typename A> template<typename B> struct X<A>::Y<B*> { int n; };
      int k = X<int>::Y<int*>().n;

is the last line valid? There is implementation variance on this point. Similarly, for an example like

      template<typename A> struct Outer {
       template<typename B, typename C> struct Inner;
      };
      Outer<int> outer;
      template<typename A> template<typename B>
        struct Outer<A>::Inner<typename A::error, B> {};

at what point, if at all, is the declaration of the partial specialization instantiated? Again, there is implementation variance in the treatment of this example.

Notes from the February, 2014 meeting:

CWG decided that partial specialization declarations should be instantiated only when needed to determine whether the partial specialization matches or not.

Additional note, November, 2014:

See also paper N4090.

#### 1286. Equivalence of alias templates

Section: 14.5.7 [temp.alias] Status: drafting Submitter: Gabriel Dos Reis Date: 2011-04-03

Issue 1244 was resolved by changing the example in 14.4 [temp.type] paragraph 1 from

      template<template<class> class TT> struct X { };
      template<class> struct Y { };
      template<class T> using Z = Y<T>;
      X<Y> y;
      X<Z> z;

to

      template<class T> struct X { };
      template<class> struct Y { };
      template<class T> using Z = Y<T>;
      X<Y<int> > y;
      X<Z<int> > z;

In fact, the original intent was that the example should have been correct as written; however, the normative wording to make it so was missing. The current wording of 14.5.7 [temp.alias] deals only with the equivalence of a specialization of an alias template with the type-id after substitution. Wording needs to be added specifying under what circumstances an alias template itself is equivalent to a class template.

Proposed resolution (September, 2012):

1. Add the following as a new paragraph following 14.5.7 [temp.alias] paragraph 2:

> When the type-id in the declaration of alias template (call it `A`) consists of a simple-template-id in which the template-argument-list consists of a list of identifiers naming each template-parameter of `A` exactly once in the same order in which they appear in `A`'s template-parameter-list, the alias template is equivalent to the template named in the simple-template-id (call it `T`) if `A` and `T` have the same number of template-parameters. [Footnote: This rule is transitive: if an alias template `A` is equivalent to another alias template `B` that is equivalent to a class template `C`, then `A` is also equivalent to `C`, and `A` and `B` are also equivalent to each other. —end footnote] [Example:

>       template<typename T, U = T> struct A;

>       template<typename V, typename W>
>         using B = A<V, W>;                // equivalent to A

>       template<typename V, typename W>
>         using C = A<V>;                   // not equivalent to A:
>                                           // not all parameters used

>       template<typename V>
>         using D = A<V>;                   // not equivalent to A:
>                                           // different number of parameters

>       template<typename V, typename W>
>         using E = A<W, V>;                // not equivalent to A:
>                                           // template-arguments in wrong order

>       template<typename V, typename W = int>
>         using F = A<V, W>;                // equivalent to A:
>                                           // default arguments not considered

>       template<typename V, typename W>
>         using G = A<V, W>;                // equivalent to A and B

>       template<typename V, typename W>
>         using H = E<V, W>;                // equivalent to E

>       template<typename V, typename W>
>         using I = A<V, typename W::type>; // not equivalent to A:
>                                           // argument not identifier

> —end example]

2. Change 14.4 [temp.type] paragraph 1 as follows:

> Two template-ids refer to the same class or function if

> - ...

> - their corresponding template template-arguments refer to the same or equivalent (14.5.7 [temp.alias]) templates.

> [Example:

> ...declares `x2` and `x3` to be of the same type. Their type differs from the types of `x1` and `x4`.

>       template<class T template<class> class TT> struct X { };
>       template<class> struct Y { };
>       template<class T> using Z = Y<T>;
>       X<Y<int> Y> y;
>       X<Z<int> Z> z;

> declares `y` and `z` to be of the same type. —end example]

Additional note, November, 2014:

Concern has been expressed over the proposed resolution with regard to its handling of default template arguments that differ between the template and its alias, e.g.,

       template<typename T, typename U = int> struct A {};
       template<typename T, typename U = char> using B = A<T, U>;
       template<template<typename...> typename C> struct X { C<int> c; };

#### 1430. Pack expansion into fixed alias template parameter list

Section: 14.5.7 [temp.alias] Status: drafting Submitter: Jason Merrill Date: 2011-12-13

Originally, a pack expansion could not expand into a fixed-length template parameter list, but this was changed in N2555. This works fine for most templates, but causes issues with alias templates.

In most cases, an alias template is transparent; when it's used in a template we can just substitute in the dependent template arguments. But this doesn't work if the template-id uses a pack expansion for non-variadic parameters. For example:

        template<class T, class U, class V>
        struct S {};

        template<class T, class V>
        using A = S<T, int, V>;

        template<class... Ts>
        void foo(A<Ts...>);

There is no way to express `A<Ts...>` in terms of `S`, so we need to hold onto the `A` until we have the `Ts` to substitute in, and therefore it needs to be handled in mangling.

Currently, EDG and Clang reject this testcase, complaining about too few template arguments for A. G++ did as well, but I thought that was a bug. However, on the ABI list John Spicer argued that it should be rejected.

(See also issue 1558.)

Notes from the October, 2012 meeting:

The consensus of CWG was that this usage should be prohibited, disallowing use of an alias template when a dependent argument can't simply be substituted directly into the type-id.

Additional note, April, 2013:

For another example, consider:

      template<class... x> class list{};
      template<class a, class... b> using tail=list<b...>;
      template <class...T> void f(tail<T...>);

      int main() {
        f<int,int>({});
      }

There is implementation variance in the handling of this example.

#### 1554. Access and alias templates

Section: 14.5.7 [temp.alias] Status: drafting Submitter: Jason Merrill Date: 2012-09-17

The interaction of alias templates and access control is not clear from the current wording of 14.5.7 [temp.alias]. For example:

      template <class T> using foo = typename T::foo;

      class B {
        typedef int foo;
        friend struct C;
      };

      struct C {
        foo<B> f;    // Well-formed?
      };

Is the substitution of `B::foo` for `foo<B>` done in the context of the befriended class `C`, making the reference well-formed, or is the access determined independently of the context in which the alias template specialization appears?

If the answer to this question is that the access is determined independently from the context, care must be taken to ensure that an access failure is still considered to be “in the immediate context of the function type” (14.8.2 [temp.deduct] paragraph 8) so that it results in a deduction failure rather than a hard error.

Notes from the October, 2012 meeting:

The consensus of CWG was that instantiation (lookup and access) for alias templates should be as for other templates, in the definition context rather than in the context where they are used. They should still be expanded immediately, however.

Additional note (February, 2014):

A related problem is raised by the definition of `std::enable_if_t` (20.10.2 [meta.type.synop]):

      template <bool b, class T = void>
      using enable_if_t = typename enable_if<b,T>::type;

If `b` is `false`, there will be no `type` member. The intent is that such a substitution failure is to be considered as being “in the immediate context” where the alias template specialization is used, but the existing wording does not seem to accomplish that goal.

Additional note, November, 2014:

Concern has been expressed that the intent to analyze access in the context of the alias template definition is at odds with the fact that friendship cannot be granted to alias templates; if it could, the access violation in the original example could be avoided by making `foo` a friend of class `B`, but that is not possible.

#### 1896. Repeated alias templates

Section: 14.5.7 [temp.alias] Status: drafting Submitter: Mike Miller Date: 2014-03-18

The current wording of the Standard does not permit repeated alias template declarations within a scope, but some current implementations allow it, presumably by analogy with typedef declarations. Should the Standard be changed to permit this usage?

Notes from the November, 2014 meeting:

CWG agreed that the usage should be permitted, provided that the dependent types are equivalent. Note that this is a weaker requirement than the token-for-token identity of the ODR, since alias templates are not definitions per 14 [temp] paragraph 1.

#### 1980. Equivalent but not functionally-equivalent redeclarations

Section: 14.5.7 [temp.alias] Status: drafting Submitter: Richard Smith Date: 2014-08-04

In an example like

      template<typename T, typename U> using X = T;
      template<typename T> X<void, typename T::type> f();
      template<typename T> X<void, typename T::other> f();

it appears that the second declaration of `f` is a redeclaration of the first but distinguishable by SFINAE, i.e., equivalent but not functionally equivalent.

Notes from the November, 2014 meeting:

CWG felt that these two declarations should not be equivalent.

#### 560. Use of the `typename` keyword in return types

Section: 14.6 [temp.res] Status: drafting Submitter: Greg Comeau Date: 11 February 2006

Consider the following example:

        template <class T> struct Outer {
            struct Inner {
                Inner* self();
            };
        };
        template <class T> Outer<T>::Inner*
            Outer<T>::Inner::self() { return this; }

According to 14.6 [temp.res] paragraph 3 (before the salient wording was inadvertently removed, see issue 559),

> A qualified-id that refers to a type and in which the nested-name-specifier depends on a template-parameter (14.6.2 [temp.dep]) but does not refer to a member of the current instantiation (14.6.2.1 [temp.dep.type]) shall be prefixed by the keyword `typename` to indicate that the qualified-id denotes a type, forming a typename-specifier.

Because `Outer<T>::Inner` is a member of the current instantiation, the Standard does not currently require that it be prefixed with `typename` when it is used in the return type of the definition of the `self()` member function. However, it is difficult to parse this definition correctly without knowing that the return type is, in fact, a type, which is what the `typename` keyword is for. Should the Standard be changed to require `typename` in such contexts?

#### 1271. Imprecise wording regarding dependent types

Section: 14.6 [temp.res] Status: drafting Submitter: Daveed Vandevoorde Date: 2011-03-24

According to 14.6 [temp.res] paragraph 3,

> When a qualified-id is intended to refer to a type that is not a member of the current instantiation (14.6.2.1 [temp.dep.type]) and its nested-name-specifier refers to a dependent type, it shall be prefixed by the keyword `typename`, forming a typename-specifier. If the qualified-id in a typename-specifier does not denote a type, the program is ill- formed.

The intent of the programmer cannot form the basis for a compiler determining whether to issue a diagnostic or not.

Suggested resolution:

> Let `N` be a qualified-id with a nested-name-specifier that denotes a dependent type. If `N` is not prefixed by the keyword `typename`, `N` shall refer to a member of the current instantiation or it shall not refer to a type.

> typename-specifier:
> `typename` nested-name-specifier identifier
> `typename` nested-name-specifier `template` opt simple-template-id

> If the qualified-id in a typename-specifier does not denote a type, the program is ill-formed.

(See also issues 590 and 591.)

#### 1785. Conflicting diagnostic requirements for template definitions

Section: 14.6 [temp.res] Status: drafting Submitter: CWG Date: 2013-09-28

According to 14.6 [temp.res] paragraph 8,

> No diagnostic shall be issued for a template for which a valid specialization can be generated.

One sentence later, it says,

> If every valid specialization of a variadic template requires an empty template parameter pack, the template is ill-formed, no diagnostic required.

This appears to be a contradiction: in the latter case, there is postulated to exist a “valid” specialization (with an empty pack expansion), for which a diagnostic might or might not be issued. The first quoted sentence, however, forbids issuing a diagnostic for a template that has at least one valid specialization.

#### 1841. `<` following template injected-class-name

Section: 14.6.1 [temp.local] Status: drafting Submitter: Ismail Pazarbasi Date: 2014-01-23

According to 14.6.1 [temp.local]paragraph 1,

> Like normal (non-template) classes, class templates have an injected-class-name (Clause 9 [class]). The injected-class-name can be used as a template-name or a type-name. When it is used with a template-argument-list, as a template-argument for a template template-parameter, or as the final identifier in the elaborated-type-specifier of a friend class template declaration, it refers to the class template itself. Otherwise, it is equivalent to the template-name followed by the template-parameters of the class template enclosed in <>.

The intent is that a `<` following such an injected-class-name is to be interpreted as the start of a template-argument-list (and an error if the following tokens do not constitute a valid template-argument-list), but that is not said explicitly.

#### 1936. Dependent qualified-ids

Section: 14.6.2 [temp.dep] Status: drafting Submitter: Richard Smith Date: 2014-06-05

The resolution of issue 1321 changed the term “dependent name” to apply only to unqualified-ids, presumably on the basis that only unqualified-ids affect the lookup set. However, the rule from 14.5.6.1 [temp.over.link] paragraph 5,

> For determining whether two dependent names (14.6.2 [temp.dep]) are equivalent, only the name itself is considered, not the result of name lookup in the context of the template. If multiple declarations of the same function template differ in the result of this name lookup, the result for the first declaration is used.

should apply to non-dependent qualified-ids naming functions called with dependent arguments, as well.

There should also be a statement that the name of a member of an unknown specialization is a dependent name and so should fall under the rules of 14.6.4 [temp.dep.res] and not 14.6.3 [temp.nondep].

#### 1390. Dependency of alias template specializations

Section: 14.6.2.1 [temp.dep.type] Status: drafting Submitter: Johannes Schaub Date: 2011-09-04

According to 14.6.2.1 [temp.dep.type] paragraph 8, a type is dependent (among other things) if it is

- a simple-template-id in which either the template name is a template parameter or any of the template arguments is a dependent type or an expression that is type-dependent or value-dependent

This applies to alias template specializations, even if the resulting type does not depend on the template argument:

        struct B { typedef int type; };
        template<typename> using foo = B;
        template<typename T> void f() {
          foo<T>::type * x;  //error: typename required
        }

Is a change to the rules for cases like this warranted?

Notes from the October, 2012 meeting:

CWG agreed that no `typename` should be required in this case. In some ways, an alias template specialization is like the current instantiation and can be known at template definition time.

#### 1524. Incompletely-defined class template base

Section: 14.6.2.1 [temp.dep.type] Status: drafting Submitter: Jason Merrill Date: 2012-07-17

The correct handling of an example like the following is unclear:

      template<typename T> struct A {
        struct B: A { };
      };

A type used as a base must be complete (10 [class.derived] paragraph 2). The fact that the base class in this example is the current instantiation could be interpreted as indicating that it should be available for lookup, and thus the normal rule should apply, as members declared after the nested class would not be visible.

On the other hand, 14.6.2 [temp.dep] paragraph 3 says,

> In the definition of a class or class template, if a base class depends on a template-parameter, the base class scope is not examined during unqualified name lookup either at the point of definition of the class template or member or during an instantiation of the class template or member.

This wording refers not to a dependent type, which would permit lookup in the current instantiation, but simply to a type that “depends on a template-parameter,” and the current instantiation is such a type.

Implementations vary on the handling of this example.

(See also issue 1526 for another case related to the distinction between a “dependent type” and a “type that depends on a template-parameter.”)

Notes from the October, 2012 meeting:

CWG determined that the example should be ill-formed.

#### 2. How can dependent names be used in member declarations that appear outside of the class template definition?

Section: 14.6.4 [temp.dep.res] Status: drafting Submitter: unknown Date: unknown

        template <class T> class Foo {

           public:
           typedef int Bar;
           Bar f();
        };
        template <class T> typename Foo<T>::Bar Foo<T>::f() { return 1;}
                           --------------------

In the class template definition, the declaration of the member function is interpreted as:

       int Foo<T>::f();

In the definition of the member function that appears outside of the class template, the return type is not known until the member function is instantiated. Must the return type of the member function be known when this out-of-line definition is seen (in which case the definition above is ill-formed)? Or is it OK to wait until the member function is instantiated to see if the type of the return type matches the return type in the class template definition (in which case the definition above is well-formed)?

Suggested resolution: (John Spicer)

My opinion (which I think matches several posted on the reflector recently) is that the out-of-class definition must match the declaration in the template. In your example they do match, so it is well formed.

I've added some additional cases that illustrate cases that I think either are allowed or should be allowed, and some cases that I don't think are allowed.

        template <class T> class A { typedef int X; };

        template <class T> class Foo {
         public:
           typedef int Bar;
           typedef typename A<T>::X X;
           Bar f();
           Bar g1();
           int g2();
           X h();
           X i();
           int j();
         };

         // Declarations that are okay
         template <class T> typename Foo<T>::Bar Foo<T>::f()
                                                         { return 1;}
         template <class T> typename Foo<T>::Bar Foo<T>::g1()
                                                         { return 1;}
         template <class T> int Foo<T>::g2() { return 1;}
         template <class T> typename Foo<T>::X Foo<T>::h() { return 1;}

         // Declarations that are not okay
         template <class T> int Foo<T>::i() { return 1;}
         template <class T> typename Foo<T>::X Foo<T>::j() { return 1;}

In general, if you can match the declarations up using only information from the template, then the declaration is valid.

Declarations like `Foo::i` and `Foo::j` are invalid because for a given instance of `A<T>`, `A<T>::X` may not actually be int if the class is specialized.

This is not a problem for `Foo::g1` and `Foo::g2` because for any instance of `Foo<T>` that is generated from the template you know that Bar will always be int. If an instance of `Foo` is specialized, the template member definitions are not used so it doesn't matter whether a specialization defines `Bar` as int or not.

#### 287. Order dependencies in template instantiation

Section: 14.6.4.1 [temp.point] Status: drafting Submitter: Martin Sebor Date: 17 May 2001

Implementations differ in their treatment of the following code:

        template <class T>
        struct A {
    	typename T::X x;
        };

        template <class T>
        struct B {
    	typedef T* X;
    	A<B> a;
        };

        int main ()
        {
    	B<int> b;
        }

Some implementations accept it. At least one rejects it because the instantiation of `A<B<int> >` requires that `B<int>` be complete, and it is not at the point at which `A<B<int> >` is being instantiated.

Erwin Unruh:

In my view the programm is ill-formed. My reasoning:

- you need a complete type `B<int>` because you declare a variable in `main`
- `B<int>` contains a member of type `A<B<int> >`, so you need that complete.
- `A<B<int> >` tries to access `B<int>::X`, which in turn needs `B<int>` being complete.

So each class needs the other to be complete.

The problem can be seen much easier if you replace the typedef with

        typedef T (*X) [sizeof(B::a)];

Now you have a true recursion. The compiler cannot easily distinguish between a true recursion and a potential recursion.

John Spicer:

Using a class to form a qualified name does not require the class to be complete, it only requires that the named member already have been declared. In other words, this kind of usage is permitted:

        class A {
            typedef int B;
            A::B ab;
        };

In the same way, once `B` has been declared in `A`, it is also visible to any template that uses `A` through a template parameter.

The standard could be more clear in this regard, but there are two notes that make this point. Both 3.4.3.1 [class.qual] and 5.1.1 [expr.prim.general] paragraph 7 contain a note that says "a class member can be referred to using a qualified-id at any point in its potential scope (3.3.7 [basic.scope.class])." A member's potential scope begins at its point of declaration.

In other words, a class has three states: incomplete, being completed, and complete. The standard permits a qualified name to be used once a name has been declared. The quotation of the notes about the potential scope was intended to support that.

So, in the original example, class `A` does not require the type of `T` to be complete, only that it have already declared a member `X`.

Bill Gibbons:

The template and non-template cases are different. In the non-template case the order in which the members become declared is clear. In the template case the members of the instantiation are conceptually all created at the same time. The standard does not say anything about trying to mimic the non-template case during the instantiation of a class template.

Mike Miller:

I think the relevant specification is 14.6.4.1 [temp.point] paragraph 3, dealing with the point of instantiation:

> For a class template specialization... if the specialization is implicitly instantiated because it is referenced from within another template specialization, if the context from which the specialization is referenced depends on a template parameter, and if the specialization is not instantiated previous to the instantiation of the enclosing template, the point of instantiation is immediately before the point of instantiation of the enclosing template. Otherwise, the point of instantiation for such a specialization immediately precedes the namespace scope declaration or definition that refers to the specialization.

That means that the point of instantiation of `A<B<int> >` is before that of `B<int>`, not in the middle of `B<int>` after the declaration of `B::X`, and consequently a reference to `B<int>::X` from `A<B<int> >` is ill-formed.

To put it another way, I believe John's approach requires that there be an instantiation stack, with the results of partially-instantiated templates on the stack being available to instantiations above them. I don't think the Standard mandates that approach; as far as I can see, simply determining the implicit instantiations that need to be done, rewriting the definitions at their respective points of instantiation with parameters substituted (with appropriate "forward declarations" to allow for non-instantiating references), and compiling the result normally should be an acceptable implementation technique as well. That is, the implicit instantiation of the example (using, e.g., `B_int` to represent the generated name of the `B<int>` specialization) could be something like

            struct B_int;

            struct A_B_int {
                B_int::X x;    // error, incomplete type
            };

            struct B_int {
                typedef int* X;
                A_B_int a;
            };

Notes from 10/01 meeting:

This was discussed at length. The consensus was that the template case should be treated the same as the non-template class case it terms of the order in which members get declared/defined and classes get completed.

Proposed resolution:

In 14.6.4.1 [temp.point] paragraph 3 change:

> the point of instantiation is immediately before the point of instantiation of the enclosing template. Otherwise, the point of instantiation for such a specialization immediately precedes the namespace scope declaration or definition that refers to the specialization.

To:

> the point of instantiation is the same as the point of instantiation of the enclosing template. Otherwise, the point of instantiation for such a specialization immediately precedes the nearest enclosing declaration. [Note: The point of instantiation is still at namespace scope but any declarations preceding the point of instantiation, even if not at namespace scope, are considered to have been seen.]

Add following paragraph 3:

> If an implicitly instantiated class template specialization, class member specialization, or specialization of a class template references a class, class template specialization, class member specialization, or specialization of a class template containing a specialization reference that directly or indirectly caused the instantiation, the requirements of completeness and ordering of the class reference are applied in the context of the specialization reference.

and the following example

      template <class T> struct A {
              typename T::X x;
      };

      struct B {
              typedef int X;
              A<B> a;
      };

      template <class T> struct C {
              typedef T* X;
              A<C> a;
      };

      int main ()
      {
              C<int> c;
      }

Notes from the October 2002 meeting:

This needs work. Moved back to drafting status.

See also issues 595 and 1330.

#### 1258. “Instantiation context” differs from dependent lookup rules

Section: 14.6.4.1 [temp.point] Status: drafting Submitter: Nikolay Ivchenkov Date: 2011-03-10

C++11 expanded the lookup rules for dependent function calls (14.6.4.2 [temp.dep.candidate] paragraph 1 bullet 2) to include functions with internal linkage; previously only functions with external linkage were considered. However, 14.6.4.1 [temp.point] paragraph 6 still says,

> The instantiation context of an expression that depends on the template arguments is the set of declarations with external linkage declared prior to the point of instantiation of the template specialization in the same translation unit.

Presumably this wording was overlooked and should be harmonized with the new specification.

#### 1845. Point of instantiation of a variable template specialization

Section: 14.6.4.1 [temp.point] Status: drafting Submitter: Richard Smith Date: 2014-01-28

The current wording of 14.6.4.1 [temp.point] does not define the point of instantiation of a variable template specialization. Presumably replacing the references to “static data member of a class template” with “variable template” in paragraphs 1 and 8 would be sufficient.

#### 1253. Generic non-template members

Section: 14.7 [temp.spec] Status: drafting Submitter: Nikolay Ivchenkov Date: 2011-03-06

Many statements in the Standard apply only to templates, for example, 14.6 [temp.res] paragraph 8:

> If no valid specialization can be generated for a template definition, and that template is not instantiated, the template definition is ill-formed, no diagnostic required.

This clearly should apply to non-template member functions of class templates, not just to templates per se. Terminology should be established to refer to these generic entities that are not actually templates.

Additional notes (August, 2012):

Among the generic entities that should be covered by such a term are default function arguments, as they can be instantiated independently. If issue 1330 is resolved as expected, exception-specifications should also be covered by the same term.

See also issue 1484.

#### 212. Implicit instantiation is not described clearly enough

Section: 14.7.1 [temp.inst] Status: drafting Submitter: Christophe de Dinechin Date: 7 Mar 2000

Three points have been raised where the wording in 14.7.1 [temp.inst] may not be sufficiently clear.

1. In paragraph 4, the statement is made that

   > A class template specialization is implicitly instantiated... if the completeness of the class type affects the semantics of the program...

   It is not clear what it means for the "completeness... [to affect] the semantics." Consider the following example:

               template<class T> struct A;
               extern A<int> a;

               void *foo() { return &a; }

               template<class T> struct A
               {
               #ifdef OPTION
                       void *operator &() { return 0; }
               #endif
               };

   The question here is whether it is necessary for template class `A` to declare an `operator &` for the semantics of the program to be affected. If it does not do so, the meaning of `&a` will be the same whether the class is complete or not and thus arguably the semantics of the program are not affected.

   Presumably what was intended is whether the presence or absence of certain member declarations in the template class might be relevant in determining the meaning of the program. A clearer statement may be desirable.

2. Paragraph 5 says,

   > If the overload resolution process can determine the correct function to call without instantiating a class template definition, it is unspecified whether that instantiation actually takes place.

   The intent of this wording, as illustrated in the example in that paragraph, is to allow a "smart" implementation not to instantiate class templates if it can determine that such an instantiation will not affect the result of overload resolution, even though the algorithm described in clause 13 [over] requires that all the viable functions be enumerated, including functions that might be found as members of specializations.

   Unfortunately, the looseness of the wording allowing this latitude for implementations makes it unclear what "the overload resolution process" is — is it the algorithm in 13 [over] or something else? — and what "the correct function" is.

3. According to paragraph 6,

   > If an implicit instantiation of a class template specialization is required and the template is declared but not defined, the program is ill-formed.

   Here, it is not clear what conditions "require" an implicit instantiation. From the context, it would appear that the intent is to refer to the conditions in paragraph 4 that cause a specialization to be instantiated.

   This interpretation, however, leads to different treatment of template and non-template incomplete classes. For example, by this interpretation,

           class A;
           template <class T> struct TA;
           extern A a;
           extern TA<int> ta;

           void f(A*);
           void f(TA<int>*);

           int main()
           {
               f(&a);    // well-formed; undefined if A
                         // has operator &() member
               f(&ta);   // ill-formed: cannot instantiate
           }

   A different approach would be to understand "required" in paragraph 6 to mean that a complete type is required in the expression. In this interpretation, if an incomplete type is acceptable in the context and the class template definition is not visible, the instantiation is not attempted and the program is well-formed.

   The meaning of "required" in paragraph 6 must be clarified.

(See also issues 204 and 63.)

Notes on 10/01 meeting:

It was felt that item 1 is solved by addition of the word "might" in the resolution for issue 63; item 2 is not much of a problem; and item 3 could be solved by changing "required" to "required to be complete".

#### 1396. Deferred instantiation and checking of non-static data member initializers

Section: 14.7.1 [temp.inst] Status: drafting Submitter: Jason Merrill Date: 2011-09-22

Non-static data member initializers get the same late parsing as member functions and default arguments, but are they also instantiated as needed like them? And when is their validity checked?

Notes from the October, 2012 meeting:

CWG agreed that non-static data member initializers should be handled like default arguments.

Additional note (March, 2013):

Determining whether a defaulted constructor is `constexpr` or not requires parsing the class's non-static data member initializers; see also issue 1360.

#### 1665. Declaration matching in explicit instantiations

Section: 14.7.2 [temp.explicit] Status: drafting Submitter: Richard Smith Date: 2013-04-19

Consider a case like

      struct X {
        template<typename T> void f(T);
        void f(int);
      };
      template void X::f(int);

or

      template<typename T> void f(T) {}
      void f(int);
      template void f(int);

Presumably in both these cases the explicit instantiation should refer to the template and not to the non-template; however, 14.5.2 [temp.mem] paragraph 2 says,

> A normal (non-template) member function with a given name and type and a member function template of the same name, which could be used to generate a specialization of the same type, can both be declared in a class. When both exist, a use of that name and type refers to the non-template member unless an explicit template argument list is supplied.

This would appear to give the wrong answer for the first example. It's not clearly stated, but consistency would suggest a similar wrong answer for the second. Presumably a statement is needed somewhere that an explicit instantiation directive applies to a template and not a non-template function if both are visible.

Additional note, January, 2014:

A related example has been raised:

      template<typename T> class Matrix {
      public:
        Matrix(){}
        Matrix(const Matrix&){}
        template<typename U>
          Matrix(const Matrix<U>&);
      };

      template Matrix<int>::Matrix(const Matrix&);

      Matrix<int> m;
      Matrix<int> mm(m);

If the explicit instantiation directive applies to the constructor template, there is no way to explicitly instantiate the copy constructor.

#### 1704. Type checking in explicit instantiation of variable templates

Section: 14.7.2 [temp.explicit] Status: drafting Submitter: Richard Smith Date: 2013-06-20

It is not clear whether the following is well-formed or not:

      template<typename T> int arr[sizeof(T)] = {};
      template int arr<int>[];

Are we supposed to instantiate the specialization and treat the explicit instantiation declaration as if it were a redeclaration (in which case the omitted array bound would presumably be OK), or is the type of the explicit instantiation declaration required to exactly match the type that the instantiated specialization has (in which case the omitted bound would presumably not be OK)? Or something else?

(See also issue 1728.)

#### 1728. Type of an explicit instantiation of a variable template

Section: 14.7.2 [temp.explicit] Status: drafting Submitter: Larisse Voufo Date: 2013-08-05

It is not clear to what extent the type in an explicit instantiation must match that of a variable template. For example:

      template<typename T> T var = T();
      template float var<float>;   // #1.
      template int* var<int>;      // #2.
      template auto var<char>;     // #3.

(See also issue 1704.)

#### 529. Use of `template<>` with “explicitly-specialized” class templates

Section: 14.7.3 [temp.expl.spec] Status: drafting Submitter: James Widman Date: 16 August 2005

Paragraph 17 of 14.7.3 [temp.expl.spec] says,

> A member or a member template may be nested within many enclosing class templates. In an explicit specialization for such a member, the member declaration shall be preceded by a `template<>` for each enclosing class template that is explicitly specialized.

This is curious, because paragraph 3 only allows explicit specialization of members of implicitly-instantiated class specializations, not explicit specializations. Furthermore, paragraph 4 says,

> Definitions of members of an explicitly specialized class are defined in the same manner as members of normal classes, and not using the explicit specialization syntax.

Paragraph 18 provides a clue for resolving the apparent contradiction:

> In an explicit specialization declaration for a member of a class template or a member template that appears in namespace scope, the member template and some of its enclosing class templates may remain unspecialized, except that the declaration shall not explicitly specialize a class member template if its enclosing class templates are not explicitly specialized as well. In such explicit specialization declaration, the keyword `template` followed by a template-parameter-list shall be provided instead of the `template<>` preceding the explicit specialization declaration of the member.

It appears from this and the following example that the phrase “explicitly specialized” in paragraphs 17 and 18, when referring to enclosing class templates, does not mean that explicit specializations have been declared for them but that their names in the qualified-id are followed by template argument lists. This terminology is confusing and should be changed.

Proposed resolution (October, 2005):

1. Change 14.7.3 [temp.expl.spec] paragraph 17 as indicated:

> A member or a member template may be nested within many enclosing class templates. In an explicit specialization for such a member, the member declaration shall be preceded by a `template<>` for each enclosing class template that is explicitly specialized specialization. [Example:...

2. Change 14.7.3 [temp.expl.spec] paragraph 18 as indicated:

> In an explicit specialization declaration for a member of a class template or a member template that appears in namespace scope, the member template and some of its enclosing class templates may remain unspecialized, except that the declaration shall not explicitly specialize a class member template if its enclosing class templates are not explicitly specialized as well that is, the template-id naming the template may be composed of template parameter names rather than template-arguments. In For each unspecialized template in such an explicit specialization declaration, the keyword `template` followed by a template-parameter-list shall be provided instead of the `template<>` preceding the explicit specialization declaration of the member. The types of the template-parameters in the template-parameter-list shall be the same as those specified in the primary template definition. In such declarations, an unspecialized template-id shall not precede the name of a template specialization in the qualified-id naming the member. [Example:...

Notes from the April, 2006 meeting:

The revised wording describing “unspecialized” templates needs more work to ensure that the parameter names in the template-id are in the correct order; the distinction between template arguments and parameters is also probably not clear enough. It might be better to replace this paragraph completely and avoid the “unspecialized” wording altogether.

Proposed resolution (February, 2010):

1. Change 14.7.3 [temp.expl.spec] paragraph 17 as follows:

> A member or a member template may be nested within many enclosing class templates. In an explicit specialization for such a member, the member declaration shall be preceded by a `template<>` for each enclosing class template that is explicitly specialized specialization. [Example:...

2. Change 14.7.3 [temp.expl.spec] paragraph 18 as follows:

> In an explicit specialization declaration for a member of a class template or a member template that appears in namespace scope, the member template and some of its enclosing class templates may remain unspecialized, except that the declaration shall not explicitly specialize a class member template if its enclosing class templates are not explicitly specialized as well. In such explicit specialization declaration, the keyword `template` followed by a template-parameter-list shall be provided instead of the `template<>` preceding the explicit specialization declaration of the member. The types of the template-parameters in the template-parameter-list shall be the same as those specified in the primary template definition. that is, the corresponding template prefix may specify a template-parameter-list instead of `template<>` and the template-id naming the template be written using those template-parameters as template-arguments. In such a declaration, the number, kinds, and types of the template-parameters shall be the same as those specified in the primary template definition, and the template-parameters shall be named in the template-id in the same order that they appear in the template-parameter-list. An unspecialized template-id shall not precede the name of a template specialization in the qualified-id naming the member. [Example:...

#### 727. In-class explicit specializations

Section: 14.7.3 [temp.expl.spec] Status: drafting Submitter: Faisal Vali Date: 5 October, 2008

14.7.3 [temp.expl.spec] paragraph 2 requires that explicit specializations of member templates be declared in namespace scope, not in the class definition. This restriction does not apply to partial specializations of member templates; that is,

        struct A {
          template<class T> struct B;
          template <class T> struct B<T*> { }; // well-formed
          template <> struct B<int*> { }; // ill-formed
        };

There does not seem to be a good reason for this inconsistency.

Additional note (October, 2013):

EWG has requested CWG to consider resolving this issue. See EWG issue 41.

Additional note, November, 2014:

See also paper N4090.

#### 1840. Non-deleted explicit specialization of deleted function template

Section: 14.7.3 [temp.expl.spec] Status: drafting Submitter: Richard Smith Date: 2014-01-19

The resolution of issue 941 permits a non-deleted explicit specialization of a deleted function template. For example:

      template<typename T> void f() = delete;
      decltype(f<int>()) *p;
      template<> void f<int>();

However, the existing normative wording is not adequate to handle this usage. For one thing, `=delete` is formally, at least, a function definition, and an implementation is not permitted to instantiate a function definition unless it is used; presumably, then, an implementation could not reject the `decltype` above as a reference to a deleted specialization. Furthermore, there should be a requirement that a non-deleted explicit specialization of a deleted function template must precede any reference to that specialization. (I.e., the example should be ill-formed as written but well-formed if the last two lines were interchanged.)

#### 1391. Conversions to parameter types with non-deduced template arguments

Section: 14.8.1 [temp.arg.explicit] Status: drafting Submitter: Jason Merrill Date: 2011-09-08

According to 14.8.1 [temp.arg.explicit] paragraph 6,

> Implicit conversions (Clause 4 [conv]) will be performed on a function argument to convert it to the type of the corresponding function parameter if the parameter type contains no template-parameters that participate in template argument deduction. [Note: Template parameters do not participate in template argument deduction if they are explicitly specified...

But this isn't clear about when these conversions are done. Consider

        template<class T> struct A {
           typename T::N n;
        };
        template<class T> struct B { };

        template<class T, class T2>
        void foo(const A<T>& r); // #1
        template<class T>
        void foo(const B<T>& r); // #2

        void baz() {
           B<char> b;
           foo(b); // OK
           foo<char>(b); // error
        }

With the explicit template argument, the first parameter of #1 no longer participates in template argument deduction, so implicit conversions are done. If we check for the implicit conversion during the deduction process, we end up instantiating `A<char>`, resulting in a hard error. If we wait until later to check the conversion, we can reject #1 because `T2` is not deduced and never need to consider the conversion.

But if we just accept the parameter and leave it up to normal overload resolution to reject an unsuitable candidate, that breaks this testcase:

        template<class T>
        struct A {
           typename T::N n;
        };

        template<class T>
        struct B { };

        template <class T, class... U>
        typename A<T>::value_t bar(int, T, U...);

        template <class T>
        T bar(T, T);

        void baz()
        {
           B<char> b;
           bar(b, b);
        }

Here, if deduction succeeds, we substitute in the deduced arguments of `T = B<char>, U = { }`, and end up instantiating `A<B<char>>`, which fails.

EDG and GCC currently reject the first testcase and accept the second; clang accepts both.

Notes from the October, 2012 meeting:

The position initially favored by CWG was that implicit conversions are not considered during deduction but are only applied afterwards, so the second example is ill-formed, and that the normative wording of the referenced paragraph should be moved into the note. This approach does not handle some examples currently accepted by some implementations, however; for example:

       template <class T> struct Z {
        typedef T::x xx;
       };
       template <class T> Z<T>::xx f(void *, T);
       template <class T> void f(int, T);
       struct A {} a;
       int main() {
         f(1, a); // If the implementation rules out the first overload
                  // because of the invalid conversion from int to void*,
                  // the error instantiating Z<A> will be avoided
       }

Additional discussion is required.

Notes from the April, 2013 meeting:

The approach needed to accept this code appears to be doing the convertibility check between deduction and substitution.

#### 1172. “instantiation-dependent” constructs

Section: 14.8.2 [temp.deduct] Status: drafting Submitter: Adamczyk Date: 2010-08-05

There are certain constructs that are not covered by the existing categories of “type dependent” and “value dependent.” For example, the expression `sizeof(sizeof(T()))` is neither type-dependent nor value-dependent, but its validity depends on whether `T` can be value-constructed. We should be able to overload on such characteristics and select via deduction failure, but we need a term like “instantiation-dependent” to describe these cases in the Standard. The phrase “expression involving a template parameter” seems to come pretty close to capturing this idea.

Notes from the November, 2010 meeting:

The CWG favored extending the concepts of “type-dependent” and “value-dependent” to cover these additional cases, rather than adding a new concept.

Notes from the March, 2011 meeting:

The CWG reconsidered the direction from the November, 2010 meeting, as it would make more constructs dependent, thus requiring more `template` and `typename` keywords, resulting in worse error messages, etc.

Notes from the August, 2011 meeting:

The following example (from issue 1273) was deemed relevant for this issue:

        template <class T> struct C;

        class A {
           int i;
           friend struct C<int>;
        } a;

        class B {
           int i;
           friend struct C<float>;
        } b;

        template <class T>
        struct C {
           template <class U> decltype (a.i) f() { } // #1
           template <class U> decltype (b.i) f() { } // #2
        };

        int main() {
           C<int>().f<int>();     // calls #1
           C<float>().f<float>(); // calls #2
        }

#### 1322. Function parameter type decay in templates

Section: 14.8.2 [temp.deduct] Status: drafting Submitter: Jason Merrill Date: 2011-05-19

The discussion of issue 1001 seemed to have settled on the approach of doing the 8.3.5 [dcl.fct] transformations immediately to the function template declaration, so that the original form need not be remembered. However, the example in 14.8.2 [temp.deduct] paragraph 8 suggests otherwise:

      template <class T> int f(T[5]);
      int I = f<int>(0);
      int j = f<void>(0); // invalid array

One way that might be addressed would be to separate the concepts of the type of the template that participates in overload resolution and function matching from the type of the template that is the source for template argument substitution. (See also the example in paragraph 3 of the same section.)

Notes, January, 2012:

#### 1724. Unclear rules for deduction failure

Section: 14.8.2 [temp.deduct] Status: drafting Submitter: James Widman Date: 2013-07-31

According to 14.8.2 [temp.deduct] paragraph 8,

> If a substitution results in an invalid type or expression, type deduction fails. An invalid type or expression is one that would be ill-formed, with a diagnostic required, if written using the substituted arguments.

Presumably the phrase “if written” refers to rewriting the template declaration in situ with the substituted arguments, rather than writing that type or expression at some arbitrary location, e.g.,

      void g(double) = delete;

      template<class T> auto f(T t) -> decltype(g(t));

      void g(int);

      void h() {
        typedef int T;
        T t = 42;
        g(t);  // Ok (I “wrote the substituted arguments”, and it seems fine)
        f(42); // Presumably substitution is meant to fail.
      }

Perhaps a clearer formulation could be used?

#### 1844. Defining “immediate context”

Section: 14.8.2 [temp.deduct] Status: drafting Submitter: Richard Smith Date: 2014-01-28

The handling of an example like

      template<typename T, std::size_t S = sizeof(T)> struct X {};
      template<typename T> X<T> foo(T*);
      void foo(...);

      void test() { struct S *s; foo(s); }

varies among implementations, presumably because the meaning of “immediate context” in determining whether an error is a substitution failure or a hard error is not clearly defined.

#### 1513. `initializer_list` deduction failure

Section: 14.8.2.1 [temp.deduct.call] Status: drafting Submitter: Steve Adamczyk Date: 2012-06-28

According to 14.8.2.1 [temp.deduct.call] paragraph 1,

> If removing references and cv-qualifiers from `P` gives `std::initializer_list<P'>` for some `P'` and the argument is an initializer list (8.5.4 [dcl.init.list]), then deduction is performed instead for each element of the initializer list, taking `P'` as a function template parameter type and the initializer element as its argument. Otherwise, an initializer list argument causes the parameter to be considered a non-deduced context (14.8.2.5 [temp.deduct.type]).

It is not entirely clear whether the deduction for an initializer list meeting a `std::initializer_list<T>` is a recursive subcase, or part of the primary deduction. A relevant question is: if the deduction on that part fails, does the entire deduction fail, or is the parameter to be considered non-deduced?

Notes from the October, 2012 meeting:

CWG determined that the entire deduction fails in this case.

#### 1939. Argument conversions to nondeduced parameter types revisited

Section: 14.8.2.1 [temp.deduct.call] Status: drafting Submitter: Richard Smith Date: 2014-06-11

The intent of the resolution of issue 1184 appears not to have been completely realized. In particular, the phrase, “contains no template-parameters that participate in template argument deduction” in both the note in 14.8.2.1 [temp.deduct.call] paragraph 4 and the normative wording in 14.8.1 [temp.arg.explicit] paragraph 6 is potentially misleading and probably should say something like, “contains no template-parameters outside non-deduced contexts.” Also, the normative wording should be moved to 14.8.2.1 [temp.deduct.call] paragraph 4, since it applies when there are no explicitly-specified template arguments. For example,

      template<typename T>
      void f(T, typename identity<T>::type*);

Presumably the second parameter should allow pointer conversions, even though it does contain a template-parameter that participates in deduction (via the first function parameter).

#### 1486. Base-derived conversion in member pointer deduction

Section: 14.8.2.2 [temp.deduct.funcaddr] Status: drafting Submitter: John Spicer Date: 2012-03-26

The rules for deducing template arguments when taking the address of a function template in 14.8.2.2 [temp.deduct.funcaddr] do not appear to allow for a base-to-derived conversion in a case like:

      struct Base {
        template<class U> void f(U);
      };

      struct Derived : Base { };

      int main() {
        void (Derived::*pmf)(int) = &Derived::f;
      }

Most implementations appear to allow this adjustment, however.

#### 1610. Cv-qualification in deduction of reference to array

Section: 14.8.2.4 [temp.deduct.partial] Status: drafting Submitter: Richard Smith Date: 2013-01-28

Given

       template<class C> void foo(const C* val) {}
       template<int N> void foo(const char (&t)[N]) {}

it is intuitive that the second template is more specialized than the first. However, the current rules make them unordered. In 14.8.2.4 [temp.deduct.partial] paragraph 4, we have P as `const C*` and A as `const char (&)[N]`. Paragraph 5 transforms A to `const char[N]`. Finally, paragraph 7 removes top-level cv-qualification; since a cv-qualified array element type is considered to be cv-qualification of the array (3.9.3 [basic.type.qualifier] paragraph 5, cf issue 1059), A becomes `char[N]`. P remains `const C*`, so deduction fails because of the missing `const` in A.

Notes from the April, 2013 meeting:

CWG agreed that the `const` should be preserved in the array type.

#### 1825. Partial ordering between variadic and non-variadic function templates

Section: 14.8.2.4 [temp.deduct.partial] Status: drafting Submitter: Steve Clamage Date: 2013-12-30

Given the following example,

      template <class ...T> int f(T*...)  { return 1; }
      template <class T>  int f(const T&) { return 2; }
      void g() {
        f((int*)0);
      }

the current specification makes the call ambiguous because deduction fails in both directions: with A being `T` and P being `T*` in one direction and A being `T*` and P being `T`, because 14.8.2.4 [temp.deduct.partial] paragraph 8 says,

> If A was transformed from a function parameter pack and P is not a parameter pack, type deduction fails.

It is not clear whether this is the best outcome, however; it might be better to consider the first template more specialized, with the variadic/non-variadic test being a tie-breaker if there is no other reason to prefer one over the other based on the parameter types.

Notes from the February, 2014 meeting:

CWG felt that the best approach would be, when comparing `P` and `A`, if `A` is a pack and `P` is not, `A` should be repeated for each remaining instance of `P` and then use the variadic/nonvariadic criterion as a late tiebreaker if the result is still ambiguous. This would apply in the general case (including 14.8.2.4 [temp.deduct.partial]), not just in function calls.

#### 1395. Partial ordering of variadic templates reconsidered

Section: 14.8.2.5 [temp.deduct.type] Status: drafting Submitter: John Spicer Date: 2011-09-21

The resolution of issue 692 (found in document N3281) made the following example ambiguous and thus ill-formed:

        template<class T>
        void print(ostream &os, const T &t) {
            os << t;
        }

        template <class T, class... Args>
        void print(ostream &os, const T &t, const Args&... rest) {
            os << t << ", ";
            print(os, rest...);
        }

        int main() {
            print(cout, 42);
            print(cout, 42, 1.23);
        }

This pattern seems fairly intuitive; is it reason to reconsider or modify the outcome of issue 692?

(See also issue 1432.)

Notes from the October, 2012 meeting:

CWG agreed that the example should be accepted, handling this case as a late tiebreaker, preferring an omitted parameter over a parameter pack.

Additional note (March, 2013):

For another example:

      template<typename ...T> int f(T*...) {
        return 1;
      }
      template<typename T> int f(const T&) {
        return 2;
      }
      int main() {
        if (f((int*)0) != 1) {
           return 1;
        }
        return 0;
      }

This worked as expected prior to the resolution of issue 692.

#### 1847. Clarifying compatibility during partial ordering

Section: 14.8.2.5 [temp.deduct.type] Status: drafting Submitter: Jason Merrill Date: 2014-01-30

There is implementation divergence in the handling of an example like

      template<typename D> struct A { };
      template<typename T> struct Wrap1 { typedef T type; };
      template<typename T> struct Wrap2 { typedef T type; };

      template<typename T1>
      A<typename Wrap1<T1>::type>
      fn(const A<T1>& x, const A<T1>& y);

      template<typename T2, typename U>
      A<typename Wrap2<T2>::type>
      fn(const A<T2>& x, const A<U>& y);

      A<int> (*p)(const A<int>&, const A<int>&) = fn;

The implementations that accept this example do so by not comparing the return types of the two templates during partial ordering, which seems to make sense given that partial ordering would not have been performed if the candidate specializations were not indistinguishable from the perspective of overload resolution. However, the existing wording is not clear that that is how such types are be handled.

#### 1863. Requirements on thrown object type to support `std::current_exception()`

Section: 15.1 [except.throw] Status: drafting Submitter: Canada Date: 2013-09-22
N3690 comment CA 12

The specification of `std::current_exception()` in 18.8.5 [propagation] allows either referring to the exception object itself or to a copy thereof, implying that the exception object must be copyable. However, the specification of throw-expression allows throwing objects that cannot be copied, only moved. Presumably the requirements should include a non-deleted accessible copy constructor that is odr-used by a throw-expression, even if the object being thrown is moved to the exception object.

Additional note, February, 2014:

This issue was referred to CWG by EWG at the September, 2013 meeting but was overlooked at that time.

#### 1975. Permissible declarations for exception-specifications

Section: 15.4 [except.spec] Status: drafting Submitter: Richard Smith Date: 2014-07-18

The declarations in which an exception-specification may appear is not completely clear from the current wording of 15.4 [except.spec] paragraph 2.

Suggested resolution:

Change 15.4 [except.spec] paragraph 2 as follows:

> An exception-specification shall appear only on a function declarator for a function type, pointer to function type, reference to function type, or pointer to member function type that is the top-level type of a declaration or definition of a function, variable, or non-static data member, or on such a type appearing as a parameter or return type in such a function declarator. An exception-specification shall not appear in a typedef declaration or alias-declaration. [Example:...

See also issues 2010, 1995, 1946, and 1798.

#### 2001. non-directive is underspecified

Section: 16 [cpp] Status: drafting Submitter: Richard Smith Date: 2014-09-10

The Standard needs to describe non-directives more fully, e.g., whether they are ill-formed, conditionally-supported, etc. Since they are, in fact, directives, a different name might also be in order.

#### 1436. Interaction of constant expression changes with preprocessor expressions

Section: 16.1 [cpp.cond] Status: drafting Submitter: Richard Smith Date: 2012-01-02

It appears that some of the recent changes to the description of constant expressions have allowed constructs into preprocessor expressions that do not belong there. Some changes are required to restrict the current capabilities of constant expressions to what is intended to be allowed in preprocessor expressions.

Proposed resolution (February, 2012):

1. Change 16.1 [cpp.cond] paragraph 2 as follows:

> Each preprocessing token that remains (in the list of preprocessing tokens that will become the controlling expression) after all macro replacements have occurred shall be in the lexical form of a token (2.6 [lex.token]). Any such token that is a literal (2.13.1 [lex.literal.kinds]) shall be an integer-literal, a character-literal, or a boolean-literal.

2. Change 16.1 [cpp.cond] paragraph 4 as follows:

> ...using arithmetic that has at least the ranges specified in 18.3 [support.limits]. The only operators permitted in the controlling constant expression are `?:`, `||`, `&&`, `|`, `^`, `&`, `==`, `!=`, `<`, `<=`, `>`, `>=`, `<<`, `>>`, `-`, `+`, `*`, `/`, `%`, `!`, and `~`. For the purposes of this token conversion...

#### 1718. Macro invocation spanning end-of-file

Section: 16.3 [cpp.replace] Status: drafting Submitter: David Krauss Date: 2013-07-23

Although it seems to be common implementation practice to reject a macro invocation that begins in a header file and whose closing right parenthesis appears in the file that included it, there does not seem to be a prohibition of this case in the specification of function-style macros. Should this be accepted?

Notes from the February, 2014 meeting:

CWG agreed that macro invocations spanning file boundaries should be prohibited. Resolution of this issue should be coordinated with WG14.

#### 2003. Zero-argument macros incorrectly specified

Section: 16.3 [cpp.replace] Status: drafting Submitter: Richard Smith Date: 2014-09-12

According to 16.3 [cpp.replace] paragraph 4,

> If the identifier-list in the macro definition does not end with an ellipsis, the number of arguments (including those arguments consisting of no preprocessing tokens) in an invocation of a function-like macro shall equal the number of parameters in the macro definition.

That is, a sequence of no preprocessing tokens counts as an argument. That phrasing has problems with zero-argument function-like macros, e.g.,

      #define M()
      M();

`M` is defined as having no parameters but the invocation has one (empty) argument, which does not match the number of parameters in the definition.

#### 1335. Stringizing, extended characters, and universal-character-names

Section: 16.3.2 [cpp.stringize] Status: drafting Submitter: Johannes Schaub Date: 2011-07-03

When a string literal containing an extended character is stringized (16.3.2 [cpp.stringize]), the result contains a universal-character-name instead of the original extended character. The reason is that the extended character is translated to a universal-character-name in translation phase 1 (2.2 [lex.phases]), so that the string literal `"@"` (where `@` represents an extended character) becomes `"\uXXXX"`. Because the preprocessing token is a string literal, when the stringizing occurs in translation phase 4, the `\` is doubled, and the resulting string literal is `"\"\\uXXXX\""`. As a result, the universal-character-name is not recognized as such when the translation to the execution character set occurs in translation phase 5. (Note that phase 5 translation does occur if the stringized extended character does not appear in a string literal.) Existing practice appears to ignore these rules and preserve extended characters in stringized string literals, however.

See also issue 578.

Additional note (August, 2013):

Implementations are granted substantial latitude in their handling of extended characters and universal-character-names in 2.2 [lex.phases] paragraph 1 phase 1, i.e.,

> (An implementation may use any internal encoding, so long as an actual extended character encountered in the source file, and the same extended character expressed in the source file as a universal-character-name (i.e., using the `\uXXXX` notation), are handled equivalently except where this replacement is reverted in a raw string literal.)

However, this freedom is mostly nullified by the requirements of stringizing in 16.3.2 [cpp.stringize] paragraph 2:

> If, in the replacement list, a parameter is immediately preceded by a `#` preprocessing token, both are replaced by a single character string literal preprocessing token that contains the spelling of the preprocessing token sequence for the corresponding argument.

This means that, in order to handle a construct like

      #define STRINGIZE_LITERAL( X ) # X
      #define STRINGIZE( X ) STRINGIZE_LITERAL( X )

      STRINGIZE( STRINGIZE( identifier_\u00fC\U000000Fc ) )

an implementation must recall the original spelling, including the form of UCN and the capitalization of any non-numeric hexadecimal digits, rather than simply translating the characters into a convenient internal representation.

To effect the freedom asserted in 2.2 [lex.phases], the description of stringizing should make the spelling of a universal-character-name implementation-defined.

#### 1709. Stringizing raw string literals containing newline

Section: 16.3.2 [cpp.stringize] Status: drafting Submitter: David Krauss Date: 2013-07-01

Stringizing a raw string literal containing a newline produces an invalid (unterminated) string literal and hence results in undefined behavior. It should be specified that a newline in a string literal is transformed to the two characters `'\' 'n'` in the resulting string literal.

A slightly related case involves stringizing a bare backslash character: because backslashes are only escaped within a string or character literal, a stringized bare backslash becomes `"\"`, which is invalid and hence results in undefined behavior.

#### 1279. Additional differences between C++ 2003 and C++ 2011

Section: C.2 [diff.cpp03] Status: drafting Submitter: Nikolay Ivchenkov Date: 2011-03-27

A number of differences between C++03 and C++11 were omitted from C.2 [diff.cpp03]:

- New keywords. Although these are said in C.2.1 [diff.cpp03.lex] only to invalidate C++03 code, they can also change the meaning, e.g., `thread_local x(y)`, which would declare a variable `thread_local` initialized with `y` in C++03 and a thread-local variable `y` in C++11.

- New deduction rules.

- Removal of the deprecated string literal conversion.

- When a `friend` function defined in a class template is actually defined (i.e., with each instantiation or only when odr-used).

- Removal of access declarations.

- Use of the injected-class-name of a class template as a template template-argument.

Additional note (January, 2012):

In addition to the items previously mentioned, access declarations were removed from C++11 but are not mentioned in C.2 [diff.cpp03].

Proposed (partial) resolution (February, 2012):

Add the following as a new section in C.2 [diff.cpp03]:

> C.2.5 Clause 11 [class.access]: member access control | pdiff.cpp03.class.access

> Change: Remove access declarations.

> Rationale: Removal of feature deprecated since C++ 1998.

> Effect on original feature: Valid C++ 2003 code that uses access declarations is ill-formed in this International Standard. Instead, using-declarations (7.3.3 [namespace.udecl]) can be used.

#### 2031. Missing incompatibility for `&&`

Section: C.2.3 [diff.cpp03.expr] Status: drafting Submitter: Melissa Mears Date: 2014-10-31

The introduction of rvalue references in C++11 changed the interpretation of some previously well-formed examples such as the following:

      struct Struct { template <typename T> operator T(); };
      bool example_1 = new int && false;               // #1
      bool example_2 = &Struct::operator int && false; // #2

Previously the `&&` was interpreted as an operator, while it is now part of a type-name. However, this change is not mentioned in Annex C [diff].

### Issues with "Open" Status

#### 916. Does a reference type have a destructor?

Section: _N2914_.14.10.2.1 [concept.map.fct] Status: open Submitter: James Widman Date: 12 June, 2009

Is the following well-formed?

        auto concept HasDestructor<typename T> {
          T::~T();
        }

        concept_map HasDestructor<int&> { }

According to _N2914_.14.10.2.1 [concept.map.fct] paragraph 4, the destructor requirement in the concept map results in an expression `x.~X()`, where `X` is the type `int&`. According to 5.2.4 [expr.pseudo], this expression is ill-formed because the object type and the type-name must be the same type, but the object type cannot be a reference type (references are dropped from types used in expressions, 5 [expr] paragraph 5).

It is not clear whether this should be addressed by changing 5.2.4 [expr.pseudo] or _N2914_.14.10.2.1 [concept.map.fct].

#### 783. Definition of “argument”

Section: 1.3 [intro.defs] Status: open Submitter: UK Date: 3 March, 2009
N2800 comment UK 3

The definition of an argument does not seem to cover many assumed use cases, and we believe that is not intentional. There should be answers to questions such as: Are lambda-captures arguments? Are type names in a throw-spec arguments? “Argument” to casts, typeid, alignof, alignas, decltype and sizeof? why in x[arg] arg is not an argument, but the value forwarded to operator[]() is? Does not apply to operators as call-points not bounded by parentheses? Similar for copy initialization and conversion? What are deduced template “arguments?” what are “default arguments?” can attributes have arguments? What about concepts, requires clauses and concept_map instantiations? What about user-defined literals where parens are not used?

#### 949. Requirements for freestanding implementations

Section: 1.4 [intro.compliance] Status: open Submitter: Detlef Vollman Date: 2 August, 2009

According to 1.4 [intro.compliance] paragraph 7,

> A freestanding implementation is one in which execution may take place without the benefit of an operating system, and has an implementation-defined set of libraries that includes certain language-support libraries (17.6.1.3 [compliance]).

This definition links two relatively separate topics: the lack of an operating system and the minimal set of libraries. Furthermore, 3.6.1 [basic.start.main] paragraph 1 says:

> [Note: in a freestanding environment, start-up and termination is implementation-defined; start-up contains the execution of constructors for objects of namespace scope with static storage duration; termination contains the execution of destructors for objects with static storage duration. —end note]

It would be helpful if the two characteristics (lack of an operating system and restricted set of libraries) were named separately and if these statements were clarified to identify exactly what is implementation-defined.

Notes from the October, 2009 meeting:

The CWG felt that it needed a specific proposal in a paper before attempting to resolve this issue.

#### 1953. Data races and common initial sequence

Section: 1.7 [intro.memory] Status: open Submitter: Faisal Vali Date: 2014-06-23

According to 1.7 [intro.memory] paragraph 3,

> A memory location is either an object of scalar type or a maximal sequence of adjacent bit-fields all having non-zero width. [Note: Various features of the language, such as references and virtual functions, might involve additional memory locations that are not accessible to programs but are managed by the implementation. —end note] Two or more threads of execution (1.10 [intro.multithread]) can update and access separate memory locations without interfering with each other.

It is not clear how this relates to the permission granted in 9.2 [class.mem] paragraph 18 to inspect the common initial sequence of standard-layout structs that are members of a standard-layout union. If one thread is writing to the common initial sequence and another is reading from it via a different struct, that should constitute a data race, but the current wording does not clearly state that.

#### 698. The definition of “sequenced before” is too narrow

Section: 1.9 [intro.execution] Status: open Submitter: Jens Maurer Date: 13 July, 2008

According to 1.9 [intro.execution] paragraph 14, “sequenced before” is a relation between “evaluations.” However, 3.6.3 [basic.start.term] paragraph 3 says,

> If the completion of the initialization of a non-local object with static storage duration is sequenced before a call to `std::atexit` (see `<cstdlib>`, 18.5 [support.start.term]), the call to the function passed to `std::atexit` is sequenced before the call to the destructor for the object. If a call to `std::atexit` is sequenced before the completion of the initialization of a non-local object with static storage duration, the call to the destructor for the object is sequenced before the call to the function passed to `std::atexit`. If a call to `std::atexit` is sequenced before another call to `std::atexit`, the call to the function passed to the second `std::atexit` call is sequenced before the call to the function passed to the first `std::atexit` call.

Except for the calls to `std::atexit`, these events do not correspond to “evaluation” of expressions that appear in the program. If the “sequenced before” relation is to be applied to them, a more comprehensive definition is needed.

#### 578. Phase 1 replacement of characters with universal-character-names

Section: 2.2 [lex.phases] Status: open Submitter: Martin Vejnár Date: 7 May 2006

According to 2.2 [lex.phases] paragraph 1, in translation phase 1,

> Any source file character not in the basic source character set (2.3 [lex.charset]) is replaced by the universal-character-name that designates that character.

If a character that is not in the basic character set is preceded by a backslash character, for example

        "\á"

the result is equivalent to

        "\\u00e1"

that is, a backslash character followed by the spelling of the universal-character-name. This is different from the result in C99, which accepts characters from the extended source character set without replacing them with universal-character-names.

See also issue 1335.

#### 1698. Files ending in `\`

Section: 2.2 [lex.phases] Status: open Submitter: David Krauss Date: 2013-06-10

The description of how to handle file not ending in a newline in 2.2 [lex.phases] paragraph 1, phase 2, is:

2. Each instance of a backslash character (`\`) immediately followed by a new-line character is deleted, splicing physical source lines to form logical source lines. Only the last backslash on any physical source line shall be eligible for being part of such a splice. If, as a result, a character sequence that matches the syntax of a universal-character-name is produced, the behavior is undefined. A source file that is not empty and that does not end in a new-line character, or that ends in a new-line character immediately preceded by a backslash character before any such splicing takes place, shall be processed as if an additional new-line character were appended to the file.

This is not clear regarding what happens if the last character in the file is a backslash. In such a case, presumably the result of adding the newline should not be a line splice but rather a backslash preprocessing-token (that will be diagnosed as an invalid token in phase 7), but that should be spelled out.

#### 1403. Universal-character-names in comments

Section: 2.7 [lex.comment] Status: open Submitter: David Krauss Date: 2011-10-05

According to 2.3 [lex.charset] paragraph 2,

> If the hexadecimal value for a universal-character-name corresponds to a surrogate code point (in the range 0xD800-0xDFFF, inclusive), the program is ill-formed. Additionally, if the hexadecimal value for a universal-character-name outside the c-char-sequence, s-char-sequence, or r-char-sequence of a character or string literal corresponds to a control character (in either of the ranges 0x00-0x1F or 0x7F-0x9F, both inclusive) or to a character in the basic source character set, the program is ill-formed.

These restrictions should not apply to comment text. Arguably the prohibitions of control characters and characters in the basic character set already do not apply, as they require that the preprocessing tokens for literals have already been recognized; this occurs in phase 3, which also replaces comments with single spaces. However, the prohibition of surrogate code points is not so limited and might conceivably be applied within comments.

Probably the most straightforward way of addressing this problem would be simply to state in 2.7 [lex.comment] that character sequences that resemble universal-character-names are not recognized as such within comment text.

#### 1972. Identifier character restrictions in non-identifiers

Section: 2.10 [lex.name] Status: open Submitter: Richard Smith Date: 2014-07-15

According to 2.10 [lex.name] paragraph 1,

> Each universal-character-name in an identifier shall designate a character whose encoding in ISO 10646 falls into one of the ranges specified in E.1 [charname.allowed].

However, identifier-nondigit is also used in the grammar for pp-number. Should this restriction also be understood to apply in that non-identifier context?

#### 411. Use of universal-character-name in character versus string literals

Section: 2.13.5 [lex.string] Status: open Submitter: James Kanze Date: 23 Apr 2003

2.13.5 [lex.string] paragraph 5 reads

> Escape sequences and universal-character-names in string literals have the same meaning as in character literals, except that the single quote ' is representable either by itself or by the escape sequence \', and the double quote " shall be preceded by a \. In a narrow string literal, a universal-character-name may map to more than one char element due to multibyte encoding.

The first sentence refers us to 2.13.3 [lex.ccon], where we read in the first paragraph that "An ordinary character literal that contains a single c-char has type char [...]." Since the grammar shows that a universal-character-name is a c-char, something like '\u1234' must have type char (and thus be a single char element); in paragraph 5, we read that "A universal-character-name is translated to the encoding, in the execution character set, of the character named. If there is no such encoding, the universal-character-name is translated to an implemenation-defined encoding."

This is in obvious contradiction with the second sentence. In addition, I'm not really clear what is supposed to happen in the case where the execution (narrow-)character set is UTF-8. Consider the character \u0153 (the oe in the French word oeuvre). Should '\u0153' be a char, with an "error" value, say '?' (in conformance with the requirement that it be a single char), or an int, with the two char values 0xC5, 0x93, in an implementation defined order (in conformance with the requirement that a character representable in the execution character set be represented). Supposing the former, should "\u0153" be the equivalent of "?" (in conformance with the first sentence), or "\xC5\x93" (in conformance with the second).

Notes from October 2003 meeting:

We decided we should forward this to the C committee and let them resolve it. Sent via e-mail to John Benito on November 14, 2003.

Reply from John Benito:

> I talked this over with the C project editor, we believe this was handled by the C committee before publication of the current standard.

> WG14 decided there needed to be a more restrictive rule for one-to-one mappings: rather than saying "a single c-char" as C++ does, the C standard says "a single character that maps to a single-byte execution character"; WG14 fully expect some (if not many or even most) UCNs to map to multiple characters.

> Because of the fundamental differences between C and C++ character types, I am not sure the C committee is qualified to answer this satisfactorily for WG21. WG14 is willing to review any decision reached for compatibility.

> I hope this helps.

(See also issue 912 for a related question.)

#### 1266. user-defined-integer-literal overflow

Section: 2.13.8 [lex.ext] Status: open Submitter: Michael Wong Date: 2011-03-20

The decimal-literal in a user-defined-integer-literal might be too large for an `unsigned long long` to represent (in implementations with extended integer types). In such cases, the original intent appears to have been to call a raw literal operator or a literal operator template; however, the existing wording of 2.13.8 [lex.ext] paragraph 3 always calls the `unsigned long long` literal operator if it exists, regardless of the value of the decimal-literal.

#### 1209. Is a potentially-evaluated expression in a template definition a “use?”

Section: 3.2 [basic.def.odr] Status: open Submitter: Johannes Schaub Date: 2010-10-08

Consider the following complete program:

        void f();
        template<typename T> void g() { f(); }
        int main() { }

Must `f()` be defined to make this program well-formed? The current wording of 3.2 [basic.def.odr] does not make any special provision for expressions that appear only in uninstantiated template definitions.

(See also issue 1254.)

#### 2009. Unclear specification of class scope

Section: 3.3.7 [basic.scope.class] Status: open Submitter: Richard Smith Date: 2014-09-23

Point 2 of the rules of class scope in 3.3.7 [basic.scope.class] paragraph 1 says,

> A name `N` used in a class `S` shall refer to the same declaration in its context and when re-evaluated in the completed scope of `S`. No diagnostic is required for a violation of this rule.

It is not clear that this provision does not apply to names appearing in function bodies, default arguments, exception-specifications, and brace-or-equal-initializers. It is also not clear what it means to “re-evaluate” a name.

One possible approach to this problem would be to say that all names declared in a class are visible throughout the class and simply make it ill-formed to refer to a name that has not been declared yet in the contexts in which that is problematic, such as types and template arguments.

In addition, the fourth point says,

> A name declared within a member function hides a declaration of the same name whose scope extends to or past the end of the member function's class.

This rule is unneeded, as it simply restates the normal hiding rule in 3.3.1 [basic.scope.declarative] paragraph 1:

> The scope of a declaration is the same as its potential scope unless the potential scope contains another declaration of the same name. In that case, the potential scope of the declaration in the inner (contained) declarative region is excluded from the scope of the declaration

#### 191. Name lookup does not handle complex nesting

Section: 3.4.1 [basic.lookup.unqual] Status: open Submitter: Alan Nash Date: 29 Dec 1999

The current description of unqualified name lookup in 3.4.1 [basic.lookup.unqual] paragraph 8 does not correctly handle complex cases of nesting. The Standard currently reads,

> A name used in the definition of a function that is a member function (9.3) of a class `X` shall be declared in one of the following ways:
> - before its use in the block in which it is used or in an enclosing block (6.3), or
> - shall be a member of class `X` or be a member of a base class of `X` (10.2), or
> - if `X` is a nested class of class `Y` (9.7), shall be a member of `Y`, or shall be a member of a base class of `Y` (this lookup applies in turn to `Y`'s enclosing classes, starting with the innermost enclosing class), or
> - if `X` is a local class (9.8) or is a nested class of a local class, before the definition of class `X` in a block enclosing the definition of class `X`, or
> - if `X` is a member of namespace `N`, or is a nested class of a class that is a member of `N`, or is a local class or nested class within a local class of a function that is a member of `N`, before the member function definition, in namespace `N` or in one of `N`'s enclosing namespaces.

In particular, this formulation does not handle the following example:

        struct outer {
            static int i;
            struct inner {
                void f() {
                    struct local {
                        void g() {
                            i = 5;
                        }
                    };
                }
            };
        };

Here the reference to `i` is from a member function of a local class of a member function of a nested class. Nothing in the rules allows `outer::i` to be found, although intuitively it should be found.

A more comprehensive formulation is needed that allows traversal of any combination of blocks, local classes, and nested classes. Similarly, the final bullet needs to be augmented so that a function need not be a (direct) member of a namespace to allow searching that namespace when the reference is from a member function of a class local to that function. That is, the current rules do not allow the following example:

        int j;    // global namespace
        struct S {
            void f() {
                struct local2 {
                    void g() {
                        j = 5;
                    }
                };
            }
        };

#### 405. Unqualified function name lookup

Section: 3.4.1 [basic.lookup.unqual] Status: open Submitter: William M. Miller Date: 14 Apr 2003

There seems to be some confusion in the Standard regarding the relationship between 3.4.1 [basic.lookup.unqual] (Unqualified name lookup) and 3.4.2 [basic.lookup.argdep] (Argument-dependent lookup). For example, 3.4.1 [basic.lookup.unqual] paragraph 3 says,

> The lookup for an unqualified name used as the postfix-expression of a function call is described in 3.4.2 [basic.lookup.argdep].

In other words, nothing in 3.4.1 [basic.lookup.unqual] applies to function names; the entire lookup is described in 3.4.2 [basic.lookup.argdep].

3.4.2 [basic.lookup.argdep] does not appear to share this view of its responsibility. The closest it comes is in 3.4.2 [basic.lookup.argdep] paragraph 2a:

> ...the set of declarations found by the lookup of the function name is the union of the set of declarations found using ordinary unqualified lookup and the set of declarations found in the namespaces and classes associated with the argument types.

Presumably, "ordinary unqualified lookup" is a reference to the processing described in 3.4.1 [basic.lookup.unqual], but, as noted above, 3.4.1 [basic.lookup.unqual] explicitly precludes applying that processing to function names. The details of "ordinary unqualified lookup" of function names are not described anywhere.

The other clauses that reference 3.4.2 [basic.lookup.argdep], clauses 13 [over] and 14 [temp], are split over the question of the relationship between 3.4.1 [basic.lookup.unqual] and 3.4.2 [basic.lookup.argdep]. 13.3.1.1.1 [over.call.func] paragraph 3, for instance, says

> The name is looked up in the context of the function call following the normal rules for name lookup in function calls (3.4.2 [basic.lookup.argdep]).

I.e., this reference assumes that 3.4.2 [basic.lookup.argdep] is self-contained. The same is true of 13.3.1.2 [over.match.oper] paragraph 3, second bullet:

> The set of non-member candidates is the result of the unqualified lookup of operator@ in the context of the expression according to the usual rules for name lookup in unqualified function calls (3.4.2 [basic.lookup.argdep]), except that all member functions are ignored.

On the other hand, however, 14.6.4.2 [temp.dep.candidate] paragraph 1 explicitly assumes that 3.4.1 [basic.lookup.unqual] and 3.4.2 [basic.lookup.argdep] are both involved in function name lookup and do different things:

> For a function call that depends on a template parameter, if the function name is an unqualified-id but not a template-id, the candidate functions are found using the usual lookup rules (3.4.1 [basic.lookup.unqual], 3.4.2 [basic.lookup.argdep]) except that:
> - For the part of the lookup using unqualified name lookup (3.4.1 [basic.lookup.unqual]), only function declarations with external linkage from the template definition context are found.
> - For the part of the lookup using associated namespaces (3.4.2 [basic.lookup.argdep]), only function declarations with external linkage found in either the template definition context or the template instantiation context are found.

Suggested resolution:

Change 3.4.1 [basic.lookup.unqual] paragraph 1 from

> ...name lookup ends as soon as a declaration is found for the name.

to

> ...name lookup ends with the first scope containing one or more declarations of the name.

Change the first sentence of 3.4.1 [basic.lookup.unqual] paragraph 3 from

> The lookup for an unqualified name used as the postfix-expression of a function call is described in 3.4.2 [basic.lookup.argdep].

to

> An unqualified name used as the postfix-expression of a function call is looked up as described below. In addition, argument-dependent lookup (3.4.2 [basic.lookup.argdep]) is performed on this name to complete the resulting set of declarations.

#### 1200. Lookup rules for template parameters

Section: 3.4.1 [basic.lookup.unqual] Status: open Submitter: Johannes Schaub Date: 2010-09-18

Although 3.3.9 [basic.scope.temp] now describes the scope of a template parameter, the description of unqualified name lookup in 3.4.1 [basic.lookup.unqual] do not cover uses of template parameter names. The note in 3.4.1 [basic.lookup.unqual] paragraph 16 says,

> the rules for name lookup in template definitions are described in 14.6 [temp.res].

but the rules there cover dependent and non-dependent names, not template parameters themselves.

#### 1771. Restricted lookup in nested-name-specifier

Section: 3.4.3 [basic.lookup.qual] Status: open Submitter: Canada Date: 2013-09-24
N3690 comment CA 21

Consider the following example:

      template <typename T> struct B { };
      namespace N {
        namespace L {
          template <int> void A();
        }
        namespace M {
          template <int> struct A { typedef int y; };
        }
        using namespace L;
        using namespace M;
      }
      B<N::/*template */A<0>::y> (x);

Which `A` is referenced in the last line? According to 3.4.3 [basic.lookup.qual] paragraph 1,

> If a `::` scope resolution operator in a nested-name-specifier is not preceded by a decltype-specifier, lookup of the name preceding that `::` considers only namespaces, types, and templates whose specializations are types.

It is not clear whether this applies to the example or not, and the interpretation of the `<` token depends on the result of the lookup.

Notes from the September, 2013 meeting:

The restricted lookup mentioned in 3.4.3 [basic.lookup.qual] paragraph 1 is based on a one-token lookahead; because the next token following `A` in the example is not `::`, the restricted lookup does not apply, and the result is ambiguous. Uncommenting the `template` keyword in the example does not affect the lookup.

#### 562. qualified-ids in non-expression contexts

Section: 3.4.3.1 [class.qual] Status: open Submitter: Mike Miller Date: 6 April 2006

Both 3.4.3.1 [class.qual] and 3.4.3.2 [namespace.qual] specify that some lookups are to be performed “in the context of the entire postfix-expression,” ignoring the fact that qualified-ids can appear outside of expressions.

It was suggested in document J16/05-0156 = WG21 N1896 that these uses be changed to “the context in which the qualified-id occurs,” but it isn't clear that this formulation adequately covers all the places a qualified-id can occur.

#### 278. External linkage and nameless entities

Section: 3.5 [basic.link] Status: open Submitter: Daveed Vandevoorde Date: 12 Apr 2000

It is unclear to what extent entities without names match across translation units. For example,

        struct S {
           int :2;
           enum { a, b, c } x;
           static class {} *p;
        };

If this declaration appears in multiple translation units, are all these members "the same" in each declaration?

A similar question can be asked about non-member declarations:

        // Translation unit 1:
        extern enum { d, e, f } y;

        // Translation unit 2:
        extern enum { d, e, f } y;

        // Translation unit 3:
        enum { d, e, f } y;

Is this valid C++? Is it valid C?

James Kanze: `S::p` cannot be defined, because to do so requires a type specifier and the type cannot be named. `::y` is valid C because C only requires compatible, not identical, types. In C++, it appears that there is a new type in each declaration, so it would not be valid. This differs from `S::x` because the unnamed type is part of a named type — but I don't know where or if the Standard says that.

John Max Skaller: It's not valid C++, because the type is a synthesised, unique name for the enumeration type which differs across translation units, as if:

        extern enum _synth1 { d,e,f} y;
        ..
        extern enum _synth2 { d,e,f} y;

had been written.

However, within a class, the ODR implies the types are the same:

        class X { enum { d } y; };

in two translation units ensures that the type of member `y` is the same: the two `X`'s obey the ODR and so denote the same class, and it follows that there's only one member `y` and one type that it has.

(See also issues 132 and 216.)

#### 279. Correspondence of "names for linkage purposes"

Section: 3.5 [basic.link] Status: open Submitter: Daveed Vandevoorde Date: 4 Apr 2001

The standard says that an unnamed class or enum definition can be given a "name for linkage purposes" through a typedef. E.g.,

        typedef enum {} E;
        extern E *p;

can appear in multiple translation units.

How about the following combination?

        // Translation unit 1:
        struct S;
        extern S *q;

        // Translation unit 2:
        typedef struct {} S;
        extern S *q;

Is this valid C++?

Also, if the answer is "yes", consider the following slight variant:

        // Translation unit 1:
        struct S {};  // <<-- class has definition
        extern S *q;

        // Translation unit 2:
        typedef struct {} S;
        extern S *q;

Is this a violation of the ODR because two definitions of type `S` consist of differing token sequences?

#### 338. Enumerator name with linkage used as class name in other translation unit

Section: 3.5 [basic.link] Status: open Submitter: Daveed Vandevoorde Date: 26 Feb 2002

The following declarations are allowed within a translation unit:

      struct S;
      enum { S };

However, 3.5 [basic.link] paragraph 9 seems to say these two declarations cannot appear in two different translation units. That also would mean that the inclusion of a header containing the above in two different translation units is not valid C++.

I suspect this is an oversight and that users should be allowed to have the declarations above appear in different translation units. (It is a fairly common thing to do, I think.)

Mike Miller: I think you meant "`enum E { S };`" -- enumerators only have external linkage if the enumeration does (3.5 [basic.link] paragraph 4), and 3.5 [basic.link] paragraph 9 only applies to entities with external linkage.

I don't remember why enumerators were given linkage; I don't think it's necessary for mangling non-type template arguments. In any event, I can't think why cross-TU name collisions between enumerators and other entities would cause a problem, so I guess a change here would be okay. I can think of three changes that would have that effect:

1. Saying that enumerators do not have linkage.
2. Removing enumerators from the list of entities in the first sentence of 3.5 [basic.link] paragraph 9.
3. Saying that it's okay for an enumerator in one TU to have the same name as a class type in another TU only if the enumerator hides that same class type in both TUs (the example you gave).

Daveed Vandevoorde: I don't think any of these are sufficient in the sense that the problem isn't limited to enumerators. E.g.:

      struct X;
      extern void X();

shouldn't create cross-TU collisions either.

Mike Miller: So you're saying that cross-TU collisions should only be prohibited if both names denote entities of the same kind (both functions, both objects, both types, etc.), or if they are both references (regardless of what they refer to, presumably)?

Daveed Vandevoorde: Not exactly. Instead, I'm saying that if two entities (with external linkage) can coexist when they're both declared in the same translation unit (TU), then they should also be allowed to coexist when they're declared in two different translation units.

For example:

      int i;
      void i();  // Error

This is an error within a TU, so I don't see a reason to make it valid across TUs.

However, "tag names" (class/struct/union/enum) can sometimes coexist with identically named entities (variables, functions & enumerators, but not namespaces, templates or type names).

#### 371. Interleaving of constructor calls

Section: 3.6.2 [basic.start.init] Status: open Submitter: Matt Austern Date: 7 August 2002

Is a compiler allowed to interleave constructor calls when performing dynamic initialization of nonlocal objects? What I mean by interleaving is: beginning to execute a particular constructor, then going off and doing something else, then going back to the original constructor. I can't find anything explicit about this in clause 3.6.2 [basic.start.init].

I'll present a few different examples, some of which get a bit wild. But a lot of what this comes down to is exactly what the standard means when it talks about the order of initialization. If it says that some object x must be initialized before a particular event takes place, does that mean that x's constructor must be entered before that event, or does it mean that it must be exited before that event? If object x must be initialized before object y, does that mean that x's constructor must exit before y's constructor is entered?

(The answer to that question might just be common sense, but I couldn't find an answer in clause 3.6.2 [basic.start.init]. Actually, when I read 3.6.2 [basic.start.init] carefully, I find there are a lot of things I took for granted that aren't there.)

OK, so a few specific scenerios.

1. We have a translation unit with nonlocal objects A and B, both of which require dynamic initialization. A comes before B. A must be initialized before B. May the compiler start to construct A, get partway through the constructor, then construct B, and then go back to finishing A?
2. We have a translation unit with nonlocal object A and function f. Construction of A is deferred until after the first statement of main. A must be constructed before the first use of f. Is the compiler permitted to start constructing A, then execute f, then go back to constructing A?
3. We have nonlocal objects A and B, in two different translation units. The order in which A and B are constructed is unspecified by the Standard. Is the compiler permitted to begin constructing A, then construct B, then finish A's constructor? Note the implications of a 'yes' answer. If A's and B's constructor both call some function f, then the call stack might look like this:

          <runtime gunk>
            <Enter A's constructor>
               <Enter f>
                  <runtime gunk>
                     <Enter B's constructor>
                        <Enter f>
                        <Leave f>
                     <Leave B's constructor>
               <Leave f>
            <Leave A's constructor>

   The implication of a 'yes' answer for users is that any function called by a constructor, directly or indirectly, must be reentrant.
4. This last example is to show why a 'no' answer to #3 might be a problem too. New scenerio: we've got one translation unit containing a nonlocal object A and a function f1, and another translation unit containing a nonlocal object B and a function f2. A's constructor calls f2. Initialization of A and B is deferred until after the first statement of main(). Someone in main calls f1. Question: is the compiler permitted to start constructing A, then go off and construct B at some point before f2 gets called, then go back and finish constructing A? In fact, is the compiler required to do that? We've got an unpleasant tension here between the bad implications of a 'yes' answer to #3, and the explicit requirement in 3.6.2 [basic.start.init] paragraph 3.

At this point, you might be thinking we could avoid all of this nonsense by removing compilers' freedom to defer initialization until after the beginning of main(). I'd resist that, for two reasons. First, it would be a huge change to make after the standard has been out. Second, that freedom is necessary if we want to have support for dynamic libraries. I realize we don't yet say anything about dynamic libraries, but I'd hate to make decisions that would make such support even harder.

#### 1659. Initialization order of thread_local template static data members

Section: 3.6.2 [basic.start.init] Status: open Submitter: Richard Smith Date: 2013-04-14

According to 3.6.2 [basic.start.init] paragraph 5,

> It is implementation-defined whether the dynamic initialization of a non-local variable with static or thread storage duration is done before the first statement of the initial function of the thread. If the initialization is deferred to some point in time after the first statement of the initial function of the thread, it shall occur before the first odr-use (3.2 [basic.def.odr]) of any variable with thread storage duration defined in the same translation unit as the variable to be initialized.

This doesn't consider that initialization of instantiations of static data members of class templates (which can be `thread_local`) are unordered. Presumably odr-use of such a static data member should not trigger the initialization of any `thread_local` variable other than that one?

#### 640. Accessing destroyed local objects of static storage duration

Section: 3.6.3 [basic.start.term] Status: open Submitter: Howard Hinnant Date: 30 July 2007

3.6.3 [basic.start.term] paragraph 2 says,

> If a function contains a local object of static storage duration that has been destroyed and the function is called during the destruction of an object with static storage duration, the program has undefined behavior if the flow of control passes through the definition of the previously destroyed local object.

I would like to turn this behavior from undefined to well-defined behavior for the purpose of achieving a graceful shutdown, especially in a multi-threaded world.

Background: Alexandrescu describes the “phoenix singleton” in Modern C++ Design. This is a class used as a function local static, that will reconstruct itself, and reapply itself to the `atexit` chain, if the program attempts to use it after it is destructed in the `atexit` chain. It achieves this by setting a “destructed flag” in its own state in its destructor. If the object is later accessed (and a member function is called on it), the member function notes the state of the “destructed flag” and does the reconstruction dance. The phoenix singleton pattern was designed to address issues only in single-threaded code where accesses among static objects can have a non-scoped pattern. When we throw in multi-threading, and the possibility that threads can be running after `main` returns, the chances of accessing a destroyed static significantly increase.

The very least that I would like to see happen is to standardize what I believe is existing practice: When an object is destroyed in the `atexit` chain, the memory the object occupied is left in whatever state the destructor put it in. If this can only be reliably done for objects with standard layout, that would be an acceptable compromise. This would allow objects to set “I'm destructed” flags in their state and then do something well-defined if accessed, such as throw an exception.

A possible refinement of this idea is to have the compiler set up a 3-state flag around function-local statics instead of the current 2-state flag:

- Not constructed yet
- Constructed but not destroyed yet
- Destroyed

We have the first two states today. We might choose to add the third state, and if execution passes over a function-local static with “destroyed” state, an exception could be thrown. This would mean that we would not have to guarantee memory stability in destroyed objects of static duration.

This refinement would break phoenix singletons, and is not required for the `~mutex()`/`~condition()` I've described and prototyped. But it might make it easier for Joe Coder to apply this kind of guarantee to his own types.

#### 365. Storage duration and temporaries

Section: 3.7 [basic.stc] Status: open Submitter: James Kanze Date: 24 July 2002

There are several problems with 3.7 [basic.stc]:

- 3.7 [basic.stc] paragraph 2 says that "Static and automatic storage durations are associated with objects introduced by declarations (3.1 [basic.def]) and implicitly created by the implementation (12.2 [class.temporary])."

  In fact, objects "implicitly created by the implementation" are the temporaries described in (12.2 [class.temporary]), and have neither static nor automatic storage duration, but a totally different duration, described in 12.2 [class.temporary].

- 3.7 [basic.stc] uses the expression "local object" in several places, without ever defining it. Presumably, what is meant is "an object declared at block scope", but this should be said explicitly.

  In a recent discussion in comp.lang.c++.moderated, on poster interpreted "local objects" as including temporaries. This would require them to live until the end of the block in which they are created, which contradicts 12.2 [class.temporary]. If temporaries are covered by this section, and the statement in 3.7 [basic.stc] seems to suggest, and they aren't local objects, then they must have static storage duration, which isn't right either.

  I propose adding a fourth storage duration to the list after 3.7 [basic.stc] paragraph 1:

  - temporary storage duration

  And rewriting the second paragraph of this section as follows:

  > Temporary storage duration is associated with objects implicitly created by the implementation, and is described in 12.2 [class.temporary]. Static and automatic storage durations are associated with objects defined by declarations; in the following, an object defined by a declaration with block scope is a local object. The dynamic storage duration is associated with objects created by the `operator new`.

Steve Adamczyk: There may well be an issue here, but one should bear in mind the difference between storage duration and object lifetime. As far as I can see, there is no particular problem with temporaries having automatic or static storage duration, as appropriate. The point of 12.2 [class.temporary] is that they have an unusual object lifetime.

Notes from Ocrober 2002 meeting:

It might be desirable to shorten the storage duration of temporaries to allow reuse of them. The as-if rule allows some reuse, but such reuse requires analysis, including noting whether the addresses of such temporaries have been taken.

Notes from the August, 2011 meeting:

The CWG decided that further consideration of this issue would be deferred until someone produces a paper explaining the need for action and proposing specific changes.

#### 2012. Lifetime of references

Section: 3.7 [basic.stc] Status: open Submitter: Mike Miller Date: 2014-09-29

According to 3.7 [basic.stc] paragraph 3,

> The storage duration categories apply to references as well. The lifetime of a reference is its storage duration.

This is clearly not correct; references can have static storage duration but be dynamically initialized. Consider an example like:

      extern int& r1;
      int& f();
      int& r2 = r1;  // #1
      int& r1 = f();
      int i = r2;    // #2

`r1` is not initialized until after its use at #1, so the initialization of `r2` should produce undefined behavior, as should the use of `r2` at #2.

The description of the lifetime of a reference should be deleted from 3.7 [basic.stc] and it should be described properly in 3.8 [basic.life].

#### 1682. Overly-restrictive rules on function templates as allocation functions

Section: 3.7.4.1 [basic.stc.dynamic.allocation] Status: open Submitter: Jason Merrill Date: 2009-03-03

Requirements for allocation functions are given in 3.7.4.1 [basic.stc.dynamic.allocation] paragraph 1:

> An allocation function can be a function template. Such a template shall declare its return type and first parameter as specified above (that is, template parameter types shall not be used in the return type and first parameter type). Template allocation functions shall have two or more parameters.

There are a couple of problems with this description. First, it is instances of function templates that can be allocation functions, not the templates themselves (cf 3.7.4.2 [basic.stc.dynamic.deallocation] paragraph 2, which uses the correct terminology regarding deallocation functions).

More importantly, this specification was written before template metaprogramming was understood and hence prevents use of SFINAE on the return type or parameter type to select among function template specializations. (The parallel passage for deallocation functions in 3.7.4.2 [basic.stc.dynamic.deallocation] paragraph 2 shares this deficit.)

(See also issue 1628.)

#### 523. Can a one-past-the-end pointer be invalidated by deleting an adjacent object?

Section: 3.7.4.2 [basic.stc.dynamic.deallocation] Status: open Submitter: comp.std.c++ Date: 8 July 2005

When an object is deleted, 3.7.4.2 [basic.stc.dynamic.deallocation] says that the deallocation “[renders] invalid all pointers referring to any part of the deallocated storage.” According to 3.9.2 [basic.compound] paragraph 3, a pointer whose address is one past the end of an array is considered to point to an unrelated object that happens to reside at that address. Does this need to be clarified to specify that the one-past-the-end pointer of an array is not invalidated by deleting the following object? (See also 5.3.5 [expr.delete] paragraph 4, which also mentions that the system deallocation function renders a pointer invalid.)

#### 419. Can cast to virtual base class be done on partially-constructed object?

Section: 3.8 [basic.life] Status: open Submitter: Judy Ward Date: 2 June 2003

Consider

      extern "C" int printf (const char *,...);

      struct Base { Base();};
      struct Derived: virtual public Base {
         Derived() {;}
      };

      Derived d;
      extern Derived& obj = d;

      int i;

      Base::Base() {
        if ((Base *) &obj) i = 4;
        printf ("i=%d\n", i);
      }

      int main() { return 0; }

12.7 [class.cdtor] paragraph 2 makes this valid, but 3.8 [basic.life] paragraph 5 implies that it isn't valid.

Steve Adamczyk: A second issue:

      extern "C" int printf(const char *,...);
      struct A                      { virtual ~A(); int x; };
      struct B : public virtual A   { };
      struct C : public B           { C(int); };
      struct D : public C           { D(); };

      int main()                    { D t; printf("passed\n");return 0; }

      A::~A()                       {}
      C::C(int)                     {}
      D::D() : C(this->x)           {}

Core issue 52 almost, but not quite, says that in evaluating "this->x" you do a cast to the virtual base class A, which would be an error according to 12.7 [class.cdtor] paragraph 2 because the base class B constructor hasn't started yet. 5.2.5 [expr.ref] should be clarified to say that the cast does need to get done.

James Kanze submitted the same issue via comp.std.c++ on 11 July 2003:

> Richard Smith: Nonsense. You can use "this" perfectly happily in a constructor, just be careful that (a) you're not using any members that are not fully initialised, and (b) if you're calling virtual functions you know exactly what you're doing.

In practice, and I think in intent, you are right. However, the standard makes some pretty stringent restrictions in 3.8 [basic.life]. To start with, it says (in paragraph 1):

> The lifetime of an object is a runtime property of the object. The lifetime of an object of type T begins when:
> - storage with the proper alignment and size for type T is obtained, and
> - if T is a class type with a non-trivial constructor, the constructor calls has COMPLETED.
> The lifetime of an object of type T ends when:
> - if T is a class type with a non-trivial destructor, the destructor call STARTS, or
> - the storage which the object occupies is reused or released.

(Emphasis added.) Then when we get down to paragraph 5, it says:

> Before the lifetime of an object has started but after the storage which the object will occupy has been allocated [which sounds to me like it would include in the constructor, given the text above] or, after the lifetime of an object has ended and before the storage which the object occupied is reused or released, any pointer that refers to the storage location where the object will be or was located may be used but only in limited ways. [...] If the object will be or was of a non-POD class type, the program has undefined behavior if:

> [...]

> - the pointer is implicitly converted to a pointer to a base class type, or [...]

I can't find any exceptions for the this pointer.

Note that calling a non-static function in the base class, or even constructing the base class in initializer list, involves an implicit conversion of this to a pointer to the base class. Thus undefined behavior. I'm sure that this wasn't the intent, but it would seem to be what this paragraph is saying.

#### 1285. Trivial destructors and object lifetime

Section: 3.8 [basic.life] Status: open Submitter: Johannes Schaub Date: 2011-04-02

The Standard is self-contradictory regarding which destructor calls end the lifetime of an object. 3.8 [basic.life] paragraph 1 says,

> The lifetime of an object of type T ends when:

> - if `T` is a class type with a non-trivial destructor (12.4 [class.dtor]), the destructor call starts, or

> - the storage which the object occupies is reused or released.

i.e., the lifetime of an object of a class type with a trivial destructor persists until its storage is reused or released. However, 12.4 [class.dtor] paragraph 15 says,

> Once a destructor is invoked for an object, the object no longer exists; the behavior is undefined if the destructor is invoked for an object whose lifetime has ended (3.8 [basic.life]).

implying that invoking any destructor, even a trivial one, ends the lifetime of the associated object. Similarly, 12.7 [class.cdtor] paragraph 1 says,

> For an object with a non-trivial destructor, referring to any non-static member or base class of the object after the destructor finishes execution results in undefined behavior.

A similar question arises for pseudo-destructors for non-class types.

Notes from the August, 2011 meeting:

CWG will need a paper exploring this topic before it can act on the issue.

#### 350. `signed char` underlying representation for objects

Section: 3.9 [basic.types] Status: open Submitter: Noah Stein Date: 16 April 2002

Sent in by David Abrahams:

Yes, and to add to this tangent, 3.9.1 [basic.fundamental] paragraph 1 states "Plain char, signed char, and unsigned char are three distinct types." Strangely, 3.9 [basic.types] paragraph 2 talks about how "... the underlying bytes making up the object can be copied into an array of char or unsigned char. If the content of the array of char or unsigned char is copied back into the object, the object shall subsequently hold its original value." I guess there's no requirement that this copying work properly with signed chars!

Notes from October 2002 meeting:

We should do whatever C99 does. 6.5p6 of the C99 standard says "array of character type", and "character type" includes signed char (6.2.5p15), and 6.5p7 says "character type". But see also 6.2.6.1p4, which mentions (only) an array of unsigned char.

Proposed resolution (April 2003):

Change 3.8 [basic.life] paragraph 5 bullet 3 from

- the pointer is used as the operand of a `static_cast` (5.2.9 [expr.static.cast]) (except when the conversion is to `void*`, or to `void*` and subsequently to `char*`, or `unsigned` `char*`).

to

- the pointer is used as the operand of a `static_cast` (5.2.9 [expr.static.cast]) (except when the conversion is to `void*`, or to `void*` and subsequently to a pointer to byte-character type).

Change 3.8 [basic.life] paragraph 6 bullet 3 from

- the lvalue is used as the operand of a `static_cast` (5.2.9 [expr.static.cast]) (except when the conversion is ultimately to `char&` or `unsigned` `char&`), or

to

- the lvalue is used as the operand of a `static_cast` (5.2.9 [expr.static.cast]) (except when the conversion is ultimately to a reference to byte-character type), or

Change the beginning of 3.9 [basic.types] paragraph 2 from

> For any object (other than a base-class subobject) of POD type `T`, whether or not the object holds a valid value of type `T`, the underlying bytes (1.7 [intro.memory]) making up the object can be copied into an array of `char` or `unsigned` `char`.

to

> For any object (other than a base-class subobject) of POD type `T`, whether or not the object holds a valid value of type `T`, the underlying bytes (1.7 [intro.memory]) making up the object can be copied into an array of byte-character type.

Add the indicated text to 3.9.1 [basic.fundamental] paragraph 1:

> Objects declared as characters (`char`) shall be large enough to store any member of the implementation's basic character set. If a character from this set is stored in a character object, the integral value of that character object is equal to the value of the single character literal form of that character. It is implementation-defined whether a `char` object can hold negative values. Characters can be explicitly declared `unsigned` or `signed`. Plain `char`, `signed char`, and `unsigned char` are three distinct types, called the byte-character types. A `char`, a `signed char`, and an `unsigned char` occupy the same amount of storage and have the same alignment requirements (3.9 [basic.types]); that is, they have the same object representation. For byte-character types, all bits of the object representation participate in the value representation. For unsigned byte-character types, all possible bit patterns of the value representation represent numbers. These requirements do not hold for other types. In any particular implementation, a plain `char` object can take on either the same values as a `signed char` or an `unsigned char`; which one is implementation-defined.

Change 3.10 [basic.lval] paragraph 15 last bullet from

- a `char` or `unsigned` `char` type.

to

- a byte-character type.

Notes from October 2003 meeting:

It appears that in C99 signed char may have padding bits but no trap representation, whereas in C++ signed char has no padding bits but may have -0. A memcpy in C++ would have to copy the array preserving the actual representation and not just the value.

March 2004: The liaisons to the C committee have been asked to tell us whether this change would introduce any unnecessary incompatibilities with C.

Notes from October 2004 meeting:

The C99 Standard appears to be inconsistent in its requirements. For example, 6.2.6.1 paragraph 4 says:

> The value may be copied into an object of type `unsigned char [`n`]` (e.g., by `memcpy`); the resulting set of bytes is called the object representation of the value.

On the other hand, 6.2 paragraph 6 says,

> If a value is copied into an object having no declared type using `memcpy` or `memmove`, or is copied as an array of character type, then the effective type of the modified object for that access and for subsequent accesses that do not modify the value is the effective type of the object from which the value is copied, if it has one.

Mike Miller will investigate further.

Proposed resolution (February, 2010):

1. Change 3.8 [basic.life] paragraph 5 bullet 4 as follows:

> ...The program has undefined behavior if:

> - ...

> - the pointer is used as the operand of a `static_cast` (5.2.9 [expr.static.cast]) (except when the conversion is to cv `void*`, or to cv `void*` and subsequently to `char*`, or `unsigned char*` a pointer to a cv-qualified or cv-unqualified byte-character type (3.9.1 [basic.fundamental])), or

> - ...

2. Change 3.8 [basic.life] paragraph 6 bullet 4 as follows:

> ...The program has undefined behavior if:

> - ...

> - the lvalue is used as the operand of a `static_cast` (5.2.9 [expr.static.cast]) except when the conversion is ultimately to cv `char&` or cv `unsigned char&` a reference to a cv-qualified or cv-unqualified byte-character type (3.9.1 [basic.fundamental]) or an array thereof, or

> - ...

3. Change 3.9 [basic.types] paragraph 2 as follows:

> For any object (other than a base-class subobject) of trivially copyable type `T`, whether or not the object holds a valid value of type `T`, the underlying bytes (1.7 [intro.memory]) making up the object can be copied into an array of `char` or `unsigned char` a byte-character type (3.9.1 [basic.fundamental]).39 If the content of the that array of `char` or `unsigned char` is copied back into the object, the object shall subsequently hold its original value. [Example:...

4. Change 3.9.1 [basic.fundamental] paragraph 1 as follows:

> ...Characters can be explicitly declared `unsigned` or `signed`. Plain `char`, `signed char`, and `unsigned char` are three distinct types, called the byte-character types. A `char`, a `signed char`, and an `unsigned char` occupy the same amount of storage and have the same alignment requirements (3.11 [basic.align]); that is, they have the same object representation. For byte-character types, all bits of the object representation participate in the value representation. For unsigned character types `unsigned char`, all possible bit patterns of the value representation represent numbers...

5. Change 3.10 [basic.lval] paragraph 15 final bullet as follows:

> If a program attempts to access the stored value of an object through an lvalue of other than one of the following types the behavior is undefined 52

> - ...

> - a `char` or `unsigned char` byte-character type (3.9.1 [basic.fundamental]).

6. Change 3.11 [basic.align] paragraph 6 as follows:

> The alignment requirement of a complete type can be queried using an `alignof` expression (5.3.6 [expr.alignof]). Furthermore, the byte-character types (3.9.1 [basic.fundamental]) `char`, `signed char`, and `unsigned char` shall have the weakest alignment requirement. [Note: this enables the byte-character types to be used as the underlying type for an aligned memory area (7.6.2 [dcl.align]). —end note]

7. Change 5.3.4 [expr.new] paragraph 10 as follows:

> ...For arrays of `char` and `unsigned char` a byte-character type (3.9.1 [basic.fundamental]), the difference between the result of the new-expression and the address returned by the allocation function shall be an integral multiple of the strictest fundamental alignment requirement (3.11 [basic.align]) of any object type whose size is no greater than the size of the array being created. [Note: Because allocation functions are assumed to return pointers to storage that is appropriately aligned for objects of any type with fundamental alignment, this constraint on array allocation overhead permits the common idiom of allocating byte-character arrays into which objects of other types will later be placed. —end note]

Notes from the March, 2010 meeting:

The CWG was not convinced that there was a need to change the existing specification at this time. Some were concerned that there might be implementation difficulties with giving `signed char` the requisite semantics; implementations for which that is true can currently make `char` equivalent to `unsigned char` and avoid those problems, but the suggested change would undermine that strategy.

Additional note, November, 2014:

There is now the term “narrow character type” that should be used instead of “byte-character type”.

#### 146. Floating-point zero

Section: 3.9.1 [basic.fundamental] Status: open Submitter: Andy Sawyer Date: 23 Jul 1999

3.9.1 [basic.fundamental] does not impose a requirement on the floating point types that there be an exact representation of the value zero. This omission is significant in 4.12 [conv.bool] paragraph 1, in which any non-zero value converts to the `bool` value `true`.

Suggested resolution: require that all floating point types have an exact representation of the value zero.

#### 251. How many signed integer types are there?

Section: 3.9.1 [basic.fundamental] Status: open Submitter: Beman Dawes Date: 18 Oct 2000

3.9.1 [basic.fundamental] paragraph 2 says that

> There are four signed integer types: "`signed char`", "`short int`", "`int`", and "`long int`."

This would indicate that `const int` is not a signed integer type.

#### 689. Maximum values of signed and unsigned integers

Section: 3.9.1 [basic.fundamental] Status: open Submitter: James Kanze Date: 30 March, 2008

The relationship between the values representable by corresponding signed and unsigned integer types is not completely described, but 3.9 [basic.types] paragraph 4 says,

> The value representation of an object is the set of bits that hold the value of type `T`.

and 3.9.1 [basic.fundamental] paragraph 3 says,

> The range of nonnegative values of a signed integer type is a subrange of the corresponding unsigned integer type, and the value representation of each corresponding signed/unsigned type shall be the same.

I.e., the maximum value of each unsigned type must be larger than the maximum value of the corresponding signed type.

C90 doesn't have this restriction, and C99 explicitly says (6.2.6.2, paragraph 2),

> For signed integer types, the bits of the object representation shall be divided into three groups: value bits, padding bits, and the sign bit. There need not be any padding bits; there shall be exactly one sign bit. Each bit that is a value bit shall have the same value as the same bit in the object representation of the corresponding unsigned type (if there are M value bits in the signed type and N in the unsigned type, then M <= N).

Unlike C++, the sign bit is not part of the value, and on an architecture that does not have native support of unsigned types, an implementation can emulate unsigned integers by simply ignoring what would be the sign bit in the signed type and be conforming.

The question is whether we intend to make a conforming implementation on such an architecture impossible. More generally, what range of architectures do we intend to support? And to what degree do we want to follow C99 in its evolution since C89?

(See paper J16/08-0141 = WG21 N2631.)

#### 1076. Value categories and lvalue temporaries

Section: 3.10 [basic.lval] Status: open Submitter: Daniel Krügler Date: 2010-06-10

The taxonomy of value categories in 3.10 [basic.lval] classifies temporaries as prvalues. However, some temporaries are explicitly referred to as lvalues (cf 15.1 [except.throw] paragraph 3).

#### 238. Precision and accuracy constraints on floating point

Section: 5 [expr] Status: open Submitter: Christophe de Dinechin Date: 31 Jul 2000

It is not clear what constraints are placed on a floating point implementation by the wording of the Standard. For instance, is an implementation permitted to generate a "fused multiply-add" instruction if the result would be different from what would be obtained by performing the operations separately? To what extent does the "as-if" rule allow the kinds of optimizations (e.g., loop unrolling) performed by FORTRAN compilers?

#### 1642. Missing requirements for prvalue operands

Section: 5 [expr] Status: open Submitter: Joseph Mansfield Date: 2013-03-15

Although the note in 3.10 [basic.lval] paragraph 1 states that

> The discussion of each built-in operator in Clause 5 [expr] indicates the category of the value it yields and the value categories of the operands it expects

in fact, many of the operators that take prvalue operands do not make that requirement explicit. Possible approaches to address this failure could be a blanket statement that an operand whose value category is not stated is assumed to be a prvalue; adding prvalue requirements to each operand description for which it is missing; or changing the description of the usual arithmetic conversions to state that they imply the lvalue-to-rvalue conversion, which would cover the majority of the omissions.

(See also issue 1685, which deals with an inaccurately-specified value category.)

#### 1632. Lambda capture in member initializers

Section: 5.1.2 [expr.prim.lambda] Status: open Submitter: Vinny Romano Date: 2013-03-04

According to 5.1.2 [expr.prim.lambda] paragraph 9,

> A lambda-expression whose smallest enclosing scope is a block scope (3.3.3 [basic.scope.block]) is a local lambda expression; any other lambda-expression shall not have a capture-list in its lambda-introducer. The reaching scope of a local lambda expression is the set of enclosing scopes up to and including the innermost enclosing function and its parameters.

Consequently, lambdas appearing in mem-initializers and brace-or-equal-initializers cannot have a capture-list. However, these expressions are evaluated in the context of the constructor and are permitted to access `this` and non-static data members.

Should the definition of a local lambda be modified to permit capturing lambdas within these contexts?

Notes from the April, 2013 meeting:

CWG agreed with the intent of this issue.

#### 1743. init-captures in nested lambdas

Section: 5.1.2 [expr.prim.lambda] Status: open Submitter: Faisal Vali Date: 2013-08-30

According to 5.2.1 [expr.sub] paragraph 11,

> No entity is captured by an init-capture.

It should be made clearer that a variable, odr-used by an init-capture in a nested lambda, is still captured by the containing lambda as a result of the init-capture.

#### 1822. Lookup of parameter names in lambda-expressions

Section: 5.1.2 [expr.prim.lambda] Status: open Submitter: Steve Clamage Date: 2013-12-10

According to 5.1.2 [expr.prim.lambda] paragraph 7, names appearing in the compound-statement of a lambda-expression are looked up in the context of the lambda-expression, ignoring the fact that the compound-statement will be transformed into the body of the closure type's function operator. This leaves unspecified how the lambda-expression's parameters are found by name lookup. Presumably the parameters hide the corresponding names from the surrounding scope, but this needs to be specified.

#### 943. Is `T()` a temporary?

Section: 5.2.3 [expr.type.conv] Status: open Submitter: Miller Date: 14 July, 2009

According to 5.2.3 [expr.type.conv] paragraphs 1 and 3 (stated directly or by reference to another section of the Standard), all the following expressions create temporaries:

        T(1)
        T(1, 2)
        T{1}
        T{}

However, paragraph 2 says,

> The expression `T()`, where `T` is a simple-type-specifier or typename-specifier for a non-array complete effective object type or the (possibly cv-qualified) `void` type, creates an rvalue of the specified type, which is value-initialized (8.5 [dcl.init]; no initialization is done for the `void()` case).

This does not say that the result is a temporary, which means that the lifetime of the result is not specified by 12.2 [class.temporary]. Presumably this is just an oversight.

Notes from the October, 2009 meeting:

The specification in 5.2.3 [expr.type.conv] is in error, not because it fails to state that `T()` is a temporary but because it requires a temporary for the other cases with fewer than two operands. The case where `T` is a class type is covered by 12.2 [class.temporary] paragraph 1 (“a conversion that creates an rvalue”), and a temporary should not be created when `T` is not a class type.

#### 742. Postfix increment/decrement with long bit-field operands

Section: 5.2.6 [expr.post.incr] Status: open Submitter: Mike Miller Date: 11 November, 2008

Given the following declarations:

        struct S {
            signed long long sll: 3;
        };
        S s = { -1 };

the expressions `s.sll-- < 0u` and `s.sll < 0u` have different results. The reason for this is that `s.sll--` is an rvalue of type `signed long long` (5.2.6 [expr.post.incr]), which means that the usual arithmetic conversions (5 [expr] paragraph 10) convert `0u` to `signed long long` and the result is `true`. `s.sll`, on the other hand, is a bit-field lvalue, which is promoted (4.5 [conv.prom] paragraph 3) to `int`; both operands of `<` have the same rank, so `s.sll` is converted to `unsigned int` to match the type of `0u` and the result is `false`. This disparity seems undesirable.

#### 1965. Explicit casts to reference types

Section: 5.2.7 [expr.dynamic.cast] Status: open Submitter: Richard Smith Date: 2014-07-07

The specification of `dynamic_cast` in 5.2.7 [expr.dynamic.cast] paragraph 2 (and `const_cast` in 5.2.11 [expr.const.cast] is the same) says that the operand of a cast to an lvalue reference type must be an lvalue, so that

      struct A { virtual ~A(); }; A &&make_a();

      A &&a = dynamic_cast<A&&>(make_a());   // ok
      const A &b = dynamic_cast<const A&>(make_a()); // ill-formed

The behavior of `static_cast` is an odd hybrid:

      A &&c = static_cast<A&&>(make_b()); // ok
      const A &d = static_cast<const A&>(make_b()); // ok
      const B &e = static_cast<const B&>(make_a()); // ill-formed

(Binding a const lvalue reference to an rvalue is permitted by 5.2.9 [expr.static.cast] paragraph 4 but not by paragraphs 2 and 3.)

There is implementation divergence on the treatment of these examples.

Also, `const_cast` permits binding an rvalue reference to a class prvalue but not to any other kind of prvalue, which seems like an unnecessary restriction.

Finally, 5.2.9 [expr.static.cast] paragraph 3 allows binding an rvalue reference to a class or array prvalue, but not to other kinds of prvalues; those are covered in paragraph 4. This would be less confusing if paragraph 3 only dealt with binding rvalue references to glvalues and left all discussion of prvalues to paragraph 4, which adequately handles the class and array cases as well.

#### 282. Namespace for `extended_type_info`

Section: 5.2.8 [expr.typeid] Status: open Submitter: Jens Maurer Date: 01 May 2001

The original proposed resolution for issue 160 included changing `extended_type_info` (5.2.8 [expr.typeid] paragraph 1, footnote 61) to `std::extended_type_info`. There was no consensus on whether this name ought to be part of namespace `std` or in a vendor-specific namespace, so the question was moved into a separate issue.

#### 528. Why are incomplete class types not allowed with `typeid`?

Section: 5.2.8 [expr.typeid] Status: open Submitter: Dave Abrahams Date: 18 May 2005

5.2.8 [expr.typeid] paragraph 4 says,

> When `typeid` is applied to a type-id, the result refers to a `std::type_info` object representing the type of the type-id. If the type of the type-id is a reference type, the result of the `typeid` expression refers to a `std::type_info` object representing the referenced type. If the type of the type-id is a class type or a reference to a class type, the class shall be completely-defined.

I'm wondering whether this is not overly restrictive. I can't think of a reason to require that `T` be completely-defined in `typeid(T)` when `T` is a class type. In fact, several popular compilers enforce that restriction for `typeid(T)`, but not for `typeid(T&)`. Can anyone explain this?

Nathan Sidwell: I think this restriction is so that whenever the compiler has to emit a typeid object of a class type, it knows what the base classes are, and can therefore emit an array of pointers-to-base-class typeids. Such a tree is necessary to implement `dynamic_cast` and exception catching (in a commonly implemented and obvious manner). If the class could be incomplete, the compiler might have to emit a typeid for incomplete `Foo` in one object file and a typeid for complete `Foo` in another object file. The compilation system will then have to make sure that (a) those compare equal and (b) the complete `Foo` gets priority, if that is applicable.

Unfortunately, there is a problem with exceptions that means there still can be a need to emit typeids for incomplete class. Namely one can throw a pointer-to-pointer-to-incomplete. To implement the matching of pointer-to-derived being caught by pointer-to-base, it is necessary for the typeid of a pointer type to contain a pointer to the typeid of the pointed-to type. In order to do the qualification matching on a multi-level pointer type, one has a chain of pointer typeids that can terminate in the typeid of an incomplete type. You cannot simply NULL-terminate the chain, because one must distinguish between different incomplete types.

Dave Abrahams: So if implementations are still required to be able to do it, for all practical purposes, why aren't we letting the user have the benefits?

Notes from the April, 2006 meeting:

There was some concern expressed that this might be difficult under the IA64 ABI. It was also observed that while it is necessary to handle exceptions involving incomplete types, there is no requirement that the RTTI data structures be used for exception handling.

#### 1954. `typeid` null dereference check in subexpressions

Section: 5.2.8 [expr.typeid] Status: open Submitter: David Majnemer Date: 2014-06-23

According to 5.2.8 [expr.typeid] paragraph 2,

> If the glvalue expression is obtained by applying the unary `*` operator to a pointer69 and the pointer is a null pointer value (4.10 [conv.ptr]), the `typeid` expression throws an exception (15.1 [except.throw]) of a type that would match a handler of type `std::bad_typeid` exception (18.7.3 [bad.typeid]).

The footnote makes clear that this requirement applies without regard to parentheses, but it is unspecified whether it applies when the dereference occurs in a subexpression of the operand (e.g., in the second operand of the comma operator or the second or third operand of a conditional operator). There is implementation divergence on this question.

#### 944. `reinterpret_cast` for all types with the same size and alignment

Section: 5.2.10 [expr.reinterpret.cast] Status: open Submitter: Miller Date: 15 July, 2009

During the discussion of issue 799, which specified the result of using `reinterpret_cast` to convert an operand to its own type, it was observed that it is probably reasonable to allow `reinterpret_cast` between any two types that have the same size and alignment.

Additional note, April, 2015:

It has been suggested that this question may more properly be the province of EWG, especially in light of discussions during the resolution of issue 330.

#### 1230. Confusing description of ambiguity of destructor name

Section: 5.3.1 [expr.unary.op] Status: open Submitter: Johannes Schaub Date: 2010-12-13

According to 5.3.1 [expr.unary.op] paragraph 10,

> There is an ambiguity in the unary-expression `~X()`, where `X` is a class-name or decltype-specifier. The ambiguity is resolved in favor of treating `~` as a unary complement rather than treating `~X` as referring to a destructor.

It is not clear whether this is intended to apply to an expression like `(~S)()`. In large measure, that depends on whether a class-name is an id-expression or not. If it is, the ambiguity described in 5.3.1 [expr.unary.op] paragraph 10 does apply; if not, the expression is an unambiguous reference to the destructor for class `S`. There are several places in the Standard that indicate that the name of a type is an id-expression, but that might be more confusing than helpful.

#### 267. Alignment requirement for new-expressions

Section: 5.3.4 [expr.new] Status: open Submitter: James Kuyper Date: 4 Dec 2000

Requirements for the alignment of pointers returned by new-expressions are given in 5.3.4 [expr.new] paragraph 10:

> For arrays of `char` and `unsigned char`, the difference between the result of the new-expression and the address returned by the allocation function shall be an integral multiple of the most stringent alignment requirement (3.9 [basic.types]) of any object type whose size is no greater than the size of the array being created.

The intent of this wording is that the pointer returned by the new-expression will be suitably aligned for any data type that might be placed into the allocated storage (since the allocation function is constrained to return a pointer to maximally-aligned storage). However, there is an implicit assumption that each alignment requirement is an integral multiple of all smaller alignment requirements. While this is probably a valid assumption for all real architectures, there's no reason that the Standard should require it.

For example, assume that `int` has an alignment requirement of 3 bytes and `double` has an alignment requirement of 4 bytes. The current wording only requires that a buffer that is big enough for an `int` or a `double` be aligned on a 4-byte boundary (the more stringent requirement), but that would allow the buffer to be allocated on an 8-byte boundary — which might not be an acceptable location for an `int`.

Suggested resolution: Change "of any object type" to "of every object type."

A similar assumption can be found in 5.2.10 [expr.reinterpret.cast] paragraph 7:

> ...converting an rvalue of type "pointer to `T1`" to the type "pointer to `T2`" (where ... the alignment requirements of `T2` are no stricter than those of `T1`) and back to its original type yields the original pointer value...

Suggested resolution: Change the wording to

> ...converting an rvalue of type "pointer to `T1`" to the type "pointer to `T2`" (where ... the alignment requirements of `T1` are an integer multiple of those of `T2`) and back to its original type yields the original pointer value...

The same change would also be needed in paragraph 9.

#### 473. Block-scope declarations of allocator functions

Section: 5.3.4 [expr.new] Status: open Submitter: John Spicer Date: 12 Jul 2004

Looking up `operator new` in a new-expression uses a different mechanism from ordinary lookup. According to 5.3.4 [expr.new] paragraph 9,

> If the new-expression begins with a unary `::` operator, the allocation function's name is looked up in the global scope. Otherwise, if the allocated type is a class type `T` or array thereof, the allocation function's name is looked up in the scope of `T`. If this lookup fails to find the name, or if the allocated type is not a class type, the allocation function's name is looked up in the global scope.

Note in particular that the scope in which the new-expression occurs is not considered. For example,

        void f() {
            void* operator new(std::size_t, void*);
            int* i = new int;    // okay?
        }

In this example, the implicit reference to `operator new(std::size_t)` finds the global declaration, even though the block-scope declaration of `operator new` with a different signature would hide it from an ordinary reference.

This seems strange; either the block-scope declaration should be ill-formed or it should be found by the lookup.

Notes from October 2004 meeting:

The CWG agreed that the block-scope declaration should not be found by the lookup in a new-expression. It would, however, be found by ordinary lookup if the allocation function were invoked explicitly.

#### 1628. Deallocation function templates

Section: 5.3.4 [expr.new] Status: open Submitter: Richard Smith Date: 2013-02-22

According to 5.3.4 [expr.new] paragraphs 18-20, an exception thrown during the initialization of an object allocated by a new-expression will cause a deallocation function to be called for the object's storage if a matching deallocation function can be found. The rules deal only with functions, however; nothing is said regarding a mechanism by which a deallocation function template might be instantiated to free the storage, although 3.7.4.2 [basic.stc.dynamic.deallocation] paragraph 2 indicates that a deallocation function can be an instance of a function template.

One possibility for this processing might be to perform template argument deduction on any deallocation function templates; if there is a specialization that matches the allocation function, by the criteria listed in paragraph 20, that function template would be instantiated and used, although a matching non-template function would take precedence as is the usual outcome of overloading between function template specializations and non-template functions.

Another possibility might be to match non-template deallocation functions with non-template allocation functions and template deallocation functions with template allocation functions.

There is a slightly related wording problem in 5.3.4 [expr.new] paragraph 21:

> If a placement deallocation function is called, it is passed the same additional arguments as were passed to the placement allocation function, that is, the same arguments as those specified with the new-placement syntax.

This wording ignores the possibility of default arguments in the allocation function, in which case the arguments passed to the deallocation function might be a superset of those specified in the new-placement.

(See also issue 1682.)

#### 196. Arguments to deallocation functions

Section: 5.3.5 [expr.delete] Status: open Submitter: Matt Austern Date: 20 Jan 2000

5.3.4 [expr.new] paragraph 10 says that the result of an array allocation function and the value of the array new-expression from which it was invoked may be different, allowing for space preceding the array to be used for implementation purposes such as saving the number of elements in the array. However, there is no corresponding description of the relationship between the operand of an array delete-expression and the argument passed to its deallocation function.

3.7.4.2 [basic.stc.dynamic.deallocation] paragraph 3 does state that

> the value supplied to `operator delete[](void*)` in the standard library shall be one of the values returned by a previous invocation of either `operator new[](std::size_t)` or `operator new[](std::size_t, const std::nothrow_t&)` in the standard library.

This statement might be read as requiring an implementation, when processing an array delete-expression and calling the deallocation function, to perform the inverse of the calculation applied to the result of the allocation function to produce the value of the new-expression. (5.3.5 [expr.delete] paragraph 2 requires that the operand of an array delete-expression "be the pointer value which resulted from a previous array new-expression.") However, it is not completely clear whether the "shall" expresses an implementation requirement or a program requirement (or both). Furthermore, there is no direct statement about user-defined deallocation functions.

Suggested resolution: A note should be added to 5.3.5 [expr.delete] to clarify that any offset added in an array new-expression must be subtracted in the array delete-expression.

#### 2023. Composite reference result type of conditional operator

Section: 5.16 [expr.cond] Status: open Submitter: Daniel Krügler Date: 2014-10-16

The conditional operator converts pointer operands to their composite pointer type (5.16 [expr.cond] bullets 6.3 and 6.4). Similar treatment should be afforded to operands of reference type.

See also issue 2018.

#### 1256. Unevaluated operands are not necessarily constant expressions

Section: 5.20 [expr.const] Status: open Submitter: Nikolay Ivchenkov Date: 2011-03-08

The current definition of constant expressions appears to make unevaluated operands constant expressions; for example, `new char[10]` would seem to be a constant expression if it appears as the operand of `sizeof`. This seems wrong.

#### 1826. `const` floating-point in constant expressions

Section: 5.20 [expr.const] Status: open Submitter: Ville Voutilainen Date: 2014-01-04

A `const` integer initialized with a constant can be used in constant expressions, but a `const` floating point variable initialized with a constant cannot. This was intentional, to be compatible with C++03 while encouraging the consistent use of `constexpr`. Some people have found this distinction to be surprising, however.

It was also observed that allowing `const` floating point variables as constant expressions would be an ABI-breaking change, since it would affect lambda capture.

One possibility might be to deprecate the use of `const` integral variables in constant expressions.

Additional note, April, 2015:

EWG requested CWG to allow use of `const` floating-point variables in constant expressions.

#### 157. Omitted typedef declarator

Section: 7 [dcl.dcl] Status: open Submitter: Daveed Vandevoorde Date: 19 Aug 1999

7 [dcl.dcl] paragraph 3 reads,

> In a simple-declaration, the optional init-declarator-list can be omitted only when... the decl-specifier-seq contains either a class-specifier, an elaborated-type-specifier with a class-key (9.1 [class.name] ), or an enum-specifier. In these cases and whenever a class-specifier or enum-specifier is present in the decl-specifier-seq, the identifiers in those specifiers are among the names being declared by the declaration... In such cases, and except for the declaration of an unnamed bit-field (9.6 [class.bit] ), the decl-specifier-seq shall introduce one or more names into the program, or shall redeclare a name introduced by a previous declaration. [Example:

>         enum { };           // ill-formed
>         typedef class { };  // ill-formed

> —end example]

In the absence of any explicit restrictions in 7.1.3 [dcl.typedef] , this paragraph appears to allow declarations like the following:

        typedef struct S { };    // no declarator
        typedef enum { e1 };     // no declarator

In fact, the final example in 7 [dcl.dcl] paragraph 3 would seem to indicate that this is intentional: since it is illustrating the requirement that the decl-specifier-seq must introduce a name in declarations in which the init-declarator-list is omitted, presumably the addition of a class name would have made the example well-formed.

On the other hand, there is no good reason to allow such declarations; the only reasonable scenario in which they might occur is a mistake on the programmer's part, and it would be a service to the programmer to require that such errors be diagnosed.

#### 498. Storage class specifiers in definitions of class members

Section: 7.1.1 [dcl.stc] Status: open Submitter: Matt Austern Date: 13 Jan 2005

Suppose we've got this class definition:

        struct X {
           void f();
           static int n;
        };

I think I can deduce from the existing standard that the following member definitions are ill-formed:

        static void X::f() { }
        static int X::n;

To come to that conclusion, however, I have to put together several things in different parts of the standard. I would have expected to find an explicit statement of this somewhere; in particular, I would have expected to find it in 7.1.1 [dcl.stc]. I don't see it there, or anywhere.

Gabriel Dos Reis: Or in 3.5 [basic.link] which is about linkage. I would have expected that paragraph to say that that members of class types have external linkage when the enclosing class has an external linkage. Otherwise 3.5 [basic.link] paragraph 8:

> Names not covered by these rules have no linkage.

might imply that such members do not have linkage.

Notes from the April, 2005 meeting:

The question about the linkage of class members is already covered by 3.5 [basic.link] paragraph 5.

#### 1820. Qualified typedef names

Section: 7.1.3 [dcl.typedef] Status: open Submitter: Richard Smith Date: 2013-12-05

The resolution of issue 482 allows a typedef to be redeclared in the same or a containing scope using a qualified declarator-id. This was not the principal goal of the issue and is not supported by current implementations. Should the prohibition of qualified declarator-ids be reinstated for typedefs?

#### 1894. typedef-names and using-declarations

Section: 7.1.3 [dcl.typedef] Status: open Submitter: Richard Smith Date: 2014-03-16

The resolution of issue 407 does not cover cases involving using-declarations. For example:

      namespace A { struct S {}; }
      namespace B {
        // This is valid per issue 407
        using A::S;
        typedef A::S S;
        struct S s;
      }
      namespace C {
        // The typedef does not redefine the name S in this
        // scope, so issue 407's resolution does not apply.
        typedef A::S S;
        using A::S;
        // The name lookup here isn't ambiguous, because it only finds one
        // entity, but it finds both a typedef-name and a non-typedef-name referring
        // to that entity, so the standard doesn't appear to say whether this is valid.
        struct S s;
      }

The same issue appears with using-directives:

      namespace D { typedef A::S S; }
      namespace E {
        using namespace A;
        using namespace D;
        struct S s; // ok? issue 407 doesn't apply here either
      }

One possibility might be to remove the rule that a typedef-name declaration redefines an already-defined name and instead rely on `struct stat`-style hiding, taking the non-typedef-name if name lookup finds both and they refer to the same type.

Notes from the June, 2014 meeting:

CWG felt that these examples should be well-formed.

#### 144. Position of `friend` specifier

Section: 7.1.6.3 [dcl.type.elab] Status: open Submitter: Daveed Vandevoorde Date: 22 Jul 1999

7.1.6.3 [dcl.type.elab] paragraph 1 seems to impose an ordering constraint on the elements of friend class declarations. However, the general rule is that declaration specifiers can appear in any order. Should

        class C friend;

be well-formed?

#### 36. using-declarations in multiple-declaration contexts

Section: 7.3.3 [namespace.udecl] Status: open Submitter: Andrew Koenig Date: 20 Aug 1998

Section 7.3.3 [namespace.udecl] paragraph 8 says:

> A using-declaration is a declaration and can therefore be used repeatedly where (and only where) multiple declarations are allowed.

It contains the following example:

        namespace A {
                int i;
        }

        namespace A1 {
                using A::i;
                using A::i;             // OK: double declaration
        }

        void f()
        {
                using A::i;
                using A::i;             // error: double declaration
        }

However, if "`using A::i;`" is really a declaration, and not a definition, it is far from clear that repeating it should be an error in either context. Consider:

        namespace A {
                int i;
                void g();
        }

        void f() {
                using A::g;
                using A::g;
        }

Surely the definition of f should be analogous to

        void f() {
                void g();
                void g();
        }

which is well-formed because "`void g();`" is a declaration and not a definition.

Indeed, if the double using-declaration for `A::i` is prohibited in `f`, why should it be allowed in namespace `A1`?

Proposed Resolution (04/99): Change the comment "`// error: double declaration`" to "`// OK: double declaration`". (This should be reviewed against existing practice.)

Notes from 04/00 meeting:

The core language working group was unable to come to consensus over what kind of declaration a using-declaration should emulate. In a straw poll, 7 members favored allowing using-declarations wherever a non-definition declaration could appear, while 4 preferred to allow multiple using-declarations only in namespace scope (the rationale being that the permission for multiple using-declarations is primarily to support its use in multiple header files, which are seldom included anywhere other than namespace scope). John Spicer pointed out that `friend` declarations can appear multiple times in class scope and asked if using-declarations would have the same property under the "like a declaration" resolution.

As a result of the lack of agreement, the issue was returned to "open" status.

See also issues 56, 85, and 138..

Additional notes (January, 2005):

Some related issues have been raised concerning the following example (modified from a C++ validation suite test):

        struct A
        {
            int i;
            static int j;
        };

        struct B : A { };
        struct C : A { };

        struct D : virtual B, virtual C
        {
            using B::i;
            using C::i;
            using B::j;
            using C::j;
        };

Currently, it appears that the using-declarations of `i` are ill-formed, on the basis of 7.3.3 [namespace.udecl] paragraph 10:

> Since a using-declaration is a declaration, the restrictions on declarations of the same name in the same declarative region (3.3 [basic.scope]) also apply to using-declarations.

Because the using-declarations of `i` refer to different objects, declaring them in the same scope is not permitted under 3.3 [basic.scope]. It might, however, be preferable to treat this case as many other ambiguities are: allow the declaration but make the program ill-formed if a name reference resolves to the ambiguous declarations.

The status of the using-declarations of `j`, however, is less clear. They both declare the same entity and thus do not violate the rules of 3.3 [basic.scope]. This might (or might not) violate the restrictions of 9.2 [class.mem] paragraph 1:

> Except when used to declare friends (11.3 [class.friend]) or to introduce the name of a member of a base class into a derived class (7.3.3 [namespace.udecl], _N3225_.11.3 [class.access.dcl]), member-declarations declare members of the class, and each such member-declaration shall declare at least one member name of the class. A member shall not be declared twice in the member-specification, except that a nested class or member class template can be declared and then later defined.

Do the using-declarations of `j` repeatedly declare the same member? Or is the preceding sentence an indication that a using-declaration is not a declaration of a member?

#### 813. `typename` in a using-declaration with a non-dependent name

Section: 7.3.3 [namespace.udecl] Status: open Submitter: UK Date: 3 March, 2009
N2800 comment UK 101

7.3.3 [namespace.udecl] paragraph 20 says,

> If a using-declaration uses the keyword `typename` and specifies a dependent name (14.6.2 [temp.dep]), the name introduced by the using-declaration is treated as a typedef-name (7.1.3 [dcl.typedef]).

This wording does not address use of `typename` in a using-declaration with a non-dependent name; the primary specification of the `typename` keyword in 14.6 [temp.res] does not appear to describe this case, either.

#### 852. using-declarations and dependent base classes

Section: 7.3.3 [namespace.udecl] Status: open Submitter: Michael Wong Date: 2 April, 2009

The status of an example like the following is unclear in the current Standard:

        struct B {
            void f();
        };
        template<typename T> struct S: T {
            using B::f;
        };

7.3.3 [namespace.udecl] does not deal explicitly with dependent base classes, but does say in paragraph 3,

> In a using-declaration used as a member-declaration, the nested-name-specifier shall name a base class of the class being defined. If such a using-declaration names a constructor, the nested-name-specier shall name a direct base class of the class being defined; otherwise it introduces the set of declarations found by member name lookup (10.2 [class.member.lookup], 3.4.3.1 [class.qual]).

In the definition of `S`, `B::f` is not a dependent name but resolves to an apparently unrelated class. However, because `S` could be instantiated as `S<B>`, presumably 14.6 [temp.res] paragraph 8 would apply:

> No diagnostic shall be issued for a template definition for which a valid specialization can be generated.

Note also the resolution of issue 515, which permitted a similar use of a dependent base class named with a non-dependent name.

#### 1742. using-declarations and scoped enumerators

Section: 7.3.3 [namespace.udecl] Status: open Submitter: Richard Smith Date: 2013-08-28

A using-declaration cannot name a scoped enumerator, according to 7.3.3 [namespace.udecl] paragraph 7. This is presumably because a scoped enumerator belongs to an enumeration scope and thus logically cannot belong to the non-enumeration scope in which the using-declaration appears. It seems inconsistent, however, to permit using-declarations to name unscoped enumerators but not scoped enumerators.

Also, 7.3.3 [namespace.udecl] paragraph 3 says,

> In a using-declaration used as a member-declaration, the nested-name-specifier shall name a base class of the class being defined.

The consequence of this is that

      enum E { e0 };
      void f() {
        using E::e0;
      }

is well-formed, but

      struct B {
        enum E { e0 };
      };
      struct D : B {
        using B::E::e0;
      };

is not. Again, this seems inconsistent. Should these rules be relaxed?

#### 1903. What declarations are introduced by a non-member using-declaration?

Section: 7.3.3 [namespace.udecl] Status: open Submitter: Richard Smith Date: 2014-03-26

The set of declarations introduced by a using-declaration that is a member-declaration is specified by 7.3.3 [namespace.udecl] paragraph 3. However, there is no corresponding specification for a non-member using-declaration.

#### 1907. using-declarations and default arguments

Section: 7.3.3 [namespace.udecl] Status: open Submitter: Richard Smith Date: 2014-03-30

The status of an example like the following is not clear:

      void f(int, int);
      template<typename T> void g(T t) { f(t); }
      void f(int, int = 0);
      void h() { g(0); }

According to 14.6.4 [temp.dep.res] paragraph 1,

> In resolving dependent names, names from the following sources are considered:

> - Declarations that are visible at the point of definition of the template.

> - ...

If this is to be interpreted as meaning that only the declarations that are visible at the point of definition can be used in overload resolution for dependent calls, the call `g(0)` is ill-formed. If, however, it is the names, not the declarations, that are captured, then presumably the second declaration of `f` should be considered, making the call well-formed. There is implementation divergence for this example.

The resolution of issue 1551 recently clarified the requirements in similar cases involving using-declarations:

      namespace N { void f(int, int); }
      using N::f;
      template<typename T> void g(T t) { f(t); }
      namespace N { void f(int, int = 0); }
      void h() { g(0); }

The note added to 7.3.3 [namespace.udecl] paragraph 11 makes clear that the call `g(0)` is well-formed in this example.

This outcome results in an unfortunate discrepancy between how default arguments and overloaded functions are treated, even though default arguments could conceptually be viewed as simply adding extra overloads for the additional arguments.

Notes from the June, 2014 meeting:

CWG was unable to come to consensus regarding the desired outcome, with an approximately equal split between desiring the first example to be well-formed or ill-formed. It was noted that the resolution of issue 1850 makes the corresponding case for non-dependent references ill-formed, with no diagnostic required. Similar questions also apply to completing an array type, which also involves a modification to an existing entity declaration in a given scope.

#### 563. Linkage specification for objects

Section: 7.5 [dcl.link] Status: open Submitter: Daveed Vandevoorde Date: 8 March 2006

It is not clear whether some of the wording in 7.5 [dcl.link] that applies only to function types and names ought also to apply to object names. In particular, paragraph 3 says,

> Every implementation shall provide for linkage to functions written in the C programming language, `"C"`, and linkage to C++ functions, `"C++"`.

Nothing is said about variable names, apparently meaning that implementations need not provide C (or even C++!) linkage for variable names. Also, paragraph 5 says,

> Except for functions with C++ linkage, a function declaration without a linkage specification shall not precede the first linkage specification for that function. A function can be declared without a linkage specification after an explicit linkage specification has been seen; the linkage explicitly specified in the earlier declaration is not affected by such a function declaration.

There doesn't seem to be a good reason for these provisions not to apply to variable names, as well.

#### 1818. Visibility and inherited language linkage

Section: 7.5 [dcl.link] Status: open Submitter: Richard Smith Date: 2013-12-04

Does the language linkage of a block-scope declaration determine the language linkage of a subsequent declaration of the same name in a different scope? For example,

       extern "C" void f() {
         void g();    // Implicitly extern "C"
       }
       void g() { }   // Also extern "C" or linkage mismatch?

In other contexts, inheritance of linkage requires that the earlier declaration be visible, as in 3.5 [basic.link] paragraph 6:

> The name of a function declared in block scope and the name of a variable declared by a block scope `extern` declaration have linkage. If there is a visible declaration of an entity with linkage having the same name and type, ignoring entities declared outside the innermost enclosing namespace scope, the block scope declaration declares that same entity and receives the linkage of the previous declaration.

The specification for language linkage in 7.5 [dcl.link] paragraph 5, however, makes no mention of visibility:

> A function can be declared without a linkage specification after an explicit linkage specification has been seen; the linkage explicitly specified in the earlier declaration is not affected by such a function declaration.

#### 1617. `alignas` and non-defining declarations

Section: 7.6.2 [dcl.align] Status: open Submitter: Richard Smith Date: 2012-02-02

According to 7.6.2 [dcl.align] paragraph 6,

> If the defining declaration of an entity has an alignment-specifier, any non-defining declaration of that entity shall either specify equivalent alignment or have no alignment-specifier. Conversely, if any declaration of an entity has an alignment-specifier, every defining declaration of that entity shall specify an equivalent alignment. No diagnostic is required if declarations of an entity have different alignment-specifiers in different translation units.

Because this is phrased in terms of the definition of an entity, an example like the following is presumably well-formed (even though there can be no definition of `n`):

       alignas(8) extern int n;
       alignas(16) extern int n;

Is this intentional?

#### 504. Should use of a variable in its own initializer require a diagnostic?

Section: 8.3.2 [dcl.ref] Status: open Submitter: Bjarne Stroustrup Date: 14 Apr 2005

Split off from issue 453.

It is in general not possible to determine at compile time whether a reference is used before it is initialized. Nevertheless, there is some sentiment to require a diagnostic in the obvious cases that can be detected at compile time, such as the name of a reference appearing in its own initializer. The resolution of issue 453 originally made such uses ill-formed, but the CWG decided that this question should be a separate issue.

Rationale (October, 2005):

The CWG felt that this error was not likely to arise very often in practice. Implementations can warn about such constructs, and the resolution for issue 453 makes executing such code undefined behavior; that seemed to address the situation adequately.

Note (February, 2006):

Recent discussions have suggested that undefined behavior be reduced. One possibility (broadening the scope of this issue to include object declarations as well as references) was to require a diagnostic if the initializer uses the value, but not just the address, of the object or reference being declared:

        int i = i;        // Ill-formed, diagnostic required
        void* p = &p;     // Okay

#### 361. Forward reference to default argument

Section: 8.3.6 [dcl.fct.default] Status: open Submitter: Steve Clamage Date: 17 June 2002

Is this program well-formed?

      struct S {
        static int f2(int = f1()); // OK?
        static int f1(int = 2);
      };
      int main()
      {
        return S::f2();
      }

A class member function can in general refer to class members that are declared lexically later. But what about referring to default arguments of member functions that haven't yet been declared?

It seems to me that if f2 can refer to f1, it can also refer to the default argument of f1, but at least one compiler disagrees.

Notes from the February, 2012 meeting:

Implementations seem to have come to agreement that this example is ill-formed.

Additional note (March, 2013):

Additional discussion has occurred suggesting the following examples as illustrations of this issue:

      struct B {
       struct A { int a = 0; };
       B(A = A());    // Not permitted?
      };

as well as

      struct C {
       struct A { int a = C().n; }; // can we use the default argument here?
       C(int k = 0);
       int n;
      };

      bool f();
      struct D {
       struct A { bool a = noexcept(B()); }; // can we use the default initializer here?
       struct B { int b = f() ? throw 0 : 0; };
      };

(See also issue 325.)

Additional note (October, 2013):

Issue 1330 treats exception-specifications like default arguments, evaluated in the completed class type. That raises the same questions regarding self-referential `noexcept` clauses that apply to default arguments.

#### 1609. Default arguments and function parameter packs

Section: 8.3.6 [dcl.fct.default] Status: open Submitter: Jonathan Caves Date: 2013-01-25

It is not clear from 8.3.6 [dcl.fct.default] whether the following is well-formed or not:

      template<typename... T>
      void f2(int a = 0, T... b, int c = 1);

      f2<>(); // parameter a has the value 0 and parameter c has the value 1

(`T... b` is a non-deduced context per 14.8.2.5 [temp.deduct.type] paragraph 5, so the template arguments must be specified explicitly.)

Notes from the April, 2013 meeting:

CWG agreed that the example should be ill-formed.

Additional note (August, 2013):

8.3.6 [dcl.fct.default] paragraph 4 explicitly allows for a function parameter pack to follow a parameter with a default argument:

> In a given function declaration, each parameter subsequent to a parameter with a default argument shall have a default argument supplied in this or a previous declaration or shall be a function parameter pack.

However, any instantiation of such a function template with a non-empty pack expansion would result in a function declaration in which one or more parameters without default arguments (from the pack expansion) would follow a parameter with a default argument and thus would be ill-formed. Such a function template declaration thus violates 14.6 [temp.res] paragraph 8:

> If every valid specialization of a variadic template requires an empty template parameter pack, the template is ill-formed, no diagnostic required.

Although the drafting review teleconference of 2013-08-26 suggested closing the issue as NAD, it is being kept open to discuss and resolve this apparent contradiction.

Notes from the September, 2013 meeting:

CWG agreed that this example should be accepted; the restriction on default arguments applies to the template declaration itself, not to its specializations.

#### 1962. Type of `__func__`

Section: 8.4.1 [dcl.fct.def.general] Status: open Submitter: Steve Clamage Date: 2014-07-04

Two questions have arisen regarding the treatment of the type of the `__func__` built-in variable. First, some implementations accept

      void f() {
        typedef decltype(__func__) T;
        T x = __func__;
      }

even though `T` is specified to be an array type.

In a related question, it was noted that `__func__` is implicitly required to be unique in each function, and that not only the value but the type of `__func__` are implementation-defined; e.g., in something like

      inline auto f() { return &__func__; }

the function type is implementation-specific. These concerns could be addressed by making the value a prvalue of type `const char*` instead of an array lvalue.

#### 670. Copy initialization via derived-to-base conversion in the second step

Section: 8.5 [dcl.init] Status: open Submitter: Jason Merrill Date: 20 December 2007

In this example:

        struct A {};

        struct B: A {
           B(int);
           B(B&);
           B(A);
        };

        void foo(B);

        void bar() {
           foo(0);
        }

we are copy-initializing a `B` from `0`. So by 13.3.1.4 [over.match.copy] we consider all the converting constructors of `B`, and choose `B(int)` to create a `B`. Then, by 8.5 [dcl.init] paragraph 15, we direct-initialize the parameter from that temporary `B`. By 13.3.1.3 [over.match.ctor] we consider all constructors. The copy constructor cannot be called with a temporary, but `B(A)` is callable.

As far as I can tell, the Standard says that this example is well-formed, and calls `B(A)`. EDG and G++ have rejected this example with a message about the copy constructor not being callable, but I have been unsuccessful in finding anything in the Standard that says that we only consider the copy constructor in the second step of copy-initialization. I wouldn't mind such a rule, but it doesn't seem to be there. And implementing issue 391 causes G++ to start accepting the example.

This question came up before in a GCC bug report; in the discussion of that bug Nathan Sidwell said that some EDG folks explained to him why the testcase is ill-formed, but unfortunately didn't provide that explanation in the bug report.

I think the resolution of issue 391 makes this example well-formed; it was previously ill-formed because in order to bind the temporary `B(0)` to the argument of `A(const A&)` we needed to make another temporary `B`, and that's what made the example ill-formed. If we want this example to stay ill-formed, we need to change something else.

Steve Adamczyk:

I tracked down my response to Nathan at the time, and it related to my paper N1232 (on the `auto_ptr` problem). The change that came out of that paper is in 13.3.3.1 [over.best.ics] paragraph 4:

> However, when considering the argument of a user-defined conversion function that is a candidate by 13.3.1.3 [over.match.ctor] when invoked for the copying of the temporary in the second step of a class copy-initialization, or by 13.3.1.4 [over.match.copy], 13.3.1.5 [over.match.conv], or 13.3.1.6 [over.match.ref] in all cases, only standard conversion sequences and ellipsis conversion sequences are allowed.

This is intended to prevent use of more than one implicit user- defined conversion in an initialization.

I told Nathan `B(A)` can't be called because its argument would require yet another user-defined conversion, but I was wrong. I saw the conversion from `B` to `A` and immediately thought “user-defined,” but in fact because `B` is a derived class of `A` the conversion according to 13.3.3.1 [over.best.ics] paragraph 6 is a derived-to-base Conversion (even though it will be implemented by calling a copy constructor).

So I agree with you: with the analysis above and the change for issue 391 this example is well-formed. We should discuss whether we want to make a change to keep it ill-formed.

#### 233. References vs pointers in UDC overload resolution

Section: 8.5.3 [dcl.init.ref] Status: open Submitter: Matthias Meixner Date: 9 Jun 2000

There is an inconsistency in the handling of references vs pointers in user defined conversions and overloading. The reason for that is that the combination of 8.5.3 [dcl.init.ref] and 4.4 [conv.qual] circumvents the standard way of ranking conversion functions, which was probably not the intention of the designers of the standard.

Let's start with some examples, to show what it is about:

        struct Z { Z(){} };

        struct A {
           Z x;

           operator Z *() { return &x; }
           operator const Z *() { return &x; }
        };

        struct B {
           Z x;

           operator Z &() { return x; }
           operator const Z &() { return x; }
        };

        int main()
        {
           A a;
           Z *a1=a;
           const Z *a2=a; // not ambiguous

           B b;
           Z &b1=b;
           const Z &b2=b; // ambiguous
        }

So while both classes `A` and `B` are structurally equivalent, there is a difference in operator overloading. I want to start with the discussion of the pointer case (`const Z *a2=a;`): 13.3.3 [over.match.best] is used to select the best viable function. Rule 4 selects `A::operator const Z*()` as best viable function using 13.3.3.2 [over.ics.rank] since the implicit conversion sequence `const Z*` -> `const Z*` is a better conversion sequence than `Z*` -> `const Z*`.

So what is the difference to the reference case? Cv-qualification conversion is only applicable for pointers according to 4.4 [conv.qual]. According to 8.5.3 [dcl.init.ref] paragraphs 4-7 references are initialized by binding using the concept of reference-compatibility. The problem with this is, that in this context of binding, there is no conversion, and therefore there is also no comparing of conversion sequences. More exactly all conversions can be considered identity conversions according to 13.3.3.1.4 [over.ics.ref] paragraph 1, which compare equal and which has the same effect. So binding `const Z*` to `const Z*` is as good as binding `const Z*` to `Z*` in terms of overloading. Therefore `const Z &b2=b;` is ambiguous. [13.3.3.1.4 [over.ics.ref] paragraph 5 and 13.3.3.2 [over.ics.rank] paragraph 3 rule 3 (S1 and S2 are reference bindings ...) do not seem to apply to this case]

There are other ambiguities, that result in the special treatment of references: Example:

        struct A {int a;};
        struct B: public A { B() {}; int b;};

        struct X {
           B x;
           operator A &() { return x; }
           operator B &() { return x; }
        };

        main()
        {
           X x;
           A &g=x; // ambiguous
        }

Since both references of class `A` and `B` are reference compatible with references of class `A` and since from the point of ranking of implicit conversion sequences they are both identity conversions, the initialization is ambiguous.

So why should this be a defect?

- References behave fundamentally different from pointers in combination with user defined conversions, although there is no reason to have this different treatment.
- This difference only shows up in combination with user defined conversion sequences, for all other cases, there are special rules, e.g. 13.3.3.2 [over.ics.rank] paragraph 3 rule 3.

So overall I think this was not the intention of the authors of the standard.

So how could this be fixed? For comparing conversion sequences (and only for comparing) reference binding should be treated as if it was a normal assignment/initialization and cv-qualification would have to be defined for references. This would affect 8.5.3 [dcl.init.ref] paragraph 6, 4.4 [conv.qual] and probably 13.3.3.2 [over.ics.rank] paragraph 3.

Another fix could be to add a special case in 13.3.3 [over.match.best] paragraph 1.

#### 2018. Qualification conversion vs reference binding

Section: 8.5.3 [dcl.init.ref] Status: open Submitter: Richard Smith Date: 2014-10-07

Qualification conversions are not considered when doing reference binding, which leads to some unexpected results:

      template<typename T> T make();
      struct B {}; struct D : B {};

      const int *p1 = make<int*>();           // ok, qualification conversion
      const int *const *p2 = make<int**>();   // ok, qualification conversion
      const int **p3 = make<int**>();         // error, not type safe

      const int &r1 = make<int&>();           // ok, binds directly
      const int *const &r2 = make<int*&>();   // weird, binds to a temporary
      const int *&r3 = make<int*&>();         // error

      const int &&x1 = make<int&&>();         // ok, binds directly
      const int *const &&x2 = make<int*&&>(); // weird, binds to a temporary
      const int *&&x3 = make<int*&&>();       // weird, binds to a temporary

It might make sense to say that similar types are reference-related and if there is a qualification conversion they are reference-compatible.

See also issue 2023.

#### 1599. Lifetime of `initializer_list` underlying array

Section: 8.5.4 [dcl.init.list] Status: open Submitter: Johannes Schaub Date: 2012-02-10

The normative wording of 8.5.4 [dcl.init.list] regarding the lifetime of the array underlying an `initializer_list` object does not match the intent as specified in the example in paragraph 6 of that section, even after application of the resolution of issue 1290. That example contains the lines:

      void f() {
        std::initializer_list<int> i3 = { 1, 2, 3 };
      }

The commentary indicates that the lifetime of the array created for the initialization of `i3` “persists for the lifetime of the variable.” However, that is not the effect of the normative wording. According to paragraph 3,

> if `T` is a specialization of `std::initializer_list<E>`, an `initializer_list` object is constructed as described below and used to initialize the object according to the rules for initialization of an object from a class of the same type (8.5 [dcl.init]).

In other words, the underlying array for `{1,2,3}` in the example is associated with the temporary and shares its lifetime; its lifetime is not extended to that of the variable.

Notes from the February, 2014 meeting:

The resolution of issue 1299, clarifying the relationship between temporary expressions and temporary objects, is relevant to this issue.

#### 1996. Reference list-initialization ignores conversion functions

Section: 8.5.4 [dcl.init.list] Status: open Submitter: Richard Smith Date: 2014-09-04

The specification for list-initialization of a reference does not consider the existence of conversion functions. Consequently, the following example is ill-formed:

      struct S { operator struct D &(); } s;
      D &d{s};

#### 511. POD-structs with template assignment operators

Section: 9 [class] Status: open Submitter: Alisdair Meredith Date: 19 Mar 2005

A POD-struct is not permitted to have a user-declared copy assignment operator (9 [class] paragraph 4). However, a template assignment operator is not considered a copy assignment operator, even though its specializations can be selected by overload resolution for performing copy operations (12.8 [class.copy] paragraph 9 and especially footnote 114). Consequently, `X` in the following code is a POD, notwithstanding the fact that copy assignment (for a non-const operand) is a member function call rather than a bitwise copy:

        struct X {
          template<typename T> const X& operator=(T&);
        };
        void f() {
          X x1, x2;
          x1 = x2;  // calls X::operator=<X>(X&)
        }

Is this intentional?

#### 1821. Qualified redeclarations in a class member-specification

Section: 9.2 [class.mem] Status: open Submitter: Richard Smith Date: 2013-1205

9.2 [class.mem] paragraph 1 allows nested classes, class templates, and enumerations to be declared and then later defined in the class member-specification. There does not appear to be a restriction on using a qualified-id in that definition. Should such a restriction be added?

#### 57. Empty unions

Section: 9.5 [class.union] Status: open Submitter: Steve Adamczyk Date: 13 Oct 1998

There doesn't seem to be a prohibition in 9.5 [class.union] against a declaration like

        union { int : 0; } x;

Should that be valid? If so, 8.5 [dcl.init] paragraph 5 third bullet, which deals with default-initialization of unions, should say that no initialization is done if there are no data members.

What about:

        union { } x;
        static union { };

If the first example is well-formed, should either or both of these cases be well-formed as well?

(See also the resolution for issue 151.)

Notes from 10/00 meeting: The resolution to issue 178, which was accepted as a DR, addresses the first point above (default initialization). The other questions have not yet been decided, however.

#### 1943. Unspecified meaning of “bit”

Section: 9.6 [class.bit] Status: open Submitter: Hubert Tong Date: 2014-02-13

CWG decided at the 2014-06 (Rapperswil) meeting to address only a limited subset of the questions raised by issues 1857 and 1861. This issue is a placeholder for the remaining questions, such as defining a “bit” in terms of a value of 2n, specifying whether a bit-field has a sign bit, etc.

#### 380. Definition of "ambiguous base class" missing

Section: 10.2 [class.member.lookup] Status: open Submitter: Jason Merrill Date: 22 Oct 2002

The term "ambiguous base class" doesn't seem to be actually defined anywhere. 10.2 [class.member.lookup] paragraph 7 seems like the place to do it.

#### 600. Does access control apply to members or to names?

Section: 11 [class.access] Status: open Submitter: Alisdair Meredith Date: 3 October 2006

Referring to a private member of a class, 11 [class.access] paragraph 1 says,

> its name can be used only by members and friends of the class in which it is declared.

That wording does not appear to reflect the intent of access control, however. Consider the following:

        struct S {
            void f(int);
        private:
            void f(double);
        };

        void g(S* sp) {
            sp->f(2);        // Ill-formed?
        }

The statement from 11 [class.access] paragraph 1 says that the name `f` can be used only by members and friends of `S`. Function `g` is neither, and it clearly contains a use of the name `f`. That appears to make it ill-formed, in spite of the fact that overload resolution will select the public member.

A related question is whether the use of the term “name” in the description of the effect of access control means that it does not apply to constructors and destructors, which do not have names.

Mike Miller: The phrase “its name can be used” should be understood as “it can be referred to by name.” Paragraph 4, among other places, makes it clear that access control is applied after overload resolution. The “name” phrasing is there to indicate that access control does not apply where the name is not used (in a call via a pointer, for example).

#### 360. Using-declaration that reduces access

Section: 11.2 [class.access.base] Status: open Submitter: Steve Clamage Date: 4 June 2002

I have heard a claim that the following code is valid, but I don't see why.

      struct A {
        int foo ();
      };

      struct B: A {
      private:
        using A::foo;
      };

      int main ()
      {
        return B ().foo ();
      }

It seems to me that the using declaration in B should hide the public foo in A. Then the call to B::foo should fail because B::foo is not accessible in main.

Am I missing something?

Steve Adamczyk: This is similar to the last example in 11.2 [class.access.base]. In prose, the rule is that if you have access to cast to a base class and you have access to the member in the base class, you are given access in the derived class. In this case, A is a public base class of B and foo is public in A, so you can access foo through a B object. The actual permission for this is in the fourth bullet in 11.2 [class.access.base] paragraph 4.

The wording changes for issue 9 make this clearer, but I believe even without them this example could be discerned to be valid.

See my paper J16/96-0034, WG21/N0852 on this topic.

Steve Clamage: But a using-declaration is a declaration (7.3.3 [namespace.udecl]). Compare with

      struct B : A {
      private:
        int foo();
      };

In this case, the call would certainly be invalid, even though your argument about casting B to an A would make it OK. Your argument basically says that an access adjustment to make something less accessible has no effect. That also doesn't sound right.

Steve Adamczyk: I agree that is strange. I do think that's what 11.2 [class.access.base] says, but perhaps that's not what we want it to say.

#### 718. Non-class, non-function friend declarations

Section: 11.3 [class.friend] Status: open Submitter: John Spicer Date: 18 September, 2008

With the change from a scope-based to an entity-based definition of friendship (see issues 372 and 580), it could well make sense to grant friendship to enumerations and variables, for example:

        enum E: int;
        class C {
          static const int i = 5;  // Private
          friend E;
          friend int x;
        };
        enum E { e = C::i; };      // OK: E is a friend
        int x = C::i;              // OK: x is a friend

According to the current wording of 11.3 [class.friend] paragraph 3, the friend declaration of `E` is well-formed but ignored, while the friend declaration of `x` is ill-formed.

#### 581. Can a templated constructor be explicitly instantiated or specialized?

Section: 12.1 [class.ctor] Status: open Submitter: Mark Mitchell Date: 19 May 2006

Although it is not possible to specify a constructor's template arguments in a constructor invocation (because the constructor has no name but is invoked by use of the constructor's class's name), it is possible to “name” the constructor in declarative contexts: per 3.4.3.1 [class.qual] paragraph 2,

> In a lookup in which the constructor is an acceptable lookup result, if the nested-name-specifier nominates a class `C`, and the name specified after the nested-name-specifier, when looked up in `C`, is the injected-class-name of `C` (clause 9 [class]), the name is instead considered to name the constructor of class `C`... Such a constructor name shall be used only in the declarator-id of a declaration that names a constructor.

Should it therefore be possible to specify template-arguments for a templated constructor in an explicit instantiation or specialization? For example,

        template <int dim> struct T {};
        struct X {
          template <int dim> X (T<dim> &) {};
        };

        template X::X<> (T<2> &);

If so, that should be clarified in the text. In particular, 12.1 [class.ctor] paragraph 1 says,

> Constructors do not have names. A special declarator syntax using an optional sequence of function-specifiers (7.1.2 [dcl.fct.spec]) followed by the constructor's class name followed by a parameter list is used to declare or define the constructor.

This certainly sounds as if the parameter list must immediately follow the class name, with no allowance for a template argument list.

It would be worthwhile in any event to revise this wording to utilize the “considered to name” approach of 3.4.3.1 [class.qual]; as it stands, this wording sounds as if the following would be acceptable:

        struct S {
            S();
        };
        S() { }    // qualified-id not required?

Notes from the October, 2006 meeting:

It was observed that explicitly specifying the template arguments in a constructor declaration is never actually necessary because the arguments are, by definition, all deducible and can thus be omitted.

#### 1808. Constructor templates vs default constructors

Section: 12.1 [class.ctor] Status: open Submitter: Richard Smith Date: 2013-11-12

It is not clear when, if ever, a constructor template can be considered to provide a default constructor. For example:

      struct A {
        template<typename ...T> A(T...); // #1
        A(std::initializer_list<long>);  // #2
      };
      A a{};

According to 8.5.4 [dcl.init.list] paragraph 3, `A` will be value-initialized if it has a default constructor, and there is implementation divergence whether this example calls #1 or #2.

Similarly, for an example like

      struct B {
        template<typename T=int> B(T = 0);
      };

it is not completely clear whether a default constructor should be implicitly declared or not.

More generally, do utterances in the Standard concerning “constructors” also apply to constructor templates?

Notes from the February, 2014 meeting:

One possibility discussed was that we may need to change places that explicitly refer to a default constructor to use overload resolution, similar to the change that was made a few years ago with regard to copy construction vs “copy constructor.” One additional use of “default constructor” is in determining the triviality of a class, but it might be a good idea to remove the concept of a trivial class altogether. This possibility will be explored.

#### 1969. Missing exclusion of `~S` as an ordinary function name

Section: 12.4 [class.dtor] Status: open Submitter: Richard Smith Date: 2014-07-14

There does not appear to be wording to exclude use of a name like `~S` for entities other than destructors.

#### 607. Lookup of mem-initializer-ids

Section: 12.6.2 [class.base.init] Status: open Submitter: Richard Corden Date: 5 December 2006

In an example like,

        struct Y {};

        template <typename T>
        struct X : public virtual Y { };

        template <typename T>
        class A : public X<T> {
          template <typename S>
          A (S)
            : S ()
          {
          }
        };

        template A<int>::A (Y);

Should `S` be found? (`S` is a dependent name, so if it resolves to a base class type in the instantiated template, it should satisfy the requirements.) All the compilers I tried allowed this example, but 12.6.2 [class.base.init] paragraph 2 says,

> Names in a mem-initializer-id are looked up in the scope of the constructor's class and, if not found in that scope, are looked up in the scope containing the constructor's definition.

The name `S` is not declared in those scopes.

Mike Miller: Here's another example that is accepted by most/all compilers but not by the current wording:

        namespace N {
          struct B { B(int); };
          typedef B typedef_B;
          struct D: B {
            D();
          };
        }

        N::D::D(): typedef_B(0) { }

Except for the fact that the constructor function parameter names are ignored (see paragraph 7), what the compilers seem to be doing is essentially ordinary unqualified name lookup.

Notes from the October, 2009 meeting:

The eventual resolution of this issue should take into account the template parameter scope introduced by the resolution of issue 481.

#### 6. Should the optimization that allows a class object to alias another object also allow the case of a parameter in an inline function to alias its argument?

Section: 12.8 [class.copy] Status: open Submitter: unknown Date: unknown

[Picked up by evolution group at October 2002 meeting.]

(See also paper J16/99-0005 = WG21 N1182.)

At the London meeting, 12.8 [class.copy] paragraph 31 was changed to limit the optimization described to only the following cases:

- the source is a temporary object
- the return value optimization

One other case was deemed desirable as well:

- aliasing a parameter in an inline function call to the function call argument.

However, there are cases when this aliasing was deemed undesirable and, at the London meeting, the committee was not able to clearly delimit which cases should be allowed and which ones should be prohibited.

Can we find an appropriate description for the desired cases?

Rationale (04/99): The absence of this optimization does not constitute a defect in the Standard, although the proposed resolution in the paper should be considered when the Standard is revised.

Note (March, 2008):

The Evolution Working Group has accepted the intent of this issue and referred it to CWG for action (not for C++0x). See paper J16/07-0033 = WG21 N2173.

Notes from the June, 2008 meeting:

The CWG decided to take no action on this issue until an interested party produces a paper with analysis and a proposal.

#### 1049. Copy elision through reference parameters of inline functions

Section: 12.8 [class.copy] Status: open Submitter: Jason Merrill Date: 2010-03-10

Consider the following example:

        int c;

        struct A {
           A() { ++c; }
           A(const A&) { ++c; }
        };

        struct B {
           A a;
           B(const A& a): a(a) { }
        };

        int main() {
           (B(A()));
           return c - 1;
        }

Here we would like to be able to avoid the copy and just construct the `A()` directly into the `A` subobject of `B`. But we can't, because it isn't allowed by 12.8 [class.copy] paragraph 34 bullet 3:

- when a temporary class object that has not been bound to a reference (12.2 [class.temporary]) would be copied/moved to a class object with the same cv-unqualified type, the copy/move operation can be omitted by constructing the temporary object directly into the target of the omitted copy/move

The part about not being bound to a reference was added for an unrelated reason by issue 185. If that resolution were recast to require that the temporary object is not accessed after the copy, rather than banning the reference binding, this optimization could be applied.

The similar example using pass by value is also not one of the allowed cases, which could be considered part of issue 6.

#### 1928. Triviality of deleted special member functions

Section: 12.8 [class.copy] Status: open Submitter: Richard Smith Date: 2014-05-15

The current wording of the Standard does not make clear whether a special member function that is defaulted and implicitly deleted is trivial. Triviality is visible in various ways that don't involve invoking the function, such as determining whether a type is trivially copyable and determining the result of various type traits. It also factors into some ABI specifications.

(See also issue 1734.)

Notes from the June, 2014 meeting:

CWG felt that deleted functions should be trivial. See also issue 1590.

Additional note, November, 2014:

See paper N4148.

#### 1991. Inheriting constructors vs default arguments

Section: 12.9 [class.inhctor] Status: open Submitter: Hubert Tong Date: 2014-08-27

The creation of inheriting constructors does not, but should, consider the default arguments of constructors in the inheriting class. For example,

      struct A {
        A(int, int);
      };

      struct B : A {
        using A::A;
        B(int, int, int = 0); // does not suppress creation of B(int, int) from A(int, int)
      };

#### 545. User-defined conversions and built-in operator overload resolution

Section: 13.3.1.2 [over.match.oper] Status: open Submitter: Steve Clamage Date: 31 October 2005

Consider the following example:

        class B1 {};
        typedef void (B1::*PB1) (); // memptr to B1

        class B2 {};
        typedef void (B2::*PB2) (); // memptr to B2

        class D1 : public B1, public B2 {};
        typedef void (D1::*PD) (); // memptr to D1

        struct S {
             operator PB1(); // can be converted to PD
        } s;
        struct T {
             operator PB2(); // can be converted to PD
        } t;

        void foo() {
             s == t; // Is this an error?
        }

According to 13.6 [over.built] paragraph 16, there is an `operator==` for `PD` (“For every pointer to member type...”), so why wouldn't it be used for this comparison?

Mike Miller: The problem, as I understand it, is that 13.3.1.2 [over.match.oper] paragraph 3, bullet 3, sub-bullet 3 is broader than it was intended to be. It says that candidate built-in operators must “accept operand types to which the given operand or operands can be converted according to 13.3.3.1 [over.best.ics].” 13.3.3.1.2 [over.ics.user] describes user-defined conversions as having a second standard conversion sequence, and there is nothing to restrict that second standard conversion sequence.

My initial thought on addressing this would be to say that user-defined conversion sequences whose second standard conversion sequence contains a pointer conversion or a pointer-to-member conversion are not considered when selecting built-in candidate operator functions. They would still be applicable after the hand-off to Clause 5 (e.g., in bringing the operands to their common type, 5.10 [expr.eq], or composite pointer type, 5.9 [expr.rel]), just not in constructing the list of built-in candidate operator functions.

I started to suggest restricting the second standard conversion sequence to conversions having Promotion or Exact Match rank, but that would exclude the Boolean conversions, which are needed for `!`, `&&`, and `||`. (It would have also restricted the floating-integral conversions, though, which might be a good idea. They can't be used implicitly, I think, because there would be an ambiguity among all the promoted integral types; however, none of the compilers I tested even tried those conversions because the errors I got were not ambiguities but things like “floating point operands not allowed for `%`”.)

Bill Gibbons: I recall seeing this problem before, though possibly not in committee discussions. As written this rule makes the set of candidate functions dependent on what classes have been defined, including classes not otherwise required to have been defined in order for "==" to be meaningful. For templates this implies that the set is dependent on what templates have been instantiated, e.g.

      template<class T> class U : public T { };
      U<B1> u;  // changes the set of candidate functions to include
                // operator==(U<B1>,U<B1>)?

There may be other places where the existence of a class definition, or worse, a template instantiation, changes the semantics of an otherwise valid program (e.g. pointer conversions?) but it seems like something to be avoided.

(See also issue 954.)

#### 1919. Overload resolution for `!` with explicit conversion operator

Section: 13.3.1.2 [over.match.oper] Status: open Submitter: Johannes Schaub Date: 2014-04-30

Although the intent is that the `!` operator should be usable with an operand that is a class object having an explicit conversion to `bool` (i.e., its operand is “contextually converted to `bool`”), the selection of the conversion operator is done via 13.3.1.2 [over.match.oper], 13.3.2 [over.match.viable], and 13.3.3 [over.match.best], which do not make specific allowance for this special characteristic of the `!` operator and thus will not select the explicit conversion function.

Notes from the June, 2014 meeting:

CWG noted that this same issue affects `&&` and `||`.

#### 1781. Converting from `nullptr_t` to `bool` in overload resolution

Section: 13.3.1.5 [over.match.conv] Status: open Submitter: Hubert Tong Date: 2013-09-26

According to 13.3.1.5 [over.match.conv] paragraph 1, when a class type `S` is used as an initializer for an object of type `T`,

> The conversion functions of `S` and its base classes are considered. Those non-explicit conversion functions that are not hidden within `S` and yield type `T` or a type that can be converted to type `T` via a standard conversion sequence (13.3.3.1.1 [over.ics.scs]) are candidate functions.

Because conversion from `std::nullptr_t` to `bool` is only permitted in direct-initialization (4.12 [conv.bool]), it is not clear whether there is a standard conversion sequence from `std::nullptr_t` to `bool`, considering that an implicit conversion sequence is intended to model copy-initialization. Should 13.3.1.5 [over.match.conv] be understood to refer only to conversions permitted in copy-initialization, or should the form of the initialization be considered? For example,

      struct SomeType {
        operator std::nullptr_t();
      };
      bool b{ SomeType() };    // Well-formed?

Note also 13.3.3.2 [over.ics.rank] paragraph 4, which may bear on the intent (or, alternatively, might describe a situation that cannot arise):

> A conversion that does not convert a pointer, a pointer to member, or `std::nullptr_t` to `bool` is better than one that does.

#### 418. Imperfect wording on error on multiple default arguments on a called function

Section: 13.3.3 [over.match.best] Status: open Submitter: Chris Bowler Date: 27 May 2003

According to 13.3.3 [over.match.best] paragraph 4, the following program appears to be ill-formed:

      void f(int, int=0);
      void f(int=0, int);

      void g() {
        f();
      }

Though I do not expect this is the intent of this paragraph in the standard.

13.3.3 [over.match.best] paragraph 4:

> If the best viable function resolves to a function for which multiple declarations were found, and if at least two of these declarations or the declarations they refer to in the case of using-declarations specify a default argument that made the function viable, the program is ill-formed. [Example:

>     namespace A {
>       extern "C" void f(int = 5);
>     }
>     namespace B {
>       extern "C" void f(int = 5);
>     }
>     using A::f;
>     using B::f;
>     void use() {
>     f(3); //OK, default argument was not used for viability
>     f(); //Error: found default argument twice
>     }

> end example]

#### 1459. Reference-binding tiebreakers in overload resolution

Section: 13.3.3.2 [over.ics.rank] Status: open Submitter: Jason Merrill Date: 2012-02-07

Both paragraph 3 and paragraph 4 of 13.3.3.2 [over.ics.rank] have overload resolution tiebreakers for reference binding. It might be possible to merge those into a single treatment.

#### 1038. Overload resolution of `&x.static_func`

Section: 13.4 [over.over] Status: open Submitter: Mike Miller Date: 2010-03-02

The Standard is not clear whether the following example is well-formed or not:

        struct S {
            static void f(int);
            static void f(double);
        };
        S s;
        void (*pf)(int) = &s.f;

According to 5.2.5 [expr.ref] paragraph 4 bullet 3, you do function overload resolution to determine whether `x.f` is a static or non-static member function. 5.3.1 [expr.unary.op] paragraph 6 says that you can only take the address of an overloaded function in a context that determines the overload to be chosen, and the initialization of a function pointer is such a context (13.4 [over.over] paragraph 1). The problem is that 13.4 [over.over] is phrased in terms of “an overloaded function name,” and this is a member access expression, not a name.

There is variability among implementations as to whether this example is accepted; some accept it as written, some only if the `&` is omitted, and some reject it in both forms.

Additional note (October, 2010):

A related question concerns an example like

        struct S {
            static void g(int*) {}
            static void g(long) {}
        } s;

        void foo() {
            (&s.g)(0L);
        }

Because the address occurs in a call context and not in one of the contexts mentioned in 13.4 [over.over] paragraph 1, the call expression in `foo` is presumably ill-formed. Contrast this with the similar example

        void g1(int*) {}
        void g1(long) {}

        void foo1() {
            (&g1)(0L);
        }

This call presumably is well-formed because 13.3.1.1 [over.match.call] applies to “the address of a set of overloaded functions.” (This was clearer in the wording prior to the resolution of issue 704: “...in this context using `&F` behaves the same as using the name `F` by itself.”) It's not clear that there's any reason to treat these two cases differently.

This question also bears on the original question of this issue, since the original wording of 13.3.1.1 [over.match.call] also described the case of an ordinary member function call like `s.g(0L)` as involving the “name” of the function, even though the postfix-expression is a member access expression and not a “name.” Perhaps the reference to “name” in 13.4 [over.over] should be similarly understood as applying to member access expressions?

#### 1549. Overloaded comma operator with `void` operand

Section: 13.5.2 [over.binary] Status: open Submitter: Nikolay Ivchenkov Date: 2012-09-04

Even though a function cannot take a parameter of type `void`, the current rules for overload resolution require consideration of overloaded operators when one operand has a user-defined or enumeration type and the other has type `void`. This can result in side effects and possibly errors, for example:

      template <class T> struct A {
        T t;
        typedef T type;
      };

      struct X {
        typedef A<void> type;
      };

      template <class T> void operator ,(typename T::type::type, T) {}

      int main() {
        X(), void(); // OK
        void(), X(); // error: A<void> is instantiated with a field of
                     // type void
      }

#### 1620. User-defined literals and extended integer types

Section: 13.5.8 [over.literal] Status: open Submitter: Jason Merrill Date: 2013-02-12

Although numeric literals can have extended integer types, user-defined literal operators cannot have a parameter of an extended integer type. This seems like an oversight.

#### 260. User-defined conversions and built-in `operator=`

Section: 13.6 [over.built] Status: open Submitter: Scott Douglas Date: 4 Nov 2000

According to the Standard (although not implemented this way in most implementations), the following code exhibits non-intuitive behavior:

      struct T {
        operator short() const;
        operator int() const;
      };

      short s;

      void f(const T& t) {
        s = t;  // surprisingly calls T::operator int() const
      }

The reason for this choice is 13.6 [over.built] paragraph 18:

> For every triple (L, VQ, R), where L is an arithmetic type, VQ is either `volatile` or empty, and R is a promoted arithmetic type, there exist candidate operator functions of the form

> VQ L`& operator=(`VQ L`&,` R`);`

Because R is a "promoted arithmetic type," the second argument to the built-in assignment operator is `int`, causing the unexpected choice of conversion function.

Suggested resolution: Provide built-in assignment operators for the unpromoted arithmetic types.

Related to the preceding, but not resolved by the suggested resolution, is the following problem. Given:

        struct T {
    	 operator int() const;
    	 operator double() const;
        };

I believe the standard requires the following assignment to be ambiguous (even though I expect that would surprise the user):

        double x;
        void f(const T& t) { x = t; }

The problem is that both of these built-in `operator=()`s exist (13.6 [over.built] paragraph 18):

        double& operator=(double&, int);
        double& operator=(double&, double);

Both are an exact match on the first argument and a user conversion on the second. There is no rule that says one is a better match than the other.

The compilers that I have tried (even in their strictest setting) do not give a peep. I think they are not following the standard. They pick `double& operator=(double&, double)` and use `T::operator double() const`.

I hesitate to suggest changes to overload resolution, but a possible resolution might be to introduce a rule that, for built-in `operator=` only, also considers the conversion sequence from the second to the first type. This would also resolve the earlier question.

It would still leave `x += t` etc. ambiguous -- which might be the desired behavior and is the current behavior of some compilers.

Notes from the 04/01 meeting:

The difference between initialization and assignment is disturbing. On the other hand, promotion is ubiquitous in the language, and this is the beginning of a very slippery slope (as the second report above demonstrates).

Additional note (August, 2010):

See issue 507 for a similar example involving comparison operators.

#### 954. Overload resolution of conversion operator templates with built-in types

Section: 13.6 [over.built] Status: open Submitter: Steve Clamage Date: 19 August, 2009

Consider the following example:

        struct NullClass {
            template<typename T> operator T () { return 0 ; }
        };

        int main() {
            NullClass n;
            n==5;        // #1
            return 0;
        }

The comparison at #1 is, according to the current Standard, ambiguous. According to 13.6 [over.built] paragraph 12, the candidates for `operator==(L, R)` include functions “for every pair of promoted arithmetic types,” so `L` could be either `int` or `long`, and the conversion operator template will provide an exact match for either.

Some implementations unambiguously choose the `int` candidate. Perhaps the overload resolution rules could be tweaked to prefer candidates in which `L` and `R` are the same type?

(See also issue 545.)

#### 110. Can template functions and classes be declared in the same scope?

Section: 14 [temp] Status: open Submitter: John Spicer Date: 28 Apr 1999

According to 14 [temp] paragraph 5,

> Except that a function template can be overloaded either by (non-template) functions with the same name or by other function templates with the same name (14.8.3 [temp.over] ), a template name declared in namespace scope or in class scope shall be unique in that scope.

3.3.10 [basic.scope.hiding] paragraph 2 agrees that only functions, not function templates, can hide a class name declared in the same scope:

> A class name (9.1 [class.name] ) or enumeration name (7.2 [dcl.enum] ) can be hidden by the name of an object, function, or enumerator declared in the same scope.

However, 3.3 [basic.scope] paragraph 4 treats functions and template functions together in this regard:

> Given a set of declarations in a single declarative region, each of which specifies the same unqualified name,
> - they shall all refer to the same entity, or all refer to functions and function templates; or
> - exactly one declaration shall declare a class name or enumeration name that is not a typedef name and the other declarations shall all refer to the same object or enumerator, or all refer to functions and function templates; in this case the class name or enumeration name is hidden

John Spicer: You should be able to take an existing program and replace an existing function with a function template without breaking unrelated parts of the program. In addition, all of the compilers I tried allow this usage (EDG, Sun, egcs, Watcom, Microsoft, Borland). I would recommend that function templates be handled exactly like functions for purposes of name hiding.

Martin O'Riordan: I don't see any justification for extending the purview of what is decidedly a hack, just for the sake of consistency. In fact, I think we should go further and in the interest of consistency, we should deprecate the hack, scheduling its eventual removal from the C++ language standard.

The hack is there to allow old C programs and especially the 'stat.h' file to compile with minimum effort (also several other Posix and X headers). People changing such older programs have ample opportunity to "do it right". Indeed, if you are adding templates to an existing program, you should probably be placing your templates in a 'namespace', so the issue disappears anyway. The lookup rules should be able to provide the behaviour you need without further hacking.

#### 2032. Default template-arguments of variable templates

Section: 14.1 [temp.param] Status: open Submitter: CWG Date: 2014-11-03

According to 14.1 [temp.param] paragraph11,

> If a template-parameter of a class template or alias template has a default template-argument, each subsequent template-parameter shall either have a default template-argument supplied or be a template parameter pack. If a template-parameter of a primary class template or alias template is a template parameter pack, it shall be the last template-parameter.

These requirements should apply to variable templates as well.

#### 579. What is a “nested” `>` or `>>`?

Section: 14.2 [temp.names] Status: open Submitter: Daveed Vandevoorde Date: 11 May 2006

The Standard does not normatively define which `>` and `>>` tokens are to be taken as closing a template-argument-list; instead, 14.2 [temp.names] paragraph 3 uses the undefined and imprecise term “non-nested:”

> When parsing a template-id, the first non-nested `>` is taken as the end of the template-argument-list rather than a greater-than operator. Similarly, the first non-nested `>>` is treated as two consecutive but distinct `>` tokens, the first of which is taken as the end of the template-argument-list and completes the template-id.

The (non-normative) footnote clarifies that

> A `>` that encloses the type-id of a `dynamic_cast`, `static_cast`, `reinterpret_cast` or `const_cast`, or which encloses the template-arguments of a subsequent template-id, is considered nested for the purpose of this description.

Aside from the questionable wording of this footnote (e.g., in what sense does a single terminating character “enclose” anything, and is a nested template-id “subsequent?”) and the fact that it is non-normative, it does not provide a complete definition of what “nesting” is intended to mean. For example, is the first `>` in this putative template-id “nested” or not?

        X<a ? b > c : d>

Additional note (January, 2014):

A similar problem exists for an `operator>` template:

      struct S;
      template<void (*)(S, S)> struct X {};
      void operator>(S, S);
      X<operator> > x;

Somehow the specification must be written to avoid taking the `>` token in the operator name as the end of the template argument list for `X`.

#### 440. Allow implicit pointer-to-member conversion on nontype template argument

Section: 14.3 [temp.arg] Status: open Submitter: David Abrahams Date: 13 Nov 2003

None of my compilers accept this, which surprised me a little. Is the base-to-derived member function conversion considered to be a runtime-only thing?

      template <class D>
      struct B
      {
          template <class X> void f(X) {}
          template <class X, void (D::*)(X) = &B<D>::f<X> >
          struct row {};
      };
      struct D : B<D>
      {
          void g(int);
          row<int,&D::g> r1;
          row<char*> r2;
      };

John Spicer: This is not among the permitted conversions listed in 14.3.

I'm not sure there is a terribly good reason for that. Some of the template argument rules for external entities were made conservatively because of concerns about issues of mangling template argument names.

David Abrahams: I'd really like to see that restriction loosened. It is a serious inconvenience because there appears to be no way to supply a usable default in this case. Zero would be an OK default if I could use the function pointer's equality to zero as a compile-time switch to choose an empty function implementation:

      template <bool x> struct tag {};

      template <class D>
      struct B
      {
          template <class X> void f(X) {}

          template <class X, void (D::*pmf)(X) = 0 >
          struct row {
              void h() { h(tag<(pmf == 0)>(), pmf); }
              void h(tag<1>, ...) {}
              void h(tag<0>, void (D::*q)(X)) { /*something*/}
          };
      };

      struct D : B<D>
      {
          void g(int);
          row<int,&D::g> r1;
          row<char*> r2;
      };

But there appears to be no way to get that effect either. The result is that you end up doing something like:

          template <class X, void (D::*pmf)(X) = 0 >
          struct row {
              void h() { if (pmf) /*something*/ }
          };

which invariably makes compilers warn that you're switching on a constant expression.

#### 150. Template template parameters and default arguments

Section: 14.3.3 [temp.arg.template] Status: open Submitter: Mike Miller Date: 3 Aug 1999

[Picked up by evolution group at October 2002 meeting.]

How are default template arguments handled with respect to template template parameters? Two separate questions have been raised:

1. Do default template arguments allow a template argument to match a template parameter with fewer template parameters, and can the template template parameter be specialized using the smaller number of template arguments? For example,

           template <class T, class U = int>
           class ARG { };

           template <class X, template <class Y> class PARM>
           void f(PARM<X>) { }    // specialization permitted?

           void g() {
               ARG<int> x;        // actually ARG<int, int>
               f(x);              // does ARG (2 parms, 1 with default)
                                  // match PARM (1 parm)?

   Template template parameters are deducible (14.8.2.5 [temp.deduct.type] paragraph 9), but 14.3.3 [temp.arg.template] does not specify how matching is done.

   Jack Rouse: I implemented template template parameters assuming template signature matching is analogous to function type matching. This seems like the minimum reasonable implementation. The code in the example would not be accepted by this compiler. However, template default arguments are compile time entities so it seems reasonable to relax the matching rules to allow cases like the one in the example. But I would consider this to be an extension to the language.

   Herb Sutter: An open issue in the LWG is that the standard doesn't explicitly permit or forbid implementations' adding additional template-parameters to those specified by the standard, and the LWG may be leaning toward explicitly permitting this. [Under this interpretation,] if the standard is ever modified to allow additional template-parameters, then writing "a template that takes a standard library template as a template template parameter" won't be just ugly because you have to mention the defaulted parameters; it would not be (portably) possible at all except possibly by defining entire families of overloaded templates to account for all the possible numbers of parameters `vector<>` (or anything else) might actually have. That seems unfortunate.

2. Are default arguments permitted in the template parameter list of a template template parameter? For example,

           template <template <class T, class U = int> class PARM>
           class C {
               PARM<int> pi;
           };

   Jack Rouse: I decided they could not in the compiler I support. This continues the analogy with function type matching. Also, I did not see a strong need to allow default arguments in this context.

   A class template used as a template template argument can have default template arguments from its declarations. How are the two sources of default arguments to be reconciled? The default arguments from the template template formal could override. But it could be cofusing if a template-id using the argument template, `ARG<int>`, behaves differently from a template-id using the template formal name, `FORMAL<int>`.

Rationale (10/99): Template template parameters are intended to be handled analogously to function function parameters. Thus the number of parameters in a template template argument must match the number of parameters in a template template parameter, regardless of whether any of those paramaters have default arguments or not. Default arguments are allowed for the parameters of a template template parameter, and those default arguments alone will be considered in a specialization of the template template parameter within a template definition; any default arguments for the parameters of a template template argument are ignored.

Note (Mark Mitchell, February, 2006):

Perhaps it is already obvious to all, but it seems worth noting that this extension would change the meaning of conforming programs:

        struct Dense { static const unsigned int dim = 1; };

        template <template <typename> class View,
                  typename Block>
        void operator+(float, View<Block> const&);

        template <typename Block,
                  unsigned int Dim = Block::dim>
        struct Lvalue_proxy { operator float() const; };

        void test_1d (void) {
            Lvalue_proxy<Dense> p;
            float b;
            b + p;
        }

If `Lvalue_proxy` is allowed to bind to `View`, then the template `operator+` will be used to perform addition; otherwise, `Lvalue_proxy`'s implicit conversion to float, followed by the built-in addition on floats will be used.

Note (March, 2008):

The Evolution Working Group has accepted the intent of this issue and referred it to CWG for action (not for C++0x). See paper J16/07-0033 = WG21 N2173.

Notes from the June, 2008 meeting:

The CWG decided to take no action on this issue until an interested party produces a paper with analysis and a proposal.

#### 1918. `friend` templates with dependent scopes

Section: 14.5.4 [temp.friend] Status: open Submitter: Richard Smith Date: 2014-04-27

It is not clear what should happen for an example like:

      template<typename T> struct A {
        class B {
          class C {};
        };
      };
      class X {
        static int x;
        template <typename T> friend class A<T>::B::C;
      };
      template<> struct A<int> {
        typedef struct Q B;
      };
      struct Q {
        class C {
          int f() { return X::x; }
        };
      };

It appears that the friend template matches `Q::C`, because that class is also `A<int>::B::C`, but neither GCC nor EDG allow this code (saying `X::x` is inaccessible). (Clang doesn't support friend template declarations with a dependent scope.)

A strict reading of 14.5.4 [temp.friend] paragraph 5 might suggest that the friend declaration itself is ill-formed, because it does not declare a member of a class template, but I can't find any compiler that implements template friends that way.

#### 1945. Friend declarations naming members of class templates in non-templates

Section: 14.5.4 [temp.friend] Status: open Submitter: Richard Smith Date: 2014-06-19

During the discussion of issue 1918, it was decided that the last part of the issue should be split off into a separate issue. According to 14.5.4 [temp.friend] paragraph 5,

> A member of a class template may be declared to be a friend of a non-template class.

Does this make the example from issue 1918,

      template<typename T> struct A {
        class B {
          class C {};
        };
      };
      class X {
        static int x;
        template <typename T> friend class A<T>::B::C;
      };
      template<> struct A<int> {
        typedef struct Q B;
      };
      struct Q {
        class C {
          int f() { return X::x; }
        };
      };

ill-formed because the friend declaration does not refer to a member of a class template? This does not appear to be the interpretation chosen by most implementations.

#### 708. Partial specialization of member templates of class templates

Section: 14.5.5 [temp.class.spec] Status: open Submitter: James Widman Date: 8 Aug, 2008

The Standard does not appear to specify clearly the effect of a partial specialization of a member template of a class template. For example:

        template<class T> struct B {
             template<class U> struct A { // #1
                 void h() {}
             };
             template<class U> struct A<U*> {  // #2
                 void f() {}
             };
        };

        template<> template<class U> struct B<int>::A { // #3
             void g() {}
        };

        void q(B<int>::A<char*>& p) {
             p.f();  // #4
        }

The explicit specialization at #3 replaces the primary member template #1 of `B<int>`; however, it is not clear whether the partial specialization #2 should be considered to apply to the explicitly-specialized member template of `A<int>` (thus allowing the call to `p.f()` at #4) or whether the partial specialization will be used only for specializations of `B` that are implicitly instantiated (meaning that #4 could call `p.g()` but not `p.f()`).

#### 2033. Redundant restriction on partial specialization argument

Section: 14.5.5 [temp.class.spec] Status: open Submitter: CWG Date: 2014-11-04

Bullets 8.3 and 8.4 of 14.5.5 [temp.class.spec] say,

> Within the argument list of a class template partial specialization, the following restrictions apply:

> - ...

> - The argument list of the specialization shall not be identical to the implicit argument list of the primary template.

> - The specialization shall be more specialized than the primary template (14.5.5.2 [temp.class.order]).

> - ...

The former is implied by the latter and should be omitted.

#### 2035. Multi-section example is confusing

Section: 14.5.5.1 [temp.class.spec.match] Status: open Submitter: CWG Date: 2014-11-06

The example in 14.5.5.1 [temp.class.spec.match] paragraph 2 reads,

      A<int, int, 1>   a1;   // uses #1
      A<int, int*, 1>  a2;   // uses #2, T is int, I is 1
      A<int, char*, 5> a3;   // uses #4, T is char
      A<int, char*, 1> a4;   // uses #5, T1 is int, T2 is char, I is 1
      A<int*, int*, 2> a5;   // ambiguous: matches #3 and #5

However, the referenced numbers are defined two pages earlier, in 14.5.5 [temp.class.spec] paragraph 3. This is confusing and should be changed.

#### 310. Can function templates differing only in parameter cv-qualifiers be overloaded?

Section: 14.5.6.1 [temp.over.link] Status: open Submitter: Andrei Iltchenko Date: 29 Aug 2001

I get the following error diagnostic [from the EDG front end]:

    line 8: error: function template "example<T>::foo<R,A>(A)" has
              already been declared
         R  foo(const A);
            ^

when compiling this piece of code:

    struct  example  {
       template<class R, class A>   // 1-st member template
       R  foo(A);
       template<class R, class A>   // 2-nd member template
       const R  foo(A&);
       template<class R, class A>   // 3-d  member template
       R  foo(const A);
    };

    /*template<> template<>
    int  example<char>::foo(int&);*/

    int  main()
    {
       int  (example<char>::* pf)(int&) =
          &example<char>::foo;
    }

The implementation complains that

       template<class R, class A>   // 1-st member template
       R  foo(A);
       template<class R, class A>   // 3-d  member template
       R  foo(const A);

cannot be overloaded and I don't see any reason for it since it is function template specializations that are treated like ordinary non-template functions, meaning that the transformation of a parameter-declaration-clause into the corresponding parameter-type-list is applied to specializations (when determining its type) and not to function templates.

What makes me think so is the contents of 14.5.6.1 [temp.over.link] and the following sentence from 14.8.2.1 [temp.deduct.call] "If P is a cv-qualified type, the top level cv-qualifiers of P are ignored for type deduction". If the transformation was to be applied to function templates, then there would be no reason for having that sentence in 14.8.2.1 [temp.deduct.call].

14.8.2.2 [temp.deduct.funcaddr], which my example is based upon, says nothing about ignoring the top level cv-qualifiers of the function parameters of the function template whose address is being taken.

As a result, I expect that template argument deduction will fail for the 2-nd and 3-d member templates and the 1-st one will be used for the instantiation of the specialization.

#### 1644. Equivalent exception-specifications in function template declarations

Section: 14.5.6.1 [temp.over.link] Status: open Submitter: Richard Smith Date: 2013-03-17

Although 15.4 [except.spec] paragraph 3 says,

> Two exception-specifications are compatible if:

> - ...

> - both have the form `noexcept(`constant-expression`)` and the constant-expressions are equivalent, or

> - ...

it is not clear whether “equivalent” in this context should be taken as a reference to the definition of equivalent given in 14.5.6.1 [temp.over.link] paragraph 5:

> Two expressions involving template parameters are considered equivalent if two function definitions containing the expressions would satisfy the one definition rule (3.2 [basic.def.odr]), except that the tokens used to name the template parameters may differ as long as a token used to name a template parameter in one expression is replaced by another token that names the same template parameter in the other expression.

since the context there is expressions that appear in function template parameters and return types.

There is implementation variance on this question.

#### 2025. Declaration matching via alias templates

Section: 14.5.6.1 [temp.over.link] Status: open Submitter: Richard Smith Date: 2014-10-17

Consider the following example:

      template<typename ...T> struct X { void f(); static int n; };
      template<typename T, typename U> using A = T;
      template<typename ...T> void X<A<T, decltype(sizeof(T))>...>::f() {}
      template<typename ...T> void X<A<T, decltype(sizeof(T))>...>::n = 0;
      void g() { X<void>().f(); X<void>::n = 1; }

Should this be valid? The best answer would seem to be to produce an error during instantiation, and that appears to be consistent with the current Standard wording, but there is implementation divergence.

See also issue 2021.

#### 402. More on partial ordering of function templates

Section: 14.5.6.2 [temp.func.order] Status: open Submitter: Nathan Sidwell Date: 7 Apr 2003

This was split off from issue 214 at the April 2003 meeting.

Nathan Sidwell: John Spicer's proposed resolution does not make the following well-formed.

      template <typename T> int Foo (T const *) {return 1;} //#1
      template <unsigned I> int Foo (char const (&)[I]) {return 2;} //#2

      int main ()
      {
        return Foo ("a") != 2;
      }

Both #1 and #2 can deduce the "a" argument, #1 deduces T as char and #2 deduces I as 2. However, neither is more specialized because the proposed rules do not have any array to pointer decay.

#1 is only deduceable because of the rules in 14.8.2.1 [temp.deduct.call] paragraph 2 that decay array and function type arguments when the template parameter is not a reference. Given that such behaviour happens in deduction, I believe there should be equivalent behaviour during partial ordering. #2 should be resolved as more specialized as #1. The following alteration to the proposed resolution of DR214 will do that.

Insert before,

- If A is a cv-qualified type, A is replaced by the cv-unqualified version of A.

the following

- If P was not originally a reference type,
  - If A is an array type, A is replaced by the pointer type produced by the array to pointer conversion
  - If A is a function type, A is replaced by the pointer type produced by the function to pointer conversion

For the example above, this change results in deducing 'T const *' against 'char const *' in one direction (which succeeds), and 'char [I]' against 'T const *' in the other (which fails).

John Spicer: I don't consider this a shortcoming of my proposed wording, as I don't think this is part of the current rules. In other words, the resolution of 214 might make it clearer how this case is handled (i.e., clearer that it is not allowed), but I don't believe it represents a change in the language.

I'm not necessarily opposed to such a change, but I think it should be reviewed by the core group as a related change and not a defect in the proposed resolution to 214.

Notes from the October 2003 meeting:

There was some sentiment that it would be desirable to have this case ordered, but we don't think it's worth spending the time to work on it now. If we look at some larger partial ordering changes at some point, we will consider this again.

#### 1157. Partial ordering of function templates is still underspecified

Section: 14.5.6.2 [temp.func.order] Status: open Submitter: CA Date: 2010-08-03
N3092 comment CA 7

14.5.6.2 [temp.func.order] paragraph 3 says,

> To produce the transformed template, for each type, non-type, or template template parameter (including template parameter packs (14.5.3 [temp.variadic]) thereof) synthesize a unique type, value, or class template respectively and substitute it for each occurrence of that parameter in the function type of the template.

The characteristics of the synthesized entities and how they are determined is not specified. For example, members of a dependent type referred to in non-deduced contexts are not specified to exist, even though the transformed function type would be invalid in their absence.

Example 1:

      template<typename T, typename U> struct A;
      template<typename T> void foo(A<T, typename T::u> *) { } // #1
        // synthetic T1 has member T1::u
      template <typename T> void foo(A<T, typename T::u::v> *) { } // #2
        // synthetic T2 has member T2::u and member T2::u::v
        // T in #1 deduces to synthetic T2 in partial ordering;
        // deduced A for the parameter is A<T2, T2::u> * --this is not necessarily compatible
        // with A<T2, T2::u::v> * and it does not need to be. See Note 1. The effect is that
        // (in the call below) the compatibility of B::u and B::u::v is respected.
        // T in #2 cannot be successfully deduced in partial ordering from A<T1, T1::u> *;
        // invalid type T1::u::v will be formed when T1 is substituted into non-deduced contexts.
      struct B {
        struct u { typedef u v; };
      };
      int main() {
        foo((A<B, B::u> *)0); // calls #2
      }

Note 1: Template argument deduction is an attempt to match a `P` and a deduced `A`; however, template argument deduction is not specified to fail if the `P` and the deduced `A` are incompatible. This may occur in the presence of non-deduced contexts. Notwithstanding the parenthetical statement in 14.8.2.4 [temp.deduct.partial] paragraph 9, template argument deduction may succeed in determining a template argument for every template parameter while producing a deduced `A` that is not compatible with the corresponding `P`.

Example 2:

      template <typename T, typename U, typename V> struct A;
      template <typename T>
        void foo(A<T, struct T::u, struct T::u::u> *); // #2.1
          // synthetic T1 has member non-union class T1::u
      template <typename T, typename U>
        void foo(A<T, U , U> *); // #2.2
          // synthetic T2 and U2 has no required properties
          // T in #2.1 cannot be deduced in partial ordering from A<T2, U2, U2> *;
          // invalid types T2::u and T2::u::u will be formed when T2 is substituted in nondeduced contexts.
          // T and U in #2.2 deduces to, respectively, T1 and T1::u from A<T1, T1::u, struct
    T1::u::u> * unless
          // struct T1::u::u does not refer to the injected-class-name of the class T1::u (if that is possible).
      struct B {
        struct u { };
      };
      int main() {
        foo((A<B, B::u, struct B::u::u> *)0); // calls #2.1
      }

It is, however, unclear to what extent an implementation will have to go to determine these minimal properties.

#### 1979. Alias template specialization in template member definition

Section: 14.5.7 [temp.alias] Status: open Submitter: Gabriel Dos Reis Date: 2014-07-31

In an example like

      template<typename T> struct A {
        struct B {
          void f();
        };
      };

      template<typename T> using X = typename A<T>::B;

      template<typename T> void X<T>::f() { }       // #1

should #1 be considered a definition of `A<T>::B::f()`?

Analogy with alias-declarations would suggest that it should, but alias template specializations involve issues like SFINAE on unused template parameters (see issue 1558) and possibly other complications.

(See also issues 1980, 2021, and 2025.)

#### 1257. Instantiation via non-dependent references in uninstantiated templates

Section: 14.6 [temp.res] Status: open Submitter: Johannes Schaub Date: 2011-03-09

The Standard does not appear to specify whether a non-dependent reference to a template specialization in a template definition that is never instantiated causes the implicit instantiation of the referenced specialization.

#### 1974. Redundant specification of non-type typename-specifier

Section: 14.6 [temp.res] Status: open Submitter: Hubert Tong Date: 2014-07-17

Paragraphs 3-4 of 14.6 [temp.res] read, in part,

> When a qualified-id is intended to refer to a type that is not a member of the current instantiation (14.6.2.1 [temp.dep.type]) and its nested-name-specifier refers to a dependent type, it shall be prefixed by the keyword `typename`, forming a typename-specifier. If the qualified-id in a typename-specifier does not denote a type, the program is ill-formed.

> If a specialization of a template is instantiated for a set of template-arguments such that the qualified-id prefixed by typename does not denote a type, the specialization is ill-formed.

The former requirement is intended to apply to the definition and the latter to an instantiation of a template, but that intent is not completely clear, leading to the perception that they are redundant.

#### 186. Name hiding and template template-parameters

Section: 14.6.1 [temp.local] Status: open Submitter: John Spicer Date: 11 Nov 1999

The standard prohibits a class template from having the same name as one of its template parameters (14.6.1 [temp.local] paragraph 4). This prohibits

        template <class X> class X;

for the reason that the template name would hide the parameter, and such hiding is in general prohibited.

Presumably, we should also prohibit

        template <template <class T> class T> struct A;

for the same reason.

#### 459. Hiding of template parameters by base class members

Section: 14.6.1 [temp.local] Status: open Submitter: Daveed Vandevoorde Date: 2 Feb 2004

Currently, member of nondependent base classes hide references to template parameters in the definition of a derived class template.

Consider the following example:

       class B {
          typedef void *It;    // (1)
          // ...
        };

        class M: B {};

        template<typename> X {};

        template<typename It> struct S   // (2)
            : M, X<It> {   // (3)
          S(It, It);   // (4)
          // ...
        };

As the C++ language currently stands, the name "It" in line (3) refers to the template parameter declared in line (2), but the name "It" in line (4) refers to the typedef in the private base class (declared in line (1)).

This situation is both unintuitive and a hindrance to sound software engineering. (See also the Usenet discussion at http://tinyurl.com/32q8d .) Among other things, it implies that the private section of a base class may change the meaning of the derived class, and (unlike other cases where such things happen) there is no way for the writer of the derived class to defend the code against such intrusion (e.g., by using a qualified name).

Changing this can break code that is valid today. However, such code would have to:

1. name a template parameter and not use it after the opening brace, and
2. use that same name to access a base-class name within the braces.

I personally have no qualms breaking such a program.

It has been suggested to make situations like these ill-formed. That solution is unattractive however because it still leaves the writer of a derived class template without defense against accidental name conflicts with base members. (Although at least the problem would be guaranteed to be caught at compile time.) Instead, since just about everyone's intuition agrees, I would like to see the rules changed to make class template parameters hide members of the same name in a base class.

See also issue 458.

Notes from the March 2004 meeting:

We have some sympathy for a change, but the current rules fall straightforwardly out of the lookup rules, so they're not “wrong.” Making private members invisible also would solve this problem. We'd be willing to look at a paper proposing that.

Additional discussion (April, 2005):

John Spicer: Base class members are more-or-less treated as members of the class, [so] it is only natural that the base [member] would hide the template parameter.

Daveed Vandevoorde: Are base class members really “more or less” members of the class from a lookup perspective? After all, derived class members can hide base class members of the same name. So there is some pretty definite boundary between those two sets of names. IMO, the template parameters should either sit between those two sets, or they should (for lookup purposes) be treated as members of the class they parameterize (I cannot think of a practical difference between those two formulations).

John Spicer: How is [hiding template parameters] different from the fact that namespace members can be hidden by private parts of a base class? The addition of `int C` to `N::A` breaks the code in namespace `M` in this example:

        namespace N {
           class A {
        private:
             int C;
           };
        }

        namespace M {
           typedef int C;
           class B : public N::A {
             void f() {
                 C c;
             }
           };
        }

Daveed Vandevoorde: C++ has a mechanism in place to handle such situations: qualified names. There is no such mechanism in place for template parameters.

Nathan Myers: What I see as obviously incorrect ... is simply that a name defined right where I can see it, and directly attached to the textual scope of `B`'s class body, is ignored in favor of something found in some other file. I don't care that `C1` is defined in `A`, I have a `C1` right here that I have chosen to use. If I want `A::C1`, I can say so.

I doubt you'll find any regular C++ coder who doesn't find the standard behavior bizarre. If the meaning of any code is changed by fixing this behavior, the overwhelming majority of cases will be mysterious bugs magically fixed.

John Spicer: I have not heard complaints that this is actually a cause of problems in real user code. Where is the evidence that the status quo is actually causing problems?

In this example, the `T2` that is found is the one from the base class. I would argue that this is natural because base class members are found as part of the lookup in class `B`:

        struct A {
                 typedef int T2;
        };
        template <class T2> struct B : public A {
                 typedef int T1;
                 T1 t1;
                 T2 t2;
        };

This rule that base class members hide template parameters was formalized about a dozen years ago because it fell out of the principle that base class members should be found at the same stage of lookup as derived class members, and that to do otherwise would be surprising.

Gabriel Dos Reis: The bottom line is that:

1. the proposed change is a silent change of meaning;
2. the proposed change does not make the language any more regular; the current behavior is consistent with everything else, however “surprising” that might be;
3. the proposed change does have its own downsides.

Unless presented with real major programming problems the current rules exhibit, I do not think the simple rule “scopes nest” needs a change that silently mutates program meaning.

Mike Miller: The rationale for the current specification is really very simple:

1. “Unless redeclared in the derived class, members of a base class are also considered to be members of the derived class.” (10 [class.derived] paragraph 2)
2. In class scope, members hide nonmembers.

That's it. Because template parameters are not members, they are hidden by member names (whether inherited or not). I don't find that “bizarre,” or even particularly surprising.

I believe these rules are straightforward and consistent, so I would be opposed to changing them. However, I am not unsympathetic toward Daveed's concern about name hijacking from base classes. How about a rule that would make a program ill-formed if a direct or inherited member hides a template parameter?

Unless this problem is a lot more prevalent than I've heard so far, I would not want to change the lookup rules; making this kind of collision a diagnosable error, however, would prevent hijacking without changing the lookup rules.

Erwin Unruh: I have a different approach that is consistent and changes the interpretation of the questionable code. At present lookup is done in this sequence:

block scope
derived class scope
base class scope
template parameters
namespace scope

If we change this order to

template parameters
block scope
derived class scope
base class scope
namespace scope

it is still consistent in that no lookup is placed between the base class and the derived class. However, it introduces another inconsistency: now scopes do not nest the same way as curly braces nest — but base classes are already inconsistent this way.

Nathan Myers: This looks entirely satisfactory. If even this seems like too big a change, it would suffice to say that finding a different name by this search order makes the program ill-formed. Of course, a compiler might issue only a portability warning in that case and use the name found Erwin's way, anyhow.

Gabriel Dos Reis: It is a simple fact, even without templates, that a writer of a derived class cannot protect himself against declaration changes in the base class.

Richard Corden: If a change is to be made, then making it ill-formed is better than just changing the lookup rules.

        struct B
        {
          typedef int T;
          virtual void bar (T const & );
        };

        template <typename T>
        struct D : public B
        {
          virtual void bar (T const & );
        };

        template class D<float>;

I think changing the semantics of the above code silently would result in very difficult-to-find problems.

Mike Miller: Another case that may need to be considered in deciding on Erwin's suggestion or the “ill-formed” alternative is the treatment of `friend` declarations described in 3.4.1 [basic.lookup.unqual] paragraph 10:

        struct A {
            typedef int T;
            void f(T);
        };
        template<typename T> struct B {
            friend void A::f(T);  // Currently T is A::T
        };

Notes from the October, 2005 meeting:

The CWG decided not to consider a change to the existing rules at this time without a paper exploring the issue in more detail.

#### 1619. Definition of current instantiation

Section: 14.6.2.1 [temp.dep.type] Status: open Submitter: Johannes Schaub Date: 2013-02-04

The definition of the current instantiation, given in 14.6.2.1 [temp.dep.type] paragraph 1, is phrased in terms of the meaning of a name (“A name refers to the current instantiation if it is...”); it does not define when a type is the current instantiation. Thus the interpretation of `*this` and of phrases like “member of a class that is the current instantiation” is not formally specified.

#### 1829. Dependent unnamed types

Section: 14.6.2.1 [temp.dep.type] Status: open Submitter: Hubert Tong Date: 2014-01-08

The specification of dependent types in 14.6.2.1 [temp.dep.type] is given in terms of names. However, one might consider some unnamed types as dependent. Consider the following example:

      template <typename T> struct A {
        struct { } obj;
        void foo() {
          bar(obj); // lookup for bar when/where?
        }
      };

      void bar(...);

      int main() {
        A<int> a;
        a.foo();    // calls bar(...)?
      }

If the type of `A::obj` had a name, it would be dependent. However, the rationale for making nested types dependent is that they are subject to explicit specialization and thus not knowable at the point of the template definition. An unnamed type, as in this example, cannot be explicitly specialized and thus could be considered as a member of the current instantiation. Which treatment is intended?

Notes from the February, 2014 meeting:

There are other cases in which a named entity is dependnet, even though it cannot be explicitly specialized. CWG felt that the most consistent rule would be to make all nested classes dependent, whether named or not.

#### 2024. Dependent types and unexpanded parameter packs

Section: 14.6.2.1 [temp.dep.type] Status: open Submitter: Richard Smith Date: 2014-10-17

Consider an example like:

      template<typename ...Ts> struct X { X(int); };
      template<typename T> using Y = int;
      template<typename ...Ts> void f() {
        X<Y<Ts>...> x;
      }

The presence of the ellipsis should make the reference to `A` a dependent type, but there is no rule making it so.

#### 1028. Dependent names in non-defining declarations

Section: 14.6.4 [temp.dep.res] Status: open Submitter: Sean Hunt Date: 2010-02-03

The current wording of 14.6.4 [temp.dep.res] seems to assume that dependent names can only appear in the definition of a template:

> In resolving dependent names, names from the following sources are considered:

> - Declarations that are visible at the point of definition of the template.

> - Declarations from namespaces associated with the types of the function arguments both from the instantiation context (14.6.4.1 [temp.point]) and from the definition context.

However, dependent names can occur in non-defining declarations of the template as well; for instance,

        template<typename T>
        T foo(T, decltype(bar(T())));

`bar` needs to be looked up, even though there is no definition of `foo` in the translation unit.

Additional note (February, 2011):

The resolution of this issue can't simply replace the word “definition” with the word “declaration,” mutatis mutandis, because there can be multiple declarations in a translation unit (which isn't true of “the definition”). As a result, the issue was moved back to "open" status for further consideration.

#### 1500. Name lookup of dependent conversion function

Section: 14.6.4.2 [temp.dep.candidate] Status: open Submitter: Johannes Schaub Date: 2012-04-27

Consider the following example:

      template<typename T>
      struct A {
       operator int() { return 0; }

       void f() {
        operator T();
       }
      };

      int main() {
       A<int> a;
       a.f();
      }

One might expect this to call `operator int` when instantiating. But since `operator T` is a dependent name, it is looked up by unqualified lookup only in the definition context, where it will find no declaration. Argument-dependent lookup will not find anything in the instantiation context either, so this code is ill-formed. If we change `operator int()` to `operator T()`, which is a seemingly unrelated change, the code becomes well-formed.

There is implementation variability on this point.

#### 1378. When is an instantiation required?

Section: 14.7.1 [temp.inst] Status: open Submitter: Jason Merrill Date: 2011-08-18

A template instantiation can be “required” without there being a need for it at link time if it can appear in a constant expression:

        template <class T> struct A {
           static const T t;
        };
        template <class T> const T A<T>::t = 0;
        template <int I> struct B { };
        int a = sizeof(B<A<int>::t>);

        template <class T> constexpr T f(T t) { return t; }
        int b = sizeof(B<f(42)>);

It seems like it might be useful to define a term other than odr-used for this sort of use, which is like odr-used but doesn't depend on potentially evaluated context or lvalue-rvalue conversions.

Nikolay Ivchenkov:

Another possibility would be to introduce the extension described in the closed issue 1272 and then change 3.2 [basic.def.odr] paragraph 2 as follows:

> An expression `E` is potentially evaluated unless it is an unevaluated operand (Clause 5 [expr]) or a subexpression thereof. if and only if

> - `E` is a full-expression, or

> - `E` appears in a context where a constant expression is required, or

> - `E` is a direct subexpression of a potentially-evaluated expression and `E` is not an unevaluated operand.

> An expression `S` is a direct subexpression of an expression `E` if and only if `S` and `E` are different expressions, `S` is a subexpression of `E`, and there is no expression `X` such that `X` differs from both `S` and `E`, `S` is a subexpression of `X`, and `X` is a subexpression of `E`. A variable whose name appears as a potentially-evaluated expression is odr-used unless it is an object that satisfies the requirements for appearing in a constant expression (5.20 [expr.const]) and the lvalue-to-rvalue conversion (4.1) is immediately applied...

> [Example:

>         template <class T> struct X {
>             static int const m = 1;
>             static int const n;
>         };
>         template <class T> int const X<T>::n = 2;

>         int main() {
>             // X<void>::m is odr-used,
>             // X<void>::m is defined implicitly
>             std::cout << X<void>::m << std::endl;

>             // X<void>::n is odr-used,
>             // X<void>::n is defined explicitly
>             std::cout << X<void>::n << std::endl;

>             // OK (issue 712 is not relevant here)
>             std::cout << (1 ? X<void>::m : X<void>::n) << std::endl;
>         }

(See also issues 712 and 1254.)

#### 1602. Linkage of specialization vs linkage of template arguments

Section: 14.7.1 [temp.inst] Status: open Submitter: Richard Smith Date: 2013-01-09

The Standard does not appear to specify the linkage of a template specialization. 14.7.1 [temp.inst] paragraph 11 does say,

> Implicitly instantiated class and function template specializations are placed in the namespace where the template is defined.

which could be read as implying that the specialization has the same linkage as the template itself. Implementation practice seems to be that the weakst linkage of the template and the arguments is used for the specialization.

#### 1856. Indirect nested classes of class templates

Section: 14.7.1 [temp.inst] Status: open Submitter: Richard Smith Date: 2014-02-11

During the discussion of issue 1484, it was observed that the current rules do not adequately address indirect nested classes of class templates (i.e., member classes of member classes of class templates) in regard to their potential separate instantiation.

#### 293. Syntax of explicit instantiation/specialization too permissive

Section: 14.7.2 [temp.explicit] Status: open Submitter: Mark Mitchell Date: 27 Jun 2001

14.7.2 [temp.explicit] defines an explicit instantiation as

explicit-instantiation:

`template` declaration

Syntactically, that allows things like:

        template int S<int>::i = 5, S<int>::j = 7;

which isn't what anyone actually expects. As far as I can tell, nothing in the standard explicitly forbids this, as written. Syntactically, this also allows:

        template namespace N { void f(); }

although perhaps the surrounding context is enough to suggest that this is invalid.

Suggested resolution:

I think we should say:

explicit-instantiation:

type-specifier-seqopt declaratoropt `;`

[Steve Adamczyk: presumably, this should have `template` at the beginning.]

and then say that:

- The declarator can be omitted only when the type-specifier-seq consists solely of an elaborated-type-specifier for a class type, in which case the instantiation is for the named class. If the declarator is present the instantiation is for the named entity.
- The type-specifier-seq can be omitted only when the declarator is for a constructor, destructor, or conversion operator.
- The type-specifier-seq cannot define any new types.

There are similar problems in 14.7.3 [temp.expl.spec]:

explicit-specialization:

`template` <> declaration

Here, I think we want:

explicit-specialization:

decl-specifier-seqopt init-declaratoropt `;`

with similar restrictions as above.

[Steve Adamczyk: This also needs to have `template <>` at the beginning, possibly repeated.]

#### 1046. What is a “use” of a class specialization?

Section: 14.7.2 [temp.explicit] Status: open Submitter: Michael Wong Date: 2010-03-08

According to 14.7.2 [temp.explicit] paragraph 10,

> An entity that is the subject of an explicit instantiation declaration and that is also used in the translation unit shall be the subject of an explicit instantiation definition somewhere in the program; otherwise the program is ill-formed, no diagnostic required.

The term “used” is too vague and needs to be defined. In particular, “use” of a class template specialization as an incomplete type — to form a pointer, for instance — should not require the presence of an explicit instantiation definition elsewhere in the program.

#### 1993. Use of `template<>` defining member of explicit specialization

Section: 14.7.3 [temp.expl.spec] Status: open Submitter: Richard Smith Date: 2014-08-31

Issue 531 surveyed existing practice at the time and determined that the most common syntax for defining a member of an explicit specialization used the `template<>` prefix. This approach, however, does not seem consistent, since such a definition is not itself an explicit specialization.

#### 264. Unusable template constructors and conversion functions

Section: 14.8.1 [temp.arg.explicit] Status: open Submitter: John Spicer Date: 17 Nov 2000

The note in paragraph 5 of 14.8.1 [temp.arg.explicit] makes clear that explicit template arguments cannot be supplied in invocations of constructors and conversion functions because they are called without using a name. However, there is nothing in the current wording of the Standard that makes declaring a constructor or conversion operator that is unusable because of nondeduced parameters (i.e., that would need to be specified explicitly) ill-formed. It would be a service to the programmer to diagnose this useless construct as early as possible.

#### 271. Explicit instantiation and template argument deduction

Section: 14.8.2 [temp.deduct] Status: open Submitter: John Spicer Date: 20 Feb 2001

Nicolai Josuttis sent me an example like the following:

        template <typename RET, typename T1, typename T2>
        const RET& min (const T1& a, const T2& b)
        {
    	return (a < b ? a : b);
        }
        template const int& min<int>(const int&,const int&);  // #1
        template const int& min(const int&,const int&);       // #2

Among the questions was whether explicit instantiation #2 is valid, where deduction is required to determine the type of `RET`.

The first thing I realized when researching this is that the standard does not really spell out the rules for deduction in declarative contexts (friend declarations, explicit specializations, and explicit instantiations). For explicit instantiations, 14.7.2 [temp.explicit] paragraph 2 does mention deduction, but it doesn't say which set of deduction rules from 14.8.2 [temp.deduct] should be applied.

Second, Nicolai pointed out that 14.7.2 [temp.explicit] paragraph 6 says

> A trailing template-argument can be left unspecified in an explicit instantiation provided it can be deduced from the type of a function parameter (14.8.2 [temp.deduct]).

This prohibits cases like #2, but I believe this was not considered in the wording as there is no reason not to include the return type in the deduction process.

I think there may have been some confusion because the return type is excluded when doing deduction on a function call. But there are contexts where the return type is included in deduction, for example, when taking the address of a function template specialization.

Suggested resolution:

1. Update 14.8.2 [temp.deduct] to include a section "Deducing template arguments from a declaration" that describes how deduction is done when finding a template that matches a declaration. This should, I believe, include the return type.
2. Update 14.7.2 [temp.explicit] to make reference to the new rules in 14.8.2 [temp.deduct] and remove the description of the deduction details from 14.7.2 [temp.explicit] paragraph 6.

#### 297. Which template does an explicit specialization specialize?

Section: 14.8.2 [temp.deduct] Status: open Submitter: Andrei Iltchenko Date: 7 Jul 2001

Andrei Iltchenko points out that the standard has no wording that defines how to determine which template is specialized by an explicit specialization of a function template. He suggests "template argument deduction in such cases proceeds in the same way as when taking the address of a function template, which is described in 14.8.2.2 [temp.deduct.funcaddr]."

John Spicer points out that the same problem exists for all similar declarations, i.e., friend declarations and explicit instantiation directives. Finding a corresponding placement `operator delete` may have a similar problem.

John Spicer: There are two aspects of "determining which template" is referred to by a declaration: determining the function template associated with the named specialization, and determining the values of the template arguments of the specialization.

        template <class T> void f(T);  #1
        template <class T> void f(T*); #2
        template <> void f(int*);

In other words, which `f` is being specialized (#1 or #2)? And then, what are the deduced template arguments?

14.5.6.2 [temp.func.order] does say that partial ordering is done in contexts such as this. Is this sufficient, or do we need to say more about the selection of the function template to be selected?

14.8.2 [temp.deduct] probably needs a new section to cover argument deduction for cases like this.

#### 697. Deduction rules apply to more than functions

Section: 14.8.2 [temp.deduct] Status: open Submitter: Doug Gregor Date: 6 June, 2008

14.8.2 [temp.deduct] is all about function types, but these rules also apply, e.g., when matching a class template partial specialization. We should add a note stating that we could be doing substitution into the template-id for a class template partial specialization.

Additional note (August 2008):

According to 14.5.5.1 [temp.class.spec.match] paragraph 2, argument deduction is used to determine whether a given partial specialization matches a given argument list. However, there is nothing in 14.5.5.1 [temp.class.spec.match] nor in 14.8.2 [temp.deduct] and its subsections that describes exactly how argument deduction is to be performed in this case. It would seem that more than just a note is required to clarify this processing.

#### 1582. Template default arguments and deduction failure

Section: 14.8.2 [temp.deduct] Status: open Submitter: John Spicer Date: 2012-10-31

According to 14.8.2 [temp.deduct] paragraph 5,

> The resulting substituted and adjusted function type is used as the type of the function template for template argument deduction. If a template argument has not been deduced and its corresponding template parameter has a default argument, the template argument is determined by substituting the template arguments determined for preceding template parameters into the default argument. If the substitution results in an invalid type, as described above, type deduction fails.

This leaves the impression that default arguments are used after deduction failure leaves an argument undeduced. For example,

      template<typename T> struct Wrapper;
      template<typename T = int> void f(Wrapper<T>*);
      void g() {
        f(0);
      }

Deduction fails for `T`, so presumably `int` is used. However, some implementations reject this code. It appears that the intent would be better expressed as something like

> ...If a template argument is used only in a non-deduced context and its corresponding template parameter has a default argument...

Rationale (November, 2013):

CWG felt that this issue should be considered by EWG in a broader context before being resolved.

Additional note, April, 2015:

EWG has requested that CWG resolve this issue along the lines discussed above.

#### 503. Cv-qualified function types in template argument deduction

Section: 14.8.2.1 [temp.deduct.call] Status: open Submitter: Gabriel Dos Reis Date: 22 Feb 2005

Consider the following program:

        template <typename T> int ref (T&)                { return 0; }
        template <typename T> int ref (const T&)          { return 1; }
        template <typename T> int ref (const volatile T&) { return 2; }
        template <typename T> int ref (volatile T&)       { return 4; }

        template <typename T> int ptr (T*)                { return 0; }
        template <typename T> int ptr (const T*)          { return 8; }
        template <typename T> int ptr (const volatile T*) { return 16; }
        template <typename T> int ptr (volatile T*)       { return 32; }

        void foo() {}

        int main()
        {
            return ref(foo) + ptr(&foo);
        }

The Standard appears to specify that the value returned from `main` is 2. The reason for this result is that references and pointers are handled differently in template argument deduction.

For the reference case, 14.8.2.1 [temp.deduct.call] paragraph 3 says that “If `P` is a reference type, the type referred to by `P` is used for type deduction.” Because of issue 295, all four of the types for the `ref` function parameters are the same, with no cv-qualification; overload resolution does not find a best match among the parameters and thus the most-specialized function is selected.

For the pointer type, argument deduction does not get as far as forming a cv-qualified function type; instead, argument deduction fails in the cv-qualified cases because of the cv-qualification mismatch, and only the cv-unqualified version of `ptr` survives as a viable function.

I think the choice of ignoring cv-qualifiers in the reference case but not the pointer case is very troublesome. The reason is that when one considers function objects as function parameters, it introduces a semantic difference whether the function parameter is declared a reference or a pointer. In all other contexts, it does not matter: a function name decays to a pointer and the resulting semantics are the same.

(See also issue 1584.)

#### 1584. Deducing function types from cv-qualified types

Section: 14.8.2.1 [temp.deduct.call] Status: open Submitter: Daniel Krügler Date: 2012-11-04

It is not clear whether the following is well-formed or not:

      void foo(){}

      template<class T>
      void deduce(const T*) { }

      int main() {
        deduce(foo);
      }

Implementations vary in their treatment of this example.

Proposed resolution (April, 2013):

Change 14.8.2.5 [temp.deduct.type] paragraph 18 as follows:

> A template-argument can be deduced from a function, pointer to function, or pointer to member function type. [Note: cv-qualification of a deduced function type is ignored; see 8.3.5 [dcl.fct]. —end note] [Example:

>       template<class T> void f(void(*)(T,int));
>       template<class T> void f2(const T*);
>       template<class T> void foo(T,int);
>       void g(int,int);
>       void g(char,int);
>       void g2();

>       void h(int,int,int);
>       void h(char,int);
>       int m() {
>         f(&g);     // error: ambiguous
>         f(&h);     // OK: void h(char,int) is a unique match
>         f(&foo);   // error: type deduction fails because foo is a template
>         f2(g2);    // OK: cv-qualification of deduced function type ignored
>       }

> —end example]

Additional note, November, 2014:

Concern was expressed regarding the proposed resolution over its treatment of an example like the following:

      template<typename T> struct tuple_size {};
      template<typename T> struct tuple_size<T const>: tuple_size<T> {};

      tuple_size<void()> t;

In this case `T const` is always considered to be more specialized for `void()`, leading to infinite self-derivation.

The issue has been returned to "open" status for further consideration.

#### 1221. Partial ordering and reference collapsing

Section: 14.8.2.4 [temp.deduct.partial] Status: open Submitter: Michael Wong Date: 2010-11-08

The current partial ordering rules produce surprising results in the presence of reference collapsing.

Since partial ordering is currently based solely on the signature of the function templates, the lack of difference following substitution of the template type parameter in the following is not taken into account.

Especially unsettling is that the allegedly "more specialized" template (#2) is not a candidate in the first call where template argument deduction fails for it despite a lack of non-deduced contexts.

        template <typename T>
        void foo(T&&);  // #1

        template <typename T>
        void foo(volatile T&&);  // #2

        int main(void) {
          const int x = 0;
          foo(x);  // calls #1 with T='const int &'
          foo<const int &>(x);  // calls #2
        }

#### 1763. Length mismatch in template type deduction

Section: 14.8.2.5 [temp.deduct.type] Status: open Submitter: Canada Date: 2013-09-23
N3690 comment CA 4

It is not clear how an example like the following is to be handled:

      template <typename U>
      struct A {
        template <typename V> operator A<V>();
      };

      template <typename T>
      void foo(A<void (T)>);

      void foo();

      int main() {
        A<void (int, char)> a;
        foo<int>(a);
        foo(a); // deduces T to be int
      }

In subclause 14.8.2.5 [temp.deduct.type] paragraph 10, deduction from a function type considers P/A pairs from the parameter-type-list only where the "P" function type has a parameter. Deduction is not specified to fail if there are additional parameters in the corresponding "A" function type.

Notes from the September, 2013 meeting:

CWG agreed that this example should not be accepted. The existing rules seem to cover this case (deduction is not specified to “succeed,” so it's a reasonable conclusion that it fails), but it might be helpful to be clearer.

#### 1946. exception-specifications vs pointer dereference

Section: 15.4 [except.spec] Status: open Submitter: Mike Miller Date: 2014-06-21

The resolution of issue 1351 results in the following:

      void (*p)() throw(int);
      void (&r)() throw(int) = *p;  // ill-formed

The reason is that the set of potential exceptions for an indirection is “any” instead of maintaining the known potential exceptions of the operand. It would seem to be reasonable to propagate the set in such cases.

A similar issue arises with function template argument deduction:

      template<typename T> T& f(T* p);
      void (*p)() throw(int);
      void (&r)() throw(int) = f(p);  // ill-formed

See also issues 2010, 1995, 1975, and 1798.

#### 1995. exception-specifications and non-type template parameters

Section: 15.4 [except.spec] Status: open Submitter: Gabriel Dos Reis Date: 2014-09-03

In the following example,

       struct A {
         template<class T>
           T foo(T t) noexcept { return t; }
         };

         template<class T, int (T::*fptr)(int)> struct S {
           A a;
           S() noexcept(noexcept((a.*fptr)(1))) {}
         };

         int foo() {
           return noexcept(S<A,&A::foo>());
         }

what should `foo` return? The question hinges upon whether the `noexcept` property of the template argument is preserved or lost in the process of substitution.

See also issues 2010, 1975, 1946, and 1798.

#### 2010. exception-specifications and conversion operators

Section: 15.4 [except.spec] Status: open Submitter: Richard Smith Date: 2014-09-26

It is not possible to provide an exception-specification for a conversion-type-id, which prevents the result from being used in assignment or initialization of a function pointer with a non-throwing exception-specification. This seems unnecessarily restrictive.

See also issues 1995, 1975, 1946, and 1798.

#### 596. Replacing an exception object

Section: 15.5.2 [except.unexpected] Status: open Submitter: Alisdair Meredith Date: 12 September 2006

When a function throws an exception that is not in its exception-specification, `std::unexpected()` is called. According to 15.5.2 [except.unexpected] paragraph 2,

> If [`std::unexpected()`] throws or rethrows an exception that the exception-specification does not allow then the following happens: If the exception-specification does not include the class `std::bad_exception` (18.8.2 [bad.exception]) then the function `std::terminate()` is called, otherwise the thrown exception is replaced by an implementation-defined object of the type `std::bad_exception,` and the search for another handler will continue at the call of the function whose exception-specification was violated.

The “replaced by” wording is imprecise and undefined. For example, does this mean that the destructor is called for the existing exception object, or is it simply abandoned? Is the replacement in situ, so that a pointer to the existing exception object will now point to the `std::bad_exception` object?

Mike Miller: The call to `std::unexpected()` is not described as analogous to invoking a handler, but if it were, that would resolve this question; it is clearly specified what happens to the previous exception object when a new exception is thrown from a handler (15.1 [except.throw] paragraph 4).

This approach would also clarify other questions that have been raised regarding the requirements for stack unwinding. For example, 15.5.1 [except.terminate] paragraph 2 says that

> In the situation where no matching handler is found, it is implementation-defined whether or not the stack is unwound before `std::terminate()` is called.

This requirement could be viewed as in conflict with the statement in 15.5.2 [except.unexpected] paragraph 1 that

> If a function with an exception-specification throws an exception that is not listed in the exception-specification, the function `std::unexpected()` is called (D.8 [exception.unexpected]) immediately after completing the stack unwinding for the former function.

If it is implementation-defined whether stack unwinding occurs before calling `std::terminate()` and `std::unexpected()` is called only after doing stack unwinding, does that mean that it is implementation-defined whether `std::unexpected()` is called if there is ultimately no handler found?

Again, if invoking `std::unexpected()` were viewed as essentially invoking a handler, the answer to this would be clear, because unwinding occurs before invoking a handler.

#### 2034. Deprecating `uncaught_exception()`

Section: 15.5.3 [except.uncaught] Status: open Submitter: CWG Date: 2014-11-06

With the adoption of paper N4259 specifying the `std::uncaught_exceptions()` function, the `std::uncaught_exception()` function should be deprecated.

#### 2002. White space within preprocessing directives

Section: 16 [cpp] Status: open Submitter: Richard Smith Date: 2014-09-10

According to 16 [cpp] paragraphg 4,

> The only white-space characters that shall appear between preprocessing tokens within a preprocessing directive (from just after the introducing `#` preprocessing token through just before the terminating new-line character) are space and horizontal-tab (including spaces that have replaced comments or possibly other white-space characters in translation phase 3).

The effect of this restriction is unclear, however, since translation phase 3 is permitted to transform all white space characters and comments into spaces. The relationship between these two rules should be clarified.

#### 925. Type of character literals in preprocessor expressions

Section: 16.1 [cpp.cond] Status: open Submitter: Michael Wong Date: 29 June, 2009

According to 16.1 [cpp.cond] paragraph 4,

> The resulting tokens comprise the controlling constant expression which is evaluated according to the rules of 5.20 [expr.const] using arithmetic that has at least the ranges specified in 18.3 [support.limits], except that all signed and unsigned integer types act as if they have the same representation as, respectively, `intmax_t` or `uintmax_t` (_N3035_.18.4.2 [stdinth]). This includes interpreting character literals, which may involve converting escape sequences into execution character set members.

Ordinary character literals with a single c-char have the type `char`, which is neither a signed nor an unsigned integer type. Although 4.5 [conv.prom] paragraph 1 is clear that `char` values promote to `int`, regardless of whether the implementation treats `char` as having the values of `signed char` or `unsigned char`, 16.1 [cpp.cond] paragraph 4 isn't clear on whether character literals should be treated as signed or unsigned values. In C99, such literals have type `int`, so the question does not arise. If an implementation in which plain `char` has the values of `unsigned char` were to treat character literals as unsigned, an expression like `'0'-'1'` would thus have different values in C and C++, namely -1 in C and some large unsigned value in C++.

#### 1625. Adding spaces between tokens in stringizing

Section: 16.3.2 [cpp.stringize] Status: open Submitter: Chandler Carruth Date: 2013-02-18

Given the following input,

      #define F(A, B, C) A ## x.B ## y.C ## z
      #define STRINGIFY(x) #x
      #define EXPAND_AND_STRINGIFY(x) STRINGIFY(x)
      char v[] = EXPAND_AND_STRINGIFY(F(a, b, c))

there is implementation variance in the value of `v`: some produce the string `"ax.by.cz"` and others produce the string `"ax. by. cz"`. Although 16.3.2 [cpp.stringize] paragraph 2 is explicit in its treatment of leading and trailing white space, it is not clear whether there is latitude for inserting spaces between tokens, as some implementations do, since the description otherwise is written solely in terms of preprocessing tokens. There may be cases in which such spaces would be needed to preserve the original tokenization, but it is not clear whether the result of stringization needs to produce something that would lex to the same tokens.

Notes from the April, 2013 meeting:

Because the preprocessor specification is primarily copied directly from the C Standard, this issue has been referred to the C liaison for consultation with WG14.

#### 268. Macro name suppression in rescanned replacement text

Section: 16.3.4 [cpp.rescan] Status: open Submitter: Bjarne Stroustrup Date: 18 Jan 2001

It is not clear from the Standard what the result of the following example should be:

>     #define NIL(xxx) xxx
>     #define G_0(arg) NIL(G_1)(arg)
>     #define G_1(arg) NIL(arg)
>     G_0(42)

The relevant text from the Standard is found in 16.3.4 [cpp.rescan] paragraph 2:

> If the name of the macro being replaced is found during this scan of the replacement list (not including the rest of the source file's preprocessing tokens), it is not replaced. Further, if any nested replacements encounter the name of the macro being replaced, it is not replaced. These nonreplaced macro name preprocessing tokens are no longer available for further replacement even if they are later (re)examined in contexts in which that macro name preprocessing token would otherwise have been replaced.

The sequence of expansion of `G0(42)` is as follows:

>     G0(42)
>     NIL(G_1)(42)
>     G_1(42)
>     NIL(42)

The question is whether the use of `NIL` in the last line of this sequence qualifies for non-replacement under the cited text. If it does, the result will be `NIL(42)`. If it does not, the result will be simply `42`.

The original intent of the J11 committee in this text was that the result should be `42`, as demonstrated by the original pseudo-code description of the replacement algorithm provided by Dave Prosser, its author. The English description, however, omits some of the subtleties of the pseudo-code and thus arguably gives an incorrect answer for this case.

Suggested resolution (Mike Miller): Replace the cited paragraph with the following:

> As long as the scan involves only preprocessing tokens from a given macro's replacement list, or tokens resulting from a replacement of those tokens, an occurrence of the macro's name will not result in further replacement, even if it is later (re)examined in contexts in which that macro name preprocessing token would otherwise have been replaced.

> Once the scan reaches the preprocessing token following a macro's replacement list — including as part of the argument list for that or another macro — the macro's name is once again available for replacement. [Example:

>         #define NIL(xxx) xxx
>         #define G_0(arg) NIL(G_1)(arg)
>         #define G_1(arg) NIL(arg)
>         G_0(42)                         // result is 42, not NIL(42)

> The reason that `NIL(42)` is replaced is that `(42)` comes from outside the replacement list of `NIL(G_1)`, hence the occurrence of `NIL` within the replacement list for `NIL(G_1)` (via the replacement of `G_1(42)`) is not marked as nonreplaceable. —end example]

(Note: The resolution of this issue must be coordinated with J11/WG14.)

Notes (via Tom Plum) from April, 2004 WG14 Meeting:

Back in the 1980's it was understood by several WG14 people that there were tiny differences between the "non-replacement" verbiage and the attempts to produce pseudo-code. The committee's decision was that no realistic programs "in the wild" would venture into this area, and trying to reduce the uncertainties is not worth the risk of changing conformance status of implementations or programs.

#### 745. Effect of ill-formedness resulting from `#error`

Section: 16.5 [cpp.error] Status: open Submitter: Clark Nelson Date: 13 November, 2008

C99 is very clear that a `#error` directive causes a translation to fail: Clause 4 paragraph 4 says,

> The implementation shall not successfully translate a preprocessing translation unit containing a `#error` preprocessing directive unless it is part of a group skipped by conditional inclusion.

C++, on the other hand, simply says that a `#error` directive “renders the program ill-formed” (16.5 [cpp.error]), and the only requirement for an ill-formed program is that a diagnostic be issued; the translation may continue and succeed. (Noted in passing: if this difference between C99 and C++ is addressed, it would be helpful for synchronization purposes in other contexts as well to introduce the term “preprocessing translation unit.”)

#### 1889. Unclear effect of `#pragma` on conformance

Section: 16.6 [cpp.pragma] Status: open Submitter: James Widman Date: 2014-03-05

According to 16.6 [cpp.pragma] paragraph 1, the effect of a `#pragma` is to cause

> the implementation to behave in an implementation-defined manner. The behavior might cause translation to fail or cause the translator or the resulting program to behave in a non-conforming manner.

It should be clarified that the extent of the non-conformance is limited to the implementation-defined behavior.

#### 897. `_Pragma` and extended string-literals

Section: 16.9 [cpp.pragma.op] Status: open Submitter: Daniel Krügler Date: 9 May, 2009

The specification of how the string-literal in a `_Pragma` operator is handled does not deal with the new kinds of string literals. 16.9 [cpp.pragma.op] says,

> The string literal is destringized by deleting the `L` prefix, if present, deleting the leading and trailing double-quotes, replacing each escape sequence...

The various other prefixes should either be handled or prohibited.

Additional note (October, 2013):

If raw string literals are supported, the question of how to handle line splicing is relevant. The wording says that “the characters are processed through translation phase 3,” which is a bit ambiguous as to whether that includes phases 1 and 2 or not. It would be better to be explicit and say that the processing of phase 3 or of phases 1 through 3 is applied.

#### 1944. New C incompatibilities

Section: C [diff] Status: open Submitter: Mike Miller Date: 2014-06-18

Some new features of C++ not only introduce incompatibilities with previous versions of C++ but also with C; however, the organization of Annex C [diff] makes it difficult to specify that a given feature is incompatible with both languages, and the practice has been only to document the C++ incompatibilities. Some means of specifying both sets of incompatibilities should be found, hopefully without excessive duplication between the C and C++ sections.

#### 1248. Updating Annex C to C99

Section: C.1 [diff.iso] Status: open Submitter: Jonathan Wakely Date: 2011-02-28

The description of incompatibilities with C in Annex C.1 [diff.iso] refers to C89, but there are a number of new features in C99 that should be covered.

### Issues with "Concurrency" Status

#### 1661. Preservation of infinite loops

Section: 1.10 [intro.multithread] Status: concurrency Submitter: Daniel Krügler Date: 2013-04-15

According to 1.10 [intro.multithread] paragraph 24,

> The implementation may assume that any thread will eventually do one of the following:

> - terminate,

> - make a call to a library I/O function,

> - access or modify a volatile object, or

> - perform a synchronization operation or an atomic operation.

> [Note: This is intended to allow compiler transformations such as removal of empty loops, even when termination cannot be proven. —end note]

Some programmers find this liberty afforded to implementations to be disadvantageous; see this blog post for a discussion of the subject.

#### 1842. Unevaluated operands and “carries a dependency”

Section: 1.10 [intro.multithread] Status: concurrency Submitter: Hans Boehm Date: 2014-01-23

According to 1.10 [intro.multithread] paragraph 9,

> An evaluation A carries a dependency to an evaluation B if

> - the value of A is used as an operand of B, unless:

> - ...

> - A is the left operand of a built-in logical AND (`&&,` see 5.14 [expr.log.and]) or logical OR (`||`, see 5.15 [expr.log.or]) operator, or

> - ...

The intent is that this does not apply to the second operands of such operators if the first operand is such that they are not evaluated, but the wording is not clear to that effect. (A similar question applies to the non-selected operand of the conditional operator `?:`.)

#### 1961. Potentially-concurrent actions within a signal handler

Section: 1.10 [intro.multithread] Status: concurrency Submitter: Faisal Vali Date: 2014-07-04

According to 1.10 [intro.multithread] paragraph 23,

> Two actions are potentially concurrent if

> - they are performed by different threads, or

> - they are unsequenced, and at least one is performed by a signal handler.

This definition should exclude the case when both actions are performed by a signal handler.

#### 1784. Concurrent execution during static local initialization

Section: 6.7 [stmt.dcl] Status: concurrency Submitter: Jens Maurer Date: 2013-09-27

Regarding initialization of a block-scope static variable, 6.7 [stmt.dcl] paragraph 4 says,

> If control enters the declaration concurrently while the variable is being initialized, the concurrent execution shall wait for completion of the initialization.

This specification does not use the terminology of 1.10 [intro.multithread], so the meaning of “wait” is not clear. For example, will a concurrent thread that “waited” see (in the sense of happens-before) the result of the initialization (including side effects caused during the initialization)?

Perhaps the “synchronizes-with” terminology could be used here.