@@ -107,16 +107,16 @@ enum TokenTreeOrTokenTreeVec {
107107
108108impl TokenTreeOrTokenTreeVec {
109109 fn len ( & self ) -> usize {
110- match self {
111- & TtSeq ( ref v) => v. len ( ) ,
112- & Tt ( ref tt) => tt. len ( ) ,
110+ match * self {
111+ TtSeq ( ref v) => v. len ( ) ,
112+ Tt ( ref tt) => tt. len ( ) ,
113113 }
114114 }
115115
116116 fn get_tt ( & self , index : usize ) -> TokenTree {
117- match self {
118- & TtSeq ( ref v) => v[ index] . clone ( ) ,
119- & Tt ( ref tt) => tt. get_tt ( index) ,
117+ match * self {
118+ TtSeq ( ref v) => v[ index] . clone ( ) ,
119+ Tt ( ref tt) => tt. get_tt ( index) ,
120120 }
121121 }
122122}
@@ -144,17 +144,17 @@ pub struct MatcherPos {
144144
145145pub fn count_names ( ms : & [ TokenTree ] ) -> usize {
146146 ms. iter ( ) . fold ( 0 , |count, elt| {
147- count + match elt {
148- & TokenTree :: Sequence ( _, ref seq) => {
147+ count + match * elt {
148+ TokenTree :: Sequence ( _, ref seq) => {
149149 seq. num_captures
150150 }
151- & TokenTree :: Delimited ( _, ref delim) => {
151+ TokenTree :: Delimited ( _, ref delim) => {
152152 count_names ( & delim. tts )
153153 }
154- & TokenTree :: Token ( _, MatchNt ( ..) ) => {
154+ TokenTree :: Token ( _, MatchNt ( ..) ) => {
155155 1
156156 }
157- & TokenTree :: Token ( _, _) => 0 ,
157+ TokenTree :: Token ( _, _) => 0 ,
158158 }
159159 } )
160160}
@@ -203,18 +203,18 @@ pub fn nameize(p_s: &ParseSess, ms: &[TokenTree], res: &[Rc<NamedMatch>])
203203 -> HashMap < Name , Rc < NamedMatch > > {
204204 fn n_rec ( p_s : & ParseSess , m : & TokenTree , res : & [ Rc < NamedMatch > ] ,
205205 ret_val : & mut HashMap < Name , Rc < NamedMatch > > , idx : & mut usize ) {
206- match m {
207- & TokenTree :: Sequence ( _, ref seq) => {
206+ match * m {
207+ TokenTree :: Sequence ( _, ref seq) => {
208208 for next_m in & seq. tts {
209209 n_rec ( p_s, next_m, res, ret_val, idx)
210210 }
211211 }
212- & TokenTree :: Delimited ( _, ref delim) => {
212+ TokenTree :: Delimited ( _, ref delim) => {
213213 for next_m in & delim. tts {
214214 n_rec ( p_s, next_m, res, ret_val, idx)
215215 }
216216 }
217- & TokenTree :: Token ( sp, MatchNt ( bind_name, _, _, _) ) => {
217+ TokenTree :: Token ( sp, MatchNt ( bind_name, _, _, _) ) => {
218218 match ret_val. entry ( bind_name. name ) {
219219 Vacant ( spot) => {
220220 spot. insert ( res[ * idx] . clone ( ) ) ;
@@ -228,8 +228,8 @@ pub fn nameize(p_s: &ParseSess, ms: &[TokenTree], res: &[Rc<NamedMatch>])
228228 }
229229 }
230230 }
231- & TokenTree :: Token ( _, SubstNt ( ..) ) => panic ! ( "Cannot fill in a NT" ) ,
232- & TokenTree :: Token ( _, _) => ( ) ,
231+ TokenTree :: Token ( _, SubstNt ( ..) ) => panic ! ( "Cannot fill in a NT" ) ,
232+ TokenTree :: Token ( _, _) => ( ) ,
233233 }
234234 }
235235 let mut ret_val = HashMap :: new ( ) ;
0 commit comments