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
|
#include "lang.h"
#ifdef FRT_RUBY_VERSION_1_9
# include <ruby/re.h>
#else
# include <regex.h>
#endif
#include <locale.h>
#ifdef FRT_RUBY_VERSION_1_9
# include <ruby/st.h>
#else
# include <st.h>
#endif
#include "ferret.h"
#include "analysis.h"
static char *frb_locale = NULL;
static VALUE mAnalysis;
static VALUE cToken;
static VALUE cAsciiLetterTokenizer;
static VALUE cLetterTokenizer;
static VALUE cAsciiWhiteSpaceTokenizer;
static VALUE cWhiteSpaceTokenizer;
static VALUE cAsciiStandardTokenizer;
static VALUE cStandardTokenizer;
static VALUE cRegExpTokenizer;
static VALUE cAsciiLowerCaseFilter;
static VALUE cLowerCaseFilter;
static VALUE cStopFilter;
static VALUE cMappingFilter;
static VALUE cHyphenFilter;
static VALUE cStemFilter;
static VALUE cAnalyzer;
static VALUE cAsciiLetterAnalyzer;
static VALUE cLetterAnalyzer;
static VALUE cAsciiWhiteSpaceAnalyzer;
static VALUE cWhiteSpaceAnalyzer;
static VALUE cAsciiStandardAnalyzer;
static VALUE cStandardAnalyzer;
static VALUE cPerFieldAnalyzer;
static VALUE cRegExpAnalyzer;
static VALUE cTokenStream;
/* TokenStream Methods */
static ID id_next;
static ID id_reset;
static ID id_clone;
static ID id_text;
/* Analyzer Methods */
static ID id_token_stream;
static VALUE object_space;
#ifndef FRT_RUBY_VERSION_1_9
extern int ruby_re_search(struct re_pattern_buffer *, const char *, int, int,
int, struct re_registers *);
#endif
int
frb_rb_hash_size(VALUE hash)
{
#ifdef FRT_RUBY_VERSION_1_9
return RHASH(hash)->ntbl->num_entries;
#else
return RHASH(hash)->tbl->num_entries;
#endif
}
/****************************************************************************
*
* Utility Methods
*
****************************************************************************/
static char **
get_stopwords(VALUE rstop_words)
{
char **stop_words;
int i, len;
VALUE rstr;
Check_Type(rstop_words, T_ARRAY);
len = RARRAY_LEN(rstop_words);
stop_words = ALLOC_N(char *, RARRAY_LEN(rstop_words) + 1);
stop_words[len] = NULL;
for (i = 0; i < len; i++) {
rstr = rb_obj_as_string(RARRAY_PTR(rstop_words)[i]);
stop_words[i] = rs2s(rstr);
}
return stop_words;
}
/****************************************************************************
*
* token methods
*
****************************************************************************/
typedef struct RToken {
VALUE text;
int start;
int end;
int pos_inc;
} RToken;
static void
frb_token_free(void *p)
{
free(p);
}
static void
frb_token_mark(void *p)
{
RToken *token = (RToken *)p;
rb_gc_mark(token->text);
}
static VALUE
frb_token_alloc(VALUE klass)
{
return Data_Wrap_Struct(klass, &frb_token_mark, &frb_token_free,
ALLOC(RToken));
}
static VALUE
get_token(Token *tk)
{
RToken *token = ALLOC(RToken);
token->text = rb_str_new2(tk->text);
token->start = tk->start;
token->end = tk->end;
token->pos_inc = tk->pos_inc;
return Data_Wrap_Struct(cToken, &frb_token_mark, &frb_token_free, token);
}
Token *
frb_set_token(Token *tk, VALUE rt)
{
RToken *rtk;
if (rt == Qnil) return NULL;
Data_Get_Struct(rt, RToken, rtk);
tk_set(tk, rs2s(rtk->text), RSTRING_LEN(rtk->text),
rtk->start, rtk->end, rtk->pos_inc);
return tk;
}
#define GET_TK(tk, self) Data_Get_Struct(self, RToken, tk)
/*
* call-seq:
* Token.new(text, start, end, pos_inc = 1) -> new Token
*
* Creates a new token setting the text, start and end offsets of the token
* and the position increment for the token.
*
* The position increment is usually set to 1 but you can set it to other
* values as needed. For example, if you have a stop word filter you will be
* skipping tokens. Let's say you have the stop words "the" and "and" and you
* parse the title "The Old Man and the Sea". The terms "Old", "Man" and
* "Sea" will have the position increments 2, 1 and 3 respectively.
*
* Another reason you might want to vary the position increment is if you are
* adding synonyms to the index. For example let's say you have the synonym
* group "quick", "fast" and "speedy". When tokenizing the phrase "Next day
* speedy delivery", you'll add "speedy" first with a position increment of 1
* and then "fast" and "quick" with position increments of 0 since they are
* represented in the same position.
*
* The offset set values +start+ and +end+ should be byte offsets, not
* character offsets. This makes it easy to use those offsets to quickly
* access the token in the input string and also to insert highlighting tags
* when necessary.
*
* text:: the main text for the token.
* start:: the start offset of the token in bytes.
* end:: the end offset of the token in bytes.
* pos_inc:: the position increment of a token. See above.
* return:: a newly created and assigned Token object
*/
static VALUE
frb_token_init(int argc, VALUE *argv, VALUE self)
{
RToken *token;
VALUE rtext, rstart, rend, rpos_inc, rtype;
GET_TK(token, self);
token->pos_inc = 1;
switch (rb_scan_args(argc, argv, "32", &rtext, &rstart,
&rend, &rpos_inc, &rtype)) {
case 5: /* type gets ignored at this stage */
case 4: token->pos_inc = FIX2INT(rpos_inc);
}
token->text = rb_obj_as_string(rtext);
token->start = FIX2INT(rstart);
token->end = FIX2INT(rend);
return self;
}
/*
* call-seq:
* token.cmp(other_token) -> bool
*
* Used to compare two tokens. Token is extended by Comparable so you can
* also use +<+, +>+, +<=+, +>=+ etc. to compare tokens.
*
* Tokens are sorted by the position in the text at which they occur, ie
* the start offset. If two tokens have the same start offset, (see
* pos_inc=) then, they are sorted by the end offset and then
* lexically by the token text.
*/
static VALUE
frb_token_cmp(VALUE self, VALUE rother)
{
RToken *token, *other;
int cmp;
GET_TK(token, self);
GET_TK(other, rother);
if (token->start > other->start) {
cmp = 1;
} else if (token->start < other->start) {
cmp = -1;
} else {
if (token->end > other->end) {
cmp = 1;
} else if (token->end < other->end) {
cmp = -1;
} else {
cmp = strcmp(rs2s(token->text), rs2s(other->text));
}
}
return INT2FIX(cmp);
}
/*
* call-seq:
* token.text -> text
*
* Returns the text that this token represents
*/
static VALUE
frb_token_get_text(VALUE self)
{
RToken *token;
GET_TK(token, self);
return token->text;
}
/*
* call-seq:
* token.text = text -> text
*
* Set the text for this token.
*/
static VALUE
frb_token_set_text(VALUE self, VALUE rtext)
{
RToken *token;
GET_TK(token, self);
token->text = rtext;
return rtext;
}
/*
* call-seq:
* token.start -> integer
*
* Start byte-position of this token
*/
static VALUE
frb_token_get_start_offset(VALUE self)
{
RToken *token;
GET_TK(token, self);
return INT2FIX(token->start);
}
/*
* call-seq:
* token.end -> integer
*
* End byte-position of this token
*/
static VALUE
frb_token_get_end_offset(VALUE self)
{
RToken *token;
GET_TK(token, self);
return INT2FIX(token->end);
}
/*
* call-seq:
* token.pos_inc -> integer
*
* Position Increment for this token
*/
static VALUE
frb_token_get_pos_inc(VALUE self)
{
RToken *token;
GET_TK(token, self);
return INT2FIX(token->pos_inc);
}
/*
* call-seq:
* token.start = start -> integer
*
* Set start byte-position of this token
*/
static VALUE
frb_token_set_start_offset(VALUE self, VALUE rstart)
{
RToken *token;
GET_TK(token, self);
token->start = FIX2INT(rstart);
return rstart;
}
/*
* call-seq:
* token.end = end -> integer
*
* Set end byte-position of this token
*/
static VALUE
frb_token_set_end_offset(VALUE self, VALUE rend)
{
RToken *token;
GET_TK(token, self);
token->end = FIX2INT(rend);
return rend;
}
/*
* call-seq:
* token.pos_inc = pos_inc -> integer
*
* Set the position increment. This determines the position of this token
* relative to the previous Token in a TokenStream, used in phrase
* searching.
*
* The default value is 1.
*
* Some common uses for this are:
*
* * Set it to zero to put multiple terms in the same position. This is
* useful if, e.g., a word has multiple stems. Searches for phrases
* including either stem will match. In this case, all but the first
* stem's increment should be set to zero: the increment of the first
* instance should be one. Repeating a token with an increment of zero
* can also be used to boost the scores of matches on that token.
*
* * Set it to values greater than one to inhibit exact phrase matches.
* If, for example, one does not want phrases to match across removed
* stop words, then one could build a stop word filter that removes stop
* words and also sets the increment to the number of stop words removed
* before each non-stop word. Then exact phrase queries will only match
* when the terms occur with no intervening stop words.
*
*/
static VALUE
frb_token_set_pos_inc(VALUE self, VALUE rpos_inc)
{
RToken *token;
GET_TK(token, self);
token->pos_inc = FIX2INT(rpos_inc);
return rpos_inc;
}
/*
* call-seq:
* token.to_s -> token_str
*
* Return a string representation of the token
*/
static VALUE
frb_token_to_s(VALUE self)
{
RToken *token;
char *buf;
GET_TK(token, self);
buf = alloca(RSTRING_LEN(token->text) + 80);
sprintf(buf, "token[\"%s\":%d:%d:%d]", rs2s(token->text),
token->start, token->end, token->pos_inc);
return rb_str_new2(buf);
}
/****************************************************************************
*
* TokenStream Methods
*
****************************************************************************/
#define GET_TS(ts, self) Data_Get_Struct(self, TokenStream, ts)
static void
frb_ts_mark(void *p)
{
TokenStream *ts = (TokenStream *)p;
if (ts->text) frb_gc_mark(&ts->text);
}
static void
frb_ts_free(TokenStream *ts)
{
if (object_get(&ts->text) != Qnil) {
object_del(&ts->text);
}
object_del(ts);
ts_deref(ts);
}
static void frb_rets_free(TokenStream *ts);
static void frb_rets_mark(TokenStream *ts);
static Token *rets_next(TokenStream *ts);
static VALUE
get_rb_token_stream(TokenStream *ts)
{
VALUE rts = object_get(ts);
if (rts == Qnil) {
if (ts->next == &rets_next) {
rts = Data_Wrap_Struct(cTokenStream, &frb_rets_mark,
&frb_rets_free, ts);
} else {
rts = Data_Wrap_Struct(cTokenStream, &frb_ts_mark,
&frb_ts_free, ts);
}
object_add(ts, rts);
}
return rts;
}
static INLINE VALUE
get_wrapped_ts(VALUE self, VALUE rstr, TokenStream *ts)
{
StringValue(rstr);
ts->reset(ts, rs2s(rstr));
Frt_Wrap_Struct(self, &frb_ts_mark, &frb_ts_free, ts);
object_add(&ts->text, rstr);
object_add(ts, self);
return self;
}
/*
* call-seq:
* token_stream.text = text -> text
*
* Set the text attribute of the TokenStream to the text you wish to be
* tokenized. For example, you may do this;
*
* token_stream.text = File.read(file_name)
*/
static VALUE
frb_ts_set_text(VALUE self, VALUE rtext)
{
TokenStream *ts;
Data_Get_Struct(self, TokenStream, ts);
StringValue(rtext);
ts->reset(ts, rs2s(rtext));
/* prevent garbage collection */
rb_ivar_set(self, id_text, rtext);
return rtext;
}
/*
* call-seq:
* token_stream.text = text -> text
*
* Return the text that the TokenStream is tokenizing
*/
static VALUE
frb_ts_get_text(VALUE self)
{
VALUE rtext = Qnil;
TokenStream *ts;
Data_Get_Struct(self, TokenStream, ts);
if ((rtext = object_get(&ts->text)) == Qnil) {
if (ts->text) {
rtext = rb_str_new2(ts->text);
object_set(&ts->text, rtext);
}
}
return rtext;
}
/*
* call-seq:
* token_stream.next -> token
*
* Return the next token from the TokenStream or nil if there are no more
* tokens.
*/
static VALUE
frb_ts_next(VALUE self)
{
TokenStream *ts;
Token *next;
GET_TS(ts, self);
next = ts->next(ts);
if (next == NULL) {
return Qnil;
}
return get_token(next);
}
/****************************************************************************
* TokenFilter
****************************************************************************/
#define TkFilt(filter) ((TokenFilter *)(filter))
static void
frb_tf_mark(void *p)
{
TokenStream *ts = (TokenStream *)p;
if (TkFilt(ts)->sub_ts) {
frb_gc_mark(&TkFilt(ts)->sub_ts);
}
}
static void
frb_tf_free(TokenStream *ts)
{
if (TkFilt(ts)->sub_ts && (object_get(&TkFilt(ts)->sub_ts) != Qnil)) {
object_del(&TkFilt(ts)->sub_ts);
}
object_del(ts);
ts_deref(ts);
}
/****************************************************************************
* CWrappedTokenStream
****************************************************************************/
#define CachedTS(token_stream) ((CachedTokenStream *)(token_stream))
#define CWTS(token_stream) ((CWrappedTokenStream *)(token_stream))
typedef struct CWrappedTokenStream {
CachedTokenStream super;
VALUE rts;
} CWrappedTokenStream;
static void
cwrts_destroy_i(TokenStream *ts)
{
if (object_get(&ts->text) != Qnil) {
object_del(&ts->text);
}
rb_hash_delete(object_space, ((VALUE)ts)|1);
/*printf("rb_hash_size = %d\n", frb_rb_hash_size(object_space)); */
free(ts);
}
static Token *
cwrts_next(TokenStream *ts)
{
VALUE rtoken = rb_funcall(CWTS(ts)->rts, id_next, 0);
return frb_set_token(&(CachedTS(ts)->token), rtoken);
}
static TokenStream *
cwrts_reset(TokenStream *ts, char *text)
{
ts->t = ts->text = text;
rb_funcall(CWTS(ts)->rts, id_reset, 1, rb_str_new2(text));
return ts;
}
static TokenStream *
cwrts_clone_i(TokenStream *orig_ts)
{
TokenStream *new_ts = ts_clone_size(orig_ts, sizeof(CWrappedTokenStream));
VALUE rts = CWTS(new_ts)->rts = rb_funcall(CWTS(orig_ts)->rts, id_clone, 0);
rb_hash_aset(object_space, ((VALUE)new_ts)|1, rts);
return new_ts;
}
static TokenStream *
frb_get_cwrapped_rts(VALUE rts)
{
TokenStream *ts;
if (frb_is_cclass(rts) && DATA_PTR(rts)) {
GET_TS(ts, rts);
REF(ts);
}
else {
ts = ts_new(CWrappedTokenStream);
CWTS(ts)->rts = rts;
ts->next = &cwrts_next;
ts->reset = &cwrts_reset;
ts->clone_i = &cwrts_clone_i;
ts->destroy_i = &cwrts_destroy_i;
/* prevent from being garbage collected */
rb_hash_aset(object_space, ((VALUE)ts)|1, rts);
ts->ref_cnt = 1;
}
return ts;
}
/****************************************************************************
* RegExpTokenStream
****************************************************************************/
#define P "[_\\/.,-]"
#define HASDIGIT "\\w*\\d\\w*"
#define ALPHA "[-_[:alpha:]]"
#define ALNUM "[-_[:alnum:]]"
#define RETS(token_stream) ((RegExpTokenStream *)(token_stream))
static const char *TOKEN_RE =
ALPHA "+(('" ALPHA "+)+|\\.(" ALPHA "\\.)+|"
"(@|\\&)\\w+([-.]\\w+)*|:\\/\\/" ALNUM "+([-.\\/]" ALNUM "+)*)?"
"|\\w+(([-._]\\w+)*\\@\\w+([-.]\\w+)+"
"|" P HASDIGIT "(" P "\\w+" P HASDIGIT ")*(" P "\\w+)?"
"|(\\.\\w+)+"
"|"
")";
static VALUE rtoken_re;
typedef struct RegExpTokenStream {
CachedTokenStream super;
VALUE rtext;
VALUE regex;
VALUE proc;
long curr_ind;
} RegExpTokenStream;
static void
rets_destroy_i(TokenStream *ts)
{
if (object_get(&ts->text) != Qnil) {
object_del(&ts->text);
}
rb_hash_delete(object_space, ((VALUE)ts)|1);
/*printf("rb_hash_size = %d\n", frb_rb_hash_size(object_space)); */
free(ts);
}
static void
frb_rets_free(TokenStream *ts)
{
if (object_get(&ts->text) != Qnil) {
object_del(&ts->text);
}
object_del(ts);
ts_deref(ts);
}
static void
frb_rets_mark(TokenStream *ts)
{
if (ts->text) frb_gc_mark(&ts->text);
rb_gc_mark(RETS(ts)->rtext);
rb_gc_mark(RETS(ts)->regex);
rb_gc_mark(RETS(ts)->proc);
}
/*
* call-seq:
* tokenizer.text = text -> text
*
* Set the text to be tokenized by the tokenizer. The tokenizer gets reset to
* tokenize the text from the beginning.
*/
static VALUE
frb_rets_set_text(VALUE self, VALUE rtext)
{
TokenStream *ts;
GET_TS(ts, self);
rb_hash_aset(object_space, ((VALUE)ts)|1, rtext);
StringValue(rtext);
RETS(ts)->rtext = rtext;
RETS(ts)->curr_ind = 0;
return rtext;
}
/*
* call-seq:
* tokenizer.text = text -> text
*
* Get the text being tokenized by the tokenizer.
*/
static VALUE
frb_rets_get_text(VALUE self)
{
TokenStream *ts;
GET_TS(ts, self);
return RETS(ts)->rtext;
}
#ifdef FRT_RUBY_VERSION_1_9
// partly lifted from ruby 1.9 string.c
#include <ruby/encoding.h>
#define BEG(no) regs->beg[no]
#define END(no) regs->end[no]
#define STR_ENC_GET(str) rb_enc_from_index(ENCODING_GET(str))
static VALUE
scan_once(VALUE str, VALUE pat, long *start)
{
VALUE match;
struct re_registers *regs;
if (rb_reg_search(pat, str, *start, 0) >= 0) {
match = rb_backref_get();
regs = RMATCH_REGS(match);
if (BEG(0) == END(0)) {
rb_encoding *enc = STR_ENC_GET(str);
/*
* Always consume at least one character of the input string
*/
if (RSTRING_LEN(str) > END(0))
*start = END(0)+rb_enc_mbclen(RSTRING_PTR(str)+END(0),
RSTRING_END(str), enc);
else
*start = END(0)+1;
}
else {
*start = END(0);
}
return rb_reg_nth_match(0, match);
}
return Qnil;
}
//
static Token *
rets_next(TokenStream *ts)
{
VALUE ret;
long rtok_len;
int beg, end;
Check_Type(RETS(ts)->regex, T_REGEXP);
ret = scan_once(RETS(ts)->rtext, RETS(ts)->regex, &(RETS(ts)->curr_ind));
if (NIL_P(ret)) return NULL;
Check_Type(ret, T_STRING);
rtok_len = RSTRING_LEN(ret);
beg = RETS(ts)->curr_ind - rtok_len;
end = RETS(ts)->curr_ind;
if (NIL_P(RETS(ts)->proc)) {
return tk_set(&(CachedTS(ts)->token), rs2s(ret), rtok_len,
beg, end, 1);
} else {
VALUE rtok;
rtok = rb_funcall(RETS(ts)->proc, id_call, 1, ret);
return tk_set(&(CachedTS(ts)->token), rs2s(rtok),
RSTRING_LEN(rtok), beg, end, 1);
}
}
#else
static Token *
rets_next(TokenStream *ts)
{
static struct re_registers regs;
int ret, beg, end;
long rtext_len = RSTRING_LEN(RETS(ts)->rtext);
char *rtext_ptr = RSTRING_PTR(RETS(ts)->rtext);
Check_Type(RETS(ts)->regex, T_REGEXP);
ret = ruby_re_search(RREGEXP(RETS(ts)->regex)->ptr,
rtext_ptr, rtext_len,
RETS(ts)->curr_ind, rtext_len - RETS(ts)->curr_ind,
®s);
if (ret == -2) rb_raise(rb_eStandardError, "regexp buffer overflow");
if (ret < 0) return NULL; /* not matched */
beg = regs.beg[0];
RETS(ts)->curr_ind = end = regs.end[0];
if (NIL_P(RETS(ts)->proc)) {
return tk_set(&(CachedTS(ts)->token), rtext_ptr + beg, end - beg,
beg, end, 1);
} else {
VALUE rtok = rb_str_new(rtext_ptr + beg, end - beg);
rtok = rb_funcall(RETS(ts)->proc, id_call, 1, rtok);
return tk_set(&(CachedTS(ts)->token), rs2s(rtok),
RSTRING_LEN(rtok), beg, end, 1);
}
}
#endif
static TokenStream *
rets_reset(TokenStream *ts, char *text)
{
RETS(ts)->rtext = rb_str_new2(text);
RETS(ts)->curr_ind = 0;
return ts;
}
static TokenStream *
rets_clone_i(TokenStream *orig_ts)
{
TokenStream *ts = ts_clone_size(orig_ts, sizeof(RegExpTokenStream));
return ts;
}
static TokenStream *
rets_new(VALUE rtext, VALUE regex, VALUE proc)
{
TokenStream *ts = ts_new(RegExpTokenStream);
if (rtext != Qnil) {
rtext = StringValue(rtext);
rb_hash_aset(object_space, ((VALUE)ts)|1, rtext);
}
ts->reset = &rets_reset;
ts->next = &rets_next;
ts->clone_i = &rets_clone_i;
ts->destroy_i = &rets_destroy_i;
RETS(ts)->curr_ind = 0;
RETS(ts)->rtext = rtext;
RETS(ts)->proc = proc;
if (NIL_P(regex)) {
RETS(ts)->regex = rtoken_re;
} else {
Check_Type(regex, T_REGEXP);
RETS(ts)->regex = regex;
}
return ts;
}
/*
* call-seq:
* RegExpTokenizer.new(input, /[[:alpha:]]+/)
*
* Create a new tokenizer based on a regular expression
*
* input:: text to tokenizer
* regexp:: regular expression used to recognize tokens in the input
*/
static VALUE
frb_rets_init(int argc, VALUE *argv, VALUE self)
{
VALUE rtext, regex, proc;
TokenStream *ts;
rb_scan_args(argc, argv, "11&", &rtext, ®ex, &proc);
ts = rets_new(rtext, regex, proc);
Frt_Wrap_Struct(self, &frb_rets_mark, &frb_rets_free, ts);
object_add(ts, self);
return self;
}
/****************************************************************************
* Tokenizers
****************************************************************************/
#define TS_ARGS(dflt) \
bool lower;\
VALUE rlower, rstr;\
rb_scan_args(argc, argv, "11", &rstr, &rlower);\
lower = (argc ? RTEST(rlower) : dflt)
/*
* call-seq:
* AsciiLetterTokenizer.new() -> tokenizer
*
* Create a new AsciiLetterTokenizer
*/
static VALUE
frb_a_letter_tokenizer_init(VALUE self, VALUE rstr)
{
return get_wrapped_ts(self, rstr, letter_tokenizer_new());
}
/*
* call-seq:
* LetterTokenizer.new(lower = true) -> tokenizer
*
* Create a new LetterTokenizer which optionally downcases tokens. Downcasing
* is done according the current locale.
*
* lower:: set to false if you don't wish to downcase tokens
*/
static VALUE
frb_letter_tokenizer_init(int argc, VALUE *argv, VALUE self)
{
TS_ARGS(false);
#ifndef POSH_OS_WIN32
if (!frb_locale) frb_locale = setlocale(LC_CTYPE, "");
#endif
return get_wrapped_ts(self, rstr, mb_letter_tokenizer_new(lower));
}
/*
* call-seq:
* AsciiWhiteSpaceTokenizer.new() -> tokenizer
*
* Create a new AsciiWhiteSpaceTokenizer
*/
static VALUE
frb_a_whitespace_tokenizer_init(VALUE self, VALUE rstr)
{
return get_wrapped_ts(self, rstr, whitespace_tokenizer_new());
}
/*
* call-seq:
* WhiteSpaceTokenizer.new(lower = true) -> tokenizer
*
* Create a new WhiteSpaceTokenizer which optionally downcases tokens.
* Downcasing is done according the current locale.
*
* lower:: set to false if you don't wish to downcase tokens
*/
static VALUE
frb_whitespace_tokenizer_init(int argc, VALUE *argv, VALUE self)
{
TS_ARGS(false);
#ifndef POSH_OS_WIN32
if (!frb_locale) frb_locale = setlocale(LC_CTYPE, "");
#endif
return get_wrapped_ts(self, rstr, mb_whitespace_tokenizer_new(lower));
}
/*
* call-seq:
* AsciiStandardTokenizer.new() -> tokenizer
*
* Create a new AsciiStandardTokenizer
*/
static VALUE
frb_a_standard_tokenizer_init(VALUE self, VALUE rstr)
{
return get_wrapped_ts(self, rstr, standard_tokenizer_new());
}
/*
* call-seq:
* StandardTokenizer.new(lower = true) -> tokenizer
*
* Create a new StandardTokenizer which optionally downcases tokens.
* Downcasing is done according the current locale.
*
* lower:: set to false if you don't wish to downcase tokens
*/
static VALUE
frb_standard_tokenizer_init(VALUE self, VALUE rstr)
{
#ifndef POSH_OS_WIN32
if (!frb_locale) frb_locale = setlocale(LC_CTYPE, "");
#endif
return get_wrapped_ts(self, rstr, mb_standard_tokenizer_new());
}
/****************************************************************************
* Filters
****************************************************************************/
/*
* call-seq:
* AsciiLowerCaseFilter.new(token_stream) -> token_stream
*
* Create an AsciiLowerCaseFilter which normalizes a token's text to
* lowercase but only for ASCII characters. For other characters use
* LowerCaseFilter.
*/
static VALUE
frb_a_lowercase_filter_init(VALUE self, VALUE rsub_ts)
{
TokenStream *ts = frb_get_cwrapped_rts(rsub_ts);
ts = lowercase_filter_new(ts);
object_add(&(TkFilt(ts)->sub_ts), rsub_ts);
Frt_Wrap_Struct(self, &frb_tf_mark, &frb_tf_free, ts);
object_add(ts, self);
return self;
}
/*
* call-seq:
* LowerCaseFilter.new(token_stream) -> token_stream
*
* Create an LowerCaseFilter which normalizes a token's text to
* lowercase based on the current locale.
*/
static VALUE
frb_lowercase_filter_init(VALUE self, VALUE rsub_ts)
{
TokenStream *ts = frb_get_cwrapped_rts(rsub_ts);
#ifndef POSH_OS_WIN32
if (!frb_locale) frb_locale = setlocale(LC_CTYPE, "");
#endif
ts = mb_lowercase_filter_new(ts);
object_add(&(TkFilt(ts)->sub_ts), rsub_ts);
Frt_Wrap_Struct(self, &frb_tf_mark, &frb_tf_free, ts);
object_add(ts, self);
return self;
}
/*
* call-seq:
* HyphenFilter.new(token_stream) -> token_stream
*
* Create an HyphenFilter which filters hyphenated words. The way it works is
* by adding both the word concatenated into a single word and split into
* multiple words. ie "e-mail" becomes "email" and "e mail". This way a
* search for "e-mail", "email" and "mail" will all match. This filter is
* used by default by the StandardAnalyzer.
*/
static VALUE
frb_hyphen_filter_init(VALUE self, VALUE rsub_ts)
{
TokenStream *ts = frb_get_cwrapped_rts(rsub_ts);
ts = hyphen_filter_new(ts);
object_add(&(TkFilt(ts)->sub_ts), rsub_ts);
Frt_Wrap_Struct(self, &frb_tf_mark, &frb_tf_free, ts);
object_add(ts, self);
return self;
}
/*
* call-seq:
* StopFilter.new(token_stream) -> token_stream
* StopFilter.new(token_stream, ["the", "and", "it"]) -> token_stream
*
* Create an StopFilter which removes *stop-words* from a TokenStream. You can
* optionally specify the stopwords you wish to have removed.
*
* token_stream:: TokenStream to be filtered
* stop_words:: Array of *stop-words* you wish to be filtered out. This
* defaults to a list of English stop-words. The
* Ferret::Analysis contains a number of stop-word lists.
*/
static VALUE
frb_stop_filter_init(int argc, VALUE *argv, VALUE self)
{
VALUE rsub_ts, rstop_words;
TokenStream *ts;
rb_scan_args(argc, argv, "11", &rsub_ts, &rstop_words);
ts = frb_get_cwrapped_rts(rsub_ts);
if (rstop_words != Qnil) {
char **stop_words = get_stopwords(rstop_words);
ts = stop_filter_new_with_words(ts, (const char **)stop_words);
free(stop_words);
} else {
ts = stop_filter_new(ts);
}
object_add(&(TkFilt(ts)->sub_ts), rsub_ts);
Frt_Wrap_Struct(self, &frb_tf_mark, &frb_tf_free, ts);
object_add(ts, self);
return self;
}
static INLINE void frb_add_mapping_i(TokenStream *mf, VALUE from,
const char *to)
{
switch (TYPE(from)) {
case T_STRING:
mapping_filter_add(mf, rs2s(from), to);
break;
case T_SYMBOL:
mapping_filter_add(mf, rb_id2name(SYM2ID(from)), to);
break;
default:
rb_raise(rb_eArgError,
"cannot map from %s with MappingFilter",
rs2s(rb_obj_as_string(from)));
break;
}
}
static int frb_add_mappings_i(VALUE key, VALUE value, VALUE arg)
{
if (key == Qundef) {
return ST_CONTINUE;
} else {
TokenStream *mf = (TokenStream *)arg;
const char *to;
switch (TYPE(value)) {
case T_STRING:
to = rs2s(value);
break;
case T_SYMBOL:
to = rb_id2name(SYM2ID(value));
break;
default:
rb_raise(rb_eArgError,
"cannot map to %s with MappingFilter",
rs2s(rb_obj_as_string(key)));
break;
}
if (TYPE(key) == T_ARRAY) {
int i;
for (i = RARRAY_LEN(key) - 1; i >= 0; i--) {
frb_add_mapping_i(mf, RARRAY_PTR(key)[i], to);
}
}
else {
frb_add_mapping_i(mf, key, to);
}
}
return ST_CONTINUE;
}
/*
* call-seq:
* MappingFilter.new(token_stream, mapping) -> token_stream
*
* Create an MappingFilter which maps strings in tokens. This is usually used
* to map UTF-8 characters to ASCII characters for easier searching and
* better search recall. The mapping is compiled into a Deterministic Finite
* Automata so it is super fast. This Filter can therefor be used for
* indexing very large datasets. Currently regular expressions are not
* supported. If you are really interested in the feature, please contact me
* at dbalmain@gmail.com.
*
* token_stream:: TokenStream to be filtered
* mapping:: Hash of mappings to apply to tokens. The key can be a
* String or an Array of Strings. The value must be a String
*
* == Example
*
* filt = MappingFilter.new(token_stream,
* {
* ['à','á','â','ã','ä','å'] => 'a',
* ['è','é','ê','ë','ē','ę'] => 'e'
* })
*/
static VALUE
frb_mapping_filter_init(VALUE self, VALUE rsub_ts, VALUE mapping)
{
TokenStream *ts;
ts = frb_get_cwrapped_rts(rsub_ts);
ts = mapping_filter_new(ts);
rb_hash_foreach(mapping, frb_add_mappings_i, (VALUE)ts);
mulmap_compile(((MappingFilter *)ts)->mapper);
object_add(&(TkFilt(ts)->sub_ts), rsub_ts);
Frt_Wrap_Struct(self, &frb_tf_mark, &frb_tf_free, ts);
object_add(ts, self);
return self;
}
/*
* call-seq:
* StemFilter.new(token_stream) -> token_stream
* StemFilter.new(token_stream,
* algorithm="english",
* encoding="UTF-8") -> token_stream
*
* Create an StemFilter which uses a snowball stemmer (thank you Martin
* Porter) to stem words. You can optionally specify the algorithm (default:
* "english") and encoding (default: "UTF-8").
*
* token_stream:: TokenStream to be filtered
* algorithm:: The algorithm (or language) to use
* encoding:: The encoding of the data (default: "UTF-8")
*/
static VALUE
frb_stem_filter_init(int argc, VALUE *argv, VALUE self)
{
VALUE rsub_ts, ralgorithm, rcharenc;
char *algorithm = "english";
char *charenc = NULL;
TokenStream *ts;
rb_scan_args(argc, argv, "12", &rsub_ts, &ralgorithm, &rcharenc);
ts = frb_get_cwrapped_rts(rsub_ts);
switch (argc) {
case 3: charenc = rs2s(rb_obj_as_string(rcharenc));
case 2: algorithm = rs2s(rb_obj_as_string(ralgorithm));
}
ts = stem_filter_new(ts, algorithm, charenc);
object_add(&(TkFilt(ts)->sub_ts), rsub_ts);
Frt_Wrap_Struct(self, &frb_tf_mark, &frb_tf_free, ts);
object_add(ts, self);
if (((StemFilter *)ts)->stemmer == NULL) {
rb_raise(rb_eArgError, "No stemmer could be found with the encoding "
"%s and the language %s", charenc, algorithm);
}
return self;
}
/****************************************************************************
*
* Analyzer Methods
*
****************************************************************************/
/****************************************************************************
* CWrappedAnalyzer Methods
****************************************************************************/
#define GET_A(a, self) Data_Get_Struct(self, Analyzer, a)
#define CWA(analyzer) ((CWrappedAnalyzer *)(analyzer))
typedef struct CWrappedAnalyzer
{
Analyzer super;
VALUE ranalyzer;
} CWrappedAnalyzer;
static void
cwa_destroy_i(Analyzer *a)
{
rb_hash_delete(object_space, ((VALUE)a)|1);
/*printf("rb_hash_size = %d\n", frb_rb_hash_size(object_space)); */
free(a);
}
static TokenStream *
cwa_get_ts(Analyzer *a, Symbol field, char *text)
{
VALUE rts = rb_funcall(CWA(a)->ranalyzer, id_token_stream, 2,
FSYM2SYM(field), rb_str_new2(text));
return frb_get_cwrapped_rts(rts);
}
Analyzer *
frb_get_cwrapped_analyzer(VALUE ranalyzer)
{
Analyzer *a = NULL;
if (frb_is_cclass(ranalyzer) && DATA_PTR(ranalyzer)) {
Data_Get_Struct(ranalyzer, Analyzer, a);
REF(a);
}
else {
a = (Analyzer *)frt_ecalloc(sizeof(CWrappedAnalyzer));
a->destroy_i = &cwa_destroy_i;
a->get_ts = &cwa_get_ts;
a->ref_cnt = 1;
((CWrappedAnalyzer *)a)->ranalyzer = ranalyzer;
/* prevent from being garbage collected */
rb_hash_aset(object_space, ((VALUE)a)|1, ranalyzer);
}
return a;
}
static void
frb_analyzer_free(Analyzer *a)
{
object_del(a);
a_deref(a);
}
VALUE
frb_get_analyzer(Analyzer *a)
{
VALUE self = Qnil;
if (a) {
self = object_get(a);
if (self == Qnil) {
self = Data_Wrap_Struct(cAnalyzer, NULL, &frb_analyzer_free, a);
REF(a);
object_add(a, self);
}
}
return self;
}
INLINE VALUE
get_rb_ts_from_a(Analyzer *a, VALUE rfield, VALUE rstring)
{
TokenStream *ts = a_get_ts(a, frb_field(rfield), rs2s(rstring));
/* Make sure that there is no entry already */
object_set(&ts->text, rstring);
return get_rb_token_stream(ts);
}
/*
* call-seq:
* analyzer.token_stream(field_name, input) -> token_stream
*
* Create a new TokenStream to tokenize +input+. The TokenStream created may
* also depend on the +field_name+. Although this parameter is typically
* ignored.
*
* field_name:: name of the field to be tokenized
* input:: data from the field to be tokenized
*/
static VALUE
frb_analyzer_token_stream(VALUE self, VALUE rfield, VALUE rstring)
{
/* NOTE: Any changes made to this method may also need to be applied to
* frb_re_analyzer_token_stream */
Analyzer *a;
GET_A(a, self);
StringValue(rstring);
return get_rb_ts_from_a(a, rfield, rstring);
}
#define GET_LOWER(dflt) \
bool lower;\
VALUE rlower;\
rb_scan_args(argc, argv, "01", &rlower);\
lower = (argc ? RTEST(rlower) : dflt)
/*
* call-seq:
* AsciiWhiteSpaceAnalyzer.new(lower = false) -> analyzer
*
* Create a new AsciiWhiteSpaceAnalyzer which downcases tokens by default
* but can optionally leave case as is. Lowercasing will only be done to
* ASCII characters.
*
* lower:: set to false if you don't want the field's tokens to be downcased
*/
static VALUE
frb_a_white_space_analyzer_init(int argc, VALUE *argv, VALUE self)
{
Analyzer *a;
GET_LOWER(false);
a = whitespace_analyzer_new(lower);
Frt_Wrap_Struct(self, NULL, &frb_analyzer_free, a);
object_add(a, self);
return self;
}
/*
* call-seq:
* WhiteSpaceAnalyzer.new(lower = false) -> analyzer
*
* Create a new WhiteSpaceAnalyzer which downcases tokens by default but can
* optionally leave case as is. Lowercasing will be done based on the current
* locale.
*
* lower:: set to false if you don't want the field's tokens to be downcased
*/
static VALUE
frb_white_space_analyzer_init(int argc, VALUE *argv, VALUE self)
{
Analyzer *a;
GET_LOWER(false);
#ifndef POSH_OS_WIN32
if (!frb_locale) frb_locale = setlocale(LC_CTYPE, "");
#endif
a = mb_whitespace_analyzer_new(lower);
Frt_Wrap_Struct(self, NULL, &frb_analyzer_free, a);
object_add(a, self);
return self;
}
/*
* call-seq:
* AsciiLetterAnalyzer.new(lower = true) -> analyzer
*
* Create a new AsciiWhiteSpaceAnalyzer which downcases tokens by default
* but can optionally leave case as is. Lowercasing will only be done to
* ASCII characters.
*
* lower:: set to false if you don't want the field's tokens to be downcased
*/
static VALUE
frb_a_letter_analyzer_init(int argc, VALUE *argv, VALUE self)
{
Analyzer *a;
GET_LOWER(true);
a = letter_analyzer_new(lower);
Frt_Wrap_Struct(self, NULL, &frb_analyzer_free, a);
object_add(a, self);
return self;
}
/*
* call-seq:
* LetterAnalyzer.new(lower = true) -> analyzer
*
* Create a new LetterAnalyzer which downcases tokens by default but can
* optionally leave case as is. Lowercasing will be done based on the current
* locale.
*
* lower:: set to false if you don't want the field's tokens to be downcased
*/
static VALUE
frb_letter_analyzer_init(int argc, VALUE *argv, VALUE self)
{
Analyzer *a;
GET_LOWER(true);
#ifndef POSH_OS_WIN32
if (!frb_locale) frb_locale = setlocale(LC_CTYPE, "");
#endif
a = mb_letter_analyzer_new(lower);
Frt_Wrap_Struct(self, NULL, &frb_analyzer_free, a);
object_add(a, self);
return self;
}
static VALUE
get_rstopwords(const char **stop_words)
{
char **w = (char **)stop_words;
VALUE rstopwords = rb_ary_new();
while (*w) {
rb_ary_push(rstopwords, rb_str_new2(*w));
w++;
}
return rstopwords;
}
/*
* call-seq:
* AsciiStandardAnalyzer.new(lower = true, stop_words = FULL_ENGLISH_STOP_WORDS)
* -> analyzer
*
* Create a new AsciiStandardAnalyzer which downcases tokens by default but
* can optionally leave case as is. Lowercasing will be done based on the
* current locale. You can also set the list of stop-words to be used by the
* StopFilter.
*
* lower:: set to false if you don't want the field's tokens to be downcased
* stop_words:: list of stop-words to pass to the StopFilter
*/
static VALUE
frb_a_standard_analyzer_init(int argc, VALUE *argv, VALUE self)
{
bool lower;
VALUE rlower, rstop_words;
Analyzer *a;
rb_scan_args(argc, argv, "02", &rstop_words, &rlower);
lower = ((rlower == Qnil) ? true : RTEST(rlower));
if (rstop_words != Qnil) {
char **stop_words = get_stopwords(rstop_words);
a = standard_analyzer_new_with_words((const char **)stop_words, lower);
free(stop_words);
} else {
a = standard_analyzer_new(lower);
}
Frt_Wrap_Struct(self, NULL, &frb_analyzer_free, a);
object_add(a, self);
return self;
}
/*
* call-seq:
* StandardAnalyzer.new(stop_words = FULL_ENGLISH_STOP_WORDS, lower=true)
* -> analyzer
*
* Create a new StandardAnalyzer which downcases tokens by default but can
* optionally leave case as is. Lowercasing will be done based on the current
* locale. You can also set the list of stop-words to be used by the
* StopFilter.
*
* lower:: set to false if you don't want the field's tokens to be downcased
* stop_words:: list of stop-words to pass to the StopFilter
*/
static VALUE
frb_standard_analyzer_init(int argc, VALUE *argv, VALUE self)
{
bool lower;
VALUE rlower, rstop_words;
Analyzer *a;
#ifndef POSH_OS_WIN32
if (!frb_locale) frb_locale = setlocale(LC_CTYPE, "");
#endif
rb_scan_args(argc, argv, "02", &rstop_words, &rlower);
lower = ((rlower == Qnil) ? true : RTEST(rlower));
if (rstop_words != Qnil) {
char **stop_words = get_stopwords(rstop_words);
a = mb_standard_analyzer_new_with_words((const char **)stop_words, lower);
free(stop_words);
} else {
a = mb_standard_analyzer_new(lower);
}
Frt_Wrap_Struct(self, NULL, &frb_analyzer_free, a);
object_add(a, self);
return self;
}
static void
frb_h_mark_values_i(void *key, void *value, void *arg)
{
frb_gc_mark(value);
}
static void
frb_pfa_mark(void *p)
{
frb_gc_mark(PFA(p)->default_a);
h_each(PFA(p)->dict, &frb_h_mark_values_i, NULL);
}
/*** PerFieldAnalyzer ***/
/*
* call-seq:
* PerFieldAnalyzer.new(default_analyzer) -> analyzer
*
* Create a new PerFieldAnalyzer specifying the default analyzer to use on
* all fields that are set specifically.
*
* default_analyzer:: analyzer to be used on fields that aren't otherwise
* specified
*/
static VALUE
frb_per_field_analyzer_init(VALUE self, VALUE ranalyzer)
{
Analyzer *def = frb_get_cwrapped_analyzer(ranalyzer);
Analyzer *a = per_field_analyzer_new(def);
Frt_Wrap_Struct(self, &frb_pfa_mark, &frb_analyzer_free, a);
object_add(a, self);
return self;
}
/*
* call-seq:
* per_field_analyzer.add_field(field_name, default_analyzer) -> self
* per_field_analyzer[field_name] = default_analyzer -> self
*
* Set the analyzer to be used on field +field_name+. Note that field_name
* should be a symbol.
*
* field_name:: field we wish to set the analyzer for
* analyzer:: analyzer to be used on +field_name+
*/
static VALUE
frb_per_field_analyzer_add_field(VALUE self, VALUE rfield, VALUE ranalyzer)
{
Analyzer *pfa, *a;
Data_Get_Struct(self, Analyzer, pfa);
a = frb_get_cwrapped_analyzer(ranalyzer);
pfa_add_field(pfa, frb_field(rfield), a);
return self;
}
/*
* call-seq:
* analyzer.token_stream(field_name, input) -> token_stream
*
* Create a new TokenStream to tokenize +input+. The TokenStream created will
* also depend on the +field_name+ in the case of the PerFieldAnalyzer.
*
* field_name:: name of the field to be tokenized
* input:: data from the field to be tokenized
*/
static VALUE
frb_pfa_analyzer_token_stream(VALUE self, VALUE rfield, VALUE rstring)
{
Analyzer *pfa, *a;
Symbol field = frb_field(rfield);
GET_A(pfa, self);
StringValue(rstring);
a = (Analyzer *)h_get(PFA(pfa)->dict, field);
if (a == NULL) {
a = PFA(pfa)->default_a;
}
if (a->get_ts == cwa_get_ts) {
return rb_funcall(CWA(a)->ranalyzer, id_token_stream, 2,
FSYM2SYM(field), rb_str_new2(rs2s(rstring)));
}
else {
return get_rb_ts_from_a(a, rfield, rstring);
}
}
/*** RegExpAnalyzer ***/
static void
frb_re_analyzer_mark(Analyzer *a)
{
frb_gc_mark(a->current_ts);
}
static void
re_analyzer_destroy_i(Analyzer *a)
{
ts_deref(a->current_ts);
free(a);
}
/*
* call-seq:
* RegExpAnalyzer.new(reg_exp, lower = true) -> analyzer
*
* Create a new RegExpAnalyzer which will create tokenizers based on the
* regular expression and lowercasing if required.
*
* reg_exp:: the token matcher for the tokenizer to use
* lower:: set to false if you don't want to downcase the tokens
*/
static VALUE
frb_re_analyzer_init(int argc, VALUE *argv, VALUE self)
{
VALUE lower, rets, regex, proc;
Analyzer *a;
TokenStream *ts;
rb_scan_args(argc, argv, "02&", ®ex, &lower, &proc);
ts = rets_new(Qnil, regex, proc);
rets = Data_Wrap_Struct(cRegExpTokenizer, &frb_rets_mark, &frb_rets_free, ts);
object_add(ts, rets);
if (lower != Qfalse) {
rets = frb_lowercase_filter_init(frb_data_alloc(cLowerCaseFilter), rets);
ts = DATA_PTR(rets);
}
REF(ts);
a = analyzer_new(ts, &re_analyzer_destroy_i, NULL);
Frt_Wrap_Struct(self, &frb_re_analyzer_mark, &frb_analyzer_free, a);
object_add(a, self);
return self;
}
/*
* call-seq:
* analyzer.token_stream(field_name, input) -> token_stream
*
* Create a new TokenStream to tokenize +input+. The TokenStream created may
* also depend on the +field_name+. Although this parameter is typically
* ignored.
*
* field_name:: name of the field to be tokenized
* input:: data from the field to be tokenized
*/
static VALUE
frb_re_analyzer_token_stream(VALUE self, VALUE rfield, VALUE rtext)
{
TokenStream *ts;
Analyzer *a;
GET_A(a, self);
StringValue(rtext);
ts = a_get_ts(a, frb_field(rfield), rs2s(rtext));
/* Make sure that there is no entry already */
object_set(&ts->text, rtext);
if (ts->next == &rets_next) {
RETS(ts)->rtext = rtext;
rb_hash_aset(object_space, ((VALUE)ts)|1, rtext);
}
else {
RETS(((TokenFilter*)ts)->sub_ts)->rtext = rtext;
rb_hash_aset(object_space, ((VALUE)((TokenFilter*)ts)->sub_ts)|1, rtext);
}
return get_rb_token_stream(ts);
}
/****************************************************************************
*
* Locale stuff
*
****************************************************************************/
/*
* call-seq:
* Ferret.locale -> locale_str
*
* Returns a string corresponding to the locale set. For example;
*
* puts Ferret.locale #=> "en_US.UTF-8"
*/
static VALUE frb_get_locale(VALUE self, VALUE locale)
{
return (frb_locale ? rb_str_new2(frb_locale) : Qnil);
}
/*
* call-seq:
* Ferret.locale = "en_US.UTF-8"
*
* Set the global locale. You should use this method to set different locales
* when indexing documents with different encodings.
*/
static VALUE frb_set_locale(VALUE self, VALUE locale)
{
char *l = ((locale == Qnil) ? NULL : rs2s(rb_obj_as_string(locale)));
frb_locale = setlocale(LC_CTYPE, l);
return frb_locale ? rb_str_new2(frb_locale) : Qnil;
}
/****************************************************************************
*
* Init Functions
*
****************************************************************************/
/*
* Document-class: Ferret::Analysis::Token
*
* == Summary
*
* A Token is an occurrence of a term from the text of a field. It consists
* of a term's text and the start and end offset of the term in the text of
* the field;
*
* The start and end offsets permit applications to re-associate a token with
* its source text, e.g., to display highlighted query terms in a document
* browser, or to show matching text fragments in a KWIC (KeyWord In Context)
* display, etc.
*
* === Attributes
*
* text:: the terms text which may have been modified by a Token Filter or
* Tokenizer from the text originally found in the document
* start:: is the position of the first character corresponding to
* this token in the source text
* end:: is equal to one greater than the position of the last
* character corresponding of this token Note that the
* difference between @end_offset and @start_offset may not be
* equal to @text.length(), as the term text may have been
* altered by a stemmer or some other filter.
*/
static void Init_Token(void)
{
cToken = rb_define_class_under(mAnalysis, "Token", rb_cObject);
rb_define_alloc_func(cToken, frb_token_alloc);
rb_include_module(cToken, rb_mComparable);
rb_define_method(cToken, "initialize", frb_token_init, -1);
rb_define_method(cToken, "<=>", frb_token_cmp, 1);
rb_define_method(cToken, "text", frb_token_get_text, 0);
rb_define_method(cToken, "text=", frb_token_set_text, 1);
rb_define_method(cToken, "start", frb_token_get_start_offset, 0);
rb_define_method(cToken, "start=", frb_token_set_start_offset, 1);
rb_define_method(cToken, "end", frb_token_get_end_offset, 0);
rb_define_method(cToken, "end=", frb_token_set_end_offset, 1);
rb_define_method(cToken, "pos_inc", frb_token_get_pos_inc, 0);
rb_define_method(cToken, "pos_inc=", frb_token_set_pos_inc, 1);
rb_define_method(cToken, "to_s", frb_token_to_s, 0);
}
/*
* Document-class: Ferret::Analysis::TokenStream
*
* == Summary
*
* A TokenStream enumerates the sequence of tokens, either from
* fields of a document or from query text.
*
* This is an abstract class. Concrete subclasses are:
*
* Tokenizer:: a TokenStream whose input is a string
* TokenFilter:: a TokenStream whose input is another TokenStream
*/
static void Init_TokenStream(void)
{
cTokenStream = rb_define_class_under(mAnalysis, "TokenStream", rb_cObject);
frb_mark_cclass(cTokenStream);
rb_define_method(cTokenStream, "next", frb_ts_next, 0);
rb_define_method(cTokenStream, "text=", frb_ts_set_text, 1);
rb_define_method(cTokenStream, "text", frb_ts_get_text, 0);
}
/*
* Document-class: Ferret::Analysis::AsciiLetterTokenizer
*
* == Summary
*
* A LetterTokenizer is a tokenizer that divides text at non-ASCII letters.
* That is to say, it defines tokens as maximal strings of adjacent letters,
* as defined by the regular expression _/[A-Za-z]+/_.
*
* === Example
*
* "Dave's résumé, at http://www.davebalmain.com/ 1234"
* => ["Dave", "s", "r", "sum", "at", "http", "www", "davebalmain", "com"]
*/
static void Init_AsciiLetterTokenizer(void)
{
cAsciiLetterTokenizer =
rb_define_class_under(mAnalysis, "AsciiLetterTokenizer", cTokenStream);
frb_mark_cclass(cAsciiLetterTokenizer);
rb_define_alloc_func(cAsciiLetterTokenizer, frb_data_alloc);
rb_define_method(cAsciiLetterTokenizer, "initialize",
frb_a_letter_tokenizer_init, 1);
}
/*
* Document-class: Ferret::Analysis::LetterTokenizer
*
* == Summary
*
* A LetterTokenizer is a tokenizer that divides text at non-letters. That is
* to say, it defines tokens as maximal strings of adjacent letters, as
* defined by the regular expression _/[[:alpha:]]+/_ where [:alpha] matches
* all characters in your local locale.
*
* === Example
*
* "Dave's résumé, at http://www.davebalmain.com/ 1234"
* => ["Dave", "s", "résumé", "at", "http", "www", "davebalmain", "com"]
*/
static void Init_LetterTokenizer(void)
{
cLetterTokenizer =
rb_define_class_under(mAnalysis, "LetterTokenizer", cTokenStream);
frb_mark_cclass(cLetterTokenizer);
rb_define_alloc_func(cLetterTokenizer, frb_data_alloc);
rb_define_method(cLetterTokenizer, "initialize",
frb_letter_tokenizer_init, -1);
}
/*
* Document-class: Ferret::Analysis::AsciiWhiteSpaceTokenizer
*
* == Summary
*
* A WhiteSpaceTokenizer is a tokenizer that divides text at white-space.
* Adjacent sequences of non-WhiteSpace characters form tokens.
*
* === Example
*
* "Dave's résumé, at http://www.davebalmain.com/ 1234"
* => ["Dave's", "résumé,", "at", "http://www.davebalmain.com", "1234"]
*/
static void Init_AsciiWhiteSpaceTokenizer(void)
{
cAsciiWhiteSpaceTokenizer =
rb_define_class_under(mAnalysis, "AsciiWhiteSpaceTokenizer",
cTokenStream);
frb_mark_cclass(cAsciiWhiteSpaceTokenizer);
rb_define_alloc_func(cAsciiWhiteSpaceTokenizer, frb_data_alloc);
rb_define_method(cAsciiWhiteSpaceTokenizer, "initialize",
frb_a_whitespace_tokenizer_init, 1);
}
/*
* Document-class: Ferret::Analysis::WhiteSpaceTokenizer
*
* == Summary
*
* A WhiteSpaceTokenizer is a tokenizer that divides text at white-space.
* Adjacent sequences of non-WhiteSpace characters form tokens.
*
* === Example
*
* "Dave's résumé, at http://www.davebalmain.com/ 1234"
* => ["Dave's", "résumé,", "at", "http://www.davebalmain.com", "1234"]
*/
static void Init_WhiteSpaceTokenizer(void)
{
cWhiteSpaceTokenizer =
rb_define_class_under(mAnalysis, "WhiteSpaceTokenizer", cTokenStream);
frb_mark_cclass(cWhiteSpaceTokenizer);
rb_define_alloc_func(cWhiteSpaceTokenizer, frb_data_alloc);
rb_define_method(cWhiteSpaceTokenizer, "initialize",
frb_whitespace_tokenizer_init, -1);
}
/*
* Document-class: Ferret::Analysis::AsciiStandardTokenizer
*
* == Summary
*
* The standard tokenizer is an advanced tokenizer which tokenizes most
* words correctly as well as tokenizing things like email addresses, web
* addresses, phone numbers, etc.
*
* === Example
*
* "Dave's résumé, at http://www.davebalmain.com/ 1234"
* => ["Dave's", "r", "sum", "at", "http://www.davebalmain.com", "1234"]
*/
static void Init_AsciiStandardTokenizer(void)
{
cAsciiStandardTokenizer =
rb_define_class_under(mAnalysis, "AsciiStandardTokenizer", cTokenStream);
frb_mark_cclass(cAsciiStandardTokenizer);
rb_define_alloc_func(cAsciiStandardTokenizer, frb_data_alloc);
rb_define_method(cAsciiStandardTokenizer, "initialize",
frb_a_standard_tokenizer_init, 1);
}
/*
* Document-class: Ferret::Analysis::StandardTokenizer
*
* == Summary
*
* The standard tokenizer is an advanced tokenizer which tokenizes most
* words correctly as well as tokenizing things like email addresses, web
* addresses, phone numbers, etc.
*
* === Example
*
* "Dave's résumé, at http://www.davebalmain.com/ 1234"
* => ["Dave's", "résumé", "at", "http://www.davebalmain.com", "1234"]
*/
static void Init_StandardTokenizer(void)
{
cStandardTokenizer =
rb_define_class_under(mAnalysis, "StandardTokenizer", cTokenStream);
frb_mark_cclass(cStandardTokenizer);
rb_define_alloc_func(cStandardTokenizer, frb_data_alloc);
rb_define_method(cStandardTokenizer, "initialize",
frb_standard_tokenizer_init, 1);
}
/*
* Document-class: Ferret::Analysis::RegExpTokenizer
*
* == Summary
*
* A tokenizer that recognizes tokens based on a regular expression passed to
* the constructor. Most possible tokenizers can be created using this class.
*
* === Example
*
* Below is an example of a simple implementation of a LetterTokenizer using
* an RegExpTokenizer. Basically, a token is a sequence of alphabetic
* characters separated by one or more non-alphabetic characters.
*
* # of course you would add more than just é
* RegExpTokenizer.new(input, /[[:alpha:]é]+/)
*
* "Dave's résumé, at http://www.davebalmain.com/ 1234"
* => ["Dave", "s", "résumé", "at", "http", "www", "davebalmain", "com"]
*/
static void Init_RegExpTokenizer(void)
{
cRegExpTokenizer =
rb_define_class_under(mAnalysis, "RegExpTokenizer", cTokenStream);
frb_mark_cclass(cRegExpTokenizer);
rtoken_re = rb_reg_new(TOKEN_RE, strlen(TOKEN_RE), 0);
rb_define_const(cRegExpTokenizer, "REGEXP", rtoken_re);
rb_define_alloc_func(cRegExpTokenizer, frb_data_alloc);
rb_define_method(cRegExpTokenizer, "initialize",
frb_rets_init, -1);
rb_define_method(cRegExpTokenizer, "text=", frb_rets_set_text, 1);
rb_define_method(cRegExpTokenizer, "text", frb_rets_get_text, 0);
}
/***************/
/*** Filters ***/
/***************/
/*
* Document-class: Ferret::Analysis::AsciiLowerCaseFilter
*
* == Summary
*
* AsciiLowerCaseFilter normalizes a token's text to lowercase but only for
* ASCII characters. For other characters use LowerCaseFilter.
*
* === Example
*
* ["One", "TWO", "three", "RÉSUMÉ"] => ["one", "two", "three", "rÉsumÉ"]
*
*/
static void Init_AsciiLowerCaseFilter(void)
{
cAsciiLowerCaseFilter =
rb_define_class_under(mAnalysis, "AsciiLowerCaseFilter", cTokenStream);
frb_mark_cclass(cAsciiLowerCaseFilter);
rb_define_alloc_func(cAsciiLowerCaseFilter, frb_data_alloc);
rb_define_method(cAsciiLowerCaseFilter, "initialize",
frb_a_lowercase_filter_init, 1);
}
/*
* Document-class: Ferret::Analysis::LowerCaseFilter
*
* == Summary
*
* LowerCaseFilter normalizes a token's text to lowercase based on the
* current locale.
*
* === Example
*
* ["One", "TWO", "three", "RÉSUMÉ"] => ["one", "two", "three", "résumé"]
*
*/
static void Init_LowerCaseFilter(void)
{
cLowerCaseFilter =
rb_define_class_under(mAnalysis, "LowerCaseFilter", cTokenStream);
frb_mark_cclass(cLowerCaseFilter);
rb_define_alloc_func(cLowerCaseFilter, frb_data_alloc);
rb_define_method(cLowerCaseFilter, "initialize",
frb_lowercase_filter_init, 1);
}
/*
* Document-class: Ferret::Analysis::HyphenFilter
*
* == Summary
*
* HyphenFilter filters hyphenated words by adding both the word concatenated
* into a single word and split into multiple words. ie "e-mail" becomes
* "email" and "e mail". This way a search for "e-mail", "email" and "mail"
* will all match. This filter is used by default by the StandardAnalyzer.
*
* === Example
*
* ["e-mail", "set-up"] => ["email", "e", "mail", "setup", "set", "up"]
*
*/
static void Init_HyphenFilter(void)
{
cHyphenFilter =
rb_define_class_under(mAnalysis, "HyphenFilter", cTokenStream);
frb_mark_cclass(cHyphenFilter);
rb_define_alloc_func(cHyphenFilter, frb_data_alloc);
rb_define_method(cHyphenFilter, "initialize", frb_hyphen_filter_init, 1);
}
/*
* Document-class: Ferret::Analysis::MappingFilter
*
* == Summary
*
* A MappingFilter maps strings in tokens. This is usually used to map UTF-8
* characters to ASCII characters for easier searching and better search
* recall. The mapping is compiled into a Deterministic Finite Automata so it
* is super fast. This Filter can therefor be used for indexing very large
* datasets. Currently regular expressions are not supported. If you are
* really interested in the feature, please contact me at dbalmain@gmail.com.
*
* == Example
*
* mapping = {
* ['à','á','â','ã','ä','å','ā','ă'] => 'a',
* 'æ' => 'ae',
* ['ď','đ'] => 'd',
* ['ç','ć','č','ĉ','ċ'] => 'c',
* ['è','é','ê','ë','ē','ę','ě','ĕ','ė',] => 'e',
* ['ƒ'] => 'f',
* ['ĝ','ğ','ġ','ģ'] => 'g',
* ['ĥ','ħ'] => 'h',
* ['ì','ì','í','î','ï','ī','ĩ','ĭ'] => 'i',
* ['į','ı','ij','ĵ'] => 'j',
* ['ķ','ĸ'] => 'k',
* ['ł','ľ','ĺ','ļ','ŀ'] => 'l',
* ['ñ','ń','ň','ņ','ʼn','ŋ'] => 'n',
* ['ò','ó','ô','õ','ö','ø','ō','ő','ŏ','ŏ'] => 'o',
* ['œ'] => 'oek',
* ['ą'] => 'q',
* ['ŕ','ř','ŗ'] => 'r',
* ['ś','š','ş','ŝ','ș'] => 's',
* ['ť','ţ','ŧ','ț'] => 't',
* ['ù','ú','û','ü','ū','ů','ű','ŭ','ũ','ų'] => 'u',
* ['ŵ'] => 'w',
* ['ý','ÿ','ŷ'] => 'y',
* ['ž','ż','ź'] => 'z'
* }
* filt = MappingFilter.new(token_stream, mapping)
*/
static void Init_MappingFilter(void)
{
cMappingFilter =
rb_define_class_under(mAnalysis, "MappingFilter", cTokenStream);
frb_mark_cclass(cMappingFilter);
rb_define_alloc_func(cMappingFilter, frb_data_alloc);
rb_define_method(cMappingFilter, "initialize",
frb_mapping_filter_init, 2);
}
/*
* Document-class: Ferret::Analysis::StopFilter
*
* == Summary
*
* A StopFilter filters *stop-words* from a TokenStream. Stop-words are words
* that you don't wish to be index. Usually they will be common words like
* "the" and "and" although you can specify whichever words you want.
*
* === Example
*
* ["the", "pig", "and", "whistle"] => ["pig", "whistle"]
*/
static void Init_StopFilter(void)
{
cStopFilter =
rb_define_class_under(mAnalysis, "StopFilter", cTokenStream);
frb_mark_cclass(cStopFilter);
rb_define_alloc_func(cStopFilter, frb_data_alloc);
rb_define_method(cStopFilter, "initialize",
frb_stop_filter_init, -1);
}
/*
* Document-class: Ferret::Analysis::StemFilter
*
* == Summary
*
* A StemFilter takes a term and transforms the term as per the SnowBall
* stemming algorithm. Note: the input to the stemming filter must already
* be in lower case, so you will need to use LowerCaseFilter or lowercasing
* Tokenizer further down the Tokenizer chain in order for this to work
* properly!
*
* === Available algorithms and encodings
*
* Algorithm Algorithm Pseudonyms Encoding
* ----------------------------------------------------------------
* "danish", | "da", "dan" | "ISO_8859_1", "UTF_8"
* "dutch", | "dut", "nld" | "ISO_8859_1", "UTF_8"
* "english", | "en", "eng" | "ISO_8859_1", "UTF_8"
* "finnish", | "fi", "fin" | "ISO_8859_1", "UTF_8"
* "french", | "fr", "fra", "fre" | "ISO_8859_1", "UTF_8"
* "german", | "de", "deu", "ge", "ger" | "ISO_8859_1", "UTF_8"
* "hungarian", | "hu", "hun" | "ISO_8859_1", "UTF_8"
* "italian", | "it", "ita" | "ISO_8859_1", "UTF_8"
* "norwegian", | "nl", "no" | "ISO_8859_1", "UTF_8"
* "porter", | | "ISO_8859_1", "UTF_8"
* "portuguese", | "por", "pt" | "ISO_8859_1", "UTF_8"
* "romanian", | "ro", "ron", "rum" | "ISO_8859_2", "UTF_8"
* "russian", | "ru", "rus" | "KOI8_R", "UTF_8"
* "spanish", | "es", "esl" | "ISO_8859_1", "UTF_8"
* "swedish", | "sv", "swe" | "ISO_8859_1", "UTF_8"
* "turkish", | "tr", "tur" | "UTF_8"
*
*
* === New Stemmers
*
* The following stemmers have recently benn added. Please try them out;
*
* * Hungarian
* * Romanian
* * Turkish
*
* === Example
*
* To use this filter with other analyzers, you'll want to write an Analyzer
* class that sets up the TokenStream chain as you want it. To use this with
* a lowercasing Tokenizer, for example, you'd write an analyzer like this:
*
* def MyAnalyzer < Analyzer
* def token_stream(field, str)
* return StemFilter.new(LowerCaseFilter.new(StandardTokenizer.new(str)))
* end
* end
*
* "debate debates debated debating debater"
* => ["debat", "debat", "debat", "debat", "debat"]
*
* === Attributes
*
* token_stream:: TokenStream to be filtered
* algorithm:: The algorithm (or language) to use (default: "english")
* encoding:: The encoding of the data (default: "UTF-8")
*/
static void Init_StemFilter(void)
{
cStemFilter =
rb_define_class_under(mAnalysis, "StemFilter", cTokenStream);
frb_mark_cclass(cStemFilter);
rb_define_alloc_func(cStemFilter, frb_data_alloc);
rb_define_method(cStemFilter, "initialize",
frb_stem_filter_init, -1);
}
/*************************/
/*** * * Analyzers * * ***/
/*************************/
/*
* Document-class: Ferret::Analysis::Analyzer
*
* == Summary
*
* An Analyzer builds TokenStreams, which analyze text. It thus represents
* a policy for extracting index terms from text.
*
* Typical implementations first build a Tokenizer, which breaks the stream
* of characters from the Reader into raw Tokens. One or more TokenFilters
* may then be applied to the output of the Tokenizer.
*
* The default Analyzer just creates a LowerCaseTokenizer which converts
* all text to lowercase tokens. See LowerCaseTokenizer for more details.
*
* === Example
*
* To create your own custom Analyzer you simply need to implement a
* token_stream method which takes the field name and the data to be
* tokenized as parameters and returns a TokenStream. Most analyzers
* typically ignore the field name.
*
* Here we'll create a StemmingAnalyzer;
*
* def MyAnalyzer < Analyzer
* def token_stream(field, str)
* return StemFilter.new(LowerCaseFilter.new(StandardTokenizer.new(str)))
* end
* end
*/
static void Init_Analyzer(void)
{
cAnalyzer =
rb_define_class_under(mAnalysis, "Analyzer", rb_cObject);
frb_mark_cclass(cAnalyzer);
rb_define_alloc_func(cAnalyzer, frb_data_alloc);
rb_define_method(cAnalyzer, "initialize", frb_letter_analyzer_init, -1);
rb_define_method(cAnalyzer, "token_stream", frb_analyzer_token_stream, 2);
}
/*
* Document-class: Ferret::Analysis::AsciiLetterAnalyzer
*
* == Summary
*
* An AsciiLetterAnalyzer creates a TokenStream that splits the input up into
* maximal strings of ASCII characters. If implemented in Ruby it would look
* like;
*
* class AsciiLetterAnalyzer
* def initialize(lower = true)
* @lower = lower
* end
*
* def token_stream(field, str)
* if @lower
* return AsciiLowerCaseFilter.new(AsciiLetterTokenizer.new(str))
* else
* return AsciiLetterTokenizer.new(str)
* end
* end
* end
*
* As you can see it makes use of the AsciiLetterTokenizer and
* AsciiLowerCaseFilter. Note that this tokenizer won't recognize non-ASCII
* characters so you should use the LetterAnalyzer is you want to analyze
* multi-byte data like "UTF-8".
*/
static void Init_AsciiLetterAnalyzer(void)
{
cAsciiLetterAnalyzer =
rb_define_class_under(mAnalysis, "AsciiLetterAnalyzer", cAnalyzer);
frb_mark_cclass(cAsciiLetterAnalyzer);
rb_define_alloc_func(cAsciiLetterAnalyzer, frb_data_alloc);
rb_define_method(cAsciiLetterAnalyzer, "initialize",
frb_a_letter_analyzer_init, -1);
}
/*
* Document-class: Ferret::Analysis::LetterAnalyzer
*
* == Summary
*
* A LetterAnalyzer creates a TokenStream that splits the input up into
* maximal strings of characters as recognized by the current locale. If
* implemented in Ruby it would look like;
*
* class LetterAnalyzer
* def initialize(lower = true)
* @lower = lower
* end
*
* def token_stream(field, str)
* return LetterTokenizer.new(str, @lower)
* end
* end
*
* As you can see it makes use of the LetterTokenizer.
*/
static void Init_LetterAnalyzer(void)
{
cLetterAnalyzer =
rb_define_class_under(mAnalysis, "LetterAnalyzer", cAnalyzer);
frb_mark_cclass(cLetterAnalyzer);
rb_define_alloc_func(cLetterAnalyzer, frb_data_alloc);
rb_define_method(cLetterAnalyzer, "initialize",
frb_letter_analyzer_init, -1);
}
/*
* Document-class: Ferret::Analysis::AsciiWhiteSpaceAnalyzer
*
* == Summary
*
* The AsciiWhiteSpaceAnalyzer recognizes tokens as maximal strings of
* non-whitespace characters. If implemented in Ruby the
* AsciiWhiteSpaceAnalyzer would look like;
*
* class AsciiWhiteSpaceAnalyzer
* def initialize(lower = true)
* @lower = lower
* end
*
* def token_stream(field, str)
* if @lower
* return AsciiLowerCaseFilter.new(AsciiWhiteSpaceTokenizer.new(str))
* else
* return AsciiWhiteSpaceTokenizer.new(str)
* end
* end
* end
*
* As you can see it makes use of the AsciiWhiteSpaceTokenizer. You should
* use WhiteSpaceAnalyzer if you want to recognize multibyte encodings such
* as "UTF-8".
*/
static void Init_AsciiWhiteSpaceAnalyzer(void)
{
cAsciiWhiteSpaceAnalyzer =
rb_define_class_under(mAnalysis, "AsciiWhiteSpaceAnalyzer", cAnalyzer);
frb_mark_cclass(cAsciiWhiteSpaceAnalyzer);
rb_define_alloc_func(cAsciiWhiteSpaceAnalyzer, frb_data_alloc);
rb_define_method(cAsciiWhiteSpaceAnalyzer, "initialize",
frb_a_white_space_analyzer_init, -1);
}
/*
* Document-class: Ferret::Analysis::WhiteSpaceAnalyzer
*
* == Summary
*
* The WhiteSpaceAnalyzer recognizes tokens as maximal strings of
* non-whitespace characters. If implemented in Ruby the WhiteSpaceAnalyzer
* would look like;
*
* class WhiteSpaceAnalyzer
* def initialize(lower = true)
* @lower = lower
* end
*
* def token_stream(field, str)
* return WhiteSpaceTokenizer.new(str, @lower)
* end
* end
*
* As you can see it makes use of the WhiteSpaceTokenizer.
*/
static void Init_WhiteSpaceAnalyzer(void)
{
cWhiteSpaceAnalyzer =
rb_define_class_under(mAnalysis, "WhiteSpaceAnalyzer", cAnalyzer);
frb_mark_cclass(cWhiteSpaceAnalyzer);
rb_define_alloc_func(cWhiteSpaceAnalyzer, frb_data_alloc);
rb_define_method(cWhiteSpaceAnalyzer, "initialize",
frb_white_space_analyzer_init, -1);
}
/*
* Document-class: Ferret::Analysis::AsciiStandardAnalyzer
*
* == Summary
*
* The AsciiStandardAnalyzer is the most advanced of the available
* ASCII-analyzers. If it were implemented in Ruby it would look like this;
*
* class AsciiStandardAnalyzer
* def initialize(stop_words = FULL_ENGLISH_STOP_WORDS, lower = true)
* @lower = lower
* @stop_words = stop_words
* end
*
* def token_stream(field, str)
* ts = AsciiStandardTokenizer.new(str)
* ts = AsciiLowerCaseFilter.new(ts) if @lower
* ts = StopFilter.new(ts, @stop_words)
* ts = HyphenFilter.new(ts)
* end
* end
*
* As you can see it makes use of the AsciiStandardTokenizer and you can also
* add your own list of stop-words if you wish. Note that this tokenizer
* won't recognize non-ASCII characters so you should use the
* StandardAnalyzer is you want to analyze multi-byte data like "UTF-8".
*/
static void Init_AsciiStandardAnalyzer(void)
{
cAsciiStandardAnalyzer =
rb_define_class_under(mAnalysis, "AsciiStandardAnalyzer", cAnalyzer);
frb_mark_cclass(cAsciiStandardAnalyzer);
rb_define_alloc_func(cAsciiStandardAnalyzer, frb_data_alloc);
rb_define_method(cAsciiStandardAnalyzer, "initialize",
frb_a_standard_analyzer_init, -1);
}
/*
* Document-class: Ferret::Analysis::StandardAnalyzer
*
* == Summary
*
* The StandardAnalyzer is the most advanced of the available analyzers. If
* it were implemented in Ruby it would look like this;
*
* class StandardAnalyzer
* def initialize(stop_words = FULL_ENGLISH_STOP_WORDS, lower = true)
* @lower = lower
* @stop_words = stop_words
* end
*
* def token_stream(field, str)
* ts = StandardTokenizer.new(str)
* ts = LowerCaseFilter.new(ts) if @lower
* ts = StopFilter.new(ts, @stop_words)
* ts = HyphenFilter.new(ts)
* end
* end
*
* As you can see it makes use of the StandardTokenizer and you can also add
* your own list of stopwords if you wish.
*/
static void Init_StandardAnalyzer(void)
{
cStandardAnalyzer =
rb_define_class_under(mAnalysis, "StandardAnalyzer", cAnalyzer);
frb_mark_cclass(cStandardAnalyzer);
rb_define_alloc_func(cStandardAnalyzer, frb_data_alloc);
rb_define_method(cStandardAnalyzer, "initialize",
frb_standard_analyzer_init, -1);
}
/*
* Document-class: Ferret::Analysis::PerFieldAnalyzer
*
* == Summary
*
* The PerFieldAnalyzer is for use when you want to analyze different fields
* with different analyzers. With the PerFieldAnalyzer you can specify how
* you want each field analyzed.
*
* === Example
*
* # Create a new PerFieldAnalyzer which uses StandardAnalyzer by default
* pfa = PerFieldAnalyzer.new(StandardAnalyzer.new())
*
* # Use the WhiteSpaceAnalyzer with no lowercasing on the :title field
* pfa[:title] = WhiteSpaceAnalyzer.new(false)
*
* # Use a custom analyzer on the :created_at field
* pfa[:created_at] = DateAnalyzer.new
*/
static void Init_PerFieldAnalyzer(void)
{
cPerFieldAnalyzer =
rb_define_class_under(mAnalysis, "PerFieldAnalyzer", cAnalyzer);
frb_mark_cclass(cPerFieldAnalyzer);
rb_define_alloc_func(cPerFieldAnalyzer, frb_data_alloc);
rb_define_method(cPerFieldAnalyzer, "initialize",
frb_per_field_analyzer_init, 1);
rb_define_method(cPerFieldAnalyzer, "add_field",
frb_per_field_analyzer_add_field, 2);
rb_define_method(cPerFieldAnalyzer, "[]=",
frb_per_field_analyzer_add_field, 2);
rb_define_method(cPerFieldAnalyzer, "token_stream",
frb_pfa_analyzer_token_stream, 2);
}
/*
* Document-class: Ferret::Analysis::RegExpAnalyzer
*
* == Summary
*
* Using a RegExpAnalyzer is a simple way to create a custom analyzer. If
* implemented in Ruby it would look like this;
*
* class RegExpAnalyzer
* def initialize(reg_exp, lower = true)
* @lower = lower
* @reg_exp = reg_exp
* end
*
* def token_stream(field, str)
* if @lower
* return LowerCaseFilter.new(RegExpTokenizer.new(str, reg_exp))
* else
* return RegExpTokenizer.new(str, reg_exp)
* end
* end
* end
*
* === Example
*
* csv_analyzer = RegExpAnalyzer.new(/[^,]+/, false)
*/
static void Init_RegExpAnalyzer(void)
{
cRegExpAnalyzer =
rb_define_class_under(mAnalysis, "RegExpAnalyzer", cAnalyzer);
frb_mark_cclass(cRegExpAnalyzer);
rb_define_alloc_func(cRegExpAnalyzer, frb_data_alloc);
rb_define_method(cRegExpAnalyzer, "initialize",
frb_re_analyzer_init, -1);
rb_define_method(cRegExpAnalyzer, "token_stream",
frb_re_analyzer_token_stream, 2);
}
/* rdoc hack
extern VALUE mFerret = rb_define_module("Ferret");
*/
/*
* Document-module: Ferret::Analysis
*
* == Summary
*
* The Analysis module contains all the classes used to analyze and tokenize
* the data to be indexed. There are three main classes you need to know
* about when dealing with analysis; Analyzer, TokenStream and Token.
*
* == Classes
*
* === Analyzer
*
* Analyzers handle all of your tokenizing needs. You pass an Analyzer to the
* indexing class when you create it and it will create the TokenStreams
* necessary to tokenize the fields in the documents. Most of the time you
* won't need to worry about TokenStreams and Tokens, one of the Analyzers
* distributed with Ferret will do exactly what you need. Otherwise you'll
* need to implement a custom analyzer.
*
* === TokenStream
*
* A TokenStream is an enumeration of Tokens. There are two standard types of
* TokenStream; Tokenizer and TokenFilter. A Tokenizer takes a String and
* turns it into a list of Tokens. A TokenFilter takes another TokenStream
* and post-processes the Tokens. You can chain as many TokenFilters together
* as you like but they always need to finish with a Tokenizer.
*
* === Token
*
* A Token is a single term from a document field. A token contains the text
* representing the term as well as the start and end offset of the token.
* The start and end offset will represent the token as it appears in the
* source field. Some TokenFilters may change the text in the Token but the
* start and end offsets should stay the same so (end - start) won't
* necessarily be equal to the length of text in the token. For example using
* a stemming TokenFilter the term "Beginning" might have start and end
* offsets of 10 and 19 respectively ("Beginning".length == 9) but Token#text
* might be "begin" (after stemming).
*/
void
Init_Analysis(void)
{
mAnalysis = rb_define_module_under(mFerret, "Analysis");
/* TokenStream Methods */
id_next = rb_intern("next");
id_reset = rb_intern("text=");
id_clone = rb_intern("clone");
id_text = rb_intern("@text");
/* Analyzer Methods */
id_token_stream = rb_intern("token_stream");
object_space = rb_hash_new();
rb_define_const(mFerret, "OBJECT_SPACE", object_space);
/*** * * Locale stuff * * ***/
rb_define_singleton_method(mFerret, "locale=", frb_set_locale, 1);
rb_define_singleton_method(mFerret, "locale", frb_get_locale, 0);
rb_define_const(mAnalysis, "ENGLISH_STOP_WORDS",
get_rstopwords(ENGLISH_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_ENGLISH_STOP_WORDS",
get_rstopwords(FULL_ENGLISH_STOP_WORDS));
rb_define_const(mAnalysis, "EXTENDED_ENGLISH_STOP_WORDS",
get_rstopwords(EXTENDED_ENGLISH_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_FRENCH_STOP_WORDS",
get_rstopwords(FULL_FRENCH_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_SPANISH_STOP_WORDS",
get_rstopwords(FULL_SPANISH_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_PORTUGUESE_STOP_WORDS",
get_rstopwords(FULL_PORTUGUESE_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_ITALIAN_STOP_WORDS",
get_rstopwords(FULL_ITALIAN_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_GERMAN_STOP_WORDS",
get_rstopwords(FULL_GERMAN_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_DUTCH_STOP_WORDS",
get_rstopwords(FULL_DUTCH_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_SWEDISH_STOP_WORDS",
get_rstopwords(FULL_SWEDISH_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_NORWEGIAN_STOP_WORDS",
get_rstopwords(FULL_NORWEGIAN_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_DANISH_STOP_WORDS",
get_rstopwords(FULL_DANISH_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_RUSSIAN_STOP_WORDS",
get_rstopwords(FULL_RUSSIAN_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_FINNISH_STOP_WORDS",
get_rstopwords(FULL_FINNISH_STOP_WORDS));
rb_define_const(mAnalysis, "FULL_HUNGARIAN_STOP_WORDS",
get_rstopwords(FULL_HUNGARIAN_STOP_WORDS));
Init_Token();
Init_TokenStream();
Init_AsciiLetterTokenizer();
Init_LetterTokenizer();
Init_AsciiWhiteSpaceTokenizer();
Init_WhiteSpaceTokenizer();
Init_AsciiStandardTokenizer();
Init_StandardTokenizer();
Init_RegExpTokenizer();
Init_AsciiLowerCaseFilter();
Init_LowerCaseFilter();
Init_HyphenFilter();
Init_StopFilter();
Init_MappingFilter();
Init_StemFilter();
Init_Analyzer();
Init_AsciiLetterAnalyzer();
Init_LetterAnalyzer();
Init_AsciiWhiteSpaceAnalyzer();
Init_WhiteSpaceAnalyzer();
Init_AsciiStandardAnalyzer();
Init_StandardAnalyzer();
Init_PerFieldAnalyzer();
Init_RegExpAnalyzer();
}
|