Re^2: Finding oldest file in directory

"it'd be faster to cache your stats for the sort"

Depends on what does "oldest" mean, and how files are created, modified and removed from the directory. The catched info might not be correct and useful. It probably just increases the complexity of the program, with 10+ files in the directory, most likely not worth it.

Comment on Re^2: Finding oldest file in directory

Replies are listed 'Best First'.
Re^3: Finding oldest file in directory by halley (Prior) on Oct 18, 2004 at 18:41 UTC
I think what Randal L. Schwartz was referring to, when he said "cache it for the sort," was to use a very common sort optimization technique called, not coincidentally, the Schwartzian Transform. `@sorted = map { $_->[0] } sort { $a->[1] <=> $b->[1] } map { [ $_, (-s $_) ] } @unsorted;` [download] -- `[ e d @ h a l l e y . c c ]`	[reply] [d/l]
Re^3: Finding oldest file in directory by Fletch (Bishop) on Oct 18, 2004 at 18:58 UTC
If the underlying files are changing quick enough that `-s` isn't going to return the same result you're probably already screwed (and I want to say that some `qsort` implementations might even core on you)).	[reply] [d/l]