@@ -10,8 +10,8 @@ use crate::socket::TcpState;
1010/// The only reason this struct is public is to allow the socket set storage
1111/// to be allocated externally.
1212#[ derive( Debug ) ]
13- pub struct Item < ' a , ' b : ' a > {
14- socket : Socket < ' a , ' b > ,
13+ pub struct Item < ' a > {
14+ socket : Socket < ' a > ,
1515 refs : usize
1616}
1717
@@ -27,16 +27,16 @@ impl fmt::Display for Handle {
2727
2828/// An extensible set of sockets.
2929///
30- /// The lifetimes `'b` and `'c` are used when storing a `Socket<'b, 'c >`.
30+ /// The lifetime `'b` is used when storing a `Socket<'b>`.
3131#[ derive( Debug ) ]
32- pub struct Set < ' a , ' b : ' a , ' c : ' a + ' b > {
33- sockets : ManagedSlice < ' a , Option < Item < ' b , ' c > > >
32+ pub struct Set < ' a , ' b : ' a > {
33+ sockets : ManagedSlice < ' a , Option < Item < ' b > > >
3434}
3535
36- impl < ' a , ' b : ' a , ' c : ' a + ' b > Set < ' a , ' b , ' c > {
36+ impl < ' a , ' b : ' a > Set < ' a , ' b > {
3737 /// Create a socket set using the provided storage.
38- pub fn new < SocketsT > ( sockets : SocketsT ) -> Set < ' a , ' b , ' c >
39- where SocketsT : Into < ManagedSlice < ' a , Option < Item < ' b , ' c > > > > {
38+ pub fn new < SocketsT > ( sockets : SocketsT ) -> Set < ' a , ' b >
39+ where SocketsT : Into < ManagedSlice < ' a , Option < Item < ' b > > > > {
4040 let sockets = sockets. into ( ) ;
4141 Set { sockets }
4242 }
@@ -46,10 +46,10 @@ impl<'a, 'b: 'a, 'c: 'a + 'b> Set<'a, 'b, 'c> {
4646 /// # Panics
4747 /// This function panics if the storage is fixed-size (not a `Vec`) and is full.
4848 pub fn add < T > ( & mut self , socket : T ) -> Handle
49- where T : Into < Socket < ' b , ' c > >
49+ where T : Into < Socket < ' b > >
5050 {
51- fn put < ' b , ' c > ( index : usize , slot : & mut Option < Item < ' b , ' c > > ,
52- mut socket : Socket < ' b , ' c > ) -> Handle {
51+ fn put < ' b > ( index : usize , slot : & mut Option < Item < ' b > > ,
52+ mut socket : Socket < ' b > ) -> Handle {
5353 net_trace ! ( "[{}]: adding" , index) ;
5454 let handle = Handle ( index) ;
5555 socket. meta_mut ( ) . handle = handle;
@@ -83,7 +83,7 @@ impl<'a, 'b: 'a, 'c: 'a + 'b> Set<'a, 'b, 'c> {
8383 /// # Panics
8484 /// This function may panic if the handle does not belong to this socket set
8585 /// or the socket has the wrong type.
86- pub fn get < T : AnySocket < ' b , ' c > > ( & mut self , handle : Handle ) -> SocketRef < T > {
86+ pub fn get < T : AnySocket < ' b > > ( & mut self , handle : Handle ) -> SocketRef < T > {
8787 match self . sockets [ handle. 0 ] . as_mut ( ) {
8888 Some ( item) => {
8989 T :: downcast ( SocketRef :: new ( & mut item. socket ) )
@@ -97,7 +97,7 @@ impl<'a, 'b: 'a, 'c: 'a + 'b> Set<'a, 'b, 'c> {
9797 ///
9898 /// # Panics
9999 /// This function may panic if the handle does not belong to this socket set.
100- pub fn remove ( & mut self , handle : Handle ) -> Socket < ' b , ' c > {
100+ pub fn remove ( & mut self , handle : Handle ) -> Socket < ' b > {
101101 net_trace ! ( "[{}]: removing" , handle. 0 ) ;
102102 match self . sockets [ handle. 0 ] . take ( ) {
103103 Some ( item) => item. socket ,
@@ -166,12 +166,12 @@ impl<'a, 'b: 'a, 'c: 'a + 'b> Set<'a, 'b, 'c> {
166166 }
167167
168168 /// Iterate every socket in this set.
169- pub fn iter < ' d > ( & ' d self ) -> Iter < ' d , ' b , ' c > {
169+ pub fn iter < ' d > ( & ' d self ) -> Iter < ' d , ' b > {
170170 Iter { lower : self . sockets . iter ( ) }
171171 }
172172
173173 /// Iterate every socket in this set, as SocketRef.
174- pub fn iter_mut < ' d > ( & ' d mut self ) -> IterMut < ' d , ' b , ' c > {
174+ pub fn iter_mut < ' d > ( & ' d mut self ) -> IterMut < ' d , ' b > {
175175 IterMut { lower : self . sockets . iter_mut ( ) }
176176 }
177177}
@@ -180,12 +180,12 @@ impl<'a, 'b: 'a, 'c: 'a + 'b> Set<'a, 'b, 'c> {
180180///
181181/// This struct is created by the [iter](struct.SocketSet.html#method.iter)
182182/// on [socket sets](struct.SocketSet.html).
183- pub struct Iter < ' a , ' b : ' a , ' c : ' a + ' b > {
184- lower : slice:: Iter < ' a , Option < Item < ' b , ' c > > >
183+ pub struct Iter < ' a , ' b : ' a > {
184+ lower : slice:: Iter < ' a , Option < Item < ' b > > >
185185}
186186
187- impl < ' a , ' b : ' a , ' c : ' a + ' b > Iterator for Iter < ' a , ' b , ' c > {
188- type Item = & ' a Socket < ' b , ' c > ;
187+ impl < ' a , ' b : ' a > Iterator for Iter < ' a , ' b > {
188+ type Item = & ' a Socket < ' b > ;
189189
190190 fn next ( & mut self ) -> Option < Self :: Item > {
191191 while let Some ( item_opt) = self . lower . next ( ) {
@@ -201,12 +201,12 @@ impl<'a, 'b: 'a, 'c: 'a + 'b> Iterator for Iter<'a, 'b, 'c> {
201201///
202202/// This struct is created by the [iter_mut](struct.SocketSet.html#method.iter_mut)
203203/// on [socket sets](struct.SocketSet.html).
204- pub struct IterMut < ' a , ' b : ' a , ' c : ' a + ' b > {
205- lower : slice:: IterMut < ' a , Option < Item < ' b , ' c > > > ,
204+ pub struct IterMut < ' a , ' b : ' a > {
205+ lower : slice:: IterMut < ' a , Option < Item < ' b > > > ,
206206}
207207
208- impl < ' a , ' b : ' a , ' c : ' a + ' b > Iterator for IterMut < ' a , ' b , ' c > {
209- type Item = SocketRef < ' a , Socket < ' b , ' c > > ;
208+ impl < ' a , ' b : ' a > Iterator for IterMut < ' a , ' b > {
209+ type Item = SocketRef < ' a , Socket < ' b > > ;
210210
211211 fn next ( & mut self ) -> Option < Self :: Item > {
212212 while let Some ( item_opt) = self . lower . next ( ) {
0 commit comments