optimized Reverse and Shuffle

Author: sglienke

Source/Base/Collections/Spring.Collections.Base.pas

@@ -2586,12 +2586,12 @@ function TIteratorBase<T>.ToArray: TArray<T>;
     TIteratorKind.Reversed:
     begin
       Result := fIterator.Source.ToArray;
-      TArray.Reverse<T>(Result);
+      TArray.Reverse<T>(Result, DynArrayHigh(Result));
     end;
     TIteratorKind.Shuffled:
     begin
       Result := fIterator.Source.ToArray;
-      TArray.Shuffle<T>(Result);
+      TArray.Shuffle<T>(Result, DynArrayHigh(Result));
     end;
   else
     Result := inherited ToArray;
@@ -2976,7 +2976,7 @@ function TIteratorRec<T>.ToArray: Boolean;
     TIteratorKind.Reversed:
       Count := DynArrayLength(Items);
     TIteratorKind.Shuffled:
-      TArray.Shuffle<T>(Items);
+      TArray.Shuffle<T>(Items, DynArrayHigh(Items));
   end;
   Result := True;
 end;

Source/Base/Collections/Spring.Collections.Lists.pas

@@ -1334,7 +1334,7 @@ procedure TAbstractArrayList<T>.Reverse;
   {$Q-}
   Inc(fVersion);
   {$IFDEF OVERFLOWCHECKS_ON}{$Q+}{$ENDIF}
-  TArray.Reverse<T>(fItems, 0, Count);
+  TArray.Reverse<T>(fItems, Count - 1);
 
   Reset;
 end;
@@ -1349,7 +1349,7 @@ procedure TAbstractArrayList<T>.Reverse(index, count: Integer);
   {$Q-}
   Inc(fVersion);
   {$IFDEF OVERFLOWCHECKS_ON}{$Q+}{$ENDIF}
-  TArray.Reverse<T>(fItems, index, count);
+  TArray.Reverse<T>(@fItems[index], count - 1);
 
   Reset;
 end;