Yuki Okushi 6bdd1beca6
Rollup merge of #66280 - stepancheg:union, r=alexcrichton ...
Fix HashSet::union performance
Consider this example: small_set = 0..2, large_set = 0..1000.
To efficiently compute the union of these sets, we should
* take all elements of the larger set
* for each element of the smaller set check it is not in the larger set
This is exactly what this commit does.
This particular optimization was implemented a year ago, but the
author mistaken `<` and `>`.
2019-11-12 16:36:15 +09:00
2019-11-12 16:36:08 +09:00
2019-11-07 13:06:56 -08:00
2019-11-12 16:36:10 +09:00
2019-11-02 23:20:28 +01:00
2019-11-11 19:20:54 +00:00
2019-11-04 15:59:09 +01:00
2019-11-12 16:36:03 +09:00
2019-11-06 12:49:20 -08:00
2019-11-05 12:44:02 +00:00
2019-11-05 12:44:02 +00:00
2019-10-28 20:34:59 +02:00
2019-11-12 16:36:12 +09:00
2019-11-04 15:59:09 +01:00
2019-11-10 12:21:05 +01:00
2019-11-10 12:21:05 +01:00
2019-11-10 12:21:05 +01:00
2019-11-04 15:59:09 +01:00
2019-11-12 16:36:12 +09:00
2019-11-07 13:58:36 +01:00
2019-11-02 09:01:02 +11:00
2019-11-04 15:59:09 +01:00
2019-11-10 12:18:53 +00:00
2019-11-10 03:57:18 +01:00
2019-11-10 12:21:05 +01:00
2019-10-30 23:18:57 +01:00
2019-11-11 14:05:43 +00:00
2019-11-10 12:45:31 +01:00
2019-11-10 03:57:18 +01:00
2019-11-11 14:05:43 +00:00
2019-11-09 17:50:51 +03:00
2019-11-10 15:53:35 +00:00
2019-11-10 03:57:18 +01:00
2019-11-12 16:36:07 +09:00
2019-11-10 12:31:41 +01:00
2019-11-12 16:36:01 +09:00
2019-11-11 14:05:43 +00:00
2019-11-04 15:59:09 +01:00
2019-11-10 23:53:44 +00:00
2019-11-11 14:05:43 +00:00
2019-11-10 03:57:18 +01:00
2019-11-11 08:04:39 +01:00
2019-11-10 15:53:35 +00:00
2019-11-06 14:43:52 +01:00
2019-11-03 14:03:21 +00:00
2019-11-06 07:03:06 +01:00
2019-11-12 16:36:13 +09:00
2019-11-11 11:41:10 -08:00
2019-10-24 13:32:54 -05:00
Yuki Okushi
6bdd1beca6