@@ -164,7 +164,7 @@ impl<T> DList<T> {
164
164
/// Remove the first Node and return it, or None if the list is empty
165
165
#[ inline]
166
166
fn pop_front_node ( & mut self ) -> Option < ~Node < T > > {
167
- do self . list_head . take ( ) . map_consume |mut front_node| {
167
+ do self . list_head . take ( ) . map_move |mut front_node| {
168
168
self . length -= 1 ;
169
169
match front_node. next . take ( ) {
170
170
Some ( node) => self . list_head = link_with_prev ( node, Rawlink :: none ( ) ) ,
@@ -190,7 +190,7 @@ impl<T> DList<T> {
190
190
/// Remove the last Node and return it, or None if the list is empty
191
191
#[ inline]
192
192
fn pop_back_node ( & mut self ) -> Option < ~Node < T > > {
193
- do self . list_tail . resolve ( ) . map_consume_default ( None ) |tail| {
193
+ do self . list_tail . resolve ( ) . map_move_default ( None ) |tail| {
194
194
self . length -= 1 ;
195
195
self . list_tail = tail. prev ;
196
196
match tail. prev . resolve ( ) {
@@ -237,7 +237,7 @@ impl<T> Deque<T> for DList<T> {
237
237
///
238
238
/// O(1)
239
239
fn pop_front ( & mut self ) -> Option < T > {
240
- self . pop_front_node ( ) . map_consume ( |~Node { value, _} | value)
240
+ self . pop_front_node ( ) . map_move ( |~Node { value, _} | value)
241
241
}
242
242
243
243
/// Add an element last in the list
@@ -251,7 +251,7 @@ impl<T> Deque<T> for DList<T> {
251
251
///
252
252
/// O(1)
253
253
fn pop_back ( & mut self ) -> Option < T > {
254
- self . pop_back_node ( ) . map_consume ( |~Node { value, _} | value)
254
+ self . pop_back_node ( ) . map_move ( |~Node { value, _} | value)
255
255
}
256
256
}
257
257
@@ -267,7 +267,7 @@ impl<T> DList<T> {
267
267
/// If the list is empty, do nothing.
268
268
#[ inline]
269
269
pub fn rotate_forward ( & mut self ) {
270
- do self . pop_back_node ( ) . map_consume |tail| {
270
+ do self . pop_back_node ( ) . map_move |tail| {
271
271
self . push_front_node ( tail)
272
272
} ;
273
273
}
@@ -277,7 +277,7 @@ impl<T> DList<T> {
277
277
/// If the list is empty, do nothing.
278
278
#[ inline]
279
279
pub fn rotate_backward ( & mut self ) {
280
- do self . pop_front_node ( ) . map_consume |head| {
280
+ do self . pop_front_node ( ) . map_move |head| {
281
281
self . push_back_node ( head)
282
282
} ;
283
283
}
@@ -463,7 +463,7 @@ impl<'self, A> DoubleEndedIterator<&'self A> for DListIterator<'self, A> {
463
463
if self . nelem == 0 {
464
464
return None ;
465
465
}
466
- do self. tail . resolve ( ) . map_consume |prev| {
466
+ do self. tail . resolve ( ) . map_move |prev| {
467
467
self . nelem -= 1 ;
468
468
self . tail = prev. prev ;
469
469
& prev. value
@@ -477,7 +477,7 @@ impl<'self, A> Iterator<&'self mut A> for MutDListIterator<'self, A> {
477
477
if self . nelem == 0 {
478
478
return None ;
479
479
}
480
- do self. head . resolve ( ) . map_consume |next| {
480
+ do self. head . resolve ( ) . map_move |next| {
481
481
self . nelem -= 1 ;
482
482
self . head = match next. next {
483
483
Some ( ref mut node) => Rawlink :: some ( & mut * * node) ,
@@ -499,7 +499,7 @@ impl<'self, A> DoubleEndedIterator<&'self mut A> for MutDListIterator<'self, A>
499
499
if self . nelem == 0 {
500
500
return None ;
501
501
}
502
- do self. tail . resolve ( ) . map_consume |prev| {
502
+ do self. tail . resolve ( ) . map_move |prev| {
503
503
self . nelem -= 1 ;
504
504
self . tail = prev. prev ;
505
505
& mut prev. value
@@ -553,7 +553,7 @@ impl<'self, A> ListInsertion<A> for MutDListIterator<'self, A> {
553
553
if self . nelem == 0 {
554
554
return None
555
555
}
556
- self . head . resolve ( ) . map_consume ( |head| & mut head. value )
556
+ self . head . resolve ( ) . map_move ( |head| & mut head. value )
557
557
}
558
558
}
559
559
0 commit comments