you are in an fs with millions of small files

[Arne Wörner]

--- Arne Wörner <arne_woerner at yahoo.com> wrote:
> --- Giorgos Keramidas <keramida at freebsd.org> wrote:
> But I do not know if the shift operations in L are not so
> good...
> 
> But the memory usage looks quite good to me...
> 
> I say, the sort of the directory entries should have a time
> complexity of O(N*log(N))?
> 
> Do you think, I should try to implement it?
> 
Oooops...

I just compared my algorithm to ls(1). And ls(1) is about 12 times
faster than my algorithm with a 120000 files directory.

First putting the entries into my data structure (but without
sorting) and then using qsort is a little bit faster than ls(1).

-Arne :-)



		
__________________________________ 
Discover Yahoo! 
Find restaurants, movies, travel and more fun for the weekend. Check it out! 
http://discover.yahoo.com/weekend.html