Andi Kleen wrote:
> As far as I can see (from reading fs/hpfs/*) HPFS uses a btree (or perhaps
> b*tree) on disk.
For what: Directory? Data Index? Allocation Map? All of the above?
--
Daniel
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
On Thu, Oct 05, 2000 at 03:46:10PM +0100, [EMAIL PROTECTED] wrote:
>
>
> Good! I hope to meet you next week at ALS as I'm giving a pitch on DProbes
> next Thursday. When is your session?
I'm using it successfully after a quick port to 2.4. Very nice work.
>
> The P-tree by the way is describe
e/UK/IBM@IBMGB, [EMAIL PROTECTED]
cc:
Subject: Re: Phase tree algorithm defined
[EMAIL PROTECTED] wrote:
> You could enhance you document greatly if you provided a few diagrams to
> illustrate the structure, especially the example file system. I'd
suggest
> converting the docum
[EMAIL PROTECTED] wrote:
> You could enhance you document greatly if you provided a few diagrams to
> illustrate the structure, especially the example file system. I'd suggest
> converting the document to HTML or XML.
I am currently preparing slides for the ALS presentation next week in
Atlant
niel Phillips <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED]
cc:(bcc: Richard J Moore/UK/IBM)
Subject: Phase tree algorithm defined
I have finally produced something resembling a formal definition of the
phase tree algorithm. As you will see, this algorithm is somewhat
subtle, and not easy
I have finally produced something resembling a formal definition of the
phase tree algorithm. As you will see, this algorithm is somewhat
subtle, and not easy to express in clear simple terms. But I think that
I have in fact expressed it clearly in simply. If I have not, I wish
very much to be
6 matches
Mail list logo
