Mara Bos 5878780e64

Rollup merge of #88040 - nbdd0121:btreemap, r=m-ou-se ...

BTree: remove Ord bound from new

`K: Ord` bound is unnecessary on `BTree{Map,Set}::new` and their `Default` impl. No elements exist so there are nothing to compare anyway, so I don't think "future proof" would be a blocker here. This is analogous to `HashMap::new` not having a `K: Eq + Hash` bound.

#79245 originally does this and for some reason drops the change to `new` and `Default`. I can see why changes to other methods like `entry` or `symmetric_difference` need to be careful but I couldn't find out any reason not to do it on `new`.

Removing the bound also makes the stabilisation of `const fn new` not depending on const trait bounds.

cc `@steffahn` who suggests me to make this PR.

r? `@dtolnay`

2021-09-01 09:23:23 +02:00

..

arc.rs

Add Weak may_dangle tests

2021-05-20 19:42:29 -07:00

binary_heap.rs

Fix may not to appropriate might not or must not

2021-07-29 01:15:20 -04:00

borrow.rs

…

boxed.rs

Fix grammar

2021-08-24 17:56:39 +02:00

btree_set_hash.rs

…

const_fns.rs

BTree: remove Ord bound from new

2021-08-18 03:55:36 +01:00

cow_str.rs

…

fmt.rs

…

heap.rs

…

lib.rs

Constified Default implementations

2021-08-17 07:15:54 +00:00

linked_list.rs

…

rc.rs

Add Weak may_dangle tests

2021-05-20 19:42:29 -07:00

slice.rs

Improve wording, correct -> tight.

2021-08-13 15:27:30 +02:00

str.rs

Add test for the fix

2021-07-11 17:47:57 +02:00

string.rs

Use assert_matches! instead of if let {} else

2021-08-07 14:48:27 +01:00

vec_deque.rs

Use assert_matches! instead of if let {} else

2021-08-07 14:48:27 +01:00

vec.rs

Use assert_matches! instead of if let {} else

2021-08-07 14:48:27 +01:00