package base_trie
Trie data structure library
Install
Dune Dependency
Authors
Maintainers
Sources
base_trie-v0.16.0.tar.gz
sha256=e7544117bfa8ab1708fd5d78151bbc73b55f10dba52360bcbc2ac2bf5f9a16eb
doc/src/base_trie.test_trie/test_trie.ml.html
Source file test_trie.ml
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
open! Base open Expect_test_helpers_base (* We make sure to test every function in Trie by mirroring its signature. We choose a set of examples that is not very large, but demonstrates a lot of cases (e.g. cases that differentiate [for_all] from [exists], [exists] from [existsi], etc.). Our tests then print the results of our functions on these examples. We do not do a lot of [require]-based testing. If something fails, the test output will change but it probably won't signal failure. We therefore need to read expect test output for correctness. We make that clearer, albeit more verbose, by generally printing out the inputs in each test as well as the outputs, even if that means our examples are repeated many times. *) module Examples = struct module T = Trie.Of_list (Int) let keychainable = T.Keychain.keychainable let comparator_m = Trie.Keychainable.comparator_m keychainable type keychain = int list [@@deriving compare, sexp_of] type key = int [@@deriving compare, sexp_of] type data = string [@@deriving compare, equal, sexp_of] (* We simulate alist constructors here so that Trie constructors, other than the primitive [Trie.create], are not used to test themselves. *) let rec simulate_of_alist_generic alist ~f = let datum_list, tries_list = List.partition_map alist ~f:(fun (keys, data) -> match keys with | [] -> First data | key :: keys -> Second (key, (keys, data))) in let datum = f datum_list in let tries = Map.of_alist_multi comparator_m tries_list |> Map.map ~f:(simulate_of_alist_generic ~f) in Trie.create keychainable ~datum ~tries ;; let simulate_of_alist_exn alist = simulate_of_alist_generic alist ~f:(function | [] -> None | [ data ] -> Some data | _ :: _ :: _ -> assert false) ;; let simulate_of_alist_multi alist = simulate_of_alist_generic alist ~f:(fun list -> if List.is_empty list then None else Some list) ;; let small_alist_without_duplicates = [ [], "greetings" ] let medium_alist_without_duplicates = [ [ 1 ], "yo"; [ 2; 3 ], "hello" ] let large_alist_without_duplicates = [ [ 1 ], "hi"; [ 2 ], "hello"; [ 2; 3; 4 ], "hello, world" ] ;; let alists_without_duplicates = [ [] ; small_alist_without_duplicates ; medium_alist_without_duplicates ; large_alist_without_duplicates ] ;; let small_alist_with_duplicates = [ [ 1 ], "hi"; [ 1 ], "hello" ] let large_alist_with_duplicates = let alist = large_alist_without_duplicates in alist @ List.Assoc.map alist ~f:String.uppercase ;; let alists_with_duplicates = List.concat [ alists_without_duplicates ; [ small_alist_with_duplicates; large_alist_with_duplicates ] ] ;; let small_example_trie = simulate_of_alist_exn small_alist_without_duplicates let medium_example_trie = simulate_of_alist_exn medium_alist_without_duplicates let large_example_trie = simulate_of_alist_exn large_alist_without_duplicates let example_tries = List.map alists_without_duplicates ~f:simulate_of_alist_exn let large_example_trie_multi = simulate_of_alist_multi large_alist_with_duplicates let all_prefixes list = List.init (List.length list + 1) ~f:(fun length -> List.take list length) ;; let example_key_lists = let present_keys = List.concat_map alists_with_duplicates ~f:(fun alist -> List.map alist ~f:fst) in let absent_keys = [ [ 100; 200 ] ] in let all_keys = present_keys @ absent_keys in all_keys |> List.concat_map ~f:all_prefixes |> List.dedup_and_sort ~compare:[%compare: keychain] ;; end let%test_module "Trie" = (module ( struct (* Start off with definitions we don't bother to test. *) module type S = Trie.S module Keychainable = Trie.Keychainable module Iterator = Trie.Iterator module Or_duplicate = Trie.Or_duplicate type ('chain, 'data, 'desc) t = ('chain, 'data, 'desc) Trie.t let keychainable = Trie.keychainable let sexp_of_key = Trie.sexp_of_key let sexp_of_keychain = Trie.sexp_of_keychain (* These functors are thin wrappers around [Keychainable] functors, which are themselves thin wrappers around [Iterator] functors. See [test_iterator.ml]. *) module Make = Trie.Make module Of_string = Trie.Of_string module Of_list = Trie.Of_list module Of_listable = Trie.Of_listable (* We open Examples here to shadow [sexp_of_key] with the sexp of our key type. *) open Examples (* Check invariant every time we print a trie. *) let sexp_of_t sexp_of_chain sexp_of_data sexp_of_desc trie = require_does_not_raise [%here] (fun () -> Trie.invariant ignore ignore trie); Trie.sexp_of_t sexp_of_chain sexp_of_data sexp_of_desc trie ;; let to_sexp sexp_of_data trie = require_does_not_raise [%here] (fun () -> Trie.invariant ignore ignore trie); Trie.to_sexp sexp_of_data trie ;; (* Test every function below. *) let invariant = Trie.invariant let%expect_test "invariant" = let trie = large_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; let test data_invariant key_invariant = show_raise ~hide_positions:true (fun () -> invariant data_invariant key_invariant trie) in test ignore ignore; [%expect {| "did not raise" |}]; test (List.invariant (fun key -> assert (key < 3))) ignore; [%expect {| (raised ( "invariant failed" lib/trie/src/trie.ml:LINE:COL (exn ( "invariant failed" lib/trie/src/trie.ml:LINE:COL (exn "Assert_failure test_trie.ml:LINE:COL") ("problem with trie" ((keychain (2 3 4)))))) (((1) _) ((2) _) ((2 3 4) _)))) |}]; test ignore (fun data -> assert (not (String.equal data "hello"))); [%expect {| (raised ( "invariant failed" lib/trie/src/trie.ml:LINE:COL (exn ( "invariant failed" lib/trie/src/trie.ml:LINE:COL (exn "Assert_failure test_trie.ml:LINE:COL") ("problem with trie" ((keychain (2)))))) (((1) _) ((2) _) ((2 3 4) _)))) |}] ;; let empty = Trie.empty let%expect_test "empty" = print_s [%sexp (empty keychainable : data T.t)]; [%expect {| () |}] ;; let create = Trie.create let%expect_test "create" = let t = create keychainable ~datum:(Some "hello") ~tries:(Map.singleton comparator_m 0 (empty keychainable)) in print_s [%sexp (t : data T.t)]; [%expect {| ((() hello)) |}] ;; let of_alist = Trie.of_alist let%expect_test "of_alist" = let test alist = let trie = of_alist keychainable alist in print_s [%sexp { alist : (keychain * data) list ; trie : (data T.t, keychain) Or_duplicate.t }] in List.iter alists_with_duplicates ~f:test; [%expect {| ((alist ()) (trie (Ok ()))) ((alist ((() greetings))) (trie (Ok ((() greetings))))) ((alist (((1) yo) ((2 3) hello))) (trie (Ok (((1) yo) ((2 3) hello))))) ((alist ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))))) ((alist ( ((1) hi) ((1) hello))) (trie (Duplicate (1)))) ((alist ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((1) HI) ((2) HELLO) ((2 3 4) "HELLO, WORLD"))) (trie (Duplicate (1)))) |}] ;; let of_alist_or_error = Trie.of_alist_or_error let%expect_test "of_alist_or_error" = let test alist = let trie = of_alist_or_error keychainable alist in print_s [%sexp { alist : (keychain * data) list; trie : data T.t Or_error.t }] in List.iter alists_with_duplicates ~f:test; [%expect {| ((alist ()) (trie (Ok ()))) ((alist ((() greetings))) (trie (Ok ((() greetings))))) ((alist (((1) yo) ((2 3) hello))) (trie (Ok (((1) yo) ((2 3) hello))))) ((alist ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))))) ((alist ( ((1) hi) ((1) hello))) (trie (Error ("Trie.of_alist_exn: duplicate keychain" ((keychain (1))))))) ((alist ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((1) HI) ((2) HELLO) ((2 3 4) "HELLO, WORLD"))) (trie (Error ("Trie.of_alist_exn: duplicate keychain" ((keychain (1))))))) |}] ;; let of_alist_exn = Trie.of_alist_exn let%expect_test "of_alist_exn" = let test alist = let trie = Or_error.try_with (fun () -> of_alist_exn keychainable alist) in print_s [%sexp { alist : (keychain * data) list; trie : data T.t Or_error.t }] in List.iter alists_with_duplicates ~f:test; [%expect {| ((alist ()) (trie (Ok ()))) ((alist ((() greetings))) (trie (Ok ((() greetings))))) ((alist (((1) yo) ((2 3) hello))) (trie (Ok (((1) yo) ((2 3) hello))))) ((alist ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))))) ((alist ( ((1) hi) ((1) hello))) (trie (Error ("Trie.of_alist_exn: duplicate keychain" ((keychain (1))))))) ((alist ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((1) HI) ((2) HELLO) ((2 3 4) "HELLO, WORLD"))) (trie (Error ("Trie.of_alist_exn: duplicate keychain" ((keychain (1))))))) |}] ;; let of_alist_multi = Trie.of_alist_multi let%expect_test "of_alist_multi" = let test alist = let trie = of_alist_multi keychainable alist in print_s [%sexp { alist : (keychain * data) list; trie : data list T.t }] in List.iter alists_with_duplicates ~f:test; [%expect {| ((alist ()) (trie ())) ((alist ((() greetings))) (trie ((() (greetings))))) ((alist (((1) yo) ((2 3) hello))) (trie ( ((1) (yo)) ((2 3) (hello))))) ((alist ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (trie ( ((1) (hi)) ((2) (hello)) ((2 3 4) ("hello, world"))))) ((alist ( ((1) hi) ((1) hello))) (trie (((1) (hi hello))))) ((alist ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((1) HI) ((2) HELLO) ((2 3 4) "HELLO, WORLD"))) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) |}] ;; let of_sequence = Trie.of_sequence let%expect_test "of_sequence" = let test alist = let sequence = Sequence.of_list alist in let trie = of_sequence keychainable sequence in print_s [%sexp { sequence : (keychain * data) Sequence.t ; trie : (data T.t, keychain) Or_duplicate.t }] in List.iter alists_with_duplicates ~f:test; [%expect {| ((sequence ()) (trie (Ok ()))) ((sequence ((() greetings))) (trie (Ok ((() greetings))))) ((sequence (((1) yo) ((2 3) hello))) (trie (Ok (((1) yo) ((2 3) hello))))) ((sequence ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))))) ((sequence ( ((1) hi) ((1) hello))) (trie (Duplicate (1)))) ((sequence ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((1) HI) ((2) HELLO) ((2 3 4) "HELLO, WORLD"))) (trie (Duplicate (1)))) |}] ;; let of_sequence_or_error = Trie.of_sequence_or_error let%expect_test "of_sequence_or_error" = let test alist = let sequence = Sequence.of_list alist in let trie = of_sequence_or_error keychainable sequence in print_s [%sexp { sequence : (keychain * data) Sequence.t ; trie : data T.t Or_error.t }] in List.iter alists_with_duplicates ~f:test; [%expect {| ((sequence ()) (trie (Ok ()))) ((sequence ((() greetings))) (trie (Ok ((() greetings))))) ((sequence (((1) yo) ((2 3) hello))) (trie (Ok (((1) yo) ((2 3) hello))))) ((sequence ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))))) ((sequence ( ((1) hi) ((1) hello))) (trie (Error ("Trie.of_sequence_exn: duplicate keychain" ((keychain (1))))))) ((sequence ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((1) HI) ((2) HELLO) ((2 3 4) "HELLO, WORLD"))) (trie (Error ("Trie.of_sequence_exn: duplicate keychain" ((keychain (1))))))) |}] ;; let of_sequence_exn = Trie.of_sequence_exn let%expect_test "of_sequence_exn" = let test alist = let sequence = Sequence.of_list alist in let trie = Or_error.try_with (fun () -> of_sequence_exn keychainable sequence) in print_s [%sexp { sequence : (keychain * data) Sequence.t ; trie : data T.t Or_error.t }] in List.iter alists_with_duplicates ~f:test; [%expect {| ((sequence ()) (trie (Ok ()))) ((sequence ((() greetings))) (trie (Ok ((() greetings))))) ((sequence (((1) yo) ((2 3) hello))) (trie (Ok (((1) yo) ((2 3) hello))))) ((sequence ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))))) ((sequence ( ((1) hi) ((1) hello))) (trie (Error ("Trie.of_sequence_exn: duplicate keychain" ((keychain (1))))))) ((sequence ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((1) HI) ((2) HELLO) ((2 3 4) "HELLO, WORLD"))) (trie (Error ("Trie.of_sequence_exn: duplicate keychain" ((keychain (1))))))) |}] ;; let of_sequence_multi = Trie.of_sequence_multi let%expect_test "of_sequence_multi" = let test alist = let sequence = Sequence.of_list alist in let trie = of_sequence_multi keychainable sequence in print_s [%sexp { sequence : (keychain * data) Sequence.t; trie : data list T.t }] in List.iter alists_with_duplicates ~f:test; [%expect {| ((sequence ()) (trie ())) ((sequence ((() greetings))) (trie ((() (greetings))))) ((sequence (((1) yo) ((2 3) hello))) (trie ( ((1) (yo)) ((2 3) (hello))))) ((sequence ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (trie ( ((1) (hi)) ((2) (hello)) ((2 3 4) ("hello, world"))))) ((sequence ( ((1) hi) ((1) hello))) (trie (((1) (hi hello))))) ((sequence ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((1) HI) ((2) HELLO) ((2 3 4) "HELLO, WORLD"))) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) |}] ;; let equal = Trie.equal let%expect_test "equal" = let sexp_of_pair (fst, snd) = [%sexp { fst : data T.t; snd : data T.t }] in let test tries = let equal, different = List.partition_tf (List.cartesian_product tries tries) ~f:(fun (trie1, trie2) -> equal equal_data trie1 trie2) in print_s [%sexp { equal : pair list; different : pair list }] in test example_tries; [%expect {| ((equal ( ((fst ()) (snd ())) ((fst ((() greetings))) (snd ((() greetings)))) ((fst (((1) yo) ((2 3) hello))) (snd (((1) yo) ((2 3) hello)))) ((fst ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (snd ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))))) (different ( ((fst ()) (snd ((() greetings)))) ((fst ()) (snd (((1) yo) ((2 3) hello)))) ((fst ()) (snd ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((fst ((() greetings))) (snd ())) ((fst ((() greetings))) (snd (((1) yo) ((2 3) hello)))) ((fst ((() greetings))) (snd ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((fst (((1) yo) ((2 3) hello))) (snd ())) ((fst (((1) yo) ((2 3) hello))) (snd ((() greetings)))) ((fst (((1) yo) ((2 3) hello))) (snd ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((fst ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (snd ())) ((fst ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (snd ((() greetings)))) ((fst ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (snd (((1) yo) ((2 3) hello))))))) |}] ;; let compare = Trie.compare let%expect_test "compare" = let sexp_of_pair (fst, snd) = [%sexp { fst : data T.t; snd : data T.t }] in let test tries = let less_than, equal_to, greater_than = List.partition3_map (List.cartesian_product tries tries) ~f:(fun ((trie1, trie2) as pair) -> let c = compare compare_data trie1 trie2 in if c < 0 then `Fst pair else if c = 0 then `Snd pair else `Trd pair) in print_s [%sexp { less_than : pair list ; equal_to : pair list ; greater_than : pair list }] in test example_tries; [%expect {| ((less_than ( ((fst ()) (snd ((() greetings)))) ((fst ()) (snd (((1) yo) ((2 3) hello)))) ((fst ()) (snd ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((fst (((1) yo) ((2 3) hello))) (snd ((() greetings)))) ((fst ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (snd ((() greetings)))) ((fst ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (snd (((1) yo) ((2 3) hello)))))) (equal_to ( ((fst ()) (snd ())) ((fst ((() greetings))) (snd ((() greetings)))) ((fst (((1) yo) ((2 3) hello))) (snd (((1) yo) ((2 3) hello)))) ((fst ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (snd ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))))) (greater_than ( ((fst ((() greetings))) (snd ())) ((fst ((() greetings))) (snd (((1) yo) ((2 3) hello)))) ((fst ((() greetings))) (snd ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((fst (((1) yo) ((2 3) hello))) (snd ())) ((fst (((1) yo) ((2 3) hello))) (snd ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((fst ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (snd ()))))) |}] ;; let is_empty = Trie.is_empty let%expect_test "is_empty" = let test trie = let is_empty = is_empty trie in print_s [%sexp { is_empty : bool; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((is_empty true) (trie ())) ((is_empty false) (trie ((() greetings)))) ((is_empty false) (trie (((1) yo) ((2 3) hello)))) ((is_empty false) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let length = Trie.length let%expect_test "length" = let test trie = let length = length trie in print_s [%sexp { length : int; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((length 0) (trie ())) ((length 1) (trie ((() greetings)))) ((length 2) (trie (((1) yo) ((2 3) hello)))) ((length 3) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let datum = Trie.datum let%expect_test "datum" = let test trie = let datum = datum trie in print_s [%sexp { datum : data option; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((datum ()) (trie ())) ((datum (greetings)) (trie ((() greetings)))) ((datum ()) (trie (((1) yo) ((2 3) hello)))) ((datum ()) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let tries = Trie.tries let%expect_test "tries" = let test trie = let tries = tries trie in print_s [%sexp { tries : data T.t Map.M(Int).t; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((tries ()) (trie ())) ((tries ()) (trie ((() greetings)))) ((tries ((1 ((() yo))) (2 (((3) hello))))) (trie (((1) yo) ((2 3) hello)))) ((tries ((1 ((() hi))) (2 ((() hello) ((3 4) "hello, world"))))) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let num_children = Trie.num_children let%expect_test "num_children" = let test trie = let num_children = num_children trie in print_s [%sexp { num_children : int; trie : data T.t }]; require_equal [%here] (module Int) num_children (Map.length (tries trie)) in List.iter example_tries ~f:test; [%expect {| ((num_children 0) (trie ())) ((num_children 0) (trie ((() greetings)))) ((num_children 2) (trie (((1) yo) ((2 3) hello)))) ((num_children 2) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let find_child = Trie.find_child let%expect_test "find_child" = let test trie = let child = find_child trie 2 in print_s [%sexp { child : data T.t option; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((child ()) (trie ())) ((child ()) (trie ((() greetings)))) ((child ((((3) hello)))) (trie (((1) yo) ((2 3) hello)))) ((child (((() hello) ((3 4) "hello, world")))) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let mem = Trie.mem let%expect_test "mem" = let trie = large_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; let test keychain = let present = mem trie keychain in print_s [%sexp { keychain : keychain; present : bool }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (present false)) ((keychain (1)) (present true)) ((keychain (2)) (present true)) ((keychain (2 3)) (present false)) ((keychain (2 3 4)) (present true)) ((keychain (100)) (present false)) ((keychain (100 200)) (present false)) |}] ;; let find = Trie.find let%expect_test "find" = let trie = large_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; let test keychain = let data = find trie keychain in print_s [%sexp { keychain : keychain; data : data option }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (data ())) ((keychain (1)) (data (hi))) ((keychain (2)) (data (hello))) ((keychain (2 3)) (data ())) ((keychain (2 3 4)) (data ("hello, world"))) ((keychain (100)) (data ())) ((keychain (100 200)) (data ())) |}] ;; let find_exn = Trie.find_exn let%expect_test "find_exn" = let trie = large_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; let test keychain = let data = Or_error.try_with (fun () -> find_exn trie keychain) in print_s [%sexp { keychain : keychain; data : data Or_error.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (data (Error ("Trie.find_exn: keychain not found" ((keychain ())))))) ((keychain (1)) (data (Ok hi))) ((keychain (2)) (data (Ok hello))) ((keychain (2 3)) (data (Error ("Trie.find_exn: keychain not found" ((keychain (2 3))))))) ((keychain (2 3 4)) (data (Ok "hello, world"))) ((keychain (100)) (data (Error ("Trie.find_exn: keychain not found" ((keychain (100))))))) ((keychain (100 200)) (data (Error ("Trie.find_exn: keychain not found" ((keychain (100 200))))))) |}] ;; let set = Trie.set let%expect_test "set" = let trie = medium_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) yo) ((2 3) hello)) |}]; let test ~keychain ~data = let trie = set trie ~keychain ~data in print_s [%sexp { keychain : keychain; data : data; trie : data T.t }] in List.iter example_key_lists ~f:(fun keychain -> test ~keychain ~data:"salutations"); [%expect {| ((keychain ()) (data salutations) (trie ((() salutations) ((1) yo) ((2 3) hello)))) ((keychain (1)) (data salutations) (trie (((1) salutations) ((2 3) hello)))) ((keychain (2)) (data salutations) (trie ( ((1) yo) ((2) salutations) ((2 3) hello)))) ((keychain (2 3)) (data salutations) (trie (((1) yo) ((2 3) salutations)))) ((keychain (2 3 4)) (data salutations) (trie (((1) yo) ((2 3) hello) ((2 3 4) salutations)))) ((keychain (100)) (data salutations) (trie (((1) yo) ((2 3) hello) ((100) salutations)))) ((keychain (100 200)) (data salutations) (trie ( ((1) yo) ((2 3) hello) ((100 200) salutations)))) |}] ;; let add = Trie.add let%expect_test "add" = let trie = medium_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) yo) ((2 3) hello)) |}]; let test ~keychain ~data = let trie = add trie ~keychain ~data in print_s [%sexp { keychain : keychain ; data : data ; trie : (data T.t, keychain) Or_duplicate.t }] in List.iter example_key_lists ~f:(fun keychain -> test ~keychain ~data:"salutations"); [%expect {| ((keychain ()) (data salutations) (trie (Ok ((() salutations) ((1) yo) ((2 3) hello))))) ((keychain (1)) (data salutations) (trie (Duplicate (1)))) ((keychain (2)) (data salutations) (trie ( Ok ( ((1) yo) ((2) salutations) ((2 3) hello))))) ((keychain (2 3)) (data salutations) (trie (Duplicate (2 3)))) ((keychain (2 3 4)) (data salutations) (trie (Ok (((1) yo) ((2 3) hello) ((2 3 4) salutations))))) ((keychain (100)) (data salutations) (trie (Ok (((1) yo) ((2 3) hello) ((100) salutations))))) ((keychain (100 200)) (data salutations) (trie ( Ok ( ((1) yo) ((2 3) hello) ((100 200) salutations))))) |}] ;; let add_or_error = Trie.add_or_error let%expect_test "add_or_error" = let trie = medium_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) yo) ((2 3) hello)) |}]; let test ~keychain ~data = let trie = add_or_error trie ~keychain ~data in print_s [%sexp { keychain : keychain; data : data; trie : data T.t Or_error.t }] in List.iter example_key_lists ~f:(fun keychain -> test ~keychain ~data:"salutations"); [%expect {| ((keychain ()) (data salutations) (trie (Ok ((() salutations) ((1) yo) ((2 3) hello))))) ((keychain (1)) (data salutations) (trie (Error ("Trie.add_exn: duplicate keychain" ((keychain (1))))))) ((keychain (2)) (data salutations) (trie ( Ok ( ((1) yo) ((2) salutations) ((2 3) hello))))) ((keychain (2 3)) (data salutations) (trie (Error ("Trie.add_exn: duplicate keychain" ((keychain (2 3))))))) ((keychain (2 3 4)) (data salutations) (trie (Ok (((1) yo) ((2 3) hello) ((2 3 4) salutations))))) ((keychain (100)) (data salutations) (trie (Ok (((1) yo) ((2 3) hello) ((100) salutations))))) ((keychain (100 200)) (data salutations) (trie ( Ok ( ((1) yo) ((2 3) hello) ((100 200) salutations))))) |}] ;; let add_exn = Trie.add_exn let%expect_test "add_exn" = let trie = medium_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) yo) ((2 3) hello)) |}]; let test ~keychain ~data = let trie = Or_error.try_with (fun () -> add_exn trie ~keychain ~data) in print_s [%sexp { keychain : keychain; data : data; trie : data T.t Or_error.t }] in List.iter example_key_lists ~f:(fun keychain -> test ~keychain ~data:"salutations"); [%expect {| ((keychain ()) (data salutations) (trie (Ok ((() salutations) ((1) yo) ((2 3) hello))))) ((keychain (1)) (data salutations) (trie (Error ("Trie.add_exn: duplicate keychain" ((keychain (1))))))) ((keychain (2)) (data salutations) (trie ( Ok ( ((1) yo) ((2) salutations) ((2 3) hello))))) ((keychain (2 3)) (data salutations) (trie (Error ("Trie.add_exn: duplicate keychain" ((keychain (2 3))))))) ((keychain (2 3 4)) (data salutations) (trie (Ok (((1) yo) ((2 3) hello) ((2 3 4) salutations))))) ((keychain (100)) (data salutations) (trie (Ok (((1) yo) ((2 3) hello) ((100) salutations))))) ((keychain (100 200)) (data salutations) (trie ( Ok ( ((1) yo) ((2 3) hello) ((100 200) salutations))))) |}] ;; let remove = Trie.remove let%expect_test "remove" = let trie = large_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; let test keychain = let trie = remove trie keychain in print_s [%sexp { keychain : keychain; trie : data T.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((keychain (1)) (trie (((2) hello) ((2 3 4) "hello, world")))) ((keychain (2)) (trie (((1) hi) ((2 3 4) "hello, world")))) ((keychain (2 3)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((keychain (2 3 4)) (trie ( ((1) hi) ((2) hello)))) ((keychain (100)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((keychain (100 200)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let change = Trie.change let%expect_test "change" = let trie = large_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; let test keychain = let trie = change trie keychain ~f:(function | None -> Some "Salutations!" | Some "hi" -> None | Some other -> Some (String.capitalize other ^ "!")) in print_s [%sexp { keychain : keychain; trie : data T.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie ( (() Salutations!) ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((keychain (1)) (trie (((2) hello) ((2 3 4) "hello, world")))) ((keychain (2)) (trie ( ((1) hi) ((2) Hello!) ((2 3 4) "hello, world")))) ((keychain (2 3)) (trie ( ((1) hi) ((2) hello) ((2 3) Salutations!) ((2 3 4) "hello, world")))) ((keychain (2 3 4)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "Hello, world!")))) ((keychain (100)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100) Salutations!)))) ((keychain (100 200)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100 200) Salutations!)))) |}] ;; let update = Trie.update let%expect_test "update" = let trie = large_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; let test keychain = let trie = update trie keychain ~f:(function | None -> "Salutations!" | Some other -> String.capitalize other ^ "!") in print_s [%sexp { keychain : keychain; trie : data T.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie ( (() Salutations!) ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((keychain (1)) (trie ( ((1) Hi!) ((2) hello) ((2 3 4) "hello, world")))) ((keychain (2)) (trie ( ((1) hi) ((2) Hello!) ((2 3 4) "hello, world")))) ((keychain (2 3)) (trie ( ((1) hi) ((2) hello) ((2 3) Salutations!) ((2 3 4) "hello, world")))) ((keychain (2 3 4)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "Hello, world!")))) ((keychain (100)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100) Salutations!)))) ((keychain (100 200)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100 200) Salutations!)))) |}] ;; let add_multi = Trie.add_multi let%expect_test "add_multi" = let trie = large_example_trie_multi in print_s [%sexp (trie : data list T.t)]; [%expect {| (((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))) |}]; let test keychain = let trie = add_multi trie ~keychain ~data:"Salutations" in print_s [%sexp { keychain : keychain; trie : data list T.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie ( (() (Salutations)) ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) ((keychain (1)) (trie ( ((1) (Salutations hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) ((keychain (2)) (trie ( ((1) (hi HI)) ((2) (Salutations hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) ((keychain (2 3)) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3) (Salutations)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) ((keychain (2 3 4)) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) (Salutations "hello, world" "HELLO, WORLD"))))) ((keychain (100)) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD")) ((100) (Salutations))))) ((keychain (100 200)) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD")) ((100 200) (Salutations))))) |}] ;; let remove_multi = Trie.remove_multi let%expect_test "remove_multi" = let trie = large_example_trie_multi in print_s [%sexp (trie : data list T.t)]; [%expect {| (((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))) |}]; let test keychain = let trie = remove_multi trie keychain in print_s [%sexp { keychain : keychain; trie : data list T.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) ((keychain (1)) (trie ( ((1) (HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) ((keychain (2)) (trie ( ((1) (hi HI)) ((2) (HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) ((keychain (2 3)) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) ((keychain (2 3 4)) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("HELLO, WORLD"))))) ((keychain (100)) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) ((keychain (100 200)) (trie ( ((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))))) |}] ;; let find_multi = Trie.find_multi let%expect_test "find_multi" = let trie = large_example_trie_multi in print_s [%sexp (trie : data list T.t)]; [%expect {| (((1) (hi HI)) ((2) (hello HELLO)) ((2 3 4) ("hello, world" "HELLO, WORLD"))) |}]; let test keychain = let data = find_multi trie keychain in print_s [%sexp { keychain : keychain; data : data list }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (data ())) ((keychain (1)) (data (hi HI))) ((keychain (2)) (data (hello HELLO))) ((keychain (2 3)) (data ())) ((keychain (2 3 4)) (data ("hello, world" "HELLO, WORLD"))) ((keychain (100)) (data ())) ((keychain (100 200)) (data ())) |}] ;; let mem_trie = Trie.mem_trie let%expect_test "mem_trie" = let trie = large_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; let test keychain = let present = mem_trie trie keychain in print_s [%sexp { keychain : keychain; present : bool }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (present true)) ((keychain (1)) (present true)) ((keychain (2)) (present true)) ((keychain (2 3)) (present true)) ((keychain (2 3 4)) (present true)) ((keychain (100)) (present false)) ((keychain (100 200)) (present false)) |}] ;; let find_trie = Trie.find_trie let%expect_test "find_trie" = let trie = large_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; let test keychain = let trie = find_trie trie keychain in print_s [%sexp { keychain : keychain; trie : data T.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((keychain (1)) (trie ((() hi)))) ((keychain (2)) (trie ((() hello) ((3 4) "hello, world")))) ((keychain (2 3)) (trie (((4) "hello, world")))) ((keychain (2 3 4)) (trie ((() "hello, world")))) ((keychain (100)) (trie ())) ((keychain (100 200)) (trie ())) |}] ;; let set_trie = Trie.set_trie let%expect_test "set_trie" = print_s [%sexp (large_example_trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; print_s [%sexp (small_example_trie : data T.t)]; [%expect {| ((() greetings)) |}]; let test keychain = let trie = set_trie large_example_trie ~keychain ~trie:small_example_trie in print_s [%sexp { keychain : keychain; trie : data T.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie ((() greetings)))) ((keychain (1)) (trie ( ((1) greetings) ((2) hello) ((2 3 4) "hello, world")))) ((keychain (2)) (trie ( ((1) hi) ((2) greetings)))) ((keychain (2 3)) (trie ( ((1) hi) ((2) hello) ((2 3) greetings)))) ((keychain (2 3 4)) (trie ( ((1) hi) ((2) hello) ((2 3 4) greetings)))) ((keychain (100)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100) greetings)))) ((keychain (100 200)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100 200) greetings)))) |}] ;; let add_trie = Trie.add_trie let%expect_test "add_trie" = print_s [%sexp (large_example_trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; print_s [%sexp (small_example_trie : data T.t)]; [%expect {| ((() greetings)) |}]; let test keychain = let trie = add_trie large_example_trie ~keychain ~trie:small_example_trie in print_s [%sexp { keychain : keychain; trie : (data T.t, keychain) Or_duplicate.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie (Duplicate ()))) ((keychain (1)) (trie (Duplicate (1)))) ((keychain (2)) (trie (Duplicate (2)))) ((keychain (2 3)) (trie (Duplicate (2 3)))) ((keychain (2 3 4)) (trie (Duplicate (2 3 4)))) ((keychain (100)) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100) greetings))))) ((keychain (100 200)) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100 200) greetings))))) |}] ;; let add_trie_or_error = Trie.add_trie_or_error let%expect_test "add_trie_or_error" = print_s [%sexp (large_example_trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; print_s [%sexp (small_example_trie : data T.t)]; [%expect {| ((() greetings)) |}]; let test keychain = let trie = add_trie_or_error large_example_trie ~keychain ~trie:small_example_trie in print_s [%sexp { keychain : keychain; trie : data T.t Or_error.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie (Error ("Trie.add_trie_exn: duplicate keychain" ((keychain ())))))) ((keychain (1)) (trie (Error ("Trie.add_trie_exn: duplicate keychain" ((keychain (1))))))) ((keychain (2)) (trie (Error ("Trie.add_trie_exn: duplicate keychain" ((keychain (2))))))) ((keychain (2 3)) (trie (Error ("Trie.add_trie_exn: duplicate keychain" ((keychain (2 3))))))) ((keychain (2 3 4)) (trie (Error ("Trie.add_trie_exn: duplicate keychain" ((keychain (2 3 4))))))) ((keychain (100)) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100) greetings))))) ((keychain (100 200)) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100 200) greetings))))) |}] ;; let add_trie_exn = Trie.add_trie_exn let%expect_test "add_trie_exn" = print_s [%sexp (large_example_trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; print_s [%sexp (small_example_trie : data T.t)]; [%expect {| ((() greetings)) |}]; let test keychain = let trie = Or_error.try_with (fun () -> add_trie_exn large_example_trie ~keychain ~trie:small_example_trie) in print_s [%sexp { keychain : keychain; trie : data T.t Or_error.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie (Error ("Trie.add_trie_exn: duplicate keychain" ((keychain ())))))) ((keychain (1)) (trie (Error ("Trie.add_trie_exn: duplicate keychain" ((keychain (1))))))) ((keychain (2)) (trie (Error ("Trie.add_trie_exn: duplicate keychain" ((keychain (2))))))) ((keychain (2 3)) (trie (Error ("Trie.add_trie_exn: duplicate keychain" ((keychain (2 3))))))) ((keychain (2 3 4)) (trie (Error ("Trie.add_trie_exn: duplicate keychain" ((keychain (2 3 4))))))) ((keychain (100)) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100) greetings))))) ((keychain (100 200)) (trie ( Ok ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100 200) greetings))))) |}] ;; let update_trie = Trie.update_trie let%expect_test "update_trie" = let trie = large_example_trie in print_s [%sexp (trie : data T.t)]; [%expect {| (((1) hi) ((2) hello) ((2 3 4) "hello, world")) |}]; let test keychain = let trie = update_trie trie keychain ~f:(fun trie -> create keychainable ~datum:(Some "update") ~tries:(Map.singleton comparator_m 0 trie)) in print_s [%sexp { keychain : keychain; trie : data T.t }] in List.iter example_key_lists ~f:test; [%expect {| ((keychain ()) (trie ( (() update) ((0 1) hi) ((0 2) hello) ((0 2 3 4) "hello, world")))) ((keychain (1)) (trie (((1) update) ((1 0) hi) ((2) hello) ((2 3 4) "hello, world")))) ((keychain (2)) (trie ( ((1) hi) ((2) update) ((2 0) hello) ((2 0 3 4) "hello, world")))) ((keychain (2 3)) (trie ( ((1) hi) ((2) hello) ((2 3) update) ((2 3 0 4) "hello, world")))) ((keychain (2 3 4)) (trie ( ((1) hi) ((2) hello) ((2 3 4) update) ((2 3 4 0) "hello, world")))) ((keychain (100)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100) update)))) ((keychain (100 200)) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world") ((100 200) update)))) |}] ;; let keychains = Trie.keychains let%expect_test "keys" = let test trie = let keychains = keychains trie in print_s [%sexp { keychains : keychain list; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((keychains ()) (trie ())) ((keychains (())) (trie ((() greetings)))) ((keychains ((1) (2 3))) (trie (((1) yo) ((2 3) hello)))) ((keychains ( (1) (2) (2 3 4))) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let data = Trie.data let%expect_test "data" = let test trie = let data = data trie in print_s [%sexp { data : data list; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((data ()) (trie ())) ((data (greetings)) (trie ((() greetings)))) ((data (yo hello)) (trie (((1) yo) ((2 3) hello)))) ((data (hi hello "hello, world")) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let to_alist = Trie.to_alist let%expect_test "to_alist" = let test trie = let alist = to_alist trie in print_s [%sexp { trie : data T.t; alist : (keychain * data) list }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (alist ())) ((trie ((() greetings))) (alist ((() greetings)))) ((trie (((1) yo) ((2 3) hello))) (alist (((1) yo) ((2 3) hello)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (alist ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let to_sequence = Trie.to_sequence let%expect_test "to_sequence" = let test trie = let sequence = to_sequence trie in print_s [%sexp { trie : data T.t; sequence : (keychain * data) Sequence.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (sequence ())) ((trie ((() greetings))) (sequence ((() greetings)))) ((trie (((1) yo) ((2 3) hello))) (sequence (((1) yo) ((2 3) hello)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (sequence ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let iter = Trie.iter let%expect_test "iter" = let test i trie = if i > 0 then print_endline "--"; print_s [%sexp { trie : data T.t }]; iter trie ~f:(fun data -> print_s [%sexp (data : data)]) in List.iteri example_tries ~f:test; [%expect {| ((trie ())) -- ((trie ((() greetings)))) greetings -- ((trie (((1) yo) ((2 3) hello)))) yo hello -- (( trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) hi hello "hello, world" |}] ;; let iter_keychains = Trie.iter_keychains let%expect_test "iter_keychains" = let test i trie = if i > 0 then print_endline "--"; print_s [%sexp { trie : data T.t }]; iter_keychains trie ~f:(fun keychain -> print_s [%sexp (keychain : keychain)]) in List.iteri example_tries ~f:test; [%expect {| ((trie ())) -- ((trie ((() greetings)))) () -- ((trie (((1) yo) ((2 3) hello)))) (1) (2 3) -- (( trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) (1) (2) (2 3 4) |}] ;; let iteri = Trie.iteri let%expect_test "iteri" = let test i trie = if i > 0 then print_endline "--"; print_s [%sexp { trie : data T.t }]; iteri trie ~f:(fun ~keychain ~data -> print_s [%sexp { keychain : keychain; data : data }]) in List.iteri example_tries ~f:test; [%expect {| ((trie ())) -- ((trie ((() greetings)))) ((keychain ()) (data greetings)) -- ((trie (((1) yo) ((2 3) hello)))) ((keychain (1)) (data yo)) ((keychain (2 3)) (data hello)) -- (( trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((keychain (1)) (data hi)) ((keychain (2)) (data hello)) ((keychain (2 3 4)) (data "hello, world")) |}] ;; let fold = Trie.fold let%expect_test "fold" = let test trie = let string = fold trie ~init:"..." ~f:(fun acc data -> data ^ "; " ^ acc) in print_s [%sexp { trie : data T.t; string : string }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (string ...)) ((trie ((() greetings))) (string "greetings; ...")) ((trie (((1) yo) ((2 3) hello))) (string "hello; yo; ...")) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (string "hello, world; hello; hi; ...")) |}] ;; let foldi = Trie.foldi let%expect_test "foldi" = let test trie = let string = foldi trie ~init:"..." ~f:(fun acc ~keychain ~data -> Printf.sprintf "%s=%s; %s" (String.concat ~sep:"." (List.map keychain ~f:Int.to_string)) data acc) in print_s [%sexp { trie : data T.t; string : string }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (string ...)) ((trie ((() greetings))) (string "=greetings; ...")) ((trie (((1) yo) ((2 3) hello))) (string "2.3=hello; 1=yo; ...")) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (string "2.3.4=hello, world; 2=hello; 1=hi; ...")) |}] ;; let map = Trie.map let%expect_test "map" = let test trie = let mapped = map trie ~f:String.uppercase in print_s [%sexp { trie : data T.t; mapped : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (mapped ())) ((trie ((() greetings))) (mapped ((() GREETINGS)))) ((trie (((1) yo) ((2 3) hello))) (mapped (((1) YO) ((2 3) HELLO)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (mapped ( ((1) HI) ((2) HELLO) ((2 3 4) "HELLO, WORLD")))) |}] ;; let mapi = Trie.mapi let%expect_test "mapi" = let test trie = let mapped = mapi trie ~f:(fun ~keychain ~data -> Printf.sprintf "%s @ depth %d" data (List.length keychain)) in print_s [%sexp { trie : data T.t; mapped : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (mapped ())) ((trie ((() greetings))) (mapped ((() "greetings @ depth 0")))) ((trie (((1) yo) ((2 3) hello))) (mapped (((1) "yo @ depth 1") ((2 3) "hello @ depth 2")))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (mapped ( ((1) "hi @ depth 1") ((2) "hello @ depth 1") ((2 3 4) "hello, world @ depth 3")))) |}] ;; let filter = Trie.filter let%expect_test "filter" = let test trie = let filtered = filter trie ~f:(fun string -> String.length string % 2 = 0) in print_s [%sexp { trie : data T.t; filtered : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (filtered ())) ((trie ((() greetings))) (filtered ())) ((trie (((1) yo) ((2 3) hello))) (filtered (((1) yo)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (filtered (((1) hi) ((2 3 4) "hello, world")))) |}] ;; let filter_keychains = Trie.filter_keychains let%expect_test "filter_keychains" = let test trie = let filtered = filter_keychains trie ~f:(fun keychain -> List.length keychain % 2 = 0) in print_s [%sexp { trie : data T.t; filtered : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (filtered ())) ((trie ((() greetings))) (filtered ((() greetings)))) ((trie (((1) yo) ((2 3) hello))) (filtered (((2 3) hello)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (filtered ())) |}] ;; let filteri = Trie.filteri let%expect_test "filteri" = let test trie = let filtered = filteri trie ~f:(fun ~keychain ~data -> List.length keychain % 2 = 0 || String.length data % 5 = 0) in print_s [%sexp { trie : data T.t; filtered : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (filtered ())) ((trie ((() greetings))) (filtered ((() greetings)))) ((trie (((1) yo) ((2 3) hello))) (filtered (((2 3) hello)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (filtered (((2) hello)))) |}] ;; let filter_map = Trie.filter_map let%expect_test "filter_map" = let test trie = let filtered = filter_map trie ~f:(fun data -> String.chop_prefix data ~prefix:"h") in print_s [%sexp { trie : data T.t; filtered : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (filtered ())) ((trie ((() greetings))) (filtered ())) ((trie (((1) yo) ((2 3) hello))) (filtered (((2 3) ello)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (filtered ( ((1) i) ((2) ello) ((2 3 4) "ello, world")))) |}] ;; let filter_mapi = Trie.filter_mapi let%expect_test "filter_mapi" = let test trie = let filtered = filter_mapi trie ~f:(fun ~keychain ~data -> if List.length keychain % 2 = 0 then String.chop_prefix data ~prefix:"h" else None) in print_s [%sexp { trie : data T.t; filtered : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (filtered ())) ((trie ((() greetings))) (filtered ())) ((trie (((1) yo) ((2 3) hello))) (filtered (((2 3) ello)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (filtered ())) |}] ;; let for_all = Trie.for_all let%expect_test "for_all" = let test trie = let success = for_all trie ~f:(fun data -> String.is_prefix data ~prefix:"h") in print_s [%sexp { success : bool; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((success true) (trie ())) ((success false) (trie ((() greetings)))) ((success false) (trie (((1) yo) ((2 3) hello)))) ((success true) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let for_alli = Trie.for_alli let%expect_test "for_alli" = let test trie = let success = for_alli trie ~f:(fun ~keychain ~data -> List.length keychain % 2 = 0 && String.is_prefix data ~prefix:"h") in print_s [%sexp { success : bool; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((success true) (trie ())) ((success false) (trie ((() greetings)))) ((success false) (trie (((1) yo) ((2 3) hello)))) ((success false) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let exists = Trie.exists let%expect_test "exists" = let test trie = let success = exists trie ~f:(fun data -> String.is_prefix data ~prefix:"h") in print_s [%sexp { success : bool; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((success false) (trie ())) ((success false) (trie ((() greetings)))) ((success true) (trie (((1) yo) ((2 3) hello)))) ((success true) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let existsi = Trie.existsi let%expect_test "existsi" = let test trie = let success = existsi trie ~f:(fun ~keychain ~data -> List.length keychain % 2 = 0 && String.is_prefix data ~prefix:"h") in print_s [%sexp { success : bool; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((success false) (trie ())) ((success false) (trie ((() greetings)))) ((success true) (trie (((1) yo) ((2 3) hello)))) ((success false) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let count = Trie.count let%expect_test "count" = let test trie = let count = count trie ~f:(fun data -> String.is_prefix data ~prefix:"h") in print_s [%sexp { count : int; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((count 0) (trie ())) ((count 0) (trie ((() greetings)))) ((count 1) (trie (((1) yo) ((2 3) hello)))) ((count 3) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let counti = Trie.counti let%expect_test "counti" = let test trie = let count = counti trie ~f:(fun ~keychain ~data -> List.length keychain % 2 = 0 && String.is_prefix data ~prefix:"h") in print_s [%sexp { count : int; trie : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((count 0) (trie ())) ((count 0) (trie ((() greetings)))) ((count 1) (trie (((1) yo) ((2 3) hello)))) ((count 0) (trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let partition_tf = Trie.partition_tf let%expect_test "partition_tf" = let test trie = let success, failure = partition_tf trie ~f:(fun data -> String.is_prefix data ~prefix:"h") in print_s [%sexp { trie : data T.t; success : data T.t; failure : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (success ()) (failure ())) ((trie ((() greetings))) (success ()) (failure ((() greetings)))) ((trie (((1) yo) ((2 3) hello))) (success (((2 3) hello))) (failure (((1) yo)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (success ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (failure ())) |}] ;; let partitioni_tf = Trie.partitioni_tf let%expect_test "partitioni_tf" = let test trie = let success, failure = partitioni_tf trie ~f:(fun ~keychain ~data -> List.length keychain % 2 = 0 && String.is_prefix data ~prefix:"h") in print_s [%sexp { trie : data T.t; success : data T.t; failure : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (success ()) (failure ())) ((trie ((() greetings))) (success ()) (failure ((() greetings)))) ((trie (((1) yo) ((2 3) hello))) (success (((2 3) hello))) (failure (((1) yo)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (success ()) (failure ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let partition_map = Trie.partition_map let%expect_test "partition_map" = let test trie = let success, failure = partition_map trie ~f:(fun data -> match String.chop_prefix data ~prefix:"h" with | Some suffix -> First suffix | None -> Second data) in print_s [%sexp { trie : data T.t; success : data T.t; failure : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (success ()) (failure ())) ((trie ((() greetings))) (success ()) (failure ((() greetings)))) ((trie (((1) yo) ((2 3) hello))) (success (((2 3) ello))) (failure (((1) yo)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (success ( ((1) i) ((2) ello) ((2 3 4) "ello, world"))) (failure ())) |}] ;; let partition_mapi = Trie.partition_mapi let%expect_test "partition_mapi" = let test trie = let success, failure = partition_mapi trie ~f:(fun ~keychain ~data -> match String.chop_prefix data ~prefix:"h" with | Some suffix when List.length keychain % 2 = 0 -> First suffix | Some _ | None -> Second data) in print_s [%sexp { trie : data T.t; success : data T.t; failure : data T.t }] in List.iter example_tries ~f:test; [%expect {| ((trie ()) (success ()) (failure ())) ((trie ((() greetings))) (success ()) (failure ((() greetings)))) ((trie (((1) yo) ((2 3) hello))) (success (((2 3) ello))) (failure (((1) yo)))) ((trie ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (success ()) (failure ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) |}] ;; let merge = Trie.merge let%expect_test "merge" = let test_pair (left, right) = let merged = merge left right ~f:(fun ~keychain variant -> Some (keychain, variant)) in print_s [%sexp { left : data T.t ; right : data T.t ; merged : ( keychain , keychain * [ `Left of data | `Right of data | `Both of data * data ] , _ ) t }] in let test tries = List.iter (List.cartesian_product tries tries) ~f:test_pair in test example_tries; [%expect {| ((left ()) (right ()) (merged ())) ((left ()) (right ((() greetings))) (merged ((() (() (Right greetings)))))) ((left ()) (right (((1) yo) ((2 3) hello))) (merged ( ((1) ((1) (Right yo))) ((2 3) ((2 3) (Right hello)))))) ((left ()) (right ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (merged ( ((1) ((1) (Right hi))) ((2) ((2) (Right hello))) ((2 3 4) ((2 3 4) (Right "hello, world")))))) ((left ((() greetings))) (right ()) (merged ((() (() (Left greetings)))))) ((left ((() greetings))) (right ((() greetings))) (merged ((() (() (Both (greetings greetings))))))) ((left ((() greetings))) (right (((1) yo) ((2 3) hello))) (merged ( (() (() (Left greetings))) ((1) ((1) (Right yo))) ((2 3) ((2 3) (Right hello)))))) ((left ((() greetings))) (right ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (merged ( (() (() (Left greetings))) ((1) ((1) (Right hi))) ((2) ((2) (Right hello))) ((2 3 4) ((2 3 4) (Right "hello, world")))))) ((left (((1) yo) ((2 3) hello))) (right ()) (merged ( ((1) ((1) (Left yo))) ((2 3) ((2 3) (Left hello)))))) ((left (((1) yo) ((2 3) hello))) (right ((() greetings))) (merged ( (() (() (Right greetings))) ((1) ((1) (Left yo))) ((2 3) ((2 3) (Left hello)))))) ((left (((1) yo) ((2 3) hello))) (right (((1) yo) ((2 3) hello))) (merged (((1) ((1) (Both (yo yo)))) ((2 3) ((2 3) (Both (hello hello))))))) ((left (((1) yo) ((2 3) hello))) (right ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (merged ( ((1) ((1) (Both (yo hi)))) ((2) ((2) (Right hello))) ((2 3) ((2 3) (Left hello))) ((2 3 4) ((2 3 4) (Right "hello, world")))))) ((left ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (right ()) (merged ( ((1) ((1) (Left hi))) ((2) ((2) (Left hello))) ((2 3 4) ((2 3 4) (Left "hello, world")))))) ((left ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (right ((() greetings))) (merged ( (() (() (Right greetings))) ((1) ((1) (Left hi))) ((2) ((2) (Left hello))) ((2 3 4) ((2 3 4) (Left "hello, world")))))) ((left ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (right (((1) yo) ((2 3) hello))) (merged ( ((1) ((1) (Both (hi yo)))) ((2) ((2) (Left hello))) ((2 3) ((2 3) (Right hello))) ((2 3 4) ((2 3 4) (Left "hello, world")))))) ((left ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (right ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (merged ( ((1) ((1) (Both (hi hi)))) ((2) ((2) (Both (hello hello)))) ((2 3 4) ((2 3 4) (Both ("hello, world" "hello, world"))))))) |}] ;; let merge_skewed = Trie.merge_skewed let%expect_test "merge_skewed" = let test_pair (left, right) = let merged = merge_skewed left right ~combine:(fun ~keychain data1 data2 -> let sep = if List.length keychain % 2 = 0 then ", " else "; " in data1 ^ sep ^ data2) in print_s [%sexp { left : data T.t; right : data T.t; merged : data T.t }] in let test tries = List.iter (List.cartesian_product tries tries) ~f:test_pair in test example_tries; [%expect {| ((left ()) (right ()) (merged ())) ((left ()) (right ((() greetings))) (merged ((() greetings)))) ((left ()) (right (((1) yo) ((2 3) hello))) (merged (((1) yo) ((2 3) hello)))) ((left ()) (right ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (merged ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((left ((() greetings))) (right ()) (merged ((() greetings)))) ((left ((() greetings))) (right ((() greetings))) (merged ((() "greetings, greetings")))) ((left ((() greetings))) (right (((1) yo) ((2 3) hello))) (merged ((() greetings) ((1) yo) ((2 3) hello)))) ((left ((() greetings))) (right ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (merged ( (() greetings) ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((left (((1) yo) ((2 3) hello))) (right ()) (merged (((1) yo) ((2 3) hello)))) ((left (((1) yo) ((2 3) hello))) (right ((() greetings))) (merged ((() greetings) ((1) yo) ((2 3) hello)))) ((left (((1) yo) ((2 3) hello))) (right (((1) yo) ((2 3) hello))) (merged (((1) "yo; yo") ((2 3) "hello, hello")))) ((left (((1) yo) ((2 3) hello))) (right ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (merged ( ((1) "yo; hi") ((2) hello) ((2 3) hello) ((2 3 4) "hello, world")))) ((left ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (right ()) (merged ( ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((left ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (right ((() greetings))) (merged ( (() greetings) ((1) hi) ((2) hello) ((2 3 4) "hello, world")))) ((left ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (right (((1) yo) ((2 3) hello))) (merged ( ((1) "hi; yo") ((2) hello) ((2 3) hello) ((2 3 4) "hello, world")))) ((left ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (right ( ((1) hi) ((2) hello) ((2 3 4) "hello, world"))) (merged ( ((1) "hi; hi") ((2) "hello; hello") ((2 3 4) "hello, world; hello, world")))) |}] ;; end : module type of struct include Trie end)) ;;
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>