Jan. 6, 2005
2:18 p.m.
hello all: it seems that dillo doesn't use cache replace algorithms. it simply inserts new entry into the hash table. then if the program runs for a long time, it will use more and more memories. doesn't it?