On 6/7/2011 8:29, Invisible wrote:
> Oh, I see. So the FAT is just a map of free clusters?

No. It's a file allocation table.

> I don't think that impacts what I originally said though; you could still
> cache it.

It is cached. It's just that the cache gets written when you close a file 
after allocating space from the cache, because the system can't tell you're 
going to copy more files.  Otherwirse, writing a big file would have to 
slopping back and forth between three different tracks for every granule 
written.

>> In the same way that a linked list is an entirely different thing from a
>> hashtable.
>
> Conceptually, a dictionary is a dictionary, regardless of which data
> structure you use to implement it.

And a linked list is not a dictionary.

-- 
Darren New, San Diego CA, USA (PST)
   "Coding without comments is like
    driving without turn signals."

Post a reply to this message