summaryrefslogtreecommitdiff
path: root/op.c
diff options
context:
space:
mode:
authorKarl Williamson <public@khwilliamson.com>2011-08-28 12:40:37 -0600
committerKarl Williamson <public@khwilliamson.com>2011-09-02 11:57:44 -0600
commit5c3b35c95645d687026b198c24e884914bfb6ce6 (patch)
treeae8ac11dc1ca3f9abb98b10b3882d0fd5a802e72 /op.c
parentcb366075e52d6ac4c3816d5b59a319395748363d (diff)
downloadperl-5c3b35c95645d687026b198c24e884914bfb6ce6.tar.gz
Unicode::UCD: speed up some look ups
A previous commit created the possibility that for a data structure to be used instead of an array of arrays. The latter data structure is used because most properties have long ranges in which each code point maps to the same thing, and so don't have to have a hash entry for each code point, can use the range as the base data structure. However certain properties (or property-like structures) don't have long ranges, and hence don't need to save memory by having things work through ranges instead of individual code points. For these, a hash offers improved speed, without the memory cost. This patch converts 4 of the data structures to hashes. Future extensions to this module will also take advantage of some of these being in hashes
Diffstat (limited to 'op.c')
0 files changed, 0 insertions, 0 deletions