4848 let value = V :: mls_decode ( data) ?;
4949
5050 if data. len ( ) == before || items. insert ( key, value) . is_some ( ) {
51- return Err ( crate :: Error :: InvalidMapContent ) ;
51+ return Err ( crate :: Error :: InvalidContent ) ;
5252 }
5353 }
5454
9292 let value = V :: mls_decode ( data) ?;
9393
9494 if data. len ( ) == before || items. insert ( key, value) . is_some ( ) {
95- return Err ( crate :: Error :: InvalidMapContent ) ;
95+ return Err ( crate :: Error :: InvalidContent ) ;
9696 }
9797 }
9898
@@ -164,7 +164,7 @@ mod tests {
164164 #[ test]
165165 fn hashmap_zero_length_structure ( ) {
166166 let res = HashMap :: < [ u8 ; 0 ] , [ u8 ; 0 ] > :: mls_decode ( & mut & [ 0x01 , 0xff ] [ ..] ) ;
167- assert_matches ! ( res, Err ( crate :: Error :: InvalidMapContent ) )
167+ assert_matches ! ( res, Err ( crate :: Error :: InvalidContent ) )
168168 }
169169
170170 #[ cfg( feature = "std" ) ]
@@ -177,7 +177,7 @@ mod tests {
177177 . unwrap ( ) ;
178178
179179 let res = HashMap :: < u8 , u8 > :: mls_decode ( & mut & * encoded) ;
180- assert_matches ! ( res, Err ( crate :: Error :: InvalidMapContent ) )
180+ assert_matches ! ( res, Err ( crate :: Error :: InvalidContent ) )
181181 }
182182
183183 #[ test]
@@ -189,13 +189,13 @@ mod tests {
189189 . unwrap ( ) ;
190190
191191 let res = BTreeMap :: < u8 , u8 > :: mls_decode ( & mut & * encoded) ;
192- assert_matches ! ( res, Err ( crate :: Error :: InvalidMapContent ) )
192+ assert_matches ! ( res, Err ( crate :: Error :: InvalidContent ) )
193193 }
194194
195195 #[ test]
196196 fn btree_map_zero_length_structure ( ) {
197197 let res = BTreeMap :: < [ u8 ; 0 ] , [ u8 ; 0 ] > :: mls_decode ( & mut & [ 0x01 , 0xff ] [ ..] ) ;
198- assert_matches ! ( res, Err ( crate :: Error :: InvalidMapContent ) )
198+ assert_matches ! ( res, Err ( crate :: Error :: InvalidContent ) )
199199 }
200200
201201 #[ cfg( feature = "std" ) ]
0 commit comments