Hi, Dale!
If you know some theory of sorting using binary trees, you will know that adding new element to binary tree makes it out of balance. Because VFP index files are not clear binary tree for speed reasons, they become disbalanced more quickly leaving 'free' space. That is why many applications contain nightly utility to pack and reindex tables each night.
>I know that the VFP indexes on tables will bloat. The app I wrote has indexe on 1 of the tables of about 2.5 meg. When I re-indexed the table it went down to 1.5 meg.
>
>The bloat for the index makes sense because we are re-using records in the table. Does this index bloat slow VFP down alot? Or does the bloat just waste space?
>
>Thanks,
>Dale
Vlad Grynchyshyn, Project Manager, MCP
vgryn@yahoo.comICQ #10709245
The professional level of programmer could be determined by level of stupidity of his/her bugs
It is not appropriate to say that question is "foolish". There could be only foolish answers. Everybody passed period of time when knows nothing about something.
