Use raw arrays for uppercase/lowercase #59

New issue

Open

opened 2020-08-22 20:00:36 +00:00 by Alexey-T · 1 comment

Alexey-T commented

2020-08-22 20:00:36 +00:00

(Migrated from github.com)

Uppercase/lowercase funcs in regex must be very fast. PUCU gives not fast funcs. (some [] indexes, etc). so engine could make internal arrays for first 0xFFFF chars like array[word] of word;
they have big size but fast.

Uppercase/lowercase funcs in regex must be very fast. PUCU gives not fast funcs. (some [] indexes, etc). so engine could make internal arrays for first 0xFFFF chars like `array[word] of word;` they have big size but fast.

benibela commented

2020-09-03 10:11:37 +00:00

(Migrated from github.com)

It is also not fully correct. E.g. K (U+212a) should match K or k case insensitively

But table lookups can be rather slow on modern systems when the table is not in the cache

It is also not fully correct. E.g. K (U+212a) should match K or k case insensitively But table lookups can be rather slow on modern systems when the table is not in the cache