@@ -673,18 +673,18 @@ impl ObjectTree {
673673 self . node_indices ( ) . map ( move |idx| TypeRef :: new ( self , idx) )
674674 }
675675
676- pub fn root ( & self ) -> TypeRef {
676+ pub fn root ( & self ) -> TypeRef < ' _ > {
677677 TypeRef :: new ( self , NodeIndex :: new ( 0 ) )
678678 }
679679
680- pub fn find ( & self , path : & str ) -> Option < TypeRef > {
680+ pub fn find ( & self , path : & str ) -> Option < TypeRef < ' _ > > {
681681 if path. is_empty ( ) {
682682 return Some ( self . root ( ) ) ;
683683 }
684684 self . types . get ( path) . map ( |& ix| TypeRef :: new ( self , ix) )
685685 }
686686
687- pub fn expect ( & self , path : & str ) -> TypeRef {
687+ pub fn expect ( & self , path : & str ) -> TypeRef < ' _ > {
688688 match self . types . get ( path) {
689689 Some ( & ix) => TypeRef :: new ( self , ix) ,
690690 None => panic ! ( "type not found: {path:?}" ) ,
@@ -695,7 +695,7 @@ impl ObjectTree {
695695 self . graph . get ( type_. parent_type . index ( ) )
696696 }
697697
698- pub fn type_by_path < I > ( & self , path : I ) -> Option < TypeRef >
698+ pub fn type_by_path < I > ( & self , path : I ) -> Option < TypeRef < ' _ > >
699699 where
700700 I : IntoIterator ,
701701 I :: Item : AsRef < str > ,
@@ -708,7 +708,7 @@ impl ObjectTree {
708708 }
709709 }
710710
711- pub fn type_by_path_approx < I > ( & self , path : I ) -> ( bool , TypeRef )
711+ pub fn type_by_path_approx < I > ( & self , path : I ) -> ( bool , TypeRef < ' _ > )
712712 where
713713 I : IntoIterator ,
714714 I :: Item : AsRef < str > ,
@@ -732,7 +732,7 @@ impl ObjectTree {
732732 ( true , TypeRef :: new ( self , current) )
733733 }
734734
735- pub fn type_by_constant ( & self , constant : & Constant ) -> Option < TypeRef > {
735+ pub fn type_by_constant ( & self , constant : & Constant ) -> Option < TypeRef < ' _ > > {
736736 match constant {
737737 Constant :: String ( string_path) => self . find ( string_path) ,
738738 Constant :: Prefab ( pop) => self . type_by_path ( pop. path . iter ( ) ) ,
0 commit comments