1 /* -*- buffer-read-only: t -*-
2 * !!!!!!! DO NOT EDIT THIS FILE !!!!!!!
3 * This file is built by regen/mk_invlists.pl from Unicode::UCD.
4 * Any changes made here will be lost!
7 /* See the generating file for comments */
10 UV Latin1_invlist[] = {
11 2, /* Number of elements */
12 0, /* Current iteration position */
13 0, /* Cache of previous search index result */
14 290655244, /* Version and data structure type */
15 0, /* 0 if this is the first element of the list proper;
16 1 if the next element is the first */
21 UV AboveLatin1_invlist[] = {
22 1, /* Number of elements */
23 0, /* Current iteration position */
24 0, /* Cache of previous search index result */
25 290655244, /* Version and data structure type */
26 1, /* 0 if this is the first element of the list proper;
27 1 if the next element is the first */
31 UV ASCII_invlist[] = {
32 2, /* Number of elements */
33 0, /* Current iteration position */
34 0, /* Cache of previous search index result */
35 290655244, /* Version and data structure type */
36 0, /* 0 if this is the first element of the list proper;
37 1 if the next element is the first */
42 UV L1Cased_invlist[] = {
43 16, /* Number of elements */
44 0, /* Current iteration position */
45 0, /* Cache of previous search index result */
46 290655244, /* Version and data structure type */
47 1, /* 0 if this is the first element of the list proper;
48 1 if the next element is the first */
67 UV VertSpace_invlist[] = {
68 6, /* Number of elements */
69 0, /* Current iteration position */
70 0, /* Cache of previous search index result */
71 290655244, /* Version and data structure type */
72 1, /* 0 if this is the first element of the list proper;
73 1 if the next element is the first */
82 UV PerlSpace_invlist[] = {
83 4, /* Number of elements */
84 0, /* Current iteration position */
85 0, /* Cache of previous search index result */
86 290655244, /* Version and data structure type */
87 1, /* 0 if this is the first element of the list proper;
88 1 if the next element is the first */
95 UV XPerlSpace_invlist[] = {
96 22, /* Number of elements */
97 0, /* Current iteration position */
98 0, /* Cache of previous search index result */
99 290655244, /* Version and data structure type */
100 1, /* 0 if this is the first element of the list proper;
101 1 if the next element is the first */
126 UV PosixAlnum_invlist[] = {
127 6, /* Number of elements */
128 0, /* Current iteration position */
129 0, /* Cache of previous search index result */
130 290655244, /* Version and data structure type */
131 1, /* 0 if this is the first element of the list proper;
132 1 if the next element is the first */
141 UV L1PosixAlnum_invlist[] = {
142 18, /* Number of elements */
143 0, /* Current iteration position */
144 0, /* Cache of previous search index result */
145 290655244, /* Version and data structure type */
146 1, /* 0 if this is the first element of the list proper;
147 1 if the next element is the first */
168 UV PosixAlpha_invlist[] = {
169 4, /* Number of elements */
170 0, /* Current iteration position */
171 0, /* Cache of previous search index result */
172 290655244, /* Version and data structure type */
173 1, /* 0 if this is the first element of the list proper;
174 1 if the next element is the first */
181 UV L1PosixAlpha_invlist[] = {
182 16, /* Number of elements */
183 0, /* Current iteration position */
184 0, /* Cache of previous search index result */
185 290655244, /* Version and data structure type */
186 1, /* 0 if this is the first element of the list proper;
187 1 if the next element is the first */
206 UV PosixBlank_invlist[] = {
207 4, /* Number of elements */
208 0, /* Current iteration position */
209 0, /* Cache of previous search index result */
210 290655244, /* Version and data structure type */
211 1, /* 0 if this is the first element of the list proper;
212 1 if the next element is the first */
219 UV XPosixBlank_invlist[] = {
220 18, /* Number of elements */
221 0, /* Current iteration position */
222 0, /* Cache of previous search index result */
223 290655244, /* Version and data structure type */
224 1, /* 0 if this is the first element of the list proper;
225 1 if the next element is the first */
246 UV PosixCntrl_invlist[] = {
247 4, /* Number of elements */
248 0, /* Current iteration position */
249 0, /* Cache of previous search index result */
250 290655244, /* Version and data structure type */
251 0, /* 0 if this is the first element of the list proper;
252 1 if the next element is the first */
259 UV XPosixCntrl_invlist[] = {
260 4, /* Number of elements */
261 0, /* Current iteration position */
262 0, /* Cache of previous search index result */
263 290655244, /* Version and data structure type */
264 0, /* 0 if this is the first element of the list proper;
265 1 if the next element is the first */
272 UV PosixDigit_invlist[] = {
273 2, /* Number of elements */
274 0, /* Current iteration position */
275 0, /* Cache of previous search index result */
276 290655244, /* Version and data structure type */
277 1, /* 0 if this is the first element of the list proper;
278 1 if the next element is the first */
283 UV PosixGraph_invlist[] = {
284 2, /* Number of elements */
285 0, /* Current iteration position */
286 0, /* Cache of previous search index result */
287 290655244, /* Version and data structure type */
288 1, /* 0 if this is the first element of the list proper;
289 1 if the next element is the first */
294 UV L1PosixGraph_invlist[] = {
295 4, /* Number of elements */
296 0, /* Current iteration position */
297 0, /* Cache of previous search index result */
298 290655244, /* Version and data structure type */
299 1, /* 0 if this is the first element of the list proper;
300 1 if the next element is the first */
307 UV PosixLower_invlist[] = {
308 2, /* Number of elements */
309 0, /* Current iteration position */
310 0, /* Cache of previous search index result */
311 290655244, /* Version and data structure type */
312 1, /* 0 if this is the first element of the list proper;
313 1 if the next element is the first */
318 UV L1PosixLower_invlist[] = {
319 12, /* Number of elements */
320 0, /* Current iteration position */
321 0, /* Cache of previous search index result */
322 290655244, /* Version and data structure type */
323 1, /* 0 if this is the first element of the list proper;
324 1 if the next element is the first */
339 UV PosixPrint_invlist[] = {
340 2, /* Number of elements */
341 0, /* Current iteration position */
342 0, /* Cache of previous search index result */
343 290655244, /* Version and data structure type */
344 1, /* 0 if this is the first element of the list proper;
345 1 if the next element is the first */
350 UV L1PosixPrint_invlist[] = {
351 4, /* Number of elements */
352 0, /* Current iteration position */
353 0, /* Cache of previous search index result */
354 290655244, /* Version and data structure type */
355 1, /* 0 if this is the first element of the list proper;
356 1 if the next element is the first */
363 UV PosixPunct_invlist[] = {
364 8, /* Number of elements */
365 0, /* Current iteration position */
366 0, /* Cache of previous search index result */
367 290655244, /* Version and data structure type */
368 1, /* 0 if this is the first element of the list proper;
369 1 if the next element is the first */
380 UV L1PosixPunct_invlist[] = {
381 20, /* Number of elements */
382 0, /* Current iteration position */
383 0, /* Cache of previous search index result */
384 290655244, /* Version and data structure type */
385 1, /* 0 if this is the first element of the list proper;
386 1 if the next element is the first */
409 UV PosixSpace_invlist[] = {
410 4, /* Number of elements */
411 0, /* Current iteration position */
412 0, /* Cache of previous search index result */
413 290655244, /* Version and data structure type */
414 1, /* 0 if this is the first element of the list proper;
415 1 if the next element is the first */
422 UV XPosixSpace_invlist[] = {
423 22, /* Number of elements */
424 0, /* Current iteration position */
425 0, /* Cache of previous search index result */
426 290655244, /* Version and data structure type */
427 1, /* 0 if this is the first element of the list proper;
428 1 if the next element is the first */
453 UV PosixUpper_invlist[] = {
454 2, /* Number of elements */
455 0, /* Current iteration position */
456 0, /* Cache of previous search index result */
457 290655244, /* Version and data structure type */
458 1, /* 0 if this is the first element of the list proper;
459 1 if the next element is the first */
464 UV L1PosixUpper_invlist[] = {
465 6, /* Number of elements */
466 0, /* Current iteration position */
467 0, /* Cache of previous search index result */
468 290655244, /* Version and data structure type */
469 1, /* 0 if this is the first element of the list proper;
470 1 if the next element is the first */
479 UV PosixWord_invlist[] = {
480 8, /* Number of elements */
481 0, /* Current iteration position */
482 0, /* Cache of previous search index result */
483 290655244, /* Version and data structure type */
484 1, /* 0 if this is the first element of the list proper;
485 1 if the next element is the first */
496 UV L1PosixWord_invlist[] = {
497 20, /* Number of elements */
498 0, /* Current iteration position */
499 0, /* Cache of previous search index result */
500 290655244, /* Version and data structure type */
501 1, /* 0 if this is the first element of the list proper;
502 1 if the next element is the first */
525 UV PosixXDigit_invlist[] = {
526 6, /* Number of elements */
527 0, /* Current iteration position */
528 0, /* Cache of previous search index result */
529 290655244, /* Version and data structure type */
530 1, /* 0 if this is the first element of the list proper;
531 1 if the next element is the first */
540 UV XPosixXDigit_invlist[] = {
541 12, /* Number of elements */
542 0, /* Current iteration position */
543 0, /* Cache of previous search index result */
544 290655244, /* Version and data structure type */
545 1, /* 0 if this is the first element of the list proper;
546 1 if the next element is the first */
561 UV NonL1_Perl_Non_Final_Folds_invlist[] = {
562 44, /* Number of elements */
563 0, /* Current iteration position */
564 0, /* Cache of previous search index result */
565 290655244, /* Version and data structure type */
566 1, /* 0 if this is the first element of the list proper;
567 1 if the next element is the first */
614 UV _Perl_Multi_Char_Folds_invlist[] = {
615 58, /* Number of elements */
616 0, /* Current iteration position */
617 0, /* Cache of previous search index result */
618 290655244, /* Version and data structure type */
619 1, /* 0 if this is the first element of the list proper;
620 1 if the next element is the first */