Removed AggressiveOptimization attributes

Author: Sergio0694

Microsoft.Toolkit.HighPerformance/Helpers/Internals/SpanHelper.Count.cs

@@ -79,9 +79,6 @@ public static nint Count<T>(ref T r0, nint length, T value)
         /// Implements <see cref="Count{T}"/> with a sequential search.
         /// </summary>
         [Pure]
-#if NETCOREAPP3_1
-        [MethodImpl(MethodImplOptions.AggressiveOptimization)]
-#endif
         private static nint CountSequential<T>(ref T r0, nint length, T value)
             where T : IEquatable<T>
         {
@@ -132,9 +129,6 @@ private static nint CountSequential<T>(ref T r0, nint length, T value)
         /// Implements <see cref="Count{T}"/> with a vectorized search.
         /// </summary>
         [Pure]
-#if NETCOREAPP3_1
-        [MethodImpl(MethodImplOptions.AggressiveOptimization)]
-#endif
         private static nint CountSimd<T>(ref T r0, nint length, T value)
             where T : unmanaged, IEquatable<T>
         {

Microsoft.Toolkit.HighPerformance/Helpers/Internals/SpanHelper.Hash.cs

@@ -21,9 +21,6 @@ internal static partial class SpanHelper
         /// <param name="length">The number of items to hash.</param>
         /// <returns>The Djb2 value for the input sequence of items.</returns>
         [Pure]
-#if NETCOREAPP3_1
-        [MethodImpl(MethodImplOptions.AggressiveOptimization)]
-#endif
         public static int GetDjb2HashCode<T>(ref T r0, nint length)
             where T : notnull
         {
@@ -87,9 +84,6 @@ public static int GetDjb2HashCode<T>(ref T r0, nint length)
         /// faster than <see cref="GetDjb2HashCode{T}"/>, as it can parallelize much of the workload.
         /// </remarks>
         [Pure]
-#if NETCOREAPP3_1
-        [MethodImpl(MethodImplOptions.AggressiveOptimization)]
-#endif
         public static unsafe int GetDjb2LikeByteHash(ref byte r0, nint length)
         {
             int hash = 5381;