On Sat, Mar 22, 2003 at 01:56:50PM -0800, Blars Blarson wrote: > Could it be special-cased for skipping large all-zero blocks at the start > of files and then check the second 1k block? (Or only use larger blocks > when these occur)
Something like that, yes... The easiest way I can imagine is to move *two* windows over the image, say one 64k-sized window and a 1k-sized one. The 1k-sized one would only be used for input files which are smaller than 64k. If the queue gets full, 1k-sized matches are dropped first. In fact, jigdo-file did this for a while, but the code got too complex IMHO, so I removed the feature... > Addapting jigdo when it's assuptions don't mactch reality seems better to > me than trying to change the reality that jigdo needs to deal with. You're right - it's just that the whole algorithm is already complicated enough - <sigh> Richard -- __ _ |_) /| Richard Atterer | CS student at the Technische | GnuPG key: | \/�| http://atterer.net | Universit�t M�nchen, Germany | 0x888354F7 � '` � -- To UNSUBSCRIBE, email to [EMAIL PROTECTED] with a subject of "unsubscribe". Trouble? Contact [EMAIL PROTECTED]
