1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 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 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 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 842 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 888 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 921 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 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 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 998 999 1000 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 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 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 1173 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 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 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 1369 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 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 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 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 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 1605 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 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 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 1742 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 1795 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 1836 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 1865 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 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 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 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493
|
// Brigand library
//
// Copyright (c) 2015 Edouard Alligand and Joel Falcou
//
// Boost Software License - Version 1.0 - August 17th, 2003
//
// Permission is hereby granted, free of charge, to any person or organization
// obtaining a copy of the software and accompanying documentation covered by
// this license (the "Software") to use, reproduce, display, distribute,
// execute, and transmit the Software, and to prepare derivative works of the
// Software, and to permit third-parties to whom the Software is furnished to
// do so, all subject to the following:
//
// The copyright notices in the Software and this entire statement, including
// the above license grant, this restriction and the following disclaimer,
// must be included in all copies of the Software, in whole or in part, and
// all derivative works of the Software, unless such copies or derivative
// works are solely in the form of machine-executable object code generated by
// a source language processor.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
// SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
// FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
// ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
// DEALINGS IN THE SOFTWARE.
// This file contains a standalone version of Edouard Alligand and Joel Falcou's
// Brigand library, which can be found at https://github.com/edouarda/brigand
#pragma once
#if defined(_MSC_VER) && !defined(__GNUC__) && !defined(__clang__)
#define BRIGAND_COMP_MSVC
#if _MSC_VER == 1900
#define BRIGAND_COMP_MSVC_2015
#elif _MSC_VER == 1800
#define BRIGAND_COMP_MSVC_2013
#endif
#elif defined(__GNUC__)
#ifndef __clang__
#define BRIGAND_COMP_GCC
#else
#define BRIGAND_COMP_CLANG
#endif
#endif
#define BRIGAND_NO_BOOST_SUPPORT 1
#include <cstddef>
#include <cstdint>
#include <cstring>
#include <initializer_list>
#include <tuple>
#include <type_traits>
#include <utility>
#include <wtf/StdLibExtras.h>
#if !defined(BRIGAND_NO_BOOST_SUPPORT)
#include <boost/fusion/container/vector/vector_fwd.hpp>
#include <boost/fusion/container/deque/deque_fwd.hpp>
#include <boost/fusion/container/list/list_fwd.hpp>
#include <boost/fusion/container/set/set_fwd.hpp>
#include <boost/variant.hpp>
#endif
namespace brigand
{
template <class... T> struct list {};
template<typename T, T... Values>
using integral_list = brigand::list< std::integral_constant<T,Values>...>;
using empty_sequence = brigand::list<>;
}
namespace brigand
{
namespace lazy
{
template <class A, template<class...> class B> struct wrap;
template<template<class...> class A, class... T, template<class...> class B>
struct wrap<A<T...>, B>
{
using type = B<T...>;
};
}
template<class A, template<class...> class B>
using wrap = typename lazy::wrap<A, B>::type;
}
namespace brigand
{
namespace detail
{
template <typename... Ts>
struct append_impl
{
using type = brigand::empty_sequence;
};
template <typename T>
struct append_impl<T>
{
using type = T;
};
template <template <typename...> class L1, template <typename...> class L2, typename... T1s,
typename... T2s, typename... Ts>
struct append_impl<L1<T1s...>, L2<T2s...>, Ts...> : append_impl<L1<T1s..., T2s...>, Ts...>
{
};
template <template <typename...> class L, template <typename...> class L1,
template <typename...> class L2, template <typename...> class L3,
template <typename...> class L4, template <typename...> class L5,
template <typename...> class L6, template <typename...> class L7,
template <typename...> class L8, template <typename...> class L9,
template <typename...> class L10, template <typename...> class L11,
template <typename...> class L12, template <typename...> class L13,
template <typename...> class L14, template <typename...> class L15,
template <typename...> class L16, typename... Ts, typename... T1s, typename... T2s,
typename... T3s, typename... T4s, typename... T5s, typename... T6s, typename... T7s,
typename... T8s, typename... T9s, typename... T10s, typename... T11s,
typename... T12s, typename... T13s, typename... T14s, typename... T15s,
typename... T16s, typename... Us>
struct append_impl<L<Ts...>, L1<T1s...>, L2<T2s...>, L3<T3s...>, L4<T4s...>, L5<T5s...>,
L6<T6s...>, L7<T7s...>, L8<T8s...>, L9<T9s...>, L10<T10s...>, L11<T11s...>,
L12<T12s...>, L13<T13s...>, L14<T14s...>, L15<T15s...>, L16<T16s...>, Us...>
: append_impl<L<Ts..., T1s..., T2s..., T3s..., T4s..., T5s..., T6s..., T7s..., T8s...,
T9s..., T10s..., T11s..., T12s..., T13s..., T14s..., T15s..., T16s...>,
Us...>
{
};
}
namespace lazy
{
template <typename... Ts>
using append = detail::append_impl<Ts...>;
}
template <typename... Ts>
using append = typename detail::append_impl<Ts...>::type;
namespace lazy
{
template <typename T>
struct join;
template<template<typename...> class L, typename...Ts>
struct join<L<Ts...>> : ::brigand::detail::append_impl<L<>,Ts...>
{
};
}
template <typename T>
using join = wrap<T,append>;
}
namespace brigand
{
template <typename First, typename Second>
struct pair
{
using first_type = First;
using second_type = Second;
};
}
namespace brigand
{
template<typename T> struct type_ { using type = T; };
template<typename T> using type_from = typename T::type;
}
namespace brigand
{
struct no_such_type_ {};
}
namespace brigand
{
namespace lazy
{
template <typename M, typename K>
struct lookup
: decltype(M::at(type_<K>{}))
{};
}
template <typename M, typename K>
using lookup = typename lazy::lookup<M,K>::type;
namespace detail
{
template <class... T>
struct map_impl;
template <>
struct map_impl<>
{
template <typename U>
static type_<no_such_type_> at(U);
template <class K>
static std::false_type has_key(type_<K>);
template <class K>
static map_impl erase(type_<K>);
template <class P>
static map_impl<P> insert(type_<P>);
};
template <class... Ts>
struct map_impl
{
private:
struct Pack : pair<typename Ts::first_type, Ts>... {};
template<class K, class P>
static type_<typename P::second_type> at_impl(pair<K,P>*);
public:
template<class K>
static decltype(at_impl<K>(static_cast<Pack*>(nullptr))) at(type_<K>);
template<class K>
static type_<no_such_type_> at(K);
template <class K, class = decltype(at_impl<K>(static_cast<Pack*>(nullptr)))>
static std::true_type has_key(type_<K>);
template <class K>
static std::false_type has_key(K);
template <class K>
static append<map_impl<>, typename std::conditional<std::is_same<K, typename Ts::first_type>::value, list<>, list<Ts>>::type...> erase(type_<K>);
template <class P, class = decltype(static_cast<pair<typename P::first_type, P>*>(static_cast<Pack*>(nullptr)))>
static map_impl insert(type_<P>);
template <class P>
static map_impl<Ts..., typename P::type> insert(P);
};
template<class... Ts>
struct make_map : type_<typename Ts::first_type>... {
using type = map_impl<Ts...>;
};
}
template<class... Ts>
using map = typename detail::make_map<Ts...>::type;
}
namespace brigand
{
namespace detail
{
template<class, class>
struct dup_append_list;
template<template<class...> class List, class... Ts, class... Us>
struct dup_append_list<List<Ts...>, List<Us...>>
{
using type = List<Ts..., Ts..., Us...>;
};
template<class T, template<class...> class List, std::size_t N>
struct filled_list_impl
: dup_append_list<
typename filled_list_impl<T, List, N/2>::type,
typename filled_list_impl<T, List, N - N/2*2>::type
>
{};
template<class T, template<class...> class List>
struct filled_list_impl<T, List, 1>
{
using type = List<T>;
};
template<class T, template<class...> class List>
struct filled_list_impl<T, List, 0>
{
using type = List<>;
};
}
template<class T, std::size_t N, template<class...> class List = list>
using filled_list = typename detail::filled_list_impl<T, List, N>::type;
}
namespace brigand
{
namespace detail
{
template<class T> struct element_at;
template<class... Ts>
struct element_at<list<Ts...>>
{
template<class T> type_<T> static at(Ts..., type_<T>*, ...);
};
template<std::size_t N, typename Seq> struct at_impl;
template<std::size_t N, template<typename...> class L, class... Ts>
struct at_impl<N,L<Ts...>>
: decltype(element_at<brigand::filled_list<void const *, N>>::at(static_cast<type_<Ts>*>(nullptr)...))
{
};
}
template <class L, std::size_t Index>
using at_c = typename detail::at_impl<Index, L>::type;
namespace detail
{
template <typename T>
struct has_at_method
{
struct dummy {};
template <typename C, typename P>
static auto test(P * p) -> decltype(C::at(*p), std::true_type());
template <typename, typename>
static std::false_type test(...);
static constexpr bool value = std::is_same<std::true_type, decltype(test<T, dummy>(nullptr))>::value;
};
template <class L, typename Index, bool>
struct at_dispatch
{
using type = at_c<L, Index::value>;
};
template <class L, typename Index>
struct at_dispatch<L, Index, true>
{
using type = lookup<L, Index>;
};
}
template <class Seq, typename K>
using at = typename detail::at_dispatch<Seq, K, detail::has_at_method<Seq>::value>::type;
}
namespace brigand
{
template <template <typename...> class, typename...>
struct bind
{
};
}
namespace brigand
{
template<std::size_t Index> struct args
{
};
struct _1 {};
struct _2 {};
using _3 = args<2>;
using _4 = args<3>;
using _5 = args<4>;
using _6 = args<5>;
using _7 = args<6>;
using _8 = args<7>;
using _9 = args<8>;
using _state = _1;
using _element = _2;
}
namespace brigand
{
template <typename T>
struct defer
{
};
template <typename T>
struct pin
{
};
template <typename T>
struct parent
{
};
namespace detail
{
template <typename T, typename... Ts>
struct packaged_lcall
{
};
template <typename T, typename... Ls>
struct apply {
using type = T;
};
template <template<typename...> class F, typename...Ts, typename... Args>
struct apply<bind<F,Ts...>, Args...>
{
using type = F<typename apply<Ts, Args...>::type...>;
};
template <template <typename...> class F, typename... Ts, typename L, typename... Ls>
struct apply<F<Ts...>, L, Ls...> : F<typename apply<Ts, L, Ls...>::type...>
{
};
template <typename T, typename... Args, typename...Ls>
struct apply<pin<T>, list<Args...>, Ls...>
{
using type = T;
};
template <std::size_t N, typename L, typename...Ls>
struct apply<args<N>, L, Ls...>
{
using type = at_c<L, N>;
};
template <typename T, typename...Ts, typename...Ls>
struct apply<_1, list<T, Ts...>, Ls...>
{
using type = T;
};
template <typename T, typename U, typename...Ts, typename...Ls>
struct apply<_2, list<T, U, Ts...>, Ls...>
{
using type = U;
};
template <typename T, typename L, typename...Ls>
struct apply<parent<T>, L, Ls...> : apply<T,Ls...>
{
};
template <typename Lambda, typename L, typename...Ls>
struct apply<defer<Lambda>, L, Ls...>
{
using type = packaged_lcall<Lambda, L, Ls...>;
};
template <template <typename...> class Lambda, typename... Ts, typename... PLs, typename L, typename...Ls>
struct apply<packaged_lcall<Lambda<Ts...>, PLs...>, L, Ls...> : Lambda<typename apply<Ts, L, Ls..., PLs...>::type...>
{
};
template <template <typename...> class Lambda, typename... Ts, typename... PLs, typename L, typename...Ls>
struct apply<packaged_lcall<bind<Lambda,Ts...>, PLs...>, L, Ls...>
{
using type = Lambda<typename apply<Ts, L, Ls..., PLs...>::type...>;
};
template<typename T, typename...Ts>
using bound_apply = typename apply<T, brigand::list<Ts...>>::type;
}
template <typename Lambda, typename... Args>
using apply = typename detail::apply<Lambda, brigand::list<Args...>>::type;
}
namespace brigand
{
template<std::size_t Index> struct args;
namespace detail
{
template<typename T, typename List>
struct substitute_impl
{
using type = T;
};
template<template<class...> class T, typename... Ts, typename List>
struct substitute_impl<T<Ts...>,List>
{
using type = T<typename substitute_impl<Ts,List>::type...>;
};
template<std::size_t Index, typename List>
struct substitute_impl<args<Index>,List>
{
using type = brigand::at_c<List,Index>;
};
}
template<typename T, typename List>
using substitute = typename detail::substitute_impl<T,List>::type;
}
namespace brigand
{
template <std::int8_t V>
using int8_t = std::integral_constant<std::int8_t, V>;
template <std::uint8_t V>
using uint8_t = std::integral_constant<std::uint8_t, V>;
template <std::int16_t V>
using int16_t = std::integral_constant<std::int16_t, V>;
template <std::uint16_t V>
using uint16_t = std::integral_constant<std::uint16_t, V>;
template <std::int32_t V>
using int32_t = std::integral_constant<std::int32_t, V>;
template <std::uint32_t V>
using uint32_t = std::integral_constant<std::uint32_t, V>;
template <std::int64_t V>
using int64_t = std::integral_constant<std::int64_t, V>;
template <std::uint64_t V>
using uint64_t = std::integral_constant<std::uint64_t, V>;
template<std::size_t V>
using size_t = std::integral_constant<std::size_t, V>;
template<std::ptrdiff_t V>
using ptrdiff_t = std::integral_constant<std::ptrdiff_t, V>;
}
namespace brigand
{
namespace detail
{
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
constexpr std::size_t count_bools(bool const * const begin, bool const * const end,
std::size_t n)
{
return begin == end ? n : detail::count_bools(begin + 1, end, n + *begin);
}
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
template <bool... Bs>
struct template_count_bools
{
using type = ::brigand::size_t<0>;
};
template <bool B, bool... Bs>
struct template_count_bools<B, Bs...>
{
using type = ::brigand::size_t<B + template_count_bools<Bs...>::type::value>;
};
template <bool B1, bool B2, bool B3, bool B4, bool B5, bool B6, bool B7, bool B8, bool B9,
bool B10, bool B11, bool B12, bool B13, bool B14, bool B15, bool B16, bool... Bs>
struct template_count_bools<B1, B2, B3, B4, B5, B6, B7, B8, B9, B10, B11, B12, B13, B14, B15,
B16, Bs...>
{
using type =
::brigand::size_t<B1 + B2 + B3 + B4 + B5 + B6 + B7 + B8 + B9 + B10 + B11 + B12 + B13 +
B14 + B15 + B16 + template_count_bools<Bs...>::type::value>;
};
}
namespace lazy
{
template <typename List, typename Pred>
struct count_if
{
};
template <template <typename...> class S, typename Pred>
struct count_if<S<>, Pred>
{
using type = ::brigand::size_t<0>;
};
#if defined(BRIGAND_COMP_GCC) || defined(BRIGAND_COMP_CLANG)
template <template <typename...> class S, template <typename...> class F>
struct count_if<S<>, bind<F, _1>>
{
using type = ::brigand::size_t<0>;
};
template <template <typename...> class S, template <typename...> class F>
struct count_if<S<>, F<_1>>
{
using type = ::brigand::size_t<0>;
};
template <template<typename...> class S, typename... Ts, typename Pred>
struct count_if<S<Ts...>, Pred>
{
static constexpr bool s_v[] = { ::brigand::apply<Pred, Ts>::type::value... };
using type = brigand::size_t<::brigand::detail::count_bools(s_v, s_v + sizeof...(Ts), 0u)>;
};
template <template <typename...> class S, typename... Ts, template <typename...> class F>
struct count_if<S<Ts...>, bind<F, _1>>
{
static constexpr bool s_v[] = { F<Ts>::value... };
using type = brigand::size_t<::brigand::detail::count_bools(s_v, s_v + sizeof...(Ts), 0u)>;
};
template <template <typename...> class S, typename... Ts, template <typename...> class F>
struct count_if<S<Ts...>, F<_1>>
{
static constexpr bool s_v[] = { F<Ts>::type::value... };
using type = brigand::size_t<::brigand::detail::count_bools(s_v, s_v + sizeof...(Ts), 0u)>;
};
#else
template <template <typename...> class S, typename... Ts, typename Pred>
struct count_if<S<Ts...>, Pred> : ::brigand::detail::template_count_bools<::brigand::apply<Pred, Ts>::value...>
{
};
#endif
}
template <typename List, typename Pred>
using count_if = typename lazy::count_if<List, Pred>::type;
template <class... T>
using count = std::integral_constant<std::size_t, sizeof...(T)>;
}
namespace brigand
{
template<class L> using size = wrap<L, count>;
}
namespace brigand
{
namespace detail
{
template<class L, class... T> struct push_front_impl;
template<template<class...> class L, class... U, class... T>
struct push_front_impl<L<U...>, T...>
{
using type = L<T..., U...>;
};
}
namespace lazy {
template<class L, class... T>
struct push_front : detail::push_front_impl<L, T...>{};
}
template<class L, class... T>
using push_front = typename detail::push_front_impl<L, T...>::type;
namespace detail
{
template<class L> struct front_impl;
template<template<class...> class L, class T, class... U>
struct front_impl<L<T, U...>>
{
using type = T;
};
}
template <class L>
using front = typename detail::front_impl<L>::type;
namespace detail
{
template <class L, std::size_t N> struct pop_front_impl;
template<template<class...> class L, class T, class... U>
struct pop_front_impl<L<T, U...>, 1>
{
using type = L<U...>;
};
template<template<class...> class L, class> struct pop_front_element;
template<template<class...> class L, class... Ts>
struct pop_front_element<L, list<Ts...>>
{
template<class... Us>
static L<Us...> impl(Ts..., type_<Us>*...);
};
template<template<class...> class L, class... Ts, std::size_t N>
struct pop_front_impl<L<Ts...>, N>
{
using type = decltype(pop_front_element<L, filled_list<
void const *, N
>>::impl(static_cast<type_<Ts>*>(nullptr)...));
};
}
namespace lazy {
template <class L, class N = std::integral_constant<std::size_t, 1>>
struct pop_front : detail::pop_front_impl<L, N::value> {};
}
template <class L, class N = std::integral_constant<std::size_t, 1>>
using pop_front = typename detail::pop_front_impl<L, N::value>::type;
}
namespace brigand
{
namespace detail
{
template<class L>
struct clear_impl;
template<template<class...> class L, class... Ts>
struct clear_impl<L<Ts...>>
{
using type = L<>;
};
}
template<class L>
using clear = typename detail::clear_impl<L>::type;
}
namespace brigand
{
namespace detail
{
template <bool b, typename O, typename L, std::size_t I>
struct split_at_impl;
template <template <typename...> class S, typename... Os, typename T, typename... Ts>
struct split_at_impl<false, S<Os...>, S<T, Ts...>, 0>
{
using type = S<S<Os...>, S<T, Ts...>>;
};
template <template <typename...> class S, typename... Os, typename... Ts>
struct split_at_impl<false, S<Os...>, S<Ts...>, 0>
{
using type = S<S<Os...>, S<Ts...>>;
};
template <template <typename...> class S, typename... Os, typename T, typename... Ts,
std::size_t I>
struct split_at_impl<false, S<Os...>, S<T, Ts...>, I>
: split_at_impl<false, S<Os..., T>, S<Ts...>, (I - 1)>
{
};
template <template <typename...> class S, typename... Os, typename T1, typename T2, typename T3,
typename T4, typename T5, typename T6, typename T7, typename T8, typename T9,
typename T10, typename T11, typename T12, typename T13, typename T14, typename T15,
typename T16, typename... Ts, std::size_t I>
struct split_at_impl<
true, S<Os...>,
S<T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, Ts...>, I>
: split_at_impl<((I - 16) > 16), S<Os..., T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12,
T13, T14, T15, T16>,
S<Ts...>, (I - 16)>
{
};
template <typename L, typename I>
struct call_split_at_impl : split_at_impl<(I::value > 16), brigand::clear<L>, L, I::value>
{
};
}
namespace lazy
{
template <typename L, typename I>
using split_at = ::brigand::detail::call_split_at_impl<L, I>;
}
template <typename L, typename I>
using split_at = typename ::brigand::lazy::split_at<L, I>::type;
}
namespace brigand
{
namespace detail
{
template<class L, class... T> struct push_back_impl;
template<template<class...> class L, class... U, class... T>
struct push_back_impl<L<U...>, T...>
{
using type = L<U..., T...>;
};
}
template<class L, class... T>
using push_back = typename detail::push_back_impl<L, T...>::type;
template <class L>
using back = at_c<L, size<L>::value-1>;
template <class L, class N = std::integral_constant<std::size_t, 1>>
using pop_back = front<split_at<L, std::integral_constant<std::size_t, size<L>::value - N::value>>>;
}
namespace brigand
{
namespace detail
{
template<class L1, class L2>
struct rot90;
template<
class... L1,
template<class...> class S1, class... T1,
template<class...> class S2, class... T2,
template<class...> class S3, class... T3,
template<class...> class S4, class... T4,
template<class...> class S5, class... T5,
template<class...> class S6, class... T6,
template<class...> class S7, class... T7,
template<class...> class S8, class... T8,
class... L2>
struct rot90<list<L1...>, list<
S1<T1...>, S2<T2...>, S3<T3...>, S4<T4...>,
S5<T5...>, S6<T6...>, S7<T7...>, S8<T8...>, L2...>>
: rot90<list<push_back<L1, T1, T2, T3, T4, T5, T6, T7, T8>...>, list<L2...>>
{};
template<class... L1, template<class...> class S, class... T, class... L2>
struct rot90<list<L1...>, list<S<T...>, L2...>>
: rot90<list<push_back<L1, T>...>, list<L2...>>
{};
template<class L1>
struct rot90<L1, list<>>
{
using type = L1;
};
template<class Func, class Seq1, class Seq2, class Seqs>
struct transform_impl;
template<class F, class T1, class T2, class Seq>
struct transform_apply;
template<class F, class T1, class T2, class... Ts>
struct transform_apply<F, T1, T2, list<Ts...>>
{
using type = brigand::apply<F, T1, T2, Ts...>;
};
template<
class Func,
template<class...> class Seq1, class... T1,
template<class...> class Seq2, class... T2,
class... Seqs>
struct transform_impl<Func, Seq1<T1...>, Seq2<T2...>, list<Seqs...>>
{
using type = Seq1<typename transform_apply<Func, T1, T2, Seqs>::type...>;
};
template<std::size_t N, class Seq1, class Seq2, class... FuncOrSeqs>
struct transform
: transform_impl<back<list<FuncOrSeqs...>>, Seq1, Seq2,
typename rot90<filled_list<list<>, size<Seq1>::value>, pop_back<list<FuncOrSeqs...>>>::type>
{};
template<template<class...> class Seq, class... T, class Func>
struct transform<0, Seq<T...>, Func>
{
using type = Seq<brigand::apply<Func, T>...>;
};
template<template<class...> class Seq, class... T, template<typename...> class Func>
struct transform<0, Seq<T...>, bind<Func, _1>>
{
using type = Seq<Func<T>...>;
};
template<template<class...> class Seq, class... T, template<typename...> class Func>
struct transform<0, Seq<T...>, Func<_1>>
{
using type = Seq<typename Func<T>::type...>;
};
template<template<class...> class Seq1, class... T1, template<class...> class Seq2, class... T2, class Func>
struct transform<1, Seq1<T1...>, Seq2<T2...>, Func>
{
using type = Seq1<brigand::apply<Func, T1, T2>...>;
};
}
namespace lazy
{
template<typename Sequence1, typename OpSeq1, typename... OpSeq2>
struct transform : detail::transform<sizeof...(OpSeq2), Sequence1, OpSeq1, OpSeq2...> {};
}
template<typename Sequence1, typename OpSeq1, typename... OpSeq2>
using transform = typename detail::transform<sizeof...(OpSeq2), Sequence1, OpSeq1, OpSeq2...>::type;
}
namespace brigand
{
template <typename T>
struct make_integral : std::integral_constant <typename T::value_type, T::value> {};
template <typename L>
using as_integral_list = transform<L, make_integral<brigand::_1>>;
}
namespace brigand
{
namespace detail
{
template <typename L, template <class...> class Sequence>
struct as_sequence_impl
{
using type = wrap<L, Sequence>;
};
}
template <typename L, template <class...> class Sequence>
using as_sequence = typename detail::as_sequence_impl<L, Sequence>::type;
template <typename L>
using as_list = as_sequence<L, brigand::list>;
}
namespace brigand
{
template <typename... T>
struct pair_wrapper_
{
static_assert (sizeof...(T) == 2
, "as_pair requires a type list of exactly two types"
);
using type = no_such_type_;
};
template <typename T, typename U>
struct pair_wrapper_<T,U>
{
using type = std::pair<T,U>;
};
template <typename... T>
using pair_wrapper = typename pair_wrapper_<T...>::type;
template <typename L>
using as_pair = wrap<L, pair_wrapper>;
}
namespace brigand
{
template <typename... T>
using tuple_wrapper = typename std::tuple<T...>;
template <typename L>
using as_tuple = wrap<L, tuple_wrapper>;
}
#if !defined(BRIGAND_NO_BOOST_SUPPORT)
namespace brigand
{
template <typename... T>
using fusion_vector_wrapper = boost::fusion::vector<T...>;
template <typename... T>
using fusion_list_wrapper = boost::fusion::list<T...>;
template <typename... T>
using fusion_deque_wrapper = boost::fusion::deque<T...>;
template <typename... T>
using fusion_set_wrapper = boost::fusion::set<T...>;
template <typename L> using as_fusion_vector = wrap<L, fusion_vector_wrapper>;
template <typename L> using as_fusion_deque = wrap<L, fusion_deque_wrapper>;
template <typename L> using as_fusion_list = wrap<L, fusion_list_wrapper>;
template <typename L> using as_fusion_set = wrap<L, fusion_set_wrapper>;
}
namespace brigand
{
template <typename... T>
using variant_wrapper = typename boost::variant<T...>;
template <typename L>
using as_variant = wrap<L, variant_wrapper>;
}
#endif
namespace brigand
{
template <bool B>
using bool_ = std::integral_constant<bool, B>;
}
namespace brigand
{
namespace detail
{
template <typename Args>
struct non_null_impl : bool_<Args::value != 0>{};
using non_null = non_null_impl<_1>;
}
}
namespace brigand
{
#ifdef BRIGAND_COMP_MSVC_2013
namespace detail
{
template <bool...> struct bools_ {};
template< typename Sequence, typename Predicate, typename... Ts> struct all_impl;
template< template<class...> class Sequence, typename Predicate, typename... Ts>
struct all_impl<Sequence<Ts...>, Predicate>
: std::is_same< bools_<true, ::brigand::apply<Predicate, Ts>::value...>
, bools_<::brigand::apply<Predicate, Ts>::value..., true>
>
{};
}
#else
namespace detail
{
struct all_same
{
const bool value = false;
constexpr all_same(...) {}
template <typename T>
constexpr all_same(std::initializer_list<T *>) : value{ true }
{
}
};
template <typename Sequence, typename Predicate>
struct all_impl : bool_<true>{};
template <template <class...> class Sequence, typename Predicate, typename T, typename... Ts>
struct all_impl<Sequence<T,Ts...>, Predicate>
{
static constexpr all_same tester{ static_cast<::brigand::apply<Predicate, T> *>(nullptr),
static_cast<::brigand::apply<Predicate, Ts> *>(nullptr)... };
using type = bool_<(::brigand::apply<Predicate, T>::value != 0 && tester.value)>;
};
template <template <class...> class Sequence, template <typename...> class F, typename T,
typename... Ts>
struct all_impl<Sequence<T, Ts...>, bind<F, _1>>
{
static constexpr all_same tester{ static_cast<F<T> *>(nullptr),
static_cast<F<Ts> *>(nullptr)... };
using type = bool_<(F<T>::value != 0 && tester.value)>;
};
template <template <class...> class Sequence, template <typename...> class F, typename T,
typename... Ts>
struct all_impl<Sequence<T, Ts...>, F<_1>>
{
static constexpr all_same tester{ static_cast<typename F<T>::type *>(nullptr),
static_cast<typename F<Ts>::type *>(nullptr)... };
using type = bool_<(F<T>::type::value != 0 && tester.value)>;
};
}
#endif
template <typename Sequence, typename Predicate = detail::non_null>
using all = typename detail::all_impl<Sequence, Predicate>::type;
}
namespace brigand
{
#ifdef BRIGAND_COMP_MSVC_2013
namespace detail
{
template<typename Sequence, typename Pred> struct none_impl
{
template<typename T>
struct nope
{
using that = brigand::apply<Pred, T>;
using type = bool_<!that::value>;
};
using type = all<Sequence, nope<_1>>;
};
}
#else
namespace detail
{
template <typename Sequence, typename Predicate>
struct none_impl : bool_<true>{};
template <template <class...> class Sequence, typename Predicate, typename T, typename... Ts>
struct none_impl<Sequence<T,Ts...>, Predicate>
{
static constexpr all_same tester{ static_cast<::brigand::apply<Predicate, T> *>(nullptr),
static_cast<::brigand::apply<Predicate, Ts> *>(nullptr)... };
using type = bool_<(::brigand::apply<Predicate, T>::value == 0 && tester.value)>;
};
template <template <class...> class Sequence, template <typename...> class F, typename T,
typename... Ts>
struct none_impl<Sequence<T, Ts...>, bind<F, _1>>
{
static constexpr all_same tester{ static_cast<F<T> *>(nullptr),
static_cast<F<Ts> *>(nullptr)... };
using type = bool_<(F<T>::value == 0 && tester.value)>;
};
template <template <class...> class Sequence, template <typename...> class F, typename T,
typename... Ts>
struct none_impl<Sequence<T, Ts...>, F<_1>>
{
static constexpr all_same tester{ static_cast<typename F<T>::type *>(nullptr),
static_cast<typename F<Ts>::type *>(nullptr)... };
using type = bool_<(F<T>::type::value == 0 && tester.value)>;
};
}
#endif
template< typename Sequence, typename Predicate = detail::non_null>
using none = typename detail::none_impl<Sequence,Predicate>::type;
}
namespace brigand
{
namespace detail
{
template< typename Sequence, typename Predicate >
struct any_impl : bool_<!none<Sequence,Predicate>::value> {};
}
template<typename Sequence, typename Predicate = detail::non_null>
using any = typename detail::any_impl<Sequence,Predicate>::type;
}
namespace brigand
{
namespace detail
{
template <template <typename...> class S, template <typename...> class F, typename... Ts>
struct finder
{
template <typename T>
using P = F<Ts..., T>;
template <bool InNext8, bool Match, typename... Ls>
struct find
{
using type = S<>;
};
template <typename L>
struct find<true, false, L>
{
using type = S<>;
};
template <typename L, typename... Ls>
struct find<true, true, L, Ls...>
{
using type = S<L, Ls...>;
};
template <typename L1, typename L2, typename... Ls>
struct find<true, false, L1, L2, Ls...> : find<true, F<Ts..., L2>::value, L2, Ls...>
{
};
template <typename L0, typename L1, typename L2, typename L3, typename L4, typename L5,
typename L6, typename L7, typename L8,
typename... Ls>
struct find<false, false, L0, L1, L2, L3, L4, L5, L6, L7, L8, Ls...>
: find<true, F<Ts..., L8>::value, L8, Ls...>
{
};
template <typename L1, typename L2, typename L3, typename L4, typename L5, typename L6,
typename L7, typename L8, typename L9, typename L10, typename L11, typename L12,
typename L13, typename L14, typename L15, typename L16,
typename... Ls>
struct find<false, false, L1, L2, L3, L4, L5, L6, L7, L8, L9, L10, L11, L12, L13, L14, L15,
L16, Ls...>
: find<(P<L9>::value || P<L10>::value || P<L11>::value || P<L12>::value ||
P<L13>::value || P<L14>::value || P<L15>::value || P<L16>::value),
P<L9>::value, L9, L10, L11, L12, L13, L14, L15, L16, Ls...>
{
};
};
}
}
namespace brigand
{
namespace detail
{
template <template<class...> class L, class...>
struct reverse_elements;
template <template <class...> class L>
struct reverse_elements<L>
{
using type = L<>;
};
template <template <class...> class L, class T0, class... Ts>
struct reverse_elements<L, T0, Ts...>
: append_impl<typename reverse_elements<L, Ts...>::type, L<T0>>
{
};
template <template <class...> class L, class T0, class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10, class T11, class T12, class T13, class T14, class T15, class... Ts>
struct reverse_elements<L, T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, Ts...>
: append_impl<typename reverse_elements<L, Ts...>::type, L<T15, T14, T13, T12, T11, T10, T9, T8, T7, T6, T5, T4, T3, T2, T1, T0>>
{
};
template<class L>
struct reverse_impl;
template<template<class...> class L, class... U>
struct reverse_impl<L<U...>>
: reverse_elements<L, U...>
{
};
}
namespace lazy
{
template <typename L>
using reverse = typename detail::reverse_impl<L>;
}
template <typename L>
using reverse = typename detail::reverse_impl<L>::type;
}
namespace brigand
{
namespace lazy
{
template <typename Sequence, typename Predicate = ::brigand::detail::non_null>
struct find;
template <template <typename...> class Sequence, typename... Ls, typename Pred>
struct find<Sequence<Ls...>, Pred>
: detail::finder<Sequence, detail::bound_apply, Pred>::template find<
false, false, void, void, void, void, void, void, void, void, Ls...>
{
};
template <template <typename...> class Sequence, typename... Ls, template <typename...> class F>
struct find<Sequence<Ls...>, bind<F, _1>>
: detail::finder<Sequence, F>::template find<false, false, void, void, void, void, void,
void, void, void, Ls...>
{
};
}
template <typename Sequence, typename Predicate = brigand::detail::non_null>
using find = typename lazy::find<Sequence, Predicate>::type;
namespace lazy
{
template <typename Sequence, typename Predicate = detail::non_null>
using reverse_find =
::brigand::lazy::reverse<::brigand::find<brigand::reverse<Sequence>, Predicate>>;
}
template <typename Sequence, typename Predicate = detail::non_null>
using reverse_find = typename ::brigand::lazy::reverse_find<Sequence, Predicate>::type;
namespace detail
{
template <typename Sequence, typename Predicate>
using find_size = size<brigand::find<Sequence, Predicate>>;
template <typename Sequence, typename Predicate>
using empty_find = bool_<find_size<Sequence, Predicate>::value == 0>;
template <typename Sequence, typename Predicate>
using non_empty_find = bool_<find_size<Sequence, Predicate>::value != 0>;
}
template <typename Sequence, typename Predicate = detail::non_null>
using not_found = typename detail::empty_find<Sequence, Predicate>;
template <typename Sequence, typename Predicate = detail::non_null>
using found = typename detail::non_empty_find<Sequence, Predicate>;
}
namespace brigand
{
namespace detail
{
template <class L>
struct flatten_impl
{
using type = L;
};
template <template<class...> class L, class T>
struct flatten_element_impl
{
using type = L<T>;
};
template <template<class...> class L, class... Ts>
struct flatten_element_impl<L, L<Ts...>>
: append_impl<typename flatten_element_impl<L, Ts>::type...>
{
};
template <template<class...> class L, class... Ts>
struct flatten_impl<L<Ts...>>
: flatten_element_impl<L, L<Ts...>>
{
};
}
namespace lazy
{
template <typename Sequence>
using flatten = typename detail::flatten_impl<Sequence>;
}
template <typename Sequence>
using flatten = typename lazy::flatten<Sequence>::type;
}
namespace brigand { namespace detail
{
template<class Functor, class State, class Sequence>
struct fold_impl
{
using type = State;
};
template<
class Functor, class State, template <class...> class Sequence,
class T0>
struct fold_impl<Functor, State, Sequence<T0>>
{
using type = brigand::apply<Functor, State, T0>;
};
template<
class Functor, class State, template <class...> class Sequence,
class T0, class T1>
struct fold_impl<Functor, State, Sequence<T0, T1>>
{
using type = brigand::apply<Functor,
brigand::apply<Functor,State, T0>, T1
>;
};
template<
class Functor, class State, template <class...> class Sequence,
class T0, class T1, class T2>
struct fold_impl<Functor, State, Sequence<T0, T1, T2>>
{
using type = brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor, State, T0>, T1
>, T2
>;
};
template<
class Functor, class State, template <class...> class Sequence,
class T0, class T1, class T2, class T3>
struct fold_impl<Functor, State, Sequence<T0, T1, T2, T3>>
{
using type = brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor, State, T0>, T1
>, T2
>, T3
>;
};
template<
class Functor, class State, template <class...> class Sequence,
class T0, class T1, class T2, class T3, class T4>
struct fold_impl<Functor, State, Sequence<T0, T1, T2, T3, T4>>
{
using type = brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor, State, T0>, T1
>, T2
>, T3
>, T4
>;
};
template<
class Functor, class State, template <class...> class Sequence,
class T0, class T1, class T2, class T3, class T4, class T5>
struct fold_impl<Functor, State, Sequence<T0, T1, T2, T3, T4, T5>>
{
using type = brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor, State, T0>, T1
>, T2
>, T3
>, T4
>, T5
>;
};
template<
class Functor, class State, template <class...> class Sequence,
class T0, class T1, class T2, class T3, class T4, class T5, class T6>
struct fold_impl<Functor, State, Sequence<T0, T1, T2, T3, T4, T5, T6>>
{
using type = brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor, State, T0>, T1
>, T2
>, T3
>, T4
>, T5
>, T6
>;
};
template<
class Functor, class State, template <class...> class Sequence,
class T0, class T1, class T2, class T3, class T4, class T5, class T6, class T7>
struct fold_impl<Functor, State, Sequence<T0, T1, T2, T3, T4, T5, T6, T7>>
{
using type = brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor, State, T0>, T1
>, T2
>, T3
>, T4
>, T5
>, T6
>, T7
>;
};
template<
class Functor, class State, template <class...> class Sequence,
class T0, class T1, class T2, class T3, class T4, class T5, class T6, class T7, class... T>
struct fold_impl<Functor, State, Sequence<T0, T1, T2, T3, T4, T5, T6, T7, T...>>
: fold_impl<
Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
State, T0
>, T1
>, T2
>, T3
>, T4
>, T5
>, T6
>, T7
>,
Sequence<T...>
>
{};
template<typename Functor, typename State, typename Sequence>
struct reverse_fold_impl
{
using type = State;
};
template <typename Functor, typename State, template <typename...> class L, typename T, typename... Ts>
struct reverse_fold_impl<Functor, State, L<T, Ts...>>
{
using type =
brigand::apply<Functor, typename reverse_fold_impl<Functor, State, L<Ts...>>::type, T>;
};
template<
typename Functor, typename State, template <typename...> class L,
typename T0, typename T1, typename T2, typename T3, typename T4, typename T5, typename T6, typename T7, typename... Ts>
struct reverse_fold_impl<Functor, State, L<T0, T1, T2, T3, T4, T5, T6, T7, Ts...>>{
using type = brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
brigand::apply<Functor,
typename reverse_fold_impl<Functor, State, L<Ts...>>::type, T7
>, T6
>, T5
>, T4
>, T3
>, T2
>, T1
>, T0
>;
};
} }
namespace brigand
{
namespace lazy
{
template <class Sequence, class State, class Functor>
using fold = typename detail::fold_impl<Functor, State, Sequence>;
template <class Sequence, class State, class Functor>
using reverse_fold = typename detail::reverse_fold_impl<Functor, State, Sequence>;
}
template <class Sequence, class State, class Functor>
using fold = typename ::brigand::lazy::fold<Sequence, State, Functor>::type;
template <class Sequence, class State, class Functor>
using reverse_fold = typename ::brigand::lazy::reverse_fold<Sequence, State, Functor>::type;
}
namespace brigand
{
template<class F, class...Ts> F for_each_args(F f, Ts&&...a)
{
return (void)std::initializer_list<int>{((void)std::ref(f)(static_cast<Ts&&>(a)),0)...}, f;
}
}
namespace brigand
{
namespace detail
{
template<template<class...> class List, typename... Elements, typename Functor>
Functor for_each_impl( List<Elements...>&&, Functor f )
{
return for_each_args( f, type_<Elements>()... );
}
}
template<typename List, typename Functor> Functor for_each( Functor f )
{
return detail::for_each_impl( List{}, f );
}
}
namespace brigand
{
namespace detail
{
template <bool Found, class Sequence, typename Predicate, typename NotFoundType>
struct index_if_impl
{
using type = ::brigand::size_t<size<Sequence>::value -
size<::brigand::find<Sequence, Predicate>>::value>;
};
template <class Sequence, typename Predicate, typename NotFoundType>
struct index_if_impl<false, Sequence, Predicate, NotFoundType>
{
using type = NotFoundType;
};
}
template <class Sequence, class Predicate, class NotFoundType = no_such_type_>
using index_if = typename detail::index_if_impl<::brigand::found<Sequence, Predicate>::value,
Sequence, Predicate, NotFoundType>::type;
template <class Sequence, typename T>
using index_of = index_if<Sequence, std::is_same<T, ::brigand::_1>>;
}
namespace brigand
{
namespace detail
{
template<class T, class, class, T>
struct range_cat;
#ifdef BRIGAND_COMP_MSVC
template<class T, T Start, T Int>
struct int_plus
{
using type = std::integral_constant<T, Start + Int>;
};
#endif
template<class T, class... Ts, T... Ints, T Start>
struct range_cat<T, list<Ts...>, list<std::integral_constant<T, Ints>...>, Start>
{
#ifdef BRIGAND_COMP_MSVC
using type = list<Ts..., typename int_plus<T, Start, Ints>::type...>;
#else
using type = list<Ts..., std::integral_constant<T, Start + Ints>...>;
#endif
};
template<class T, T Start, std::size_t N>
struct range_impl
: range_cat<
T,
typename range_impl<T, Start, N/2>::type,
typename range_impl<T, Start, N - N/2>::type,
N/2
>
{};
template<class T, T Start>
struct range_impl<T, Start, 1>
{
using type = list<std::integral_constant<T, Start>>;
};
template<class T, T Start>
struct range_impl<T, Start, 0>
{
using type = list<>;
};
template<class T, class, class, T>
struct reverse_range_cat;
#ifdef BRIGAND_COMP_MSVC
template<class T, T Start, T Int>
struct int_minus
{
using type = std::integral_constant<T, Int - Start>;
};
#endif
template<class T, class... Ts, T... Ints, T Start>
struct reverse_range_cat<T, list<Ts...>, list<std::integral_constant<T, Ints>...>, Start>
{
#ifdef BRIGAND_COMP_MSVC
using type = list<Ts..., typename int_minus<T, Start, Ints>::type...>;
#else
using type = list<Ts..., std::integral_constant<T, Ints - Start>...>;
#endif
};
template<class T, T Start, std::size_t N>
struct reverse_range_impl
: reverse_range_cat<
T,
typename reverse_range_impl<T, Start, N/2>::type,
typename reverse_range_impl<T, Start, N - N/2>::type,
N/2
>
{
};
template<class T, T Start>
struct reverse_range_impl<T, Start, 1>
{
using type = list<std::integral_constant<T, Start>>;
};
template<class T, T Start>
struct reverse_range_impl<T, Start, 0>
{
using type = list<>;
};
template <class T, T Start, T Stop>
struct reverse_range_safe
{
static_assert(Start >= Stop, "Invalid parameters. reverse_range<> syntax is reverse_range<type, from, down_to>");
using type = typename reverse_range_impl<T, Start, Start-Stop>::type;
};
}
template<class T, T Start, T Stop>
using range = typename detail::range_impl<T, Start, Stop-Start>::type;
template<class T, T Start, T Stop>
using reverse_range = typename detail::reverse_range_safe<T, Start, Stop>::type;
}
namespace brigand
{
namespace detail
{
template<class, class T> struct unique_x_t
{ operator type_<T> (); };
template<class Ints, class... Ts>
struct is_set_impl;
template<>
struct is_set_impl<list<>>
{
using type = std::true_type;
};
inline std::true_type true_fn(...);
template<class... Ints, class... Ts>
struct is_set_impl<list<Ints...>, Ts...>
{
struct Pack : unique_x_t<Ints, Ts>... {};
template<class... Us>
static auto is_set(Us...) -> decltype(true_fn(static_cast<Us>(Pack())...));
static std::false_type is_set(...);
using type = decltype(is_set(type_<Ts>()...));
};
}
template<class... Ts>
using is_set = typename detail::is_set_impl<range<int, 0, sizeof...(Ts)>, Ts...>::type;
}
namespace brigand
{
#if defined(BRIGAND_COMP_GCC) || defined(BRIGAND_COMP_CLANG)
namespace lazy
{
template <typename L, typename Pred>
struct remove_if;
template <template <class...> class L, typename... Ts, typename Pred>
struct remove_if<L<Ts...>, Pred>
: ::brigand::detail::append_impl<
L<>, typename std::conditional<::brigand::apply<Pred, Ts>::value, list<>, list<Ts>>::type...>
{
};
template <template <class...> class L, typename... Ts, template<typename...> class F>
struct remove_if<L<Ts...>, bind<F,_1>>
: ::brigand::detail::append_impl<
L<>, typename std::conditional<F<Ts>::value, list<>, list<Ts>>::type...>
{
};
template <template <class...> class L, typename... Ts, template<typename...> class F>
struct remove_if<L<Ts...>, F<_1>>
: ::brigand::detail::append_impl<
L<>, typename std::conditional<F<Ts>::type::value, list<>, list<Ts>>::type...>
{
};
}
namespace lazy
{
template <typename L, typename T>
struct remove;
template <template <class...> class L, typename... Ts, typename T>
struct remove<L<Ts...>, T>
: ::brigand::detail::append_impl<
L<>, typename std::conditional<std::is_same<Ts, T>::value, list<>, list<Ts>>::type...>
{
};
}
namespace lazy
{
template <typename L, typename Pred>
struct filter;
template <template <class...> class L, typename... Ts, typename Pred>
struct filter<L<Ts...>, Pred>
: ::brigand::detail::append_impl<
L<>, typename std::conditional<::brigand::apply<Pred, Ts>::value, list<Ts>, list<>>::type...>
{
};
template <template <class...> class L, typename... Ts, template<typename...> class F>
struct filter<L<Ts...>, bind<F, _1>>
: ::brigand::detail::append_impl<
L<>, typename std::conditional<F<Ts>::value, list<Ts>, list<>>::type...>
{
};
template <template <class...> class L, typename... Ts, template<typename...> class F>
struct filter<L<Ts...>, F<_1>>
: ::brigand::detail::append_impl<
L<>, typename std::conditional<F<Ts>::type::value, list<Ts>, list<>>::type...>
{
};
}
#else
namespace detail
{
template <typename Pred, typename T, bool B>
struct empty_if_true : std::conditional<::brigand::apply<Pred, T>::value == B, list<>, list<T>>
{
};
template <template <typename...> class F, typename T, bool B>
struct empty_if_true<bind<F, _1>, T, B> : std::conditional<F<T>::value == B, list<>, list<T>>
{
};
template <template <typename...> class F, typename T, bool B>
struct empty_if_true<F<_1>, T, B> : std::conditional<F<T>::type::value == B, list<>, list<T>>
{
};
}
namespace lazy
{
template <typename L, typename Pred>
struct remove_if;
template <template <class...> class L, typename... Ts, typename Pred>
struct remove_if<L<Ts...>, Pred>
: ::brigand::detail::append_impl<
L<>, typename ::brigand::detail::empty_if_true<Pred, Ts, true>::type...>
{
};
}
namespace lazy
{
template <typename L, typename T>
struct remove;
template <template <class...> class L, typename... Ts, typename T>
struct remove<L<Ts...>, T>
: ::brigand::detail::append_impl<
L<>, typename std::conditional<std::is_same<Ts, T>::value, list<>, list<Ts>>::type...>
{
};
}
namespace lazy
{
template <typename L, typename Pred>
struct filter;
template <template <class...> class L, typename... Ts, typename Pred>
struct filter<L<Ts...>, Pred>
: ::brigand::detail::append_impl<
L<>, typename ::brigand::detail::empty_if_true<Pred, Ts, false>::type...>
{
};
}
#endif
template <typename L, typename Pred>
using remove_if = typename lazy::remove_if<L, Pred>::type;
template <typename L, typename T>
using remove = typename lazy::remove<L, T>::type;
template <typename L, typename Pred>
using filter = typename lazy::filter<L, Pred>::type;
}
namespace brigand
{
template <class Seq, class Pred>
using partition = pair<filter<Seq, Pred>, remove_if<Seq, Pred>>;
}
namespace brigand
{
namespace detail
{
template <typename T, typename Pred, typename NewType>
struct replacer : std::conditional<::brigand::apply<Pred, T>::value, NewType, T>
{
};
template <typename T, template <typename...> class F, typename NewType>
struct replacer<T, bind<F, _1>, NewType> : std::conditional<F<T>::value, NewType, T>
{
};
template <typename T, template <typename...> class F, typename NewType>
struct replacer<T, F<_1>, NewType> : std::conditional<F<T>::type::value, NewType, T>
{
};
}
namespace lazy
{
template <typename Sequence, typename Predicate, typename NewType>
struct replace_if;
template <template <typename...> class S, typename... Ts, typename Predicate, typename NewType>
struct replace_if<S<Ts...>, Predicate, NewType>
{
using type = S<typename detail::replacer<Ts, Predicate, NewType>::type...>;
};
template <typename Sequence, typename OldType, typename NewType>
using replace = replace_if<Sequence, std::is_same<_1, pin<OldType>>, NewType>;
}
template <typename Sequence, typename Predicate, typename NewType>
using replace_if = typename ::brigand::lazy::replace_if<Sequence, Predicate, NewType>::type;
template <typename Sequence, typename OldType, typename NewType>
using replace = typename ::brigand::lazy::replace<Sequence, OldType, NewType>::type;
}
namespace brigand
{
template<typename C, typename T, typename F>
inline typename std::enable_if<C::value,T&&>::type select(T&& t, F&&)
{
return std::forward<T>(t);
}
template<typename C, typename T, typename F>
inline typename std::enable_if<!C::value,F&&>::type select(T&&, F&& f)
{
return std::forward<F>(f);
}
}
namespace brigand
{
namespace detail
{
template<typename TOut, typename TCurrent, typename TDelim, typename... Ts>
struct split_impl;
template<template<typename...> class L, typename... Os, typename... Cs, typename TDelim, typename T, typename... Ts>
struct split_impl<L<Os...>, L<Cs...>, TDelim, T, Ts...> :
split_impl<L<Os...>, L<Cs..., T>, TDelim, Ts...> {};
template<template<typename...> class L, typename... Os, typename... Cs, typename TDelim, typename T>
struct split_impl<L<Os...>, L<Cs...>, TDelim, T> {
using type = L<Os..., L<Cs..., T>>;
};
template<template<typename...> class L, typename... Os, typename... Cs, typename TDelim, typename... Ts>
struct split_impl<L<Os...>, L<Cs...>, TDelim, TDelim, Ts...> :
split_impl<L<Os..., L<Cs...>>, L<>, TDelim, Ts...> {};
template<template<typename...> class L, typename... Os, typename... Cs, typename TDelim>
struct split_impl<L<Os...>, L<Cs...>, TDelim, TDelim> {
using type = L<Os..., L<Cs...>>;
};
template<template<typename...> class L, typename... Os, typename TDelim, typename... Ts>
struct split_impl<L<Os...>, L<>, TDelim, TDelim, Ts...> :
split_impl<L<Os...>, L<>, TDelim, Ts...> {};
template<template<typename...> class L, typename... Os, typename TDelim>
struct split_impl<L<Os...>, L<>, TDelim, TDelim> {
using type = L<Os...>;
};
template<template<typename...> class L, typename... Os, typename TDelim>
struct split_impl<L<Os...>, L<>, TDelim> {
using type = L<Os...>;
};
template<typename TList, typename TDelim>
struct split_helper;
template<template<typename...> class L, typename T, typename... Ts, typename TDelim>
struct split_helper<L<T,Ts...>, TDelim> : split_impl<L<>, L<>, TDelim, T, Ts...>{};
template<template<typename...> class L, typename... T, typename TDelim>
struct split_helper<L<T...>, TDelim> {
using type = L<>;
};
}
namespace lazy
{
template<typename TList, typename TDelim>
using split = detail::split_helper<TList, TDelim>;
}
template<typename TList, typename TDelim>
using split = typename lazy::split<TList, TDelim>::type;
}
namespace brigand
{
template <typename A, typename B>
struct less : bool_ < (A::value < B::value) > {};
}
namespace brigand
{
namespace detail
{
template<class L, class Seq1, class Seq2, class Comp>
struct merge_impl;
template<bool, class L, class Seq1, class Seq2, class Comp>
struct merge_insert;
template<class... R, class T0, class T1, class... Ts, class U, class... Us, class Comp>
struct merge_insert<true, list<R...>, list<T0,T1,Ts...>, list<U,Us...>, Comp>
: merge_insert<::brigand::apply<Comp,T1,U>::value, list<R...,T0>, list<T1,Ts...>, list<U,Us...>, Comp>
{};
template<class... R, class T, class U, class... Us, class Comp>
struct merge_insert<true, list<R...>, list<T>, list<U,Us...>, Comp>
{
using list = ::brigand::list<R...,T>;
using left = ::brigand::list<>;
using right = ::brigand::list<U,Us...>;
};
template<class... R, class T, class... Ts, class U0, class U1, class... Us, class Comp>
struct merge_insert<false, list<R...>, list<T,Ts...>, list<U0,U1,Us...>, Comp>
: merge_insert<::brigand::apply<Comp,T,U1>::value, list<R...,U0>, list<T,Ts...>, list<U1,Us...>, Comp>
{};
template<class... R, class T, class... Ts, class U, class Comp>
struct merge_insert<false, list<R...>, list<T,Ts...>, list<U>, Comp>
{
using list = ::brigand::list<R...,U>;
using left = ::brigand::list<T,Ts...>;
using right = ::brigand::list<>;
};
template<
class... R,
class T0, class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class... Ts,
class U0, class U1, class U2, class U3, class U4, class U5, class U6, class U7, class U8, class U9, class... Us, class Comp>
struct merge_impl<list<R...>, list<T0,T1,T2,T3,T4,T5,T6,T7,T8,T9,Ts...>, list<U0,U1,U2,U3,U4,U5,U6,U7,U8,U9,Us...>, Comp>
{
using sub = merge_insert<::brigand::apply<Comp,T0,U0>::value, list<>, list<T0,T1,T2,T3,T4,T5,T6,T7,T8,T9>, list<U0,U1,U2,U3,U4,U5,U6,U7,U8,U9>, Comp>;
using type = typename merge_impl<
append<list<R...>, typename sub::list>,
append<typename sub::left, list<Ts...>>,
append<typename sub::right, list<Us...>>,
Comp
>::type;
};
template<class... R, class T, class... Ts, class U, class... Us, class Comp>
struct merge_impl<list<R...>, list<T,Ts...>, list<U,Us...>, Comp>
: std::conditional<
::brigand::apply<Comp,T,U>::value,
merge_impl<list<R...,T>, list<Ts...>, list<U,Us...>, Comp>,
merge_impl<list<R...,U>, list<T,Ts...>, list<Us...>, Comp>
>::type
{};
template<class... R, class... Ts, class Comp>
struct merge_impl<list<R...>, list<Ts...>, list<>, Comp>
{
using type = list<R..., Ts...>;
};
template<class... R, class... Us, class Comp>
struct merge_impl<list<R...>, list<>, list<Us...>, Comp>
{
using type = list<R..., Us...>;
};
template<class... R, class Comp>
struct merge_impl<list<R...>, list<>, list<>, Comp>
{
using type = list<R...>;
};
}
template<class Seq1, class Seq2, class Comp = less<_1,_2>>
using merge = append<clear<Seq1>, typename detail::merge_impl<list<>, wrap<Seq1, list>, wrap<Seq2, list>, Comp>::type>;
}
namespace brigand
{
namespace detail
{
template <class Ls, class Seq, typename Comp>
struct sort_impl;
template<class L, class Comp>
struct mini_sort;
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class... Ts, class Comp>
struct mini_sort<list<T0, T1, T2, T3, T4, T5, T6, T7, T8, Ts...>, Comp>
: merge_impl<
list<>,
typename mini_sort<list<T0, T1, T2, T3, T4, T5, T6, T7>, Comp>::type,
typename mini_sort<list<T8, Ts...>, Comp>::type, Comp>
{};
template<class T0, class T1, class T2, class T3, class T4, class... Ts, class Comp>
struct mini_sort<list<T0, T1, T2, T3, T4, Ts...>, Comp>
: merge_impl<list<>, typename mini_sort<list<T0, T1, T2, T3>, Comp>::type, typename mini_sort<list<T4, Ts...>, Comp>::type, Comp>
{};
template<class T0, class T1, class T2, class T3, class Comp>
struct mini_sort<list<T0, T1, T2, T3>, Comp>
: merge_impl<list<>, typename mini_sort<list<T0, T1>, Comp>::type, typename mini_sort<list<T2, T3>, Comp>::type, Comp>
{};
template<class T0, class T1, class T2, class Comp>
struct mini_sort<list<T0, T1, T2>, Comp>
: merge_impl<list<>, typename mini_sort<list<T0, T1>, Comp>::type, list<T2>, Comp>
{};
template<class T0, class T1, class Comp>
struct mini_sort<list<T0, T1>, Comp>
{
using type = typename std::conditional<::brigand::apply<Comp, T0, T1>::value, list<T0, T1>, list<T1, T0>>::type;
};
template<class T0, class Comp>
struct mini_sort<list<T0>, Comp>
{
using type = list<T0>;
};
template <
class T0, class T1, class T2, class T3, class T4, class T5, class T6,
class T7, class T8, class T9, class T10, class T11, class T12, class T13,
class T14, class T15, class T16, class T17, class... Ts, typename Comp>
struct sort_impl<list<>, list<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, Ts...>, Comp>
: sort_impl<
list<typename mini_sort<list<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17>, Comp>::type>,
list<Ts...>, Comp>
{};
template <
class L0,
class T0, class T1, class T2, class T3, class T4, class T5, class T6,
class T7, class T8, class T9, class T10, class T11, class T12, class T13,
class T14, class T15, class T16, class T17, class... Ts, typename Comp>
struct sort_impl<list<L0>, list<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, Ts...>, Comp>
: sort_impl<
list<L0, typename mini_sort<list<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17>, Comp>::type>,
list<Ts...>, Comp>
{};
template <
class L0, class L1,
class T0, class T1, class T2, class T3, class T4, class T5, class T6,
class T7, class T8, class T9, class T10, class T11, class T12, class T13,
class T14, class T15, class T16, class T17, class... Ts, typename Comp>
struct sort_impl<list<L0,L1>, list<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, Ts...>, Comp>
: sort_impl<
list<L0, L1, typename mini_sort<list<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17>, Comp>::type>,
list<Ts...>, Comp>
{};
template <
class L0, class L1, class L2,
class T0, class T1, class T2, class T3, class T4, class T5, class T6,
class T7, class T8, class T9, class T10, class T11, class T12, class T13,
class T14, class T15, class T16, class T17, class... Ts, typename Comp>
struct sort_impl<list<L0,L1,L2>, list<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, Ts...>, Comp>
: sort_impl<
list<
merge<L0, L1, Comp>,
merge<
typename mini_sort<list<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17>, Comp>::type, L2, Comp>>,
list<Ts...>, Comp>
{};
template <class T, class... Ts, typename Comp>
struct sort_impl<list<>, list<T, Ts...>, Comp>
{
using type = typename mini_sort<list<T, Ts...>, Comp>::type;
};
template <class L, class T, class... Ts, typename Comp>
struct sort_impl<list<L>, list<T, Ts...>, Comp>
{
using type = merge<typename mini_sort<list<T, Ts...>, Comp>::type, L, Comp>;
};
template <class L0, class L1, class T, class... Ts, typename Comp>
struct sort_impl<list<L0, L1>, list<T, Ts...>, Comp>
{
using type = merge<L0, merge<typename mini_sort<list<T, Ts...>, Comp>::type, L1, Comp>, Comp>;
};
template <class L0, class L1, class L2, class T, class... Ts, typename Comp>
struct sort_impl<list<L0, L1, L2>, list<T, Ts...>, Comp>
{
using type = merge<merge<L0, L1, Comp>, merge<typename mini_sort<list<T, Ts...>, Comp>::type, L2, Comp>, Comp>;
};
template <class L, typename Comp>
struct sort_impl<list<L>, list<>, Comp>
{
using type = L;
};
template <class L0, class L1, typename Comp>
struct sort_impl<list<L0, L1>, list<>, Comp>
{
using type = merge<L0,L1,Comp>;
};
template <class L0, class L1, class L2, typename Comp>
struct sort_impl<list<L0,L1,L2>, list<>, Comp>
{
using type = merge<merge<L0,L1,Comp>,L2,Comp>;
};
template <typename Comp>
struct sort_impl<list<>, list<>, Comp>
{
using type = list<>;
};
template <
class T0, class T1, class T2, class T3, class T4, class T5, class T6, class T7, class T8, class T9, class T10, class T11, class T12,
class T13, class T14, class T15, class T16, class T17, class T18, class T19, class T20, class T21, class T22, class T23, class T24,
class T25, class T26, class T27, class T28, class T29, class T30, class T31, class T32, class T33, class T34, class T35, class T36,
class T37, class T38, class T39, class T40, class T41, class T42, class T43, class T44, class T45, class T46, class T47, class T48,
class T49, class T50, class T51, class T52, class T53, class T54, class T55, class T56, class T57, class T58, class T59, class T60,
class T61, class T62, class T63, class T64, class T65, class T66, class T67, class T68, class T69, class T70, class T71, class T72,
class T73, class T74, class T75, class T76, class T77, class T78, class T79, class T80, class T81, class T82, class T83, class T84,
class T85, class T86, class T87, class T88, class T89, class T90, class T91, class T92, class T93, class T94, class T95, class T96,
class T97, class T98, class T99, class T100, class T101, class T102, class T103, class T104, class T105, class T106, class T107,
class T108, class T109, class T110, class T111, class T112, class T113, class T114, class T115, class T116, class T117, class T118,
class T119, class T120, class T121, class T122, class T123, class T124, class T125, class T126, class T127, class T128, class T129,
class T130, class T131, class T132, class T133, class T134, class T135, class T136, class T137, class T138, class T139, class T140,
class T141, class T142, class T143, class T144, class T145, class T146, class T147, class T148, class T149, class T150, class T151,
class T152, class T153, class T154, class T155, class T156, class T157, class T158, class T159, class T160, class T161, class T162,
class T163, class T164, class T165, class T166, class T167, class T168, class T169, class T170, class T171, class T172, class T173,
class T174, class T175, class T176, class T177, class T178, class T179, class T180, class T181, class T182, class T183, class T184,
class T185, class T186, class T187, class T188, class T189, class T190, class T191, class T192, class T193, class T194, class T195,
class T196, class T197, class T198, class T199, class T200, class T201, class T202, class T203, class T204, class T205, class T206,
class T207, class T208, class T209, class T210, class T211, class T212, class T213, class T214, class T215, class T216, class T217,
class T218, class T219, class T220, class T221, class T222, class T223, class T224, class T225, class T226, class T227, class T228,
class T229, class T230, class T231, class T232, class T233, class T234, class T235, class T236, class T237, class T238, class T239,
class T240, class T241, class T242, class T243, class T244, class T245, class T246, class T247, class T248, class T249, class T250,
class T251, class T252, class T253, class T254, class T255, typename... Ts, typename Comp>
struct sort_impl<list<>, list<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20, T21,
T22, T23, T24, T25, T26, T27, T28, T29, T30, T31, T32, T33, T34, T35, T36, T37, T38, T39, T40, T41, T42, T43, T44, T45, T46, T47,
T48, T49, T50, T51, T52, T53, T54, T55, T56, T57, T58, T59, T60, T61, T62, T63, T64, T65, T66, T67, T68, T69, T70, T71, T72, T73,
T74, T75, T76, T77, T78, T79, T80, T81, T82, T83, T84, T85, T86, T87, T88, T89, T90, T91, T92, T93, T94, T95, T96, T97, T98, T99,
T100, T101, T102, T103, T104, T105, T106, T107, T108, T109, T110, T111, T112, T113, T114, T115, T116, T117, T118, T119, T120, T121,
T122, T123, T124, T125, T126, T127, T128, T129, T130, T131, T132, T133, T134, T135, T136, T137, T138, T139, T140, T141, T142, T143,
T144, T145, T146, T147, T148, T149, T150, T151, T152, T153, T154, T155, T156, T157, T158, T159, T160, T161, T162, T163, T164, T165,
T166, T167, T168, T169, T170, T171, T172, T173, T174, T175, T176, T177, T178, T179, T180, T181, T182, T183, T184, T185, T186, T187,
T188, T189, T190, T191, T192, T193, T194, T195, T196, T197, T198, T199, T200, T201, T202, T203, T204, T205, T206, T207, T208, T209,
T210, T211, T212, T213, T214, T215, T216, T217, T218, T219, T220, T221, T222, T223, T224, T225, T226, T227, T228, T229, T230, T231,
T232, T233, T234, T235, T236, T237, T238, T239, T240, T241, T242, T243, T244, T245, T246, T247, T248, T249, T250, T251, T252, T253,
T254, T255, Ts...>, Comp>
{
using type = merge<
typename sort_impl<list<>, list<T0, T1, T2, T3, T4, T5, T6, T7, T8, T9, T10, T11, T12, T13, T14, T15, T16, T17, T18, T19, T20,
T21, T22, T23, T24, T25, T26, T27, T28, T29, T30, T31, T32, T33, T34, T35, T36, T37, T38, T39, T40, T41, T42, T43, T44, T45,
T46, T47, T48, T49, T50, T51, T52, T53, T54, T55, T56, T57, T58, T59, T60, T61, T62, T63, T64, T65, T66, T67, T68, T69, T70,
T71, T72, T73, T74, T75, T76, T77, T78, T79, T80, T81, T82, T83, T84, T85, T86, T87, T88, T89, T90, T91, T92, T93, T94, T95,
T96, T97, T98, T99, T100, T101, T102, T103, T104, T105, T106, T107, T108, T109, T110, T111, T112, T113, T114, T115, T116,
T117, T118, T119, T120, T121, T122, T123, T124, T125, T126, T127, T128, T129, T130, T131, T132, T133, T134, T135, T136, T137,
T138, T139, T140, T141, T142, T143, T144, T145, T146, T147, T148, T149, T150, T151, T152, T153, T154, T155, T156, T157, T158,
T159, T160, T161, T162, T163, T164, T165, T166, T167, T168, T169, T170, T171, T172, T173, T174, T175, T176, T177, T178, T179,
T180, T181, T182, T183, T184, T185, T186, T187, T188, T189, T190, T191, T192, T193, T194, T195, T196, T197, T198, T199, T200,
T201, T202, T203, T204, T205, T206, T207, T208, T209, T210, T211, T212, T213, T214, T215, T216, T217, T218, T219, T220, T221,
T222, T223, T224, T225, T226, T227, T228, T229, T230, T231, T232, T233, T234, T235, T236, T237, T238, T239, T240, T241, T242,
T243, T244, T245, T246, T247, T248, T249, T250, T251, T252, T253, T254>, Comp>::type,
typename sort_impl<list<>, list<T255, Ts...>, Comp>::type, Comp
>;
};
}
template <class Seq, class Comp = less<_1,_2>>
using sort = append<clear<Seq>, typename detail::sort_impl<list<>, wrap<Seq, list>, Comp>::type>;
}
namespace brigand
{
template <typename A>
struct complement : std::integral_constant< typename A::value_type
, typename A::value_type(~A::value)
> {};
}
namespace brigand
{
template <typename A, typename B>
struct divides : std::integral_constant < typename A::value_type, A::value / B::value > {};
}
namespace brigand
{
template<class T>
struct identity
{
using type = T;
};
}
namespace brigand
{
template <typename A, typename B>
struct max : std::integral_constant < typename A::value_type
, (A::value < B::value) ? B::value : A::value
>
{};
}
namespace brigand
{
template <typename A, typename B>
struct min : std::integral_constant < typename A::value_type
, (A::value < B::value) ? A::value : B::value
>
{};
}
namespace brigand
{
template <typename A, typename B>
struct minus : std::integral_constant < typename A::value_type, A::value - B::value > {};
}
namespace brigand
{
template <typename A, typename B>
struct modulo : std::integral_constant < typename A::value_type, A::value % B::value > {};
}
namespace brigand
{
template <typename A>
struct negate : std::integral_constant < typename A::value_type, -A::value > {};
}
namespace brigand
{
template <typename A>
struct next : std::integral_constant < typename A::value_type, A::value + 1 > {};
}
namespace brigand
{
template <typename A, typename B>
struct plus : std::integral_constant < typename A::value_type, A::value + B::value > {};
}
namespace brigand
{
template <typename A>
struct prev : std::integral_constant < typename A::value_type, A::value - 1 > {};
}
namespace brigand
{
template <typename A, typename B>
struct times : std::integral_constant < typename A::value_type, A::value * B::value > {};
}
namespace brigand
{
template <typename A, typename B>
struct bitand_ : std::integral_constant<typename A::value_type, A::value & B::value> {};
}
namespace brigand
{
template <typename A, typename B>
struct bitor_ : std::integral_constant<typename A::value_type, A::value | B::value> {};
}
namespace brigand
{
template <typename A, typename B>
struct bitxor_ : std::integral_constant<typename A::value_type, A::value ^ B::value> {};
}
namespace brigand
{
template <typename A, typename B>
struct shift_left : std::integral_constant<typename A::value_type, (A::value << B::value)> {};
}
namespace brigand
{
template <typename A, typename B>
struct shift_right : std::integral_constant<typename A::value_type, (A::value >> B::value)> {};
}
namespace brigand
{
template <typename A, typename B>
struct equal_to : bool_ < (A::value == B::value) > {};
}
namespace brigand
{
template <typename A, typename B>
struct greater : bool_<(A::value > B::value) > {};
}
namespace brigand
{
template <typename A, typename B>
struct greater_equal : bool_ < (A::value >= B::value) > {};
}
namespace brigand
{
template <typename A, typename B>
struct less_equal : bool_ < (A::value <= B::value) > {};
}
namespace brigand
{
template <typename A, typename B>
struct not_equal_to : bool_ < (A::value != B::value) > {};
}
namespace brigand
{
template <typename Condition, typename A, typename B>
struct eval_if
{
using type = typename std::conditional<Condition::value, A, B>::type::type;
};
template <bool Condition, typename A, typename B>
struct eval_if_c
{
using type = typename std::conditional<Condition, A, B>::type::type;
};
}
namespace brigand
{
template <typename Condition, typename A, typename B>
struct if_ : std::conditional<Condition::value, A, B> {};
template <bool Condition, typename A, typename B>
struct if_c : std::conditional<Condition, A, B> {};
}
namespace brigand
{
template <typename A, typename B>
struct and_ : std::integral_constant <typename A::value_type, A::value && B::value > {};
}
namespace brigand
{
template <typename T>
struct not_ : std::integral_constant<typename T::value_type, !T::value> {};
}
namespace brigand
{
template <typename A, typename B>
struct or_ : std::integral_constant < typename A::value_type, A::value || B::value > {};
}
namespace brigand
{
template <typename A, typename B>
struct xor_ : std::integral_constant<typename A::value_type, A::value != B::value> {};
}
namespace brigand
{
template<class T>
struct always
{
using type = T;
};
}
namespace brigand
{
namespace detail
{
template<template<class> class F, unsigned N, class T>
struct repeat_impl
: repeat_impl<F, N-7, F<F<F<F<F<F<F<T>>>>>>>>
{};
template<template<class> class F, class T>
struct repeat_impl<F, 7, T>
{
using type = F<F<F<F<F<F<F<T>>>>>>>;
};
template<template<class> class F, class T>
struct repeat_impl<F, 6, T>
{
using type = F<F<F<F<F<F<T>>>>>>;
};
template<template<class> class F, class T>
struct repeat_impl<F, 5, T>
{
using type = F<F<F<F<F<T>>>>>;
};
template<template<class> class F, class T>
struct repeat_impl<F, 4, T>
{
using type = F<F<F<F<T>>>>;
};
template<template<class> class F, class T>
struct repeat_impl<F, 3, T>
{
using type = F<F<F<T>>>;
};
template<template<class> class F, class T>
struct repeat_impl<F, 2, T>
{
using type = F<F<T>>;
};
template<template<class> class F, class T>
struct repeat_impl<F, 1, T>
{
using type = F<T>;
};
template<template<class> class F, class T>
struct repeat_impl<F, 0, T>
{
using type = T;
};
}
namespace lazy
{
template<template<class> class F, class N, class T>
using repeat = typename detail::repeat_impl<F, N::value, T>;
}
template<template<class> class F, class N, class T>
using repeat = typename ::brigand::lazy::repeat<F, N, T>::type;
}
namespace brigand
{
template<typename T>
struct sizeof_ : std::integral_constant <std::size_t, sizeof(T)> {};
}
namespace brigand
{
namespace detail
{
template<class C, class K>
struct has_key_impl
{
using type = decltype(C::has_key(type_<K>{}));
};
}
template<class L, class K>
using has_key = typename detail::has_key_impl<L, K>::type;
}
namespace brigand
{
namespace detail
{
template<class Start, unsigned N, class Next, class... E>
struct mksq8
: mksq8<brigand::apply<Next, Start>, N-1, Next, E..., Start>
{};
template<class Start, class Next, class... E>
struct mksq8<Start, 0, Next, E...>
{
using type = list<E...>;
};
template<class Start, class Next, class... E>
struct mksq8<Start, 1, Next, E...>
{
using type = list<E..., Start>;
};
template<class Start, class Next>
struct mksq8<Start, 8, Next>
{
using t1 = brigand::apply<Next, Start>;
using t2 = brigand::apply<Next, t1>;
using t3 = brigand::apply<Next, t2>;
using t4 = brigand::apply<Next, t3>;
using t5 = brigand::apply<Next, t4>;
using t6 = brigand::apply<Next, t5>;
using t7 = brigand::apply<Next, t6>;
using type = list<Start, t1, t2, t3, t4, t5, t6, t7>;
};
template<template<class...> class List, class Start, unsigned N, class Next, bool, class... L>
struct make_sequence_impl
: make_sequence_impl<
List,
brigand::apply<Next, typename mksq8<Start, 8, Next>::t7>,
N-8,
Next,
(N-8<=8),
L...,
typename mksq8<Start, 8, Next>::type
>
{};
template<template<class...> class List, class Start, unsigned N, class Next, class... L>
struct make_sequence_impl<List, Start, N, Next, true, L...>
{
using type = append<List<>, L..., typename mksq8<Start, N, Next>::type>;
};
}
template<class Start, unsigned N, class Next = next<_1>, template<class...> class List = list>
using make_sequence = typename detail::make_sequence_impl<List, Start, N, Next, (N<=8)>::type;
}
namespace brigand
{
template<class L, std::size_t Index>
using erase_c = append<
front<split_at<L, size_t<Index>>>,
pop_front<back<split_at<L, size_t<Index>>>>
>;
namespace detail
{
template <typename T>
struct has_erase_method
{
struct dummy {};
template <typename C, typename P>
static auto test(P * p) -> decltype(C::erase(type_<P>{}), std::true_type());
template <typename, typename>
static std::false_type test(...);
static constexpr bool value = std::is_same<std::true_type, decltype(test<T, dummy>(nullptr))>::value;
};
template<class L, class I, bool>
struct erase_dispatch
{
using type = erase_c<L, I::value>;
};
template<class C, class K>
struct erase_dispatch<C, K, true>
{
using type = decltype(C::erase(type_<K>{}));
};
}
template<class L, class K>
using erase = typename detail::erase_dispatch<L, K, detail::has_erase_method<L>::value>::type;
}
namespace brigand
{
namespace detail
{
template <class C, class T>
struct insert_impl
{
using type = decltype(C::insert(type_<T>{}));
};
}
template<class L, class T>
using insert = typename detail::insert_impl<L, T>::type;
}
namespace brigand
{
namespace detail
{
template <class L, class K>
struct contains_impl
{
using type = decltype(L::contains(type_<K>{}));
};
}
template <class L, class K>
using contains = typename detail::contains_impl<L, K>::type;
}
namespace brigand
{
namespace detail
{
template<class... Ts>
struct make_set;
template<class U, class K>
struct set_erase_pred_impl
{
using type = list<U>;
};
template<class K>
struct set_erase_pred_impl<K,K>
{
using type = list<>;
};
template <class... T>
struct set_impl
{
template <typename K, typename = decltype(static_cast<type_<K>*>(static_cast<make_set<T...>*>(nullptr)))>
static std::true_type contains(type_<K>);
template <typename K>
static std::false_type contains(K);
template <typename K, typename = decltype(static_cast<type_<K>*>(static_cast<make_set<T...>*>(nullptr)))>
static std::true_type has_key(type_<K>);
template <typename K>
static std::false_type has_key(K);
template <class K>
static append<set_impl<>, typename set_erase_pred_impl<T, K>::type...> erase(type_<K>);
template<class K, class = decltype(static_cast<type_<K>*>(static_cast<make_set<T...>*>(nullptr)))>
static set_impl insert(type_<K>);
template<class K>
static set_impl<T..., typename K::type> insert(K);
};
template<class... Ts>
struct make_set : type_<Ts>...
{
using type = set_impl<Ts...>;
};
}
template<class... Ts>
using set = typename detail::make_set<Ts...>::type;
}
namespace brigand
{
namespace detail
{
template <typename Pair>
struct get_second {
using type = typename Pair::second_type;
};
}
template <typename Map, template <class...> class Sequence = brigand::list>
using values_as_sequence = transform<as_sequence<Map, Sequence>, detail::get_second<_1>>;
}
namespace brigand
{
namespace detail
{
template <typename Pair>
struct get_first {
using type = typename Pair::first_type;
};
}
template <typename Map, template <class...> class Sequence = brigand::set>
using keys_as_sequence = transform<as_sequence<Map, Sequence>, detail::get_first<_1>>;
}
namespace brigand
{
struct empty_base {};
}
namespace brigand
{
template<typename T, typename R = void > struct has_type
{
using type = R;
};
}
namespace brigand
{
template<typename... Ts> struct inherit;
template<typename T> struct inherit<T>
{
struct type : public T {};
};
template<> struct inherit<>
{
using type = empty_base;
};
template<> struct inherit<empty_base>
{
using type = empty_base;
};
template<typename T1, typename T2> struct inherit<T1,T2>
{
struct type : public T1, T2 {};
};
template<typename T1> struct inherit<T1,empty_base>
{
using type = T1;
};
template<typename T2> struct inherit<empty_base,T2>
{
using type = T2;
};
template<> struct inherit<empty_base,empty_base>
{
using type = empty_base;
};
template<typename T1, typename T2, typename T3, typename... Ts>
struct inherit<T1, T2, T3, Ts...>
: inherit<T1, typename inherit<T2,typename inherit<T3, Ts...>::type>::type>
{};
}
namespace brigand
{
namespace lazy
{
template< typename Types
, typename Node
, typename Root = brigand::empty_base
>
struct inherit_linearly;
template< typename Types
, template<typename...> class Node, typename...Ts
, typename Root
>
struct inherit_linearly<Types,Node<Ts...>,Root>
{
using type = brigand::fold<Types,Root,bind<Node,Ts...>>;
};
}
template< typename Types
, typename Node
, typename Root = brigand::empty_base
>
using inherit_linearly = typename lazy::inherit_linearly<Types,Node,Root>::type;
}
namespace brigand
{
template<typename RealType, typename Type, Type Value>
struct real_ : std::integral_constant<Type,Value>
{
using value_type = RealType;
using parent = std::integral_constant<Type,Value>;
inline operator value_type() const
{
value_type that;
static_assert(sizeof(that) == sizeof(parent::value));
memcpySpan(asMutableByteSpan(that), asByteSpan(parent::value));
return that;
}
};
template<std::uint32_t Value>
struct single_ : real_<float, std::uint32_t, Value> {};
template<std::uint64_t Value>
struct double_ : real_<double, std::uint64_t,Value> {};
}
|