[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Groff-commit] groff ChangeLog
From: |
Werner LEMBERG |
Subject: |
[Groff-commit] groff ChangeLog |
Date: |
Sun, 26 Dec 2010 10:50:18 +0000 |
CVSROOT: /cvsroot/groff
Module name: groff
Changes by: Werner LEMBERG <wl> 10/12/26 10:50:18
Modified files:
. : ChangeLog
Log message:
Thinko.
CVSWeb URLs:
http://cvs.savannah.gnu.org/viewcvs/groff/ChangeLog?cvsroot=groff&r1=1.1264&r2=1.1265
Patches:
Index: ChangeLog
===================================================================
RCS file: /cvsroot/groff/groff/ChangeLog,v
retrieving revision 1.1264
retrieving revision 1.1265
diff -u -b -r1.1264 -r1.1265
--- ChangeLog 26 Dec 2010 10:43:35 -0000 1.1264
+++ ChangeLog 26 Dec 2010 10:50:18 -0000 1.1265
@@ -3,12 +3,13 @@
Speed up troff.
* src/include/ptable.h (PTABLE): Make hash tables much more sparse
- by changing `FULL_NUM' from 3 to 1. This increases the allocated
- memory by about 200kByte (which is nothing today) but assures that
- there aren't extremely long searches for a free hash slot in case
- that the hash function doesn't return a free one. Due to the nature
- of the entries in uniuni.cpp, the used hash function in ptable.cpp
- is not optimal, but using a sparse array compensates this.
+ by changing the ratio `FULL_NUM/FULL_DEN' from 2/3 to 1/4. This
+ increases the allocated memory by about 200kByte (which is nothing
+ today) but assures that there aren't extremely long searches for a
+ free hash slot in case that the hash function doesn't return a free
+ one. Due to the nature of the entries in uniuni.cpp, the used hash
+ function in ptable.cpp is not optimal, but using a sparse array
+ compensates this.
2010-12-20 Werner LEMBERG <address@hidden>