| commit | b47d48fdae42ba9127cf8394217634cb22123555 | |
| author | Stas Boukarev <stassats@gmail.com> | |
| Wed, 21 Dec 2016 19:50:12 +0000 (21 22:50 +0300) | ||
| committer | Stas Boukarev <stassats@gmail.com> | |
| Wed, 21 Dec 2016 19:50:12 +0000 (21 22:50 +0300) | ||
| tree | dbe3cf5555c4e88f00a0cb5c36d6c3944bc5e3ed | treesnapshot (tar.gz zip) |
| parent | bfb7de5ffff78e43cefcb5e43280684e68f89e78 | commitdiff |
Optimize two-arg-char-equal.
Previously it compared equal-char-code, lower case, of both
characters, but the table that stores these codes has lower case and
upper case adjacent. So it needs to compute table addresses only once
and use both cases for comparison.
Previously it compared equal-char-code, lower case, of both
characters, but the table that stores these codes has lower case and
upper case adjacent. So it needs to compute table addresses only once
and use both cases for comparison.
| src/code/target-char.lisp | diffblobblamehistory |