team-karma team mailing list archive

[arvind iyer <iyer.arvind.sundaram@xxxxxxxxx>]

We had faced a problem regarding the recursive structure of the directory
entry. I have a rather simplistic solution to this problem of removal of
dentrys from the middle of the file stream
We make sure that there are no vacant spaces in any chain!!!!

Whenever an entry is to be removed from the middle of a chain just write the
last (in the chain) entry in its place and resize the filestream. Thats
it!!! no linked list----no bitmaps nothing!!!! How is it ????

all that is needed is that the size of each block be the same, which too we
shall optimize by having say 4 discrete sizes, and corresponding 4 chains.
and also we can have a need based tree development.....

-- 
================================
Work while you are alive, you can rest later