i2p/haiku-beta6
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Reverted last change since, as Axel pointed out, old version is "a bit" faster than the new one

Browse Source 
git-svn-id: file:///srv/svn/repos/haiku/trunk/current@7219 a95241bf-73f2-0310-859d-f6bbb57e9c96
This commit is contained in:
Stefano Ceccherini
2004-04-16 06:21:42 +00:00
parent a45c236cab
commit df5ce07bff
1 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/kits/interface/BTextView/WidthBuffer.cpp
+3 -3
View File
@@ -236,7 +236,7 @@ _BWidthBuffer_::GetEscapement(uint32 value, int32 index, float *escapement)
{
_width_table_ *table = &fBuffer[index];
hashed_escapement *widths = static_cast<hashed_escapement *>(table->widths);
uint32 hashed = Hash(value) % table->tableCount;
uint32 hashed = Hash(value) & (table->tableCount - 1);
DEBUG_ONLY(uint32 iterations = 1;)
uint32 found;
@@ -306,7 +306,7 @@ _BWidthBuffer_::HashEscapements(const char *inText, int32 numChars, int32 textLe
uint32 value = CharToCode(inText + offset, charLen);
uint32 hashed = Hash(value) % table->tableCount;
uint32 hashed = Hash(value) & (table->tableCount - 1);
uint32 found = widths[hashed].code;
// Check if the value is already in the table
@@ -341,7 +341,7 @@ _BWidthBuffer_::HashEscapements(const char *inText, int32 numChars, int32 textLe
// Rehash the values, and put them into the new table
for (int32 oldPos = 0; oldPos < table->tableCount; oldPos++) {
if (widths[oldPos].code != (uint32) -1) {
uint32 newPos = Hash(widths[oldPos].code) % newSize;
uint32 newPos = Hash(widths[oldPos].code) & (newSize - 1);
while (newWidths[newPos].code != (uint32)-1) {
if (++newPos >= (uint32)newSize)
newPos = 0;