anchor.diff:          if overflowing karr then
   
               // grow
  -            let values = Array.zeroCreate (karr.Current_ * int (1.0f / karr.Threshold_))
  +            let values = Array.zeroCreate (max 1 karr.Current_ * int karr.Threshold_)
               Array.blit karr.Values_ 0 values 0 karr.Current_
               karr.Values_ <- values
   
  
positive.code:           Removed_ = 0.0f
            Threshold_ = threshold }
  
  /// A garbage-collected keyed array.
  /// TODO: once this is well-tested, let's consider moving into Prime.
  type KeyedArray<'k, 'v when 'k : comparison> = KeyedArray.KeyedArray<'k, 'v>
negative.code:         &karr.[key]
  
      /// Make a KeyedArray with the given compaction threshold and initial capaticy.
      let make<'k, 'v when 'k : comparison> threshold capacity : KeyedArray<'k, 'v> =
          { Keys_ = SortedDictionary<int, 'k> ()
            Indices_ = Dictionary<'k, int> ()
            Values_ = Array.zeroCreate capacity
  