| commit | 5c91d5356ec2f1e3f87ba4d3665c8230dd8ee25c | |
| author | Dylan Smith <dylan.ah.smith@gmail.com> | |
| Fri, 6 Feb 2009 06:10:06 +0000 (6 01:10 -0500) | ||
| committer | Alexandre Julliard <julliard@winehq.org> | |
| Fri, 6 Feb 2009 13:54:01 +0000 (6 14:54 +0100) | ||
| tree | f32c61b5fe2c42991063b41226f710427308d45d | treesnapshot (tar.gz zip) |
| parent | 5a84e193c2558a9ac6ab1a24d984f6da275b4e6f | commitdiff |
richedit: Avoided searching for adjacent paragraphs through runs.
When finding an adjacent paragraph, the next_para and prev_para pointers
should be used because they are direct pointers, a constant time
operation. Instead I found some places in the code that searched through
the general linked list to get to an adjacent paragraph, which is a linear
time operation, depending on the number of rows and runs in between
paragraphs.
When finding an adjacent paragraph, the next_para and prev_para pointers
should be used because they are direct pointers, a constant time
operation. Instead I found some places in the code that searched through
the general linked list to get to an adjacent paragraph, which is a linear
time operation, depending on the number of rows and runs in between
paragraphs.
| dlls/riched20/paint.c | diffblobblamehistory | |
| dlls/riched20/para.c | diffblobblamehistory | |
| dlls/riched20/row.c | diffblobblamehistory |