else:
code = 'I'
# Convert block indices to byte array of 256 bytes
- mapping = array.array('b', mapping).tobytes()
+ mapping = array.array('B', mapping).tobytes()
# Convert byte array to word array
mapping = array.array(code, mapping)
assert mapping.itemsize == _sre.CODESIZE
"\u2222").group(1), "\u2222")
self.assertEqual(re.match("([\u2222\u2223])",
"\u2222", re.UNICODE).group(1), "\u2222")
+ r = '[%s]' % ''.join(map(chr, range(256, 2**16, 255)))
+ self.assertEqual(re.match(r,
+ "\uff01", re.UNICODE).group(), "\uff01")
def test_big_codesize(self):
# Issue #1160
Library
-------
+- Issue #19327: Fixed the working of regular expressions with too big charset.
+
- Issue #19350: Increasing the test coverage of macurl2path. Patch by Colin
Williams.
count = *(set++);
if (sizeof(SRE_CODE) == 2) {
- block = ((char*)set)[ch >> 8];
+ block = ((unsigned char*)set)[ch >> 8];
set += 128;
if (set[block*16 + ((ch & 255)>>4)] & (1 << (ch & 15)))
return ok;
/* !(c & ~N) == (c < N+1) for any unsigned c, this avoids
* warnings when c's type supports only numbers < N+1 */
if (!(ch & ~65535))
- block = ((char*)set)[ch >> 8];
+ block = ((unsigned char*)set)[ch >> 8];
else
block = -1;
set += 64;