anchor.diff:  
   const
     BitsPerByte                = 8;
  -  BitsForChildIndexPerBucket = 4;
  -  BucketMask                 = $F;
  +  BitsForChildIndexPerBucket = 4;   // Don't play with this knob, code designed to work on this specific value
  +  BucketMask                 = $F;  // Don't play with this knob, code designed to work on this specific value
     MaxTrieDepth               = sizeof(Int64) * BitsPerByte div BitsForChildIndexPerBucket;
     ChildrenPerBucket          = BitsForChildIndexPerBucket * BitsForChildIndexPerBucket;
     TrieDepth16Bits            = (sizeof(Word) * BitsPerByte) div BitsForChildIndexPerBucket;
  
positive.code:   branch node.
    Finally, Leaf nodes can be dynamically controlled by the derived class from TTrie
    allowing for easy implementation of dictionaries using TTrie as a base.
  *)
  
  unit Trie;
  
negative.code:   begin
      AIterator.ANodeStack[0] := @FRoot^.Base;
      {$IFDEF VER180}
      if ATrieDepth > TrieDepth32Bits then
        AIterator.LastResult64 := 0
      else AIterator.LastResult32 := 0;
  