/usr/include/ptlib/pstring.h is in libpt-1.10.10-dev 1.10.10-3.1ubuntu1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 | /*
* pstring.h
*
* Character string class.
*
* Portable Windows Library
*
* Copyright (c) 1993-1998 Equivalence Pty. Ltd.
*
* The contents of this file are subject to the Mozilla Public License
* Version 1.0 (the "License"); you may not use this file except in
* compliance with the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS"
* basis, WITHOUT WARRANTY OF ANY KIND, either express or implied. See
* the License for the specific language governing rights and limitations
* under the License.
*
* The Original Code is Portable Windows Library.
*
* The Initial Developer of the Original Code is Equivalence Pty. Ltd.
*
* Portions are Copyright (C) 1993 Free Software Foundation, Inc.
* All Rights Reserved.
*
* Contributor(s): ______________________________________.
*
* $Log: pstring.h,v $
* Revision 1.85 2005/12/15 21:14:34 dsandras
* Fixed from Alexander Larsson <alexl _AT__ redhat.com> for gcc 4.1 compilation. Thanks!
*
* Revision 1.84 2005/11/30 12:47:38 csoutheren
* Removed tabs, reformatted some code, and changed tags for Doxygen
*
* Revision 1.83 2005/11/25 03:43:47 csoutheren
* Fixed function argument comments to be compatible with Doxygen
*
* Revision 1.82 2005/09/18 11:05:36 dominance
* include/ptlib/channel.h, include/ptlib/pstring.h, src/ptlib/common/contain.cxx,
* src/ptlib/common/pchannel.cxx:
* correct the STL defined checking to use proper syntax.
*
* include/ptlib/object.h:
* re-add typedef to compile on mingw
*
* make/ptlib-config.in:
* import a long-standing fix from the Debian packs which allows usage of
* ptlib-config without manually adding -lpt for each of the subsequent
* projects
*
* Revision 1.81 2004/12/22 04:04:36 dereksmithies
* Modify description of parameters for PString::Replace()
*
* Revision 1.80 2004/11/23 11:33:08 csoutheren
* Fixed problem with RemoveAt returning invalid pointer in some cases,
* and added extra documentation on this case.
* Thanks to Diego Tartara for pointing out this potential problem
*
* Revision 1.79 2004/10/21 13:04:20 rjongbloed
* Fixed possibility of const operator[] on PStringArray returning a NULL reference. This
* function should return a non-lvalue PString anyway as it is const!
*
* Revision 1.78 2004/08/16 08:49:59 csoutheren
* Removed error when compiling with gcc
*
* Revision 1.77 2004/08/16 06:40:59 csoutheren
* Added adapters template to make device plugins available via the abstract factory interface
*
* Revision 1.76 2004/06/01 05:54:18 csoutheren
* Added <vector> and <string>
*
* Revision 1.75 2004/06/01 05:21:38 csoutheren
* Added conversions between std::string and PString, and vector<PString> and PStringArray
*
* Revision 1.74 2004/05/04 11:10:36 rjongbloed
* Fixed usage of MakeEmpty() with PStringStream.
*
* Revision 1.73 2004/04/18 04:33:36 rjongbloed
* Changed all operators that return BOOL to return standard type bool. This is primarily
* for improved compatibility with std STL usage removing many warnings.
*
* Revision 1.72 2004/04/11 13:26:25 csoutheren
* Removed namespace problems and removed warnings for Windows <string>
*
* Revision 1.71 2004/04/09 06:38:10 rjongbloed
* Fixed compatibility with STL based streams, eg as used by VC++2003
*
* Revision 1.70 2004/04/09 03:42:34 csoutheren
* Removed all usages of "virtual inline" and "inline virtual"
*
* Revision 1.69 2004/04/03 06:54:22 rjongbloed
* Many and various changes to support new Visual C++ 2003
*
* Revision 1.68 2004/02/23 00:44:38 csoutheren
* A completely different, other regex include hack to avoid requiring
* the sources when using a header-file only environment
*
* Revision 1.67 2004/02/23 00:26:05 csoutheren
* Finally, a generic and elegant fix for the regex include hacks. Thanks to Roger Hardiman
*
* Revision 1.66 2004/02/11 05:09:14 csoutheren
* Fixed problems with regex libraries on Solaris, and with host OS numbering
* being a quoted string rather than a number. Thanks to Chad Attermann
* Fixed problems SSL detection problems thanks to Michal Zygmuntowicz
*
* Revision 1.65 2004/02/08 11:13:11 rjongbloed
* Fixed crash in heavily loaded multi-threaded systems using simultaneous sorted
* lists, Thanks Federico Pinna, Fabrizio Ammollo and the gang at Reitek S.p.A.
*
* Revision 1.64 2004/01/18 13:43:48 rjongbloed
* Fixed broken PString::MakeEmpty() function and moved implementations to .inl file.
*
* Revision 1.63 2004/01/17 18:15:24 csoutheren
* Fixed multi-threading problem with PString::Empty
* Created PString::MakeEmpty for efficient emptying of existing strings
*
* Revision 1.62 2004/01/16 13:24:37 csoutheren
* Changed PString::Empty to be thread-safe
* Fixed PContainer::SetMinSize and PAbstractArray::SetSize, thanks to 123@call2ua.com
* Fixed PString::FindLast, thanks to Andreas Sikkema
*
* Revision 1.61 2003/12/13 23:08:46 csoutheren
* Changed PRegularExpression to allow a copy constructor and operator =
*
* Revision 1.60 2003/12/10 03:28:50 csoutheren
* Removed compile time warning under Linux
*
* Revision 1.59 2003/12/07 05:50:49 csoutheren
* Blocked operator = for PRegularExpression
*
* Revision 1.58 2003/12/04 13:10:38 csoutheren
* Made PRegularExpression copy constructor private to avoid accidental usage (and subsequent crash)
*
* Revision 1.57 2003/05/14 00:46:47 rjongbloed
* Added constructor to string lists/arrays etc that takes a single PString.
*
* Revision 1.56 2003/03/31 01:23:56 robertj
* Added ReadFrom functions for standard container classes such as
* PIntArray and PStringList etc
*
* Revision 1.55 2003/03/05 08:48:32 robertj
* Added PStringArray::ToCharAray() function at suggestion of Ravelli Rossano
*
* Revision 1.54 2002/11/12 09:17:44 robertj
* Added PString::NumCompare() as functional equivalent of strncmp().
* Added PSortedStringList::GetNextStringsIndex() to do searches of binary
* tree on partal strings.
*
* Revision 1.53 2002/10/31 05:53:44 robertj
* Now comprehensively stated that a PString is ALWAYS an 8 bit string as
* there are far too many inheerent assumptions every to make it 16 bit.
* Added UTF-8/UCS-2 conversion functions to PString.
*
* Revision 1.52 2002/09/16 01:08:59 robertj
* Added #define so can select if #pragma interface/implementation is used on
* platform basis (eg MacOS) rather than compiler, thanks Robert Monaghan.
*
* Revision 1.51 2002/08/14 00:43:39 robertj
* Added ability to have fixed maximum length PStringStream's so does not do
* unwanted malloc()'s while outputing data.
*
* Revision 1.50 2002/04/09 02:30:18 robertj
* Removed GCC3 variable as __GNUC__ can be used instead, thanks jason Spence
*
* Revision 1.49 2002/02/15 04:29:31 robertj
* Added PString::Empty() to return the primordial empty string. Saves on a
* couple of memory allocations for every empty string ever used.
*
* Revision 1.48 2002/01/26 23:55:55 craigs
* Changed for GCC 3.0 compatibility, thanks to manty@manty.net
*
* Revision 1.47 2002/01/22 01:03:57 craigs
* Added operator += and operator + functions to PStringArray and PStringList
* Added AppendString operator to PStringArray
*
* Revision 1.46 2001/10/17 05:09:22 robertj
* Added contructors and assigmnent operators so integer types can be
* automatically converted to strings.
*
* Revision 1.45 2001/08/11 07:57:30 rogerh
* Add Mac OS Carbon changes from John Woods <jfw@jfwhome.funhouse.com>
*
* Revision 1.44 2001/04/18 04:10:15 robertj
* Removed hash function for caseless strings as confuses mixed dictionaries.
*
* Revision 1.43 2001/04/18 01:20:58 robertj
* Fixed problem with hash function for short strings, thanks Patrick Koorevaar.
* Also fixed hash function for caseless strings.
*
* Revision 1.42 2001/02/21 03:38:37 robertj
* Added ability to copy between various string lists/arrays etc during construction.
*
* Revision 1.41 2001/02/13 04:39:08 robertj
* Fixed problem with operator= in container classes. Some containers will
* break unless the copy is virtual (eg PStringStream's buffer pointers) so
* needed to add a new AssignContents() function to all containers.
*
* Revision 1.40 1999/08/22 12:13:43 robertj
* Fixed warning when using inlines on older GNU compiler
*
* Revision 1.39 1999/05/28 14:01:22 robertj
* Added initialisers to string containers (list, sorted list and set).
*
* Revision 1.38 1999/03/09 09:34:05 robertj
* Fixed typo's.
*
* Revision 1.37 1999/03/09 02:59:50 robertj
* Changed comments to doc++ compatible documentation.
*
* Revision 1.36 1999/02/16 08:11:09 robertj
* MSVC 6.0 compatibility changes.
*
* Revision 1.35 1998/09/23 06:21:12 robertj
* Added open source copyright license.
*
* Revision 1.34 1998/01/26 00:33:46 robertj
* Added FindRegEx function to PString that returns position and length.
* Added Execute() functions to PRegularExpression that take PINDEX references instead of PIntArrays.
* Added static function to PRegularExpression to escape all special operator characters in a string.
*
* Revision 1.33 1998/01/05 10:39:35 robertj
* Fixed "typesafe" templates/macros for dictionaries, especially on GNU.
*
* Revision 1.32 1997/12/11 13:32:47 robertj
* Added AsUnsigned() function to convert string to DWORD.
*
* Revision 1.31 1997/12/11 10:29:49 robertj
* Added type correct Contains() function to dictionaries.
*
* Revision 1.30 1997/07/08 13:13:47 robertj
* DLL support.
*
* Revision 1.29 1997/06/10 11:36:32 craigs
* Added inline statements to allow compilation uder Unix
*
* Revision 1.28 1997/06/08 04:48:58 robertj
* Added regular expressions.
* Fixed non-template class descendent order.
*
* Revision 1.27 1997/05/16 12:10:12 robertj
* Fixed G++ compatibility bug.
*
* Revision 1.26 1996/10/08 13:13:38 robertj
* Added operator += and &= for char so no implicit PString construction.
*
* Revision 1.25 1996/09/14 12:52:39 robertj
* Added operator! for !IsEmpty().
*
* Revision 1.24 1996/08/17 10:00:25 robertj
* Changes for Windows DLL support.
*
* Revision 1.23 1996/05/26 03:27:02 robertj
* Compatibility to GNU 2.7.x
*
* Revision 1.22 1996/03/31 08:51:22 robertj
* Added RemoveAt() function to remove entries from dictionaries.
*
* Revision 1.21 1996/03/10 13:15:50 robertj
* Added operator() to template version.
*
* Revision 1.20 1996/02/19 13:17:33 robertj
* Removed PCaselessString hash function to fix dictionary match failure.
* Added operator() to do string dictionary lookup with default value.
*
* Revision 1.19 1996/02/08 12:19:16 robertj
* Added new operators to PString for case insensitive compare and spaced concatenate.
*
* Revision 1.18 1996/01/24 14:43:15 robertj
* Added initialisers to string dictionaries.
*
* Revision 1.17 1996/01/23 13:15:17 robertj
* Added Replace() function to strings.
* Mac Metrowerks compiler support.
* String searching algorithm rewrite.
*
* Revision 1.16 1996/01/02 12:04:31 robertj
* Mac OS compatibility changes.
* Removed requirement that PArray elements have parameterless constructor..
*
* Revision 1.15 1995/12/23 03:46:23 robertj
* Added operators for include and exclude from string set.
*
* Revision 1.14 1995/10/14 15:02:56 robertj
* Changed arrays to not break references, but strings still need to.
*
* Revision 1.13 1995/06/17 11:13:08 robertj
* Documentation update.
*
* Revision 1.12 1995/06/17 00:43:40 robertj
* Added flag for PStringArray constructor to create caseless strings.
*
* Revision 1.11 1995/06/04 12:34:57 robertj
* Better C++ compatibility (with BC++)
*
* Revision 1.10 1995/04/02 09:27:23 robertj
* Added "balloon" help.
*
* Revision 1.9 1995/03/14 12:42:16 robertj
* Updated documentation to use HTML codes.
*
* Revision 1.8 1995/03/12 04:44:39 robertj
* Fixed use of PCaselessString as dictionary key.
*
* Revision 1.7 1995/02/05 00:48:09 robertj
* Fixed template version.
*
* Revision 1.6 1995/01/15 04:50:20 robertj
* Added inlines on friend functions, required by GNU compiler.
*
* Revision 1.5 1995/01/10 11:43:41 robertj
* Removed PString parameter in stdarg function for GNU C++ compatibility.
*
* Revision 1.4 1995/01/09 12:33:44 robertj
* Removed unnecesary return value from I/O functions.
* Changed function names due to Mac port.
*
* Revision 1.3 1994/12/21 11:53:21 robertj
* Documentation and variable normalisation.
*
* Revision 1.2 1994/12/12 13:13:13 robertj
* Fixed bugs in PString mods just made.
*
* Revision 1.1 1994/12/12 09:59:37 robertj
* Initial revision
*
*/
#ifdef P_USE_PRAGMA
#pragma interface
#endif
#include <string>
#include <vector>
///////////////////////////////////////////////////////////////////////////////
// PString class
class PStringArray;
class PRegularExpression;
/**The character string class. It supports a wealth of additional functions
for string processing and conversion. Operators are provided so that
strings can virtually be treated as a basic type.
An important feature of the string class, which is not present in other
container classes, is that when the string contents is changed, that is
resized or elements set, the string is "dereferenced", and a duplicate
made of its contents. That is this instance of the array is disconnected
from all other references to the string data, if any, and a new string array
contents created. For example consider the following:
\begin{verbatim}
PString s1 = "String"; // New array allocated and set to "String"
PString s2 = s1; // s2 has pointer to same array as s1
// and reference count is 2 for both
s1[0] = 's'; // Breaks references into different strings
\end{verbatim}
at the end s1 is "string" and s2 is "String" both with reference count of 1.
The functions that will "break" a reference are #SetSize()#,
#SetMinSize()#, #GetPointer()#, #SetAt()# and
#operator[]#.
Note that the array is a '\0' terminated string as in C strings. Thus the
memory allocated, and the length of the string may be different values.
Also note that the PString is inherently an 8 bit string. The character set
is not defined for most operations and it may be any 8 bit character set.
However when conversions are being made to or from 2 byte formats then the
PString is assumed to be the UTF-8 format. The 2 byte format is nominally
UCS-2 (aka BMP string) and while it is not exactly the same as UNICODE
they are compatible enough for them to be treated the same for most real
world usage.
*/
class PString : public PCharArray {
PCLASSINFO(PString, PCharArray);
// using namespace std;
public:
/**@name Construction */
//@{
/**Construct an empty string. This will have one character in it which is
the '\0' character.
*/
PINLINE PString();
/**Create a new reference to the specified string. The string memory is not
copied, only the pointer to the data.
*/
PINLINE PString(
const PString & str ///< String to create new reference to.
);
/**Create a new string from the specified std::string
*/
PINLINE PString(
const std::string & str
);
/**Create a string from the C string array. This is most commonly used with
a literal string, eg "hello". A new memory block is allocated of a size
sufficient to take the length of the string and its terminating
'\0' character.
If UCS-2 is used then each char from the char pointer is mapped to a
single UCS-2 character.
*/
PString(
const char * cstr ///< Standard '\0' terminated C string.
);
/**Create a string from the UCS-2 string array.
A new memory block is allocated of a size sufficient to take the length
of the string and its terminating '\0' character.
*/
PString(
const WORD * ustr ///< UCS-2 null terminated string.
);
/**Create a string from the array. A new memory block is allocated of
a size equal to #len# plus one which is sufficient to take
the string and a terminating '\0' character.
If UCS-2 is used then each char from the char pointer is mapped to a
single UCS-2 character.
Note that this function will allow a string with embedded '\0'
characters to be created, but most of the functions here will be unable
to access characters beyond the first '\0'. Furthermore, if the
#MakeMinimumSize()# function is called, all data beyond that first
#'\0'# character will be lost.
*/
PString(
const char * cstr, ///< Pointer to a string of characters.
PINDEX len ///< Length of the string in bytes.
);
/**Create a string from the UCS-2 array. A new memory block is allocated
of a size equal to #len# plus one which is sufficient to take
the string and a terminating '\0' character.
Note that this function will allow a string with embedded '\0'
characters to be created, but most of the functions here will be unable
to access characters beyond the first '\0'. Furthermore, if the
#MakeMinimumSize()# function is called, all data beyond that first
#'\0'# character will be lost.
*/
PString(
const WORD * ustr, ///< Pointer to a string of UCS-2 characters.
PINDEX len ///< Length of the string in bytes.
);
/**Create a string from the UCS-2 array. A new memory block is allocated
of a size equal to #len# plus one which is sufficient to take
the string and a terminating '\0' character.
Note that this function will allow a string with embedded '\0'
characters to be created, but most of the functions here will be unable
to access characters beyond the first '\0'. Furthermore, if the
#MakeMinimumSize()# function is called, all data beyond that first
#'\0'# character will be lost.
*/
PString(
const PWORDArray & ustr ///< UCS-2 null terminated string.
);
/**Create a string from the single character. This is most commonly used
as a type conversion constructor when a literal character, eg 'A' is
used in a string expression. A new memory block is allocated of two
characters to take the char and its terminating '\0' character.
If UCS-2 is used then the char is mapped to a single UCS-2
character.
*/
PString(
char ch ///< Single character to initialise string.
);
/**Create a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString(
short n ///< Integer to convert
);
/**Create a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString(
unsigned short n ///< Integer to convert
);
/**Create a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString(
int n ///< Integer to convert
);
/**Create a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString(
unsigned int n ///< Integer to convert
);
/**Create a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString(
long n ///< Integer to convert
);
/**Create a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString(
unsigned long n ///< Integer to convert
);
/**Create a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString(
PInt64 n ///< Integer to convert
);
/**Create a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString(
PUInt64 n ///< Integer to convert
);
enum ConversionType {
Pascal, // Data is a length byte followed by characters.
Basic, // Data is two length bytes followed by characters.
Literal, // Data is C language style string with \ escape codes.
Signed, // Convert a signed integer to a string.
Unsigned, // Convert an unsigned integer to a string.
Decimal, // Convert a real number to a string in decimal format.
Exponent, // Convert a real number to a string in exponent format.
Printf, // Formatted output, sprintf() style function.
NumConversionTypes
};
/* Type of conversion to make in the conversion constructors.
*/
/* Contruct a new string converting from the spcified data source into
a string array.
*/
PString(
ConversionType type, ///< Type of data source for conversion.
const char * str, ///< String to convert.
... ///< Extra parameters for #sprintf()# call.
);
PString(
ConversionType type, ///< Type of data source for conversion.
long value, ///< Integer value to convert.
unsigned base = 10 ///< Number base to use for the integer conversion.
);
PString(
ConversionType type, ///< Type of data source for conversion.
double value, ///< Floating point value to convert.
unsigned places ///< Number of decimals in real number output.
);
/**Assign the string to the current object. The current instance then
becomes another reference to the same string in the #str#
parameter.
@return
reference to the current PString object.
*/
PString & operator=(
const PString & str ///< New string to assign.
);
/**Assign the C string to the current object. The current instance then
becomes a unique reference to a copy of the #cstr# parameter.
The #cstr# parameter is typically a literal string, eg:
\begin{verbatim}
myStr = "fred";
\end{verbatim}
@return
reference to the current PString object.
*/
PString & operator=(
const char * cstr ///< C string to assign.
);
/**Assign the character to the current object. The current instance then
becomes a unique reference to a copy of the character parameter. eg:
\begin{verbatim}
myStr = 'A';
\end{verbatim}
@return
reference to the current PString object.
*/
PString & operator=(
char ch ///< Character to assign.
);
/**Assign a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString & operator=(
short n ///< Integer to convert
);
/**Assign a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString & operator=(
unsigned short n ///< Integer to convert
);
/**Assign a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString & operator=(
int n ///< Integer to convert
);
/**Assign a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString & operator=(
unsigned int n ///< Integer to convert
);
/**Assign a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString & operator=(
long n ///< Integer to convert
);
/**Assign a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString & operator=(
unsigned long n ///< Integer to convert
);
/**Assign a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString & operator=(
PInt64 n ///< Integer to convert
);
/**Assign a string from the integer type.
This will create a simple base 10, shortest length conversion of the
integer (with sign character if appropriate) into the string.
*/
PString & operator=(
PUInt64 n ///< Integer to convert
);
/**Make the current string empty
*/
virtual PString & MakeEmpty();
/**Return an empty string.
*/
static PString Empty();
//@}
/**@name Overrides from class PObject */
//@{
/**Make a complete duplicate of the string. Note that the data in the
array of characters is duplicated as well and the new object is a
unique reference to that data.
*/
virtual PObject * Clone() const;
/**Get the relative rank of the two strings. The system standard function,
eg strcmp(), is used.
@return
comparison of the two objects, #EqualTo# for same,
#LessThan# for #obj# logically less than the
object and #GreaterThan# for #obj# logically
greater than the object.
*/
virtual Comparison Compare(
const PObject & obj ///< Other PString to compare against.
) const;
/**Output the string to the specified stream.
*/
virtual void PrintOn(
ostream & strm ///< I/O stream to output to.
) const;
/**Input the string from the specified stream. This will read all
characters until a end of line is reached. The end of line itself is
{\bf not} placed in the string, however it {\bf is} removed from
the stream.
*/
virtual void ReadFrom(
istream & strm ///< I/O stream to input from.
);
/**Calculate a hash value for use in sets and dictionaries.
The hash function for strings will produce a value based on the sum of
the first three characters of the string. This is a fairly basic
function and make no assumptions about the string contents. A user may
descend from PString and override the hash function if they can take
advantage of the types of strings being used, eg if all strings start
with the letter 'A' followed by 'B or 'C' then the current hash function
will not perform very well.
@return
hash value for string.
*/
virtual PINDEX HashFunction() const;
//@}
/**@name Overrides from class PContainer */
//@{
/**Set the size of the string. A new string may be allocated to accomodate
the new number of characters. If the string increases in size then the
new characters are initialised to zero. If the string is made smaller
then the data beyond the new size is lost.
Note that this function will break the current instance from multiple
references to an array. A new array is allocated and the data from the
old array copied to it.
@return
TRUE if the memory for the array was allocated successfully.
*/
virtual BOOL SetSize(
PINDEX newSize ///< New size of the array in elements.
);
/**Determine if the string is empty. This is semantically slightly
different from the usual #PContainer::IsEmpty()# function. It does
not test for #PContainer::GetSize()# equal to zero, it tests for
#GetLength()# equal to zero.
@return
TRUE if no non-null characters in string.
*/
virtual BOOL IsEmpty() const;
/**Make this instance to be the one and only reference to the container
contents. This implicitly does a clone of the contents of the container
to make a unique reference. If the instance was already unique then
the function does nothing.
@return
TRUE if the instance was already unique.
*/
virtual BOOL MakeUnique();
//@}
/**@name Size/Length functions */
//@{
/**Set the actual memory block array size to the minimum required to hold
the current string contents.
Note that this function will break the current instance from multiple
references to the string. A new string buffer is allocated and the data
from the old string buffer copied to it.
@return
TRUE if new memory block successfully allocated.
*/
BOOL MakeMinimumSize();
/**Determine the length of the null terminated string. This is different
from #PContainer::GetSize()# which returns the amount of memory
allocated to the string. This is often, though no necessarily, one
larger than the length of the string.
@return
length of the null terminated string.
*/
PINLINE PINDEX GetLength() const;
/**Determine if the string is NOT empty. This is semantically identical
to executing !IsEmpty() on the string.
@return
TRUE if non-null characters in string.
*/
bool operator!() const;
//@}
/**@name Concatenation operators **/
//@{
/**Concatenate two strings to produce a third. The original strings are
not modified, an entirely new unique reference to a string is created.
@return
new string with concatenation of the object and parameter.
*/
PString operator+(
const PString & str ///< String to concatenate.
) const;
/**Concatenate a C string to a PString to produce a third. The original
string is not modified, an entirely new unique reference to a string
is created. The #cstr# parameter is typically a literal
string, eg:
\begin{verbatim}
myStr = aStr + "fred";
\end{verbatim}
@return
new string with concatenation of the object and parameter.
*/
PString operator+(
const char * cstr ///< C string to concatenate.
) const;
/**Concatenate a single character to a PString to produce a third. The
original string is not modified, an entirely new unique reference to a
string is created. The #ch# parameter is typically a
literal, eg:
\begin{verbatim}
myStr = aStr + '!';
\end{verbatim}
@return
new string with concatenation of the object and parameter.
*/
PString operator+(
char ch ///< Character to concatenate.
) const;
/**Concatenate a PString to a C string to produce a third. The original
string is not modified, an entirely new unique reference to a string
is created. The #cstr# parameter is typically a literal
string, eg:
\begin{verbatim}
myStr = "fred" + aStr;
\end{verbatim}
@return
new string with concatenation of the object and parameter.
*/
friend PString operator+(
const char * cstr, ///< C string to be concatenated to.
const PString & str ///< String to concatenate.
);
/**Concatenate a PString to a single character to produce a third. The
original string is not modified, an entirely new unique reference to a
string is created. The #c# parameter is typically a literal,
eg:
\begin{verbatim}
myStr = '!' + aStr;
\end{verbatim}
@return
new string with concatenation of the object and parameter.
*/
friend PString operator+(
char c, ///< Character to be concatenated to.
const PString & str ///< String to concatenate.
);
/**Concatenate a string to another string, modifiying that string.
@return
reference to string that was concatenated to.
*/
PString & operator+=(
const PString & str ///< String to concatenate.
);
/**Concatenate a C string to a PString, modifiying that string. The
#cstr# parameter is typically a literal string, eg:
\begin{verbatim}
myStr += "fred";
\end{verbatim}
@return
reference to string that was concatenated to.
*/
PString & operator+=(
const char * cstr ///< C string to concatenate.
);
/**Concatenate a single character to a PString. The #ch#
parameter is typically a literal, eg:
\begin{verbatim}
myStr += '!';
\end{verbatim}
@return
new string with concatenation of the object and parameter.
*/
PString & operator+=(
char ch ///< Character to concatenate.
);
/**Concatenate two strings to produce a third. The original strings are
not modified, an entirely new unique reference to a string is created.
@return
new string with concatenation of the object and parameter.
*/
PString operator&(
const PString & str ///< String to concatenate.
) const;
/**Concatenate a C string to a PString to produce a third. The original
string is not modified, an entirely new unique reference to a string
is created. The #cstr# parameter is typically a literal
string, eg:
\begin{verbatim}
myStr = aStr & "fred";
\end{verbatim}
This function differes from operator+ in that it assures there is at
least one space between the strings. Exactly one space is added if
there is not a space at the end of the first or beggining of the last
string.
@return
new string with concatenation of the object and parameter.
*/
PString operator&(
const char * cstr ///< C string to concatenate.
) const;
/**Concatenate a single character to a PString to produce a third. The
original string is not modified, an entirely new unique reference to a
string is created. The #ch# parameter is typically a
literal, eg:
\begin{verbatim}
myStr = aStr & '!';
\end{verbatim}
This function differes from operator+ in that it assures there is at
least one space between the strings. Exactly one space is added if
there is not a space at the end of the first or beggining of the last
string.
@return
new string with concatenation of the object and parameter.
*/
PString operator&(
char ch ///< Character to concatenate.
) const;
/**Concatenate a PString to a C string to produce a third. The original
string is not modified, an entirely new unique reference to a string
is created. The #cstr# parameter is typically a literal
string, eg:
\begin{verbatim}
myStr = "fred" & aStr;
\end{verbatim}
This function differes from operator+ in that it assures there is at
least one space between the strings. Exactly one space is added if
there is not a space at the end of the first or beggining of the last
string.
@return
new string with concatenation of the object and parameter.
*/
friend PString operator&(
const char * cstr, ///< C string to be concatenated to.
const PString & str ///< String to concatenate.
);
/**Concatenate a PString to a single character to produce a third. The
original string is not modified, an entirely new unique reference to a
string is created. The #c# parameter is typically a literal,
eg:
\begin{verbatim}
myStr = '!' & aStr;
\end{verbatim}
This function differes from #operator+# in that it assures there is at
least one space between the strings. Exactly one space is added if
there is not a space at the end of the first or beggining of the last
string.
@return
new string with concatenation of the object and parameter.
*/
friend PString operator&(
char ch, ///< Character to be concatenated to.
const PString & str ///< String to concatenate.
);
/**Concatenate a string to another string, modifiying that string.
@return
reference to string that was concatenated to.
*/
PString & operator&=(
const PString & str ///< String to concatenate.
);
/**Concatenate a C string to a PString, modifiying that string. The
#cstr# parameter is typically a literal string, eg:
\begin{verbatim}
myStr &= "fred";
\end{verbatim}
This function differes from operator+ in that it assures there is at
least one space between the strings. Exactly one space is added if
there is not a space at the end of the first or beggining of the last
string.
@return
reference to string that was concatenated to.
*/
PString & operator&=(
const char * cstr ///< C string to concatenate.
);
/**Concatenate a character to a PString, modifiying that string. The
#ch# parameter is typically a literal string, eg:
\begin{verbatim}
myStr &= '!';
\end{verbatim}
This function differes from operator+ in that it assures there is at
least one space between the strings. Exactly one space is added if
there is not a space at the end of the first or beggining of the last
string.
@return
reference to string that was concatenated to.
*/
PString & operator&=(
char ch ///< Character to concatenate.
);
//@}
/**@name Comparison operators */
//@{
/**Compare two strings using case insensitive comparison.
@return
TRUE if equal.
*/
bool operator*=(
const PString & str ///< PString object to compare against.
) const;
/**Compare two strings using the #PObject::Compare()# function. This
is identical to the #PObject# class function but is necessary due
to other overloaded versions.
@return
TRUE if equal.
*/
bool operator==(
const PObject & str ///< PString object to compare against.
) const;
/**Compare two strings using the #PObject::Compare()# function. This
is identical to the #PObject# class function but is necessary due
to other overloaded versions.
@return
TRUE if not equal.
*/
bool operator!=(
const PObject & str ///< PString object to compare against.
) const;
/**Compare two strings using the #PObject::Compare()# function. This
is identical to the #PObject# class function but is necessary due
to other overloaded versions.
@return
TRUE if less than.
*/
bool operator<(
const PObject & str ///< PString object to compare against.
) const;
/**Compare two strings using the #PObject::Compare()# function. This
is identical to the #PObject# class function but is necessary due
to other overloaded versions.
@return
TRUE if greater than.
*/
bool operator>(
const PObject & str ///< PString object to compare against.
) const;
/**Compare two strings using the #PObject::Compare()# function. This
is identical to the #PObject# class function but is necessary due
to other overloaded versions.
@return
TRUE if less than or equal.
*/
bool operator<=(
const PObject & str ///< PString object to compare against.
) const;
/**Compare two strings using the #PObject::Compare()# function. This
is identical to the #PObject# class function but is necessary due
to other overloaded versions.
@return
TRUE if greater than or equal.
*/
bool operator>=(
const PObject & str ///< PString object to compare against.
) const;
/**Compare a PString to a C string using a case insensitive compare
function. The #cstr# parameter is typically a literal string,
eg:
\begin{verbatim}
if (myStr == "fred")
\end{verbatim}
@return
TRUE if equal.
*/
bool operator*=(
const char * cstr ///< C string to compare against.
) const;
/**Compare a PString to a C string using the ##Compare()##
function. The #cstr# parameter is typically a literal string,
eg:
\begin{verbatim}
if (myStr == "fred")
\end{verbatim}
@return
TRUE if equal.
*/
bool operator==(
const char * cstr ///< C string to compare against.
) const;
/**Compare a PString to a C string using the #PObject::Compare()#
function. The #cstr# parameter is typically a literal
string, eg:
\begin{verbatim}
if (myStr != "fred")
\end{verbatim}
@return
TRUE if not equal.
*/
bool operator!=(
const char * cstr ///< C string to compare against.
) const;
/**Compare a PString to a C string using the #PObject::Compare()#
function. The #cstr# parameter is typically a literal
string, eg:
\begin{verbatim}
if (myStr < "fred")
\end{verbatim}
@return
TRUE if less than.
*/
bool operator<(
const char * cstr ///< C string to compare against.
) const;
/**Compare a PString to a C string using the #PObject::Compare()#
function. The #cstr# parameter is typically a literal
string, eg:
\begin{verbatim}
if (myStr > "fred")
\end{verbatim}
@return
TRUE if greater than.
*/
bool operator>(
const char * cstr ///< C string to compare against.
) const;
/**Compare a PString to a C string using the #PObject::Compare()#
function. The #cstr# parameter is typically a literal
string, eg:
\begin{verbatim}
if (myStr <= "fred")
\end{verbatim}
@return
TRUE if less than or equal.
*/
bool operator<=(
const char * cstr ///< C string to compare against.
) const;
/**Compare a PString to a C string using the #PObject::Compare()#
function. The #cstr# parameter is typically a literal
string, eg:
\begin{verbatim}
if (myStr >= "fred")
\end{verbatim}
@return
TRUE if greater than or equal.
*/
bool operator>=(
const char * cstr ///< C string to compare against.
) const;
/**Compare a string against a substring of the object.
This will compare at most #count# characters of the string, starting at
the specified #offset#, against that many characters of the #str#
parameter. If #count# greater than the length of the #str# parameter
then the actual length of #str# is used. If #count# and the length of
#str# are greater than the length of the string remaining from the
#offset# then FALSE is returned.
@return
TRUE if str is a substring of .
*/
Comparison NumCompare(
const PString & str, ///< PString object to compare against.
PINDEX count = P_MAX_INDEX, ///< Number of chacracters in str to compare
PINDEX offset = 0 ///< Offset into string to compare
) const;
/**Compare a string against a substring of the object.
This will compare at most #count# characters of the string, starting at
the specified #offset#, against that many characters of the #str#
parameter. If #count# greater than the length of the #str# parameter
then the actual length of #str# is used. If #count# and the length of
#str# are greater than the length of the string remaining from the
#offset# then FALSE is returned.
@return
TRUE if str is a substring of .
*/
Comparison NumCompare(
const char * cstr, ///< C string object to compare against.
PINDEX count = P_MAX_INDEX, ///< Number of chacracters in str to compare
PINDEX offset = 0 ///< Offset into string to compare
) const;
//@}
/**@name Search & replace functions */
//@{
/** Locate the position within the string of the character. */
PINDEX Find(
char ch, ///< Character to search for in string.
PINDEX offset = 0 ///< Offset into string to begin search.
) const;
/** Locate the position within the string of the substring. */
PINDEX Find(
const PString & str, ///< String to search for in string.
PINDEX offset = 0 ///< Offset into string to begin search.
) const;
/* Locate the position within the string of the character or substring. The
search will begin at the character offset provided.
If #offset# is beyond the length of the string, then the
function will always return #P_MAX_INDEX#.
The matching will be for identical character or string. If a search
ignoring case is required then the string should be converted to a
#PCaselessString# before the search is made.
@return
position of character or substring in the string, or P_MAX_INDEX if the
character or substring is not in the string.
*/
PINDEX Find(
const char * cstr, ///< C string to search for in string.
PINDEX offset = 0 ///< Offset into string to begin search.
) const;
/** Locate the position of the last matching character. */
PINDEX FindLast(
char ch, ///< Character to search for in string.
PINDEX offset = P_MAX_INDEX ///< Offset into string to begin search.
) const;
/** Locate the position of the last matching substring. */
PINDEX FindLast(
const PString & str, ///< String to search for in string.
PINDEX offset = P_MAX_INDEX ///< Offset into string to begin search.
) const;
/**Locate the position of the last matching substring.
Locate the position within the string of the last matching character or
substring. The search will begin at the character offset provided,
moving backward through the string.
If #offset# is beyond the length of the string, then the
search begins at the end of the string. If #offset# is zero
then the function always returns #P_MAX_INDEX#.
The matching will be for identical character or string. If a search
ignoring case is required then the string should be converted to a
#PCaselessString# before the search is made.
@return
position of character or substring in the string, or P_MAX_INDEX if the
character or substring is not in the string.
*/
PINDEX FindLast(
const char * cstr, ///< C string to search for in string.
PINDEX offset = P_MAX_INDEX ///< Offset into string to begin search.
) const;
/** Locate the position of one of the characters in the set. */
PINDEX FindOneOf(
const PString & set, ///< String of characters to search for in string.
PINDEX offset = 0 ///< Offset into string to begin search.
) const;
/**Locate the position of one of the characters in the set.
The search will begin at the character offset provided.
If #offset# is beyond the length of the string, then the
function will always return #P_MAX_INDEX#.
The matching will be for identical character or string. If a search
ignoring case is required then the string should be converted to a
#PCaselessString# before the search is made.
@return
position of character in the string, or P_MAX_INDEX if no characters
from the set are in the string.
*/
PINDEX FindOneOf(
const char * cset, ///< C string of characters to search for in string.
PINDEX offset = 0 ///< Offset into string to begin search.
) const;
/**Locate the position within the string of one of the regular expression.
The search will begin at the character offset provided.
If #offset# is beyond the length of the string, then the
function will always return #P_MAX_INDEX#.
@return
position of regular expression in the string, or P_MAX_INDEX if no
characters from the set are in the string.
*/
PINDEX FindRegEx(
const PRegularExpression & regex, ///< regular expression to find
PINDEX offset = 0 ///< Offset into string to begin search.
) const;
/**Locate the position within the string of one of the regular expression.
The search will begin at the character offset provided.
If #offset# is beyond the length of the string, then the
function will always return #P_MAX_INDEX#.
@return
position of regular expression in the string, or P_MAX_INDEX if no
characters from the set are in the string.
*/
BOOL FindRegEx(
const PRegularExpression & regex, ///< regular expression to find
PINDEX & pos, ///< Position of matched expression
PINDEX & len, ///< Length of matched expression
PINDEX offset = 0, ///< Offset into string to begin search.
PINDEX maxPos = P_MAX_INDEX ///< Maximum offset into string
) const;
/**Locate the substring within the string and replace it with the specifed
substring. The search will begin at the character offset provided.
If #offset# is beyond the length of the string, then the
function will do nothing.
The matching will be for identical character or string. If a search
ignoring case is required then the string should be converted to a
#PCaselessString# before the search is made.
*/
void Replace(
const PString & target, ///< Text to be removed.
const PString & subs, ///< String to be inserted into the gaps created
BOOL all = FALSE, ///< Replace all occurrences of target text.
PINDEX offset = 0 ///< Offset into string to begin search.
);
/**Splice the string into the current string at the specified position. The
specified number of bytes are removed from the string.
Note that this function will break the current instance from multiple
references to the string. A new string buffer is allocated and the data
from the old string buffer copied to it.
*/
void Splice(
const PString & str, ///< Substring to insert.
PINDEX pos, ///< Position in string to insert the substring.
PINDEX len = 0 ///< Length of section to remove.
);
/**Splice the string into the current string at the specified position. The
specified number of bytes are removed from the string.
Note that this function will break the current instance from multiple
references to the string. A new string buffer is allocated and the data
from the old string buffer copied to it.
*/
void Splice(
const char * cstr, ///< Substring to insert.
PINDEX pos, ///< Position in string to insert the substring.
PINDEX len = 0 ///< Length of section to remove.
);
/**Remove the substring from the string.
Note that this function will break the current instance from multiple
references to the string. A new string buffer is allocated and the data
from the old string buffer copied to it.
*/
void Delete(
PINDEX start, ///< Position in string to remove.
PINDEX len ///< Number of characters to delete.
);
//@}
/**@name Sub-string functions */
//@{
/**Extract a portion of the string into a new string. The original string
is not changed and a new unique reference to a string is returned.
The substring is returned inclusive of the characters at the
#start# and #end# positions.
If the #end# position is greater than the length of the
string then all characters from the #start# up to the end of
the string are returned.
If #start# is greater than the length of the string or
#end# is before #start# then an empty string is
returned.
@return
substring of the source string.
*/
PString operator()(
PINDEX start, ///< Starting position of the substring.
PINDEX end ///< Ending position of the substring.
) const;
/**Extract a portion of the string into a new string. The original string
is not changed and a new unique reference to a string is returned.
A substring from the beginning of the string for the number of
characters specified is extracted.
If #len# is greater than the length of the string then all
characters to the end of the string are returned.
If #len# is zero then an empty string is returned.
@return
substring of the source string.
*/
PString Left(
PINDEX len ///< Number of characters to extract.
) const;
/**Extract a portion of the string into a new string. The original string
is not changed and a new unique reference to a string is returned.
A substring from the end of the string for the number of characters
specified is extracted.
If #len# is greater than the length of the string then all
characters to the beginning of the string are returned.
If #len# is zero then an empty string is returned.
@return
substring of the source string.
*/
PString Right(
PINDEX len ///< Number of characters to extract.
) const;
/**Extract a portion of the string into a new string. The original string
is not changed and a new unique reference to a string is returned.
A substring from the #start# position for the number of
characters specified is extracted.
If #len# is greater than the length of the string from the
#start# position then all characters to the end of the
string are returned.
If #start# is greater than the length of the string or
#len# is zero then an empty string is returned.
@return
substring of the source string.
*/
PString Mid(
PINDEX start, ///< Starting position of the substring.
PINDEX len = P_MAX_INDEX ///< Number of characters to extract.
) const;
/**Create a string consisting of all characters from the source string
except all spaces at the beginning of the string. The original string
is not changed and a new unique reference to a string is returned.
@return
string with leading spaces removed.
*/
PString LeftTrim() const;
/**Create a string consisting of all characters from the source string
except all spaces at the end of the string. The original string is not
changed and a new unique reference to a string is returned.
@return
string with trailing spaces removed.
*/
PString RightTrim() const;
/**Create a string consisting of all characters from the source string
except all spaces at the beginning and end of the string. The original
string is not changed and a new unique reference to a string is
returned.
@return
string with leading and trailing spaces removed.
*/
PString Trim() const;
/**Create a string consisting of all characters from the source string
with all upper case letters converted to lower case. The original
string is not changed and a new unique reference to a string is
returned.
@return
string with upper case converted to lower case.
*/
PString ToLower() const;
/**Create a string consisting of all characters from the source string
with all lower case letters converted to upper case. The original
string is not changed and a new unique reference to a string is
returned.
@return
string with lower case converted to upper case.
*/
PString ToUpper() const;
/** Split the string into an array of substrings. */
PStringArray Tokenise(
const PString & separators,
///< A string for the set of separator characters that delimit tokens.
BOOL onePerSeparator = TRUE
///< Flag for if there are empty tokens between consecutive separators.
) const;
/**Split the string into an array of substrings.
Divide the string into an array of substrings delimited by characters
from the specified set.
There are two options for the tokenisation, the first is where the
#onePerSeparator# is TRUE. This form will produce a token
for each delimiter found in the set. Thus the string ",two,three,,five"
would be split into 5 substrings; "", "two", "three", "" and "five".
The second form where #onePerSeparator# is FALSE is used
where consecutive delimiters do not constitute a empty token. In this
case the string " a list of words " would be split into 4 substrings;
"a", "list", "of" and "words".
There is an important distinction when there are delimiters at the
beginning or end of the source string. In the first case there will be
empty strings at the end of the array and in the second the delimiters
are ignored.
@return
an array of substring for each token in the string.
*/
PStringArray Tokenise(
const char * cseparators,
///< A C string for the set of separator characters that delimit tokens.
BOOL onePerSeparator = TRUE
///< Flag for if there are empty tokens between consecutive separators.
) const;
/**Split the string into individual lines. The line delimiters may be a
carriage return ('\r'), a line feed ('\n') or a carriage return and
line feed pair ("\r\n"). A line feed and carriage return pair ("\n\r")
would yield a blank line. between the characters.
The #Tokenise()# function should not be used to split a string
into lines as a #"\r\n"# pair consitutes a single line
ending. The #Tokenise()# function would produce a blank line in
between them.
@return
string array with a substring for each line in the string.
*/
PStringArray Lines() const;
//@}
/**@name Conversion functions */
//@{
/**Concatenate a formatted output to the string. This is identical to the
standard C library #sprintf()# function, but appends its
output to the string.
This function makes the assumption that there is less the 1000
characters of formatted output. The function will assert if this occurs.
Note that this function will break the current instance from multiple
references to the string. A new string buffer is allocated and the data
from the old string buffer copied to it.
@return
reference to the current string object.
*/
PString & sprintf(
const char * cfmt, ///< C string for output format.
... ///< Extra parameters for #sprintf()# call.
);
/**Produce formatted output as a string. This is identical to the standard
C library #sprintf()# function, but sends its output to a
#PString#.
This function makes the assumption that there is less the 1000
characters of formatted output. The function will assert if this occurs.
Note that this function will break the current instance from multiple
references to the string. A new string buffer is allocated and the data
from the old string buffer copied to it.
@return
reference to the current string object.
*/
friend PString psprintf(
const char * cfmt, ///< C string for output format.
... ///< Extra parameters for #sprintf()# call.
);
/** Concatenate a formatted output to the string. */
PString & vsprintf(
const PString & fmt, ///< String for output format.
va_list args ///< Extra parameters for #sprintf()# call.
);
/**Concatenate a formatted output to the string. This is identical to the
standard C library #vsprintf()# function, but appends its
output to the string.
This function makes the assumption that there is less the 1000
characters of formatted output. The function will assert if this occurs.
Note that this function will break the current instance from multiple
references to the string. A new string buffer is allocated and the data
from the old string buffer copied to it.
@return
reference to the current string object.
*/
PString & vsprintf(
const char * cfmt, ///< C string for output format.
va_list args ///< Extra parameters for #sprintf()# call.
);
/** Produce formatted output as a string. */
friend PString pvsprintf(
const char * cfmt, ///< C string for output format.
va_list args ///< Extra parameters for #sprintf()# call.
);
/**Produce formatted output as a string. This is identical to the standard
C library #vsprintf()# function, but sends its output to a
#PString#.
This function makes the assumption that there is less the 1000
characters of formatted output. The function will assert if this occurs.
Note that this function will break the current instance from multiple
references to the string. A new string buffer is allocated and the data
from the old string buffer copied to it.
@return
reference to the current string object.
*/
friend PString pvsprintf(
const PString & fmt, ///< String for output format.
va_list args ///< Extra parameters for #sprintf()# call.
);
/**Convert the string to an integer value using the specified number base.
All characters up to the first illegal character for the number base are
converted. Case is not significant for bases greater than 10.
The number base may only be from 2 to 36 and the function will assert
if it is not in this range.
This function uses the standard C library #strtol()# function.
@return
integer value for the string.
*/
long AsInteger(
unsigned base = 10 ///< Number base to convert the string in.
) const;
/**Convert the string to an integer value using the specified number base.
All characters up to the first illegal character for the number base are
converted. Case is not significant for bases greater than 10.
The number base may only be from 2 to 36 and the function will assert
if it is not in this range.
This function uses the standard C library #strtoul()# function.
@return
integer value for the string.
*/
DWORD AsUnsigned(
unsigned base = 10 ///< Number base to convert the string in.
) const;
/**Convert the string to an integer value using the specified number base.
All characters up to the first illegal character for the number base are
converted. Case is not significant for bases greater than 10.
The number base may only be from 2 to 36 and the function will assert
if it is not in this range.
This function uses the standard C library #strtoq()#
or #strtoul()# function.
@return
integer value for the string.
*/
PInt64 AsInt64(
unsigned base = 10 ///< Number base to convert the string in.
) const;
/**Convert the string to an integer value using the specified number base.
All characters up to the first illegal character for the number base are
converted. Case is not significant for bases greater than 10.
The number base may only be from 2 to 36 and the function will assert
if it is not in this range.
This function uses the standard C library #strtouq()#
or #strtoul()# function.
@return
integer value for the string.
*/
PUInt64 AsUnsigned64(
unsigned base = 10 ///< Number base to convert the string in.
) const;
/**Convert the string to a floating point number. This number may be in
decimal or exponential form. All characters up to the first illegal
character for a floting point number are converted.
This function uses the standard C library #strtod()#
function.
@return
floating point value for the string.
*/
double AsReal() const;
/**Convert UTF-8 string to UCS-2.
Note the resultant PWORDArray will have the trailing null included.
*/
PWORDArray AsUCS2() const;
/**Convert a standard null terminated string to a "pascal" style string.
This consists of a songle byte for the length of the string and then
the string characters following it.
This function will assert if the string is greater than 255 characters
in length.
@return
byte array containing the "pascal" style string.
*/
PBYTEArray ToPascal() const;
/**Convert the string to C literal string format. This will convert non
printable characters to the \nnn form or for standard control characters
such as line feed, to \n form. Any '"' characters are also escaped with
a \ character and the entire string is enclosed in '"' characters.
@return
string converted to a C language literal form.
*/
PString ToLiteral() const;
/**Get the internal buffer as a pointer to unsigned characters. The
standard "operator const char *" function is provided by the
#PCharArray# ancestor class.
@return
pointer to character buffer.
*/
operator const unsigned char *() const;
//@}
protected:
void InternalFromUCS2(
const WORD * ptr,
PINDEX len
);
virtual Comparison InternalCompare(
PINDEX offset, // Offset into string to compare.
char c // Character to compare against.
) const;
virtual Comparison InternalCompare(
PINDEX offset, // Offset into string to compare.
PINDEX length, // Number of characters to compare.
const char * cstr // C string to compare against.
) const;
/* Internal function to compare the current string value against the
specified C string.
@return
relative rank of the two strings.
*/
PString(int dummy, const PString * str);
};
//////////////////////////////////////////////////////////////////////////////
/**This class is a variation of a string that ignores case. Thus in all
standard comparison (#==#, #<# etc) and search
(#Find()# etc) functions the case of the characters and strings is
ignored.
The characters in the string still maintain their case. Only the comparison
operations are affected. So printing etc will still display the string as
entered.
*/
class PCaselessString : public PString
{
PCLASSINFO(PCaselessString, PString);
public:
/**Create a new, empty, caseless string.
*/
PCaselessString();
/**Create a new caseless string, initialising it to the characters in the
C string provided.
*/
PCaselessString(
const char * cstr ///< C string to initialise the caseless string from.
);
/**Create a caseless string, with a reference to the characters in the
normal #PString# provided. A PCaselessString may also be provided
to this constructor.
*/
PCaselessString(
const PString & str ///< String to initialise the caseless string from.
);
/**Assign the string to the current object. The current instance then
becomes another reference to the same string in the #str#
parameter.
@return
reference to the current PString object.
*/
PCaselessString & operator=(
const PString & str ///< New string to assign.
);
/**Assign the C string to the current object. The current instance then
becomes a unique reference to a copy of the #cstr# parameter.
The #cstr# parameter is typically a literal string, eg:
\begin{verbatim}
myStr = "fred";
\end{verbatim}
@return
reference to the current PString object.
*/
PCaselessString & operator=(
const char * cstr ///< C string to assign.
);
/**Assign the character to the current object. The current instance then
becomes a unique reference to a copy of the character parameter. eg:
\begin{verbatim}
myStr = 'A';
\end{verbatim}
@return
reference to the current PString object.
*/
PCaselessString & operator=(
char ch ///< Character to assign.
);
// Overrides from class PObject
/**Make a complete duplicate of the string. Note that the data in the
array of characters is duplicated as well and the new object is a
unique reference to that data.
*/
virtual PObject * Clone() const;
protected:
// Overrides from class PString
virtual Comparison InternalCompare(
PINDEX offset, // Offset into string to compare.
char c // Character to compare against.
) const;
virtual Comparison InternalCompare(
PINDEX offset, // Offset into string to compare.
PINDEX length, // Number of characters to compare.
const char * cstr // C string to compare against.
) const;
/* Internal function to compare the current string value against the
specified C string.
@return
relative rank of the two strings or characters.
*/
PCaselessString(int dummy, const PCaselessString * str);
};
//////////////////////////////////////////////////////////////////////////////
class PStringStream;
/**This class is a standard C++ stream class descendent for reading or writing
streamed data to or from a #PString# class.
All of the standard stream I/O operators, manipulators etc will operate on
the PStringStream class.
*/
class PStringStream : public PString, public iostream
{
PCLASSINFO(PStringStream, PString);
public:
/**Create a new, empty, string stream. Data may be output to this stream,
but attempts to input from it will return end of file.
The internal string is continually grown as required during output.
*/
PStringStream();
/**Create a new, empty, string stream of a fixed size. Data may be output
to this stream, but attempts to input from it will return end of file.
When the fixed size is reached then no more data may be output to it.
*/
PStringStream(
PINDEX fixedBufferSize
);
/**Create a new string stream and initialise it to the provided value. The
string stream references the same string buffer as the #str#
parameter until any output to the string stream is attempted. The
reference is then broken and the instance of the string stream becomes
a unique reference to a string buffer.
*/
PStringStream(
const PString & str ///< Initial value for string stream.
);
/**Create a new string stream and initialise it with the provided value.
The stream may be read or written from. Writes will append to the end of
the string.
*/
PStringStream(
const char * cstr ///< Initial value for the string stream.
);
/**Make the current string empty
*/
virtual PString & MakeEmpty();
/**Assign the string part of the stream to the current object. The current
instance then becomes another reference to the same string in the #strm#
parameter.
This will reset the read pointer for input to the beginning of the
string. Also, any data output to the string up until the asasignement
will be lost.
@return
reference to the current PStringStream object.
*/
PStringStream & operator=(
const PStringStream & strm
);
/**Assign the string to the current object. The current instance then
becomes another reference to the same string in the #str#
parameter.
This will reset the read pointer for input to the beginning of the
string. Also, any data output to the string up until the asasignement
will be lost.
@return
reference to the current PStringStream object.
*/
PStringStream & operator=(
const PString & str ///< New string to assign.
);
/**Assign the C string to the string stream. The current instance then
becomes a unique reference to a copy of the #cstr#
parameter. The #cstr# parameter is typically a literal
string, eg:
\begin{verbatim}
myStr = "fred";
\end{verbatim}
This will reset the read pointer for input to the beginning of the
string. Also, any data output to the string up until the asasignement
will be lost.
@return
reference to the current PStringStream object.
*/
PStringStream & operator=(
const char * cstr ///< C string to assign.
);
/**Assign the character to the current object. The current instance then
becomes a unique reference to a copy of the character parameter. eg:
\begin{verbatim}
myStr = 'A';
\end{verbatim}
@return
reference to the current PString object.
*/
PStringStream & operator=(
char ch ///< Character to assign.
);
/// Destroy the string stream, deleting the stream buffer
virtual ~PStringStream();
protected:
virtual void AssignContents(const PContainer & cont);
private:
PStringStream(int, const PStringStream &) : iostream(cout.rdbuf()) { }
class Buffer : public streambuf {
public:
Buffer(PStringStream & str, PINDEX size);
Buffer(const Buffer & sbuf);
Buffer & operator=(const Buffer & sbuf);
virtual int overflow(int=EOF);
virtual int underflow();
virtual int sync();
#ifdef __USE_STL__
virtual pos_type seekoff(off_type, ios_base::seekdir, ios_base::openmode = ios_base::in | ios_base::out);
virtual pos_type seekpos(pos_type, ios_base::openmode = ios_base::in | ios_base::out);
#else
virtual streampos seekoff(streamoff, ios::seek_dir, int);
#endif
PStringStream & string;
BOOL fixedBufferSize;
};
};
class PStringList;
class PSortedStringList;
/**This is an array collection class of #PString# objects. It has all the
usual functions for a collection, with the object types set to
#PString# pointers.
In addition some addition functions are added that take a const
#PString# reference instead of a pointer as most standard collection
functions do. This is more convenient for when string expressions are used
as parameters to function in the collection.
See the #PAbstractArray# and #PArray# classes and
#PDECLARE_ARRAY# macro for more information.
*/
#ifdef DOC_PLUS_PLUS
class PStringArray : public PArray {
#endif
PDECLARE_ARRAY(PStringArray, PString);
public:
/**@name Construction */
//@{
/**Create a PStringArray from the array of C strings. If count is
P_MAX_INDEX then strarr is assumed to point to an array of strings
where the last pointer is NULL.
*/
PStringArray(
PINDEX count, ///< Count of strings in array
char const * const * strarr, ///< Array of C strings
BOOL caseless = FALSE ///< New strings are to be PCaselessStrings
);
/**Create a PStringArray of length one from the single string.
*/
PStringArray(
const PString & str ///< Single string to convert to an array of one.
);
/**Create a PStringArray from the list of strings.
*/
PStringArray(
const PStringList & list ///< List of strings to convert to array.
);
/**Create a PStringArray from the sorted list strings.
*/
PStringArray(
const PSortedStringList & list ///< List of strings to convert to array.
);
/**
* Create a PStringArray from a vector of PStrings
*/
PStringArray(
const std::vector<PString> & vec
)
{
for (std::vector<PString>::const_iterator r = vec.begin(); r != vec.end(); ++r)
AppendString(*r);
}
/**
* Create a PStringArray from a vector of std::string
*/
PStringArray(
const std::vector<std::string> & vec
)
{
for (std::vector<std::string>::const_iterator r = vec.begin(); r != vec.end(); ++r)
AppendString(PString(*r));
}
/**
* Create a PStringArray from an STL container
*/
template <typename stlContainer>
static PStringArray container(
const stlContainer & vec
)
{
PStringArray list;
for (typename stlContainer::const_iterator r = vec.begin(); r != vec.end(); ++r)
list.AppendString(PString(*r));
return list;
}
//@}
/**@name Overrides from class PObject */
//@{
/** Input the contents of the object from the stream. This is
primarily used by the standard #operator>># function.
The default behaviour reads '\n' separated strings until !strm.good().
*/
virtual void ReadFrom(
istream &strm // Stream to read the objects contents from.
);
//@}
/**@name New functions for class */
//@{
/**As for #GetValuesIndex()# but takes a PString argument so that
literals will be automatically converted.
@return
Index of string in array or P_MAX_INDEX if not found.
*/
PINDEX GetStringsIndex(
const PString & str ///< String to search for index of
) const;
PString operator[](
PINDEX index ///< Index position in the collection of the object.
) const;
/**Retrieve a reference to the object in the array. If there was not an
object at that ordinal position or the index was beyond the size of the
array then the function will create a new one.
@return
reference to the object at #index# position.
*/
PString & operator[](
PINDEX index ///< Index position in the collection of the object.
);
/** Append a string to the array
*/
PINDEX AppendString(
const PString & str ///< String to append.
);
/**Concatenate a PString or PStringArray to the array
@return
The PStringArray with the new items appended
*/
PStringArray & operator +=(const PStringArray & array);
PStringArray & operator +=(const PString & str);
/**Create a new PStringArray, and add PString or PStringArray to it
a new PStringArray
@return
A new PStringArray with the additional elements(s)
*/
PStringArray operator + (const PStringArray & array);
PStringArray operator + (const PString & str);
/**Create an array of C strings.
If storage is NULL then this returns a single pointer that may be
disposed of using free(). Note that each of the strings are part of the
same memory allocation so only one free() is required.
If storage is not null then that is used to allocate the memory.
*/
char ** ToCharArray(
PCharArray * storage = NULL
) const;
//@}
};
/**This is a list collection class of #PString# objects. It has all the
usual functions for a collection, with the object types set to
#PString# pointers.
In addition some addition functions are added that take a const
#PString# reference instead of a pointer as most standard collection
functions do. This is more convenient for when string expressions are used
as parameters to function in the collection.
See the #PAbstractList# and #PList# classes and
#PDECLARE_LIST# macro for more information.
*/
#ifdef DOC_PLUS_PLUS
class PStringList : public PList {
#endif
PDECLARE_LIST(PStringList, PString);
public:
/**@name Construction */
//@{
/**Create a PStringList from the array of C strings.
*/
PStringList(
PINDEX count, ///< Count of strings in array
char const * const * strarr, ///< Array of C strings
BOOL caseless = FALSE ///< New strings are to be PCaselessStrings
);
/**Create a PStringList of length one from the single string.
*/
PStringList(
const PString & str ///< Single string to convert to a list of one.
);
/**Create a PStringList from the array of strings.
*/
PStringList(
const PStringArray & array ///< Array of strings to convert to list
);
/**Create a PStringList from the sorted list of strings.
*/
PStringList(
const PSortedStringList & list ///< List of strings to convert to list.
);
//@}
/**@name Overrides from class PObject */
//@{
/** Input the contents of the object from the stream. This is
primarily used by the standard #operator>># function.
The default behaviour reads '\n' separated strings until !strm.good().
*/
virtual void ReadFrom(
istream &strm // Stream to read the objects contents from.
);
//@}
/**@name Operations */
//@{
/** Append a string to the list.
*/
PINDEX AppendString(
const PString & str ///< String to append.
);
/** Insert a string into the list.
*/
PINDEX InsertString(
const PString & before, ///< String to insert before.
const PString & str ///< String to insert.
);
/** Get the index of the string with the specified value.
A linear search of list is performed to find the string value.
*/
PINDEX GetStringsIndex(
const PString & str ///< String value to search for.
) const;
/**Concatenate a PString or PStringArray to the list
@return
The PStringArray with the new items appended
*/
PStringList & operator +=(const PStringList & list);
PStringList & operator +=(const PString & str);
/**Create a new PStringList, and add PString or PStringList to it
a new PStringList
@return
A new PStringList with the additional elements(s)
*/
PStringList operator + (const PStringList & array);
PStringList operator + (const PString & str);
/**
* Create a PStringArray from an STL container
*/
template <typename stlContainer>
static PStringList container(
const stlContainer & vec
)
{
PStringList list;
for (typename stlContainer::const_iterator r = vec.begin(); r != vec.end(); ++r)
list.AppendString(PString(*r));
return list;
}
//@}
};
/**This is a sorted list collection class of #PString# objects. It has all
the usual functions for a collection, with the object types set to
#PString# pointers.
In addition some addition functions are added that take a const
#PString# reference instead of a pointer as most standard collection
functions do. This is more convenient for when string expressions are used
as parameters to function in the collection.
See the #PAbstractSortedList# and #PSortedList# classes and
#PDECLARE_SORTEDLIST# macro for more information.
*/
#ifdef DOC_PLUS_PLUS
class PSortedStringList : public PSortedList {
#endif
PDECLARE_SORTED_LIST(PSortedStringList, PString);
public:
/**@name Construction */
//@{
/**Create a PStringArray from the array of C strings.
*/
PSortedStringList(
PINDEX count, ///< Count of strings in array
char const * const * strarr, ///< Array of C strings
BOOL caseless = FALSE ///< New strings are to be PCaselessStrings
);
/**Create a PSortedStringList of length one from the single string.
*/
PSortedStringList(
const PString & str ///< Single string to convert to a list of one.
);
/**Create a PSortedStringList from the array of strings.
*/
PSortedStringList(
const PStringArray & array ///< Array of strings to convert to list
);
/**Create a PSortedStringList from the list of strings.
*/
PSortedStringList(
const PStringList & list ///< List of strings to convert to list.
);
//@}
/**@name Overrides from class PObject */
//@{
/** Input the contents of the object from the stream. This is
primarily used by the standard #operator>># function.
The default behaviour reads '\n' separated strings until !strm.good().
*/
virtual void ReadFrom(
istream &strm // Stream to read the objects contents from.
);
//@}
/**@name Operations */
//@{
/** Add a string to the list.
This will place the string in the correct position in the sorted list.
*/
PINDEX AppendString(
const PString & str ///< String to append.
);
/** Get the index of the string with the specified value.
A binary search of tree is performed to find the string value.
*/
PINDEX GetStringsIndex(
const PString & str ///< String value to search for.
) const;
/** Get the index of the next string after specified value.
A binary search of tree is performed to find the string greater than
or equal to the specified string value.
*/
PINDEX GetNextStringsIndex(
const PString & str ///< String value to search for.
) const;
//@}
protected:
PINDEX InternalStringSelect(
const char * str,
PINDEX len,
Element * thisElement
) const;
};
/**This is a set collection class of #PString# objects. It has all the
usual functions for a collection, with the object types set to
#PString# pointers.
In addition some addition functions are added that take a const
#PString# reference instead of a pointer as most standard collection
functions do. This is more convenient for when string expressions are used
as parameters to function in the collection.
Unlike the normal sets, this will delete the PStrings removed from it. This
complements the automatic creation of new PString objects when literals or
expressions are used.
See the #PAbstractSet# and #PSet# classes and #PDECLARE_SET#
macro for more information.
*/
#ifdef DOC_PLUS_PLUS
class PStringSet : public PSet {
#endif
PDECLARE_SET(PStringSet, PString, TRUE);
public:
/**@name Construction */
//@{
/**Create a PStringArray from the array of C strings.
*/
PStringSet(
PINDEX count, ///< Count of strings in array
char const * const * strarr, ///< Array of C strings
BOOL caseless = FALSE ///< New strings are to be PCaselessStrings
);
/**Create a PStringSet containing the single string.
*/
PStringSet(
const PString & str ///< Single string to convert to a list of one.
);
//@}
/**@name Overrides from class PObject */
//@{
/** Input the contents of the object from the stream. This is
primarily used by the standard #operator>># function.
The default behaviour reads '\n' separated strings until !strm.good().
*/
virtual void ReadFrom(
istream &strm ///< Stream to read the objects contents from.
);
//@}
/**@name Operations */
//@{
/** Include the spcified string value into the set. */
void Include(
const PString & key ///< String value to add to set.
);
/** Include the spcified string value into the set. */
PStringSet & operator+=(
const PString & key ///< String value to add to set.
);
/** Exclude the spcified string value from the set. */
void Exclude(
const PString & key ///< String value to remove from set.
);
/** Exclude the spcified string value from the set. */
PStringSet & operator-=(
const PString & key ///< String value to remove from set.
);
//@}
};
#ifdef PHAS_TEMPLATES
/**This template class maps the PAbstractDictionary to a specific key type and
a #PString# data type. The functions in this class primarily do all the
appropriate casting of types.
Note that if templates are not used the #PDECLARE_STRING_DICTIONARY#
macro will simulate the template instantiation.
*/
template <class K> class PStringDictionary : public PAbstractDictionary
{
PCLASSINFO(PStringDictionary, PAbstractDictionary);
public:
/**@name Construction */
//@{
/**Create a new, empty, dictionary.
Note that by default, objects placed into the dictionary will be
deleted when removed or when all references to the dictionary are
destroyed.
*/
PStringDictionary()
: PAbstractDictionary() { }
//@}
/**@name Overrides from class PObject */
//@{
/**Make a complete duplicate of the dictionary. Note that all objects in
the array are also cloned, so this will make a complete copy of the
dictionary.
*/
virtual PObject * Clone() const
{ return PNEW PStringDictionary(0, this); }
//@}
/**@name New functions for class */
//@{
/**Get the string contained in the dictionary at the #key#
position. The hash table is used to locate the data quickly via the
hash function provided by the key.
The last key/data pair is remembered by the class so that subseqent
access is very fast.
This function asserts if there is no data at the key position.
@return
reference to the object indexed by the key.
*/
const PString & operator[](const K & key) const
{ return (const PString &)GetRefAt(key); }
/**Get the string contained in the dictionary at the #key#
position. The hash table is used to locate the data quickly via the
hash function provided by the key.
The last key/data pair is remembered by the class so that subseqent
access is very fast.
This function returns the #dflt# value if there is no data
at the key position.
@return
reference to the object indexed by the key.
*/
PString operator()(const K & key, const char * dflt = "") const
{ if (AbstractContains(key)) return (*this)[key]; return dflt; }
/**Determine if the value of the object is contained in the hash table. The
object values are compared, not the pointers. So the objects in the
collection must correctly implement the #PObject::Compare()#
function. The hash table is used to locate the entry.
@return
TRUE if the object value is in the dictionary.
*/
BOOL Contains(
const K & key // Key to look for in the dictionary.
) const { return AbstractContains(key); }
/**Remove an object at the specified key. The returned pointer is then
removed using the #SetAt()# function to set that key value to
NULL. If the #AllowDeleteObjects# option is set then the
object is also deleted.
@return
pointer to the object being removed, or NULL if the key was not
present in the dictionary. If the dictionary is set to delete objects
upon removal, the value -1 is returned if the key existed prior to removal
rather than returning an illegal pointer
*/
virtual PString * RemoveAt(
const K & key // Key for position in dictionary to get object.
) {
PString * s = GetAt(key); AbstractSetAt(key, NULL);
return reference->deleteObjects ? (s ? (PString *)-1 : NULL) : s;
}
/**Get the object at the specified key position. If the key was not in the
collection then NULL is returned.
@return
pointer to object at the specified key.
*/
virtual PString * GetAt(
const K & key // Key for position in dictionary to get object.
) const { return (PString *)AbstractGetAt(key); }
/**Set the data at the specified ordinal index position in the dictionary.
The ordinal position in the dictionary is determined by the hash values
of the keys and the order of insertion.
@return
TRUE if the new object could be placed into the dictionary.
*/
virtual BOOL SetDataAt(
PINDEX index, // Ordinal index in the dictionary.
const PString & str // New string value to put into the dictionary.
) { return PAbstractDictionary::SetDataAt(index, PNEW PString(str)); }
/**Add a new object to the collection. If the objects value is already in
the dictionary then the object is overrides the previous value. If the
AllowDeleteObjects option is set then the old object is also deleted.
The object is placed in the an ordinal position dependent on the keys
hash function. Subsequent searches use the has function to speed access
to the data item.
@return
TRUE if the object was successfully added.
*/
virtual BOOL SetAt(
const K & key, // Key for position in dictionary to add object.
const PString & str // New string value to put into the dictionary.
) { return AbstractSetAt(key, PNEW PString(str)); }
/**Get the key in the dictionary at the ordinal index position.
The ordinal position in the dictionary is determined by the hash values
of the keys and the order of insertion.
The last key/data pair is remembered by the class so that subseqent
access is very fast.
@return
reference to key at the index position.
*/
const K & GetKeyAt(PINDEX index) const
{ return (const K &)AbstractGetKeyAt(index); }
/**Get the data in the dictionary at the ordinal index position.
The ordinal position in the dictionary is determined by the hash values
of the keys and the order of insertion.
The last key/data pair is remembered by the class so that subseqent
access is very fast.
@return
reference to data at the index position.
*/
PString & GetDataAt(PINDEX index) const
{ return (PString &)AbstractGetDataAt(index); }
//@}
protected:
PStringDictionary(int dummy, const PStringDictionary * c)
: PAbstractDictionary(dummy, c) { }
};
/**Begin declaration of a dictionary of strings class.
This macro is used to declare a descendent of PAbstractList class,
customised for a particular key type {\bf K} and data object type
#PString#.
If the compilation is using templates then this macro produces a descendent
of the #PStringDictionary# template class. If templates are not being
used then the macro defines a set of inline functions to do all casting of
types. The resultant classes have an identical set of functions in either
case.
See the #PStringDictionary# and #PAbstractDictionary# classes for
more information.
*/
#define PDECLARE_STRING_DICTIONARY(cls, K) \
PDECLARE_CLASS(cls, PStringDictionary<K>) \
protected: \
cls(int dummy, const cls * c) \
: PStringDictionary<K>(dummy, c) { } \
public: \
cls() \
: PStringDictionary<K>() { } \
virtual PObject * Clone() const \
{ return PNEW cls(0, this); } \
/**Declare a dictionary of strings class.
This macro is used to declare a descendent of PAbstractDictionary class,
customised for a particular key type {\bf K} and data object type
#PString#. This macro closes the class declaration off so no additional
members can be added.
If the compilation is using templates then this macro produces a typedef
of the #PStringDictionary# template class.
See the #PStringDictionary# class and #PDECLARE_STRING_DICTIONARY#
macro for more information.
*/
#define PSTRING_DICTIONARY(cls, K) typedef PStringDictionary<K> cls
#else // PHAS_TEMPLATES
#define PSTRING_DICTIONARY(cls, K) \
class cls : public PAbstractDictionary { \
PCLASSINFO(cls, PAbstractDictionary) \
protected: \
inline cls(int dummy, const cls * c) \
: PAbstractDictionary(dummy, c) { } \
public: \
inline cls() \
: PAbstractDictionary() { } \
inline PObject * Clone() const \
{ return PNEW cls(0, this); } \
inline PString & operator[](const K & key) const \
{ return (PString &)GetRefAt(key); } \
inline PString operator()(const K & key, const char * dflt = "") const \
{ if (Contains(key)) return (PString &)GetRefAt(key); return dflt; } \
virtual BOOL Contains(const K & key) const \
{ return AbstractContains(key); } \
virtual PString * RemoveAt(const K & key) \
{ PString * s = GetAt(key); AbstractSetAt(key, NULL); \
return reference->deleteObjects ? (s ? (PString *)-1 : NULL) : s; } \
virtual PString * GetAt(const K & key) const \
{ return (PString *)AbstractGetAt(key); } \
virtual BOOL SetDataAt(PINDEX index, const PString & str) \
{ return PAbstractDictionary::SetDataAt(index,PNEW PString(str));} \
virtual BOOL SetAt(const K & key, const PString & str) \
{ return AbstractSetAt(key, PNEW PString(str)); } \
inline const K & GetKeyAt(PINDEX index) const \
{ return (const K &)AbstractGetKeyAt(index); } \
inline PString & GetDataAt(PINDEX index) const \
{ return (PString &)AbstractGetDataAt(index); } \
}
#define PDECLARE_STRING_DICTIONARY(cls, K) \
PSTRING_DICTIONARY(cls##_PTemplate, K); \
PDECLARE_CLASS(cls, cls##_PTemplate) \
protected: \
cls(int dummy, const cls * c) \
: cls##_PTemplate(dummy, c) { } \
public: \
cls() \
: cls##_PTemplate() { } \
virtual PObject * Clone() const \
{ return PNEW cls(0, this); } \
#endif // PHAS_TEMPLATES
/**This is a dictionary collection class of #PString# objects, keyed by an
ordinal value. It has all the usual functions for a collection, with the
object types set to #PString# pointers. The class could be considered
like a sparse array of strings.
In addition some addition functions are added that take a const
#PString# reference instead of a pointer as most standard collection
functions do. This is more convenient for when string expressions are used
as parameters to function in the collection.
See the #PAbstractDictionary# and #PStringDictionary# classes and
#PDECLARE_DICTIONARY# and #PDECLARE_STRING_DICTIONARY# macros for
more information.
*/
#ifdef DOC_PLUS_PLUS
class POrdinalToString : public PStringDictionary {
#endif
PDECLARE_STRING_DICTIONARY(POrdinalToString, POrdinalKey);
public:
/**@name Construction */
//@{
/// Structure for static array initialiser for class.
struct Initialiser {
/// Ordinal key for string.
PINDEX key;
/// String value for ordinal.
const char * value;
};
/** Initialise the ordinal dictionary of strings from the static array.
*/
POrdinalToString(
PINDEX count, ///< Count of strings in initialiser array
const Initialiser * init ///< Array of Initialiser structures
);
//@}
/**@name Overrides from class PObject */
//@{
/** Input the contents of the object from the stream. This is
primarily used by the standard #operator>># function.
The default behaviour reads '\n' separated strings until !strm.good().
*/
virtual void ReadFrom(
istream &strm // Stream to read the objects contents from.
);
//@}
};
/**This is a dictionary collection class of ordinals keyed by
#PString# objects. It has all the usual functions for a collection,
with the object types set to #POrdinalKey# pointers.
In addition some addition functions are added that take a const
#POrdinalKey# reference or a simple #PINDEX# instead of a pointer
as most standard collection functions do. This is more convenient for when
integer expressions are used as parameters to function in the collection.
See the #PAbstractDicionary# and #POrdinalDictionary# classes and
#PDECLARE_ORDINAL_DICTIONARY# macro for more information.
*/
#ifdef DOC_PLUS_PLUS
class PStringToOrdinal : public POrdinalDictionary {
#endif
PDECLARE_ORDINAL_DICTIONARY(PStringToOrdinal, PString);
public:
/**@name Construction */
//@{
/// Structure for static array initialiser for class.
struct Initialiser {
/// String key for ordinal.
const char * key;
/// Ordinal value for string.
PINDEX value;
};
/** Initialise the string dictionary of ordinals from the static array.
*/
PStringToOrdinal(
PINDEX count, ///< Count of strings in initialiser array
const Initialiser * init, ///< Array of Initialiser structures
BOOL caseless = FALSE ///< New keys are to be PCaselessStrings
);
//@}
/**@name Overrides from class PObject */
//@{
/** Input the contents of the object from the stream. This is
primarily used by the standard #operator>># function.
The default behaviour reads '\n' separated strings until !strm.good().
*/
virtual void ReadFrom(
istream &strm // Stream to read the objects contents from.
);
//@}
};
/**This is a dictionary collection class of #PString# objects, keyed by
another string. It has all the usual functions for a collection, with the
object types set to #PString# pointers.
In addition some addition functions are added that take a const
#PString# reference instead of a pointer as most standard collection
functions do. This is more convenient for when string expressions are used
as parameters to function in the collection.
See the #PAbstractDictionary# and #PStringDictionary# classes and
#PDECLARE_DICTIONARY# and #PDECLARE_STRING_DICTIONARY# macros for
more information.
*/
#ifdef DOC_PLUS_PLUS
class PStringToString : public PStringDictionary {
#endif
PDECLARE_STRING_DICTIONARY(PStringToString, PString);
public:
/**@name Construction */
//@{
/// Structure for static array initialiser for class.
struct Initialiser {
/// String key for string.
const char * key;
/// String value for string.
const char * value;
};
/** Initialise the string dictionary of strings from the static array.
*/
PStringToString(
PINDEX count, ///< Count of strings in initialiser array
const Initialiser * init, ///< Array of Initialiser structures
BOOL caselessKeys = FALSE, ///< New keys are to be PCaselessStrings
BOOL caselessValues = FALSE ///< New values are to be PCaselessStrings
);
//@}
/**@name Overrides from class PObject */
//@{
/** Input the contents of the object from the stream. This is
primarily used by the standard #operator>># function.
The default behaviour reads '\n' separated strings until !strm.good().
*/
virtual void ReadFrom(
istream &strm // Stream to read the objects contents from.
);
//@}
};
/**A class representing a regular expression that may be used for locating
patterns in strings. The regular expression string is "compiled" into a
form that is more efficient during the matching. This compiled form
exists for the lifetime of the PRegularExpression instance.
*/
class PRegularExpression : public PObject
{
PCLASSINFO(PRegularExpression, PObject);
public:
/**@name Constructors & destructors */
//@{
/// Flags for compiler options.
enum {
/// Use extended regular expressions
Extended = 1,
/// Ignore case in search.
IgnoreCase = 2,
/**If this bit is set, then anchors do not match at newline
characters in the string. If not set, then anchors do match
at newlines.
*/
AnchorNewLine = 4
};
/// Flags for execution options.
enum {
/**If this bit is set, then the beginning-of-line operator doesn't match
the beginning of the string (presumably because it's not the
beginning of a line).
If not set, then the beginning-of-line operator does match the
beginning of the string.
*/
NotBeginningOfLine = 1,
/**Like #NotBeginningOfLine#, except for the end-of-line. */
NotEndofLine = 2
};
/// Create a new, empty, regular expression
PRegularExpression();
/** Create and compile a new regular expression pattern.
*/
PRegularExpression(
const PString & pattern, ///< Pattern to compile
int flags = IgnoreCase ///< Pattern match options
);
/** Create and compile a new regular expression pattern.
*/
PRegularExpression(
const char * cpattern, ///< Pattern to compile
int flags = IgnoreCase ///< Pattern match options
);
/**
* Copy a regular expression
*/
PRegularExpression(
const PRegularExpression &
);
/**
* Assign a regular expression
*/
PRegularExpression & operator =(
const PRegularExpression &
);
/// Release storage for the compiled regular expression.
~PRegularExpression();
//@}
/**@name Status functions */
//@{
/// Error codes.
enum ErrorCodes {
/// Success.
NoError = 0,
/// Didn't find a match (for regexec).
NoMatch,
// POSIX regcomp return error codes. (In the order listed in the standard.)
/// Invalid pattern.
BadPattern,
/// Not implemented.
CollateError,
/// Invalid character class name.
BadClassType,
/// Trailing backslash.
BadEscape,
/// Invalid back reference.
BadSubReg,
/// Unmatched left bracket.
UnmatchedBracket,
/// Parenthesis imbalance.
UnmatchedParen,
/// Unmatched #\{\}#.
UnmatchedBrace,
/// Invalid contents of #\{\}#.
BadBR,
/// Invalid range end.
RangeError,
/// Ran out of memory.
OutOfMemory,
/// No preceding re for repetition op.
BadRepitition,
/* Error codes we've added. */
/// Premature end.
PrematureEnd,
/// Compiled pattern bigger than 2^16 bytes.
TooBig,
/// Unmatched ) or \); not returned from regcomp.
UnmatchedRParen,
/// Miscellaneous error
NotCompiled
};
/**Get the error code for the last Compile() or Execute() operation.
@return
Error code.
*/
ErrorCodes GetErrorCode() const;
/**Get the text description for the error of the last Compile() or
Execute() operation.
@return
Error text string.
*/
PString GetErrorText() const;
//@}
/**@name Compile & Execute functions */
//@{
/** Compiler pattern. */
BOOL Compile(
const PString & pattern, ///< Pattern to compile
int flags = IgnoreCase ///< Pattern match options
);
/**Compiler pattern.
The pattern is compiled into an internal format to speed subsequent
execution of the pattern match algorithm.
@return
TRUE if successfully compiled.
*/
BOOL Compile(
const char * cpattern, ///< Pattern to compile
int flags = IgnoreCase ///< Pattern match options
);
/** Execute regular expression */
BOOL Execute(
const PString & str, ///< Source string to search
PINDEX & start, ///< First match locations
int flags = 0 ///< Pattern match options
) const;
/** Execute regular expression */
BOOL Execute(
const PString & str, ///< Source string to search
PINDEX & start, ///< First match locations
PINDEX & len, ///< Length of match
int flags = 0 ///< Pattern match options
) const;
/** Execute regular expression */
BOOL Execute(
const char * cstr, ///< Source string to search
PINDEX & start, ///< First match locations
int flags = 0 ///< Pattern match options
) const;
/** Execute regular expression */
BOOL Execute(
const char * cstr, ///< Source string to search
PINDEX & start, ///< First match locations
PINDEX & len, ///< Length of match
int flags = 0 ///< Pattern match options
) const;
/** Execute regular expression */
BOOL Execute(
const PString & str, ///< Source string to search
PIntArray & starts, ///< List of match locations
int flags = 0 ///< Pattern match options
) const;
/** Execute regular expression */
BOOL Execute(
const PString & str, ///< Source string to search
PIntArray & starts, ///< List of match locations
PIntArray & ends, ///< List of match ends
int flags = 0 ///< Pattern match options
) const;
/** Execute regular expression */
BOOL Execute(
const char * cstr, ///< Source string to search
PIntArray & starts, ///< List of match locations
int flags = 0 ///< Pattern match options
) const;
/**Execute regular expression.
Execute the pattern match algorithm using the previously compiled
pattern.
The #starts# array is filled with as many matches as will fit
into the array. If the the array size is zero then it is set to at least
one for the first match found.
The #ends# array is set to teh ending position of each
substring whose start is returned in the #starts# array. This
will always be set to the same size as that array.
@return
TRUE if successfully compiled.
*/
BOOL Execute(
const char * cstr, ///< Source string to search
PIntArray & starts, ///< List of match locations
PIntArray & ends, ///< List of match ends
int flags = 0 ///< Pattern match options
) const;
//@}
/**@name Miscellaneous functions */
//@{
/**Escape all characters in the #str# parameter that have a
special meaning within a regular expression.
@return
String with additional escape ('\') characters.
*/
static PString EscapeString(
const PString & str ///< String to add esacpes to.
);
//@}
protected:
PString patternSaved;
int flagsSaved;
void * expression;
int lastError;
};
PString psprintf(const char * cfmt, ...);
// End Of File ///////////////////////////////////////////////////////////////
|