@@ -334,7 +334,7 @@ struct SenderTask {
334334
335335impl SenderTask {
336336 fn new ( ) -> Self {
337- SenderTask {
337+ Self {
338338 task : None ,
339339 is_parked : false ,
340340 }
@@ -665,7 +665,7 @@ impl<T> BoundedSenderInner<T> {
665665 /// Returns whether the sender send to this receiver.
666666 fn is_connected_to ( & self , receiver : & Arc < BoundedInner < T > > ) -> bool {
667667 Arc :: ptr_eq ( & self . inner , & receiver)
668- }
668+ }
669669
670670 /// Returns pointer to the Arc containing sender
671671 ///
@@ -896,19 +896,19 @@ impl<T> UnboundedSender<T> {
896896}
897897
898898impl < T > Clone for Sender < T > {
899- fn clone ( & self ) -> Sender < T > {
900- Sender ( self . 0 . clone ( ) )
899+ fn clone ( & self ) -> Self {
900+ Self ( self . 0 . clone ( ) )
901901 }
902902}
903903
904904impl < T > Clone for UnboundedSender < T > {
905- fn clone ( & self ) -> UnboundedSender < T > {
906- UnboundedSender ( self . 0 . clone ( ) )
905+ fn clone ( & self ) -> Self {
906+ Self ( self . 0 . clone ( ) )
907907 }
908908}
909909
910910impl < T > Clone for UnboundedSenderInner < T > {
911- fn clone ( & self ) -> UnboundedSenderInner < T > {
911+ fn clone ( & self ) -> Self {
912912 // Since this atomic op isn't actually guarding any memory and we don't
913913 // care about any orderings besides the ordering on the single atomic
914914 // variable, a relaxed ordering is acceptable.
@@ -928,7 +928,7 @@ impl<T> Clone for UnboundedSenderInner<T> {
928928 // The ABA problem doesn't matter here. We only care that the
929929 // number of senders never exceeds the maximum.
930930 if actual == curr {
931- return UnboundedSenderInner {
931+ return Self {
932932 inner : self . inner . clone ( ) ,
933933 } ;
934934 }
@@ -939,7 +939,7 @@ impl<T> Clone for UnboundedSenderInner<T> {
939939}
940940
941941impl < T > Clone for BoundedSenderInner < T > {
942- fn clone ( & self ) -> BoundedSenderInner < T > {
942+ fn clone ( & self ) -> Self {
943943 // Since this atomic op isn't actually guarding any memory and we don't
944944 // care about any orderings besides the ordering on the single atomic
945945 // variable, a relaxed ordering is acceptable.
@@ -959,7 +959,7 @@ impl<T> Clone for BoundedSenderInner<T> {
959959 // The ABA problem doesn't matter here. We only care that the
960960 // number of senders never exceeds the maximum.
961961 if actual == curr {
962- return BoundedSenderInner {
962+ return Self {
963963 inner : self . inner . clone ( ) ,
964964 sender_task : Arc :: new ( Mutex :: new ( SenderTask :: new ( ) ) ) ,
965965 maybe_parked : false ,
0 commit comments