* Yu Zenghui <yuzenghui@people.com.cn> wrote:
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?
Hmm. I always thought that was a feature. :) Seriously, I find it useful that dillo uses cache when possible, without touching the network. That makes it easy for me to preload a bunch of pages and then browse them when I don't have 'net access. It also speeds things up compared to browsers which check the network for updates before (or instead of) using cache. I don't tend to run one copy of dillo for a long time, though. Instead, I generally start a new instance for each site or task, and close it when I'm done. I think I have about 20-30 open right now. I guess in that sense, I treat it like an xterm -- open it, perform one or two tasks with it, then close it. I have a lot of instances running all the time, but I cycle through them quickly. Since each one has a single purpose, it's almost like a sticky-note to remind me to finish something. -- Scott