11using System . Runtime . CompilerServices ;
22using BenchmarkDotNet . Attributes ;
3- using BenchmarkDotNet . Columns ;
43using BenchmarkDotNet . Configs ;
5- using BenchmarkDotNet . Diagnosers ;
64
75namespace newtype . benchmark ;
86
@@ -39,7 +37,7 @@ public void Setup()
3937 public bool Contains_Raw ( ) => Contains ( _rawArr , 512 ) ;
4038
4139 [ Benchmark , BenchmarkCategory ( "Contains" ) ]
42- public bool Contains_Alias ( ) => Contains ( _aliasArr , ( EntityId ) 512 ) ;
40+ public bool Contains_Alias ( ) => Contains ( _aliasArr , ( EntityId ) 512 ) ;
4341
4442 // --- Generic min (IComparable<T>) ---
4543 [ Benchmark ( Baseline = true ) , BenchmarkCategory ( "GenericMin" ) ]
@@ -76,15 +74,16 @@ public void SortSetup()
7674 public int CountEq_Raw ( ) => CountEqual ( _rawArr , 0 ) ;
7775
7876 [ Benchmark , BenchmarkCategory ( "CountEq" ) ]
79- public int CountEq_Alias ( ) => CountEqual ( _aliasArr , ( EntityId ) 0 ) ;
77+ public int CountEq_Alias ( ) => CountEqual ( _aliasArr , ( EntityId ) 0 ) ;
8078
8179 // --- Helpers: generic with struct constraints for devirtualization ---
8280
8381 [ MethodImpl ( MethodImplOptions . NoInlining ) ]
8482 private static bool Contains < T > ( T [ ] arr , T value ) where T : struct , IEquatable < T >
8583 {
8684 for ( var i = 0 ; i < arr . Length ; i ++ )
87- if ( arr [ i ] . Equals ( value ) ) return true ;
85+ if ( arr [ i ] . Equals ( value ) )
86+ return true ;
8887 return false ;
8988 }
9089
@@ -93,7 +92,8 @@ private static T FindMin<T>(T[] arr) where T : struct, IComparable<T>
9392 {
9493 var min = arr [ 0 ] ;
9594 for ( var i = 1 ; i < arr . Length ; i ++ )
96- if ( arr [ i ] . CompareTo ( min ) < 0 ) min = arr [ i ] ;
95+ if ( arr [ i ] . CompareTo ( min ) < 0 )
96+ min = arr [ i ] ;
9797 return min ;
9898 }
9999
@@ -109,6 +109,7 @@ private static void InsertionSort<T>(T[] arr) where T : struct, IComparable<T>
109109 arr [ j + 1 ] = arr [ j ] ;
110110 j -- ;
111111 }
112+
112113 arr [ j + 1 ] = key ;
113114 }
114115 }
@@ -118,7 +119,8 @@ private static int CountEqual<T>(T[] arr, T value) where T : struct, IEquatable<
118119 {
119120 var count = 0 ;
120121 for ( var i = 0 ; i < arr . Length ; i ++ )
121- if ( arr [ i ] . Equals ( value ) ) count ++ ;
122+ if ( arr [ i ] . Equals ( value ) )
123+ count ++ ;
122124 return count ;
123125 }
124- }
126+ }
0 commit comments