Second Edition

April 14, 2001

Vitaliy has another method for creating irregular arrays. Click here to see his solution.

October 7, 2000

In the B+tree code in Chapter 7, Pauk Squires noticed that the call to WriteHeader in the DeleteItem routine should come after the End If statement. The call to DeleteItemFromNode might merge two nodes and call routine TooSmall. In that case, the program must call WriteHeader to update the garbage pointers.

July 28, 1999

There is a typo on page 24, "Print the items in the list." This code:

    If Not IsNull(I) ...

is only testing the loop counter. It should read:

    If Not IsNull(List(I))...

Thanks to Mike Mitchell for finding this this one.

August 30, 1998

The garbage collection example in Chapter 2 does not update m_GarbageCount when it reclaims garbage items, so it thinks it contains a lot of garbage even after you reclaim them. The solution is to reset m_GarbageCount to zero after performing garbage collection. This link shows a repaired version of subroutine CollectGarbage that you can cut and paste into your program.

May 27, 1998

Chapter 7, program AVL, module AVL.BAS, subroutine ReplaceRightmost. A bug makes the program remove nodes incorrectly. This link shows a repaired version of subroutine ReplaceRightmost that you can cut and paste into your program.

First Edition

May 9, 1997

Many of the example programs use the TimeNow function to measure speed. This function does not work in 32-bit enviroments. This update contains a new version of TIMENOW.BAS. Replace the version you currently have in your Misc subdirectory with this file. TIMENOW.BAS (2K)