@@ -353,6 +353,7 @@ impl Pre<()> {
353
353
// strategy when len(patterns)==1 if the number of literals is large. In that
354
354
// case, literal extraction gives up and will return an infinite set.)
355
355
impl < P : PrefilterI > Strategy for Pre < P > {
356
+ #[ cfg_attr( feature = "perf-inline" , inline( always) ) ]
356
357
fn group_info ( & self ) -> & GroupInfo {
357
358
& self . group_info
358
359
}
@@ -378,6 +379,7 @@ impl<P: PrefilterI> Strategy for Pre<P> {
378
379
self . pre . memory_usage ( )
379
380
}
380
381
382
+ #[ cfg_attr( feature = "perf-inline" , inline( always) ) ]
381
383
fn search ( & self , _cache : & mut Cache , input : & Input < ' _ > ) -> Option < Match > {
382
384
if input. is_done ( ) {
383
385
return None ;
@@ -393,6 +395,7 @@ impl<P: PrefilterI> Strategy for Pre<P> {
393
395
. map ( |sp| Match :: new ( PatternID :: ZERO , sp) )
394
396
}
395
397
398
+ #[ cfg_attr( feature = "perf-inline" , inline( always) ) ]
396
399
fn search_half (
397
400
& self ,
398
401
cache : & mut Cache ,
@@ -401,10 +404,12 @@ impl<P: PrefilterI> Strategy for Pre<P> {
401
404
self . search ( cache, input) . map ( |m| HalfMatch :: new ( m. pattern ( ) , m. end ( ) ) )
402
405
}
403
406
407
+ #[ cfg_attr( feature = "perf-inline" , inline( always) ) ]
404
408
fn is_match ( & self , cache : & mut Cache , input : & Input < ' _ > ) -> bool {
405
409
self . search ( cache, input) . is_some ( )
406
410
}
407
411
412
+ #[ cfg_attr( feature = "perf-inline" , inline( always) ) ]
408
413
fn search_slots (
409
414
& self ,
410
415
cache : & mut Cache ,
@@ -421,6 +426,7 @@ impl<P: PrefilterI> Strategy for Pre<P> {
421
426
Some ( m. pattern ( ) )
422
427
}
423
428
429
+ #[ cfg_attr( feature = "perf-inline" , inline( always) ) ]
424
430
fn which_overlapping_matches (
425
431
& self ,
426
432
cache : & mut Cache ,
0 commit comments