In article <45C8CA0E.7456.5F23C6@twegner.swbell.net>, "Tim Wegner" <twegner@swbell.net> writes:
We'll probably not be able to reconstruct the exact reason, but my recollection is that the seek-from-the-bottom logic was most robust with a little extra length. I believe if the calculation gives a larger result nothing bad happens, but that needs to be checked.
Yeah, I notice that the first seek-from-end attempt never works and it always goes through a loop until its offset is far enough back to find the fractal chunk. Is there any particular reason you don't scan from the front? "Its too slow on floppy disks"? -- "The Direct3D Graphics Pipeline" -- DirectX 9 draft available for download <http://www.xmission.com/~legalize/book/download/index.html> Legalize Adulthood! <http://blogs.xmission.com/legalize/>