UV Latin1_invlist[] = {
2, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
0, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
256,
UV AboveLatin1_invlist[] = {
1, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
256
UV ASCII_invlist[] = {
2, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
0, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
128,
0
};
+UV L1Cased_invlist[] = {
+ 16, /* Number of elements */
+ 0, /* Current iteration position */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
+ 1, /* 0 if this is the first element of the list proper;
+ 1 if the next element is the first */
+ 65,
+ 91,
+ 97,
+ 123,
+ 170,
+ 171,
+ 181,
+ 182,
+ 186,
+ 187,
+ 192,
+ 215,
+ 216,
+ 247,
+ 248,
+ 443
+};
+
UV VertSpace_invlist[] = {
6, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
10,
};
UV PerlSpace_invlist[] = {
- 6, /* Number of elements */
+ 4, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
9,
- 11,
- 12,
14,
32,
33
};
UV XPerlSpace_invlist[] = {
- 24, /* Number of elements */
+ 22, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
9,
- 11,
- 12,
14,
32,
33,
UV PosixAlnum_invlist[] = {
6, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
48,
UV L1PosixAlnum_invlist[] = {
18, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
48,
UV PosixAlpha_invlist[] = {
4, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
65,
UV L1PosixAlpha_invlist[] = {
16, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
65,
UV PosixBlank_invlist[] = {
4, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
9,
UV XPosixBlank_invlist[] = {
18, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
9,
UV PosixCntrl_invlist[] = {
4, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
0, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
32,
UV XPosixCntrl_invlist[] = {
4, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
0, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
32,
UV PosixDigit_invlist[] = {
2, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
48,
UV PosixGraph_invlist[] = {
2, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
33,
UV L1PosixGraph_invlist[] = {
4, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
33,
UV PosixLower_invlist[] = {
2, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
97,
UV L1PosixLower_invlist[] = {
12, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
97,
UV PosixPrint_invlist[] = {
2, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
32,
UV L1PosixPrint_invlist[] = {
4, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
32,
UV PosixPunct_invlist[] = {
8, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
33,
};
UV L1PosixPunct_invlist[] = {
- 21, /* Number of elements */
+ 20, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
33,
187,
188,
191,
- 192,
- 894
+ 192
};
UV PosixSpace_invlist[] = {
4, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
9,
UV XPosixSpace_invlist[] = {
22, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
9,
UV PosixUpper_invlist[] = {
2, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
65,
};
UV L1PosixUpper_invlist[] = {
- 7, /* Number of elements */
+ 6, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
65,
192,
215,
216,
- 223,
- 256
+ 223
};
UV PosixWord_invlist[] = {
8, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
48,
UV L1PosixWord_invlist[] = {
20, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
48,
UV PosixXDigit_invlist[] = {
6, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
48,
UV XPosixXDigit_invlist[] = {
12, /* Number of elements */
0, /* Current iteration position */
- 1064334010, /* Version and data structure type */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
1, /* 0 if this is the first element of the list proper;
1 if the next element is the first */
48,
65351
};
+UV NonL1_Perl_Non_Final_Folds_invlist[] = {
+ 44, /* Number of elements */
+ 0, /* Current iteration position */
+ 0, /* Cache of previous search index result */
+ 290655244, /* Version and data structure type */
+ 1, /* 0 if this is the first element of the list proper;
+ 1 if the next element is the first */
+ 700,
+ 701,
+ 776,
+ 777,
+ 787,
+ 788,
+ 834,
+ 835,
+ 940,
+ 941,
+ 942,
+ 943,
+ 945,
+ 946,
+ 951,
+ 952,
+ 953,
+ 954,
+ 961,
+ 962,
+ 965,
+ 966,
+ 969,
+ 970,
+ 974,
+ 975,
+ 1381,
+ 1382,
+ 1396,
+ 1397,
+ 1406,
+ 1407,
+ 7936,
+ 7944,
+ 7968,
+ 7976,
+ 8032,
+ 8040,
+ 8048,
+ 8049,
+ 8052,
+ 8053,
+ 8060,
+ 8061
+};
+
/* ex: set ro: */