@@ -643,7 +643,7 @@ mod tests {
643643 }
644644
645645 fn entry_with_peer_id ( peer_id : PeerId ) -> P2pNetworkKadEntry {
646- let key = peer_id. try_into ( ) . unwrap ( ) ;
646+ let key = peer_id. try_into ( ) . expect ( "Error converting PeerId" ) ;
647647 P2pNetworkKadEntry {
648648 key,
649649 peer_id,
@@ -655,11 +655,12 @@ mod tests {
655655 #[ test]
656656 fn test_key_generation ( ) {
657657 let random_peer_id = SecretKey :: rand ( ) . public_key ( ) . peer_id ( ) ;
658- let libp2p_peer_id = libp2p_identity:: PeerId :: try_from ( random_peer_id) . unwrap ( ) ;
658+ let libp2p_peer_id =
659+ libp2p_identity:: PeerId :: try_from ( random_peer_id) . expect ( "Conversion failed" ) ;
659660 let cid = CID :: from ( libp2p_peer_id) ;
660661
661- let key0 = P2pNetworkKadKey :: try_from ( & random_peer_id) . unwrap ( ) ;
662- let key1 = P2pNetworkKadKey :: try_from ( random_peer_id) . unwrap ( ) ;
662+ let key0 = P2pNetworkKadKey :: try_from ( & random_peer_id) . expect ( "Conversion failed" ) ;
663+ let key1 = P2pNetworkKadKey :: try_from ( random_peer_id) . expect ( "Conversion failed" ) ;
663664 let key2 = P2pNetworkKadKey :: from ( cid) ;
664665
665666 assert_eq ! ( key0, key1) ;
@@ -756,14 +757,17 @@ mod tests {
756757 let closest = BTreeSet :: from_iter ( iter) ;
757758 println ! ( "{}" , closest. len( ) ) ;
758759
759- let max_closest_dist = closest. iter ( ) . max_by_key ( |e| entry. dist ( e) ) . unwrap ( ) ;
760+ let max_closest_dist = closest
761+ . iter ( )
762+ . max_by_key ( |e| entry. dist ( e) )
763+ . expect ( "Failed to find entry" ) ;
760764 let min_non_closest_dist = rt
761765 . buckets
762766 . iter ( )
763767 . flat_map ( |e| e. iter ( ) )
764768 . filter ( |e| !closest. contains ( * e) )
765769 . min_by_key ( |e| entry. dist ( e) )
766- . unwrap ( ) ;
770+ . expect ( "Failed to find entry" ) ;
767771
768772 let max = entry. dist ( max_closest_dist) ;
769773 let min = entry. dist ( min_non_closest_dist) ;
@@ -791,15 +795,18 @@ mod tests {
791795 let find_node = rt. find_node ( & entry. key ) ;
792796 let closest = BTreeSet :: from_iter ( find_node) ;
793797
794- let max_closest_dist = closest. iter ( ) . max_by_key ( |e| entry. dist ( e) ) . unwrap ( ) ;
798+ let max_closest_dist = closest
799+ . iter ( )
800+ . max_by_key ( |e| entry. dist ( e) )
801+ . expect ( "Error finding entry" ) ;
795802 let min_non_closest_dist = rt
796803 . buckets
797804 . iter ( )
798805 . flat_map ( |e| e. iter ( ) )
799806 . filter ( |e| e. key != entry. key && e. key != rt. this_key )
800807 . filter ( |e| !closest. contains ( * e) )
801808 . min_by_key ( |e| entry. dist ( e) )
802- . unwrap ( ) ;
809+ . expect ( "Error finding entry" ) ;
803810
804811 let max = entry. dist ( max_closest_dist) ;
805812 let min = entry. dist ( min_non_closest_dist) ;
0 commit comments