Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
C
cpython
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
0
Issues
0
List
Boards
Labels
Milestones
Merge Requests
0
Merge Requests
0
Analytics
Analytics
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Commits
Issue Boards
Open sidebar
Kirill Smelkov
cpython
Commits
3550dd30
Commit
3550dd30
authored
Jul 19, 2001
by
Martin v. Löwis
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Patch #442512: put block indices in the right byte order on bigendian systems.
parent
123cbd28
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
5 additions
and
2 deletions
+5
-2
Lib/sre_compile.py
Lib/sre_compile.py
+5
-2
No files found.
Lib/sre_compile.py
View file @
3550dd30
...
@@ -8,7 +8,7 @@
...
@@ -8,7 +8,7 @@
# See the sre.py file for information on usage and redistribution.
# See the sre.py file for information on usage and redistribution.
#
#
import
_sre
import
_sre
,
sys
from
sre_constants
import
*
from
sre_constants
import
*
...
@@ -281,7 +281,10 @@ def _optimize_unicode(charset, fixup):
...
@@ -281,7 +281,10 @@ def _optimize_unicode(charset, fixup):
header
=
[
block
]
header
=
[
block
]
assert
MAXCODE
==
65535
assert
MAXCODE
==
65535
for
i
in
range
(
128
):
for
i
in
range
(
128
):
header
.
append
(
mapping
[
2
*
i
]
+
256
*
mapping
[
2
*
i
+
1
])
if
sys
.
byteorder
==
'big'
:
header
.
append
(
256
*
mapping
[
2
*
i
]
+
mapping
[
2
*
i
+
1
])
else
:
header
.
append
(
mapping
[
2
*
i
]
+
256
*
mapping
[
2
*
i
+
1
])
data
[
0
:
0
]
=
header
data
[
0
:
0
]
=
header
return
[(
BIGCHARSET
,
data
)]
return
[(
BIGCHARSET
,
data
)]
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment