anchor.diff:                          let couldBeRoot = (nextGeneration.Count = 0)
                           let avail = calcAvailable sofar couldBeRoot
                           let fitsInline = (avail >= neededForInline)
  -                        let wouldFitInlineOnNextPage = ((pageSize - PAGE_OVERHEAD) >= neededForInline)
  +                        let wouldFitInlineOnNextPage = ((pageSize - PARENT_PAGE_OVERHEAD) >= neededForInline)
                           let fitsOverflow = (avail >= neededForOverflow)
                           let flushThisPage = isLastChild || ((not fitsInline) && (wouldFitInlineOnNextPage || (not fitsOverflow))) 
                           let isRootNode = isLastChild && couldBeRoot
  
positive.code:                         if sofar = 0 then
                              first <- i
                              overflows.Clear()
                              sofar <- PAGE_OVERHEAD
                          if calcAvailable sofar (nextGeneration.Count = 0) >= neededForInline then
                              sofar <- sofar + k.Length
                          else
  
negative.code:             if pb.Position > 0 then
                  let avail = pb.Available - sizeof<int32> // for the lastInt32
                  let fitBothInline = (avail >= neededForBothInline)
                  let wouldFitBothInlineOnNextPage = ((pb.PageSize - LEAF_PAGE_OVERHEAD) >= neededForBothInline)
                  let fitKeyInlineValueOverflow = (avail >= neededForKeyInlineValueOverflow)
                  let fitBothOverflow = (avail >= neededForBothOverflow)
                  let flushThisPage = (not fitBothInline) && (wouldFitBothInlineOnNextPage || ( (not fitKeyInlineValueOverflow) && (not fitBothOverflow) ) )
  