anchor.diff:      Node := Node.Next;
     end;
   end; *)
  +
  +function TPathMap.ActualizeWeigths(Weigths: PCPFWeights; Compare: Boolean): Boolean;
  +begin
  +  Result := Compare;
  +  // todo
  +end;
  +
  +function TPathMap.ActualizeStartPoints(Points: PPoint; Count: NativeUInt; Compare: Boolean): Boolean;
  +begin
  +  Result := Compare;
  +  // todo
  +end;
  +
  +function TPathMap.ActualizeExcludedPoints(Points: PPoint; Count: NativeUInt; Compare: Boolean): Boolean;
  +begin
  +  Result := Compare;
  +  // todo
  +end;
  +
  +procedure TPathMap.ActualizeSectors;
  +begin
  +  // todo
  +end;
  +
  +procedure TPathMap.ReleaseAttainableNodes;
  +begin
  +  // todo
  +end;
  +
  +procedure TPathMap.ReleaseHeuristicsNodes;
  +begin
  +  // todo
  +end;
  +
  +procedure TPathMap.ReleaseAllocatedNodes;
  +begin
  +  // todo
  +end;
   
   
   type
  
positive.code:   {$endif}
  
    // tile weigths
    FWeights.Current.Release(FCallAddress);
    FWeights.Default.Release(FCallAddress);
  
    // internal buffers
    FStartPoints.Buffer.Free;
    FExcludedPoints.Buffer.Free;
    FFoundPath.Buffer.Free;
  
    // node storage
    for i := FInfo.NodeStorage.Allocated - 1 downto 0 do
  
negative.code:     FPathLengthLimit: NativeUInt;
      FKind: TPathMapKind;
      FHighTile: TPathMapTile;
      FSectorTest: Boolean;
      FCaching: Boolean;
  
  