@@ -186,7 +186,7 @@ pub fn reorder_table_keys(table: &mut RefMut<Vec<SyntaxElement>>, order: &[&str]
186186 table. splice ( 0 ..size, to_insert) ;
187187}
188188
189- fn load_keys ( table : & RefMut < Vec < SyntaxElement > > ) -> ( HashMap < String , usize > , Vec < Vec < SyntaxElement > > ) {
189+ fn load_keys ( table : & [ SyntaxElement ] ) -> ( HashMap < String , usize > , Vec < Vec < SyntaxElement > > ) {
190190 let mut key_to_pos = HashMap :: < String , usize > :: new ( ) ;
191191 let mut key_set = Vec :: < Vec < SyntaxElement > > :: new ( ) ;
192192 let entry_set = RefCell :: new ( Vec :: < SyntaxElement > :: new ( ) ) ;
@@ -200,7 +200,7 @@ fn load_keys(table: &RefMut<Vec<SyntaxElement>>) -> (HashMap<String, usize>, Vec
200200 } ;
201201 let mut key = String :: new ( ) ;
202202 let mut cutoff = false ;
203- for element in table. iter ( ) {
203+ for element in table {
204204 let kind = element. kind ( ) ;
205205 if kind == ENTRY {
206206 if cutoff {
@@ -238,12 +238,12 @@ pub fn get_table_name(entry: &SyntaxElement) -> String {
238238 String :: new ( )
239239}
240240
241- pub fn for_entries < F > ( table : & RefMut < Vec < SyntaxElement > > , f : & mut F )
241+ pub fn for_entries < F > ( table : & [ SyntaxElement ] , f : & mut F )
242242where
243243 F : FnMut ( String , & SyntaxNode ) ,
244244{
245245 let mut key = String :: new ( ) ;
246- for table_entry in table. iter ( ) {
246+ for table_entry in table {
247247 if table_entry. kind ( ) == ENTRY {
248248 for entry in table_entry. as_node ( ) . unwrap ( ) . children_with_tokens ( ) {
249249 if entry. kind ( ) == KEY {
0 commit comments