Thanks for the feedback. That definitely asks for a binary tree search. So I am convinced now (I'll not do it immediately, but probably towards the end of my redesign work).
Raienr > -----Original Message----- > From: [email protected] [mailto:rsyslog- > [email protected]] On Behalf Of [email protected] > Sent: Thursday, June 04, 2009 1:51 PM > To: rsyslog-users > Subject: Re: [rsyslog] request for feedback: dynafile cache size > > On Thu, 4 Jun 2009, Rainer Gerhards wrote: > > > Hi all, > > > > as you probably know, dynafiles keep a cache of the n most recently used > > files open. This is done in order to speed up processing. I wonder how many > > files you usually expect to be open. The root of my question is that I think > > about the algorithm that finds cache entries. So far, a simple linked list > is > > used, but I wonder if something more efficient (like a binary tree) would be > > useful. On the other hand, if the cache size is really small, there is not > > much difference between O(n) and O(log n), so it may not justify added code > > complexity. > > > > Feedback appreciated. > > I have a use case where it could be several thousand files > > I would expect the normal worst case to be dozens to a few hundred files. > > David Lang > _______________________________________________ > rsyslog mailing list > http://lists.adiscon.net/mailman/listinfo/rsyslog > http://www.rsyslog.com _______________________________________________ rsyslog mailing list http://lists.adiscon.net/mailman/listinfo/rsyslog http://www.rsyslog.com
