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,
UV L1Cased_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 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[] = {
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 XPerlSpace_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 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[] = {
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,
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[] = {
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,
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,
UV NonL1_Perl_Non_Final_Folds_invlist[] = {
44, /* 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 */
700,