@@ -126,7 +126,7 @@ func TestInferString(t *testing.T) {
126126
127127 for _ , tc := range cases {
128128 t .Run (tc .description , func (t * testing.T ) {
129- gotSchema := InferStrings (tc .values , NewHints ()).IntoSchema ()
129+ gotSchema := InferStrings (tc .values , WithoutHints ()).IntoSchema ()
130130 assert .EqualValues (t , tc .expectedSchema , gotSchema )
131131 })
132132 }
@@ -252,7 +252,7 @@ func TestJTDInferWithDiscriminatorHints(t *testing.T) {
252252
253253func BenchmarkInferOneRowNoMissingHints (b * testing.B ) {
254254 wors := generateRows (1 )
255- emptyHints := NewHints ()
255+ emptyHints := WithoutHints ()
256256
257257 for n := 0 ; n < b .N ; n ++ {
258258 InferStrings (wors , emptyHints )
@@ -261,7 +261,7 @@ func BenchmarkInferOneRowNoMissingHints(b *testing.B) {
261261
262262func BenchmarkInferThousandRowsNoMissingHints (b * testing.B ) {
263263 rows := generateRows (1000 )
264- emptyHints := NewHints ()
264+ emptyHints := WithoutHints ()
265265
266266 for n := 0 ; n < b .N ; n ++ {
267267 InferStrings (rows , emptyHints )
@@ -270,15 +270,19 @@ func BenchmarkInferThousandRowsNoMissingHints(b *testing.B) {
270270
271271func BenchmarkInferOneRowMissingHints (b * testing.B ) {
272272 rows := generateRows (1 )
273+ hints := Hints {}
274+
273275 for n := 0 ; n < b .N ; n ++ {
274- InferStrings (rows , nil )
276+ InferStrings (rows , hints )
275277 }
276278}
277279
278280func BenchmarkInferThousandRowsMissingHints (b * testing.B ) {
279281 rows := generateRows (1000 )
282+ hints := Hints {}
283+
280284 for n := 0 ; n < b .N ; n ++ {
281- InferStrings (rows , nil )
285+ InferStrings (rows , hints )
282286 }
283287}
284288
0 commit comments