Merge pull request #17 from LongDirtyAnimAlf/lazarus-v5

Fix FPC trunk compilation

Author: blikblum

Source/VirtualTrees.pas

@@ -5778,7 +5778,7 @@ procedure TBufferedUTF8String.Add(const S: String);
     FPosition := FStart + LastOffset;
     FEnd := FStart + NewLen;
   end;
-  Move(PChar(S)^, FPosition^, Len);
+  System.Move(PChar(S)^, FPosition^, Len);
   Inc(FPosition, Len);
 end;
 
@@ -8240,12 +8240,12 @@ procedure TVirtualTreeColumns.AdjustPosition(Column: TVirtualTreeColumn; Positio
     if OldPosition < Position then
     begin
       // column will be moved up so move down other entries
-      Move(FPositionToIndex[OldPosition + 1], FPositionToIndex[OldPosition], (Position - OldPosition) * SizeOf(Cardinal));
+      System.Move(FPositionToIndex[OldPosition + 1], FPositionToIndex[OldPosition], (Position - OldPosition) * SizeOf(Cardinal));
     end
     else
     begin
       // column will be moved down so move up other entries
-      Move(FPositionToIndex[Position], FPositionToIndex[Position + 1], (OldPosition - Position) * SizeOf(Cardinal));
+      System.Move(FPositionToIndex[Position], FPositionToIndex[Position + 1], (OldPosition - Position) * SizeOf(Cardinal));
     end;
     FPositionToIndex[Position] := Column.Index;
   end;
@@ -8490,7 +8490,7 @@ procedure TVirtualTreeColumns.IndexChanged(OldIndex, NewIndex: Integer);
       begin
         // Index found. Move all higher entries one step down and remove the last entry.
         if I < Upper then
-          Move(FPositionToIndex[I + 1], FPositionToIndex[I], (Upper - I) * SizeOf(TColumnIndex));
+          System.Move(FPositionToIndex[I + 1], FPositionToIndex[I], (Upper - I) * SizeOf(TColumnIndex));
       end;
       // Decrease all indices, which are greater than the index to be deleted.
       if FPositionToIndex[I] > OldIndex then
@@ -23298,7 +23298,7 @@ function TBaseVirtualTree.InternalAddToSelection(const NewItems: TNodeArray; New
       else
       begin
         // insert remaining new entries at position 0
-        Move(NewItems[0], FSelection[0], (J + 1) * SizeOf(Pointer));
+        System.Move(NewItems[0], FSelection[0], (J + 1) * SizeOf(Pointer));
         // nothing more to do so exit main loop
         Break;
       end;
@@ -23309,7 +23309,7 @@ function TBaseVirtualTree.InternalAddToSelection(const NewItems: TNodeArray; New
       Dec(I);
       // move all entries which are greater than the greatest entry in the new items list up
       // so the remaining gap travels down to where new items must be inserted
-      Move(FSelection[I + 1], FSelection[I + J + 2], (CurrentEnd - I) * SizeOf(Pointer));
+      System.Move(FSelection[I + 1], FSelection[I + J + 2], (CurrentEnd - I) * SizeOf(Pointer));
       CurrentEnd := I;
     end;
 
@@ -25008,7 +25008,7 @@ procedure TBaseVirtualTree.RemoveFromSelection(Node: PVirtualNode);
     begin
       Exclude(Node.States, vsSelected);
       if FindNodeInSelection(Node, Index, -1, -1) and (Index < FSelectionCount - 1) then
-        Move(FSelection[Index + 1], FSelection[Index], (FSelectionCount - Index - 1) * SizeOf(Pointer));
+        System.Move(FSelection[Index + 1], FSelection[Index], (FSelectionCount - Index - 1) * SizeOf(Pointer));
       if FSelectionCount > 0 then
         Dec(FSelectionCount);
       SetLength(FSelection, FSelectionCount);