anchor.diff:      FCount : Integer;
       function InternalFind(const Data; out ANode: PTrieLeafNode; out AChildIndex:
           Byte; LeafHasChildIndex: Boolean): Boolean;
  +    function GetBusyIndicator(ANode : PTrieBaseNode; BitFieldIndex : Byte) : Boolean; inline;
  +    procedure SetBusyIndicator(ANode : PTrieBaseNode; BitFieldIndex : Byte; Value : Boolean); inline;
       function GetChildIndex(ANode : PTrieBranchNode; BitFieldIndex : Byte) : Byte; inline;
       procedure SetChildIndex(ANode : PTrieBranchNode; BitFieldIndex, ChildIndex : Byte); {$IFDEF FPC} inline; {$ENDIF}
       function GetBitFieldIndex(const Data; Level : Byte) : Byte;
  
positive.code:     destructor Destroy; override;
      procedure Clear; virtual;
      procedure InitIterator(out AIterator : TTrieIterator);
      procedure Pack;
      property Count : Integer read FCount;
      property Stats : TTrieStats read FStats;
    end;
  
negative.code:     FLastMidBranchNode : Byte;
      function NewTrieBranchNode : PTrieBranchNode;
      function AddChild(ANode : PTrieBranchNode; Level : Byte) : Integer;
      function NextNode(ACurNode : PTrieBranchNode; ALevel, AChildIndex : Byte) : Pointer; inline;
      function GetItem(Index: Integer): Pointer;
      function IteratorBacktrack(var AIterator : TTrieIterator) : Boolean;
  