Files
rust/src/libstd
Stepan Koltsov 04a237b9e2 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-10 23:53:44 +00:00
..
2019-08-15 22:58:57 +03:00
2019-11-09 12:46:17 +01:00
2019-09-06 14:45:28 +02:00
2018-12-25 21:08:33 -07:00
2019-10-02 08:17:28 -04:00
2019-10-13 12:12:46 +02:00
2019-10-24 21:35:16 -06:00
2019-08-15 22:58:57 +03:00
2019-02-28 04:06:15 +09:00
2019-04-23 00:15:43 +02:00
2019-10-21 13:30:43 +01:00
2019-10-18 16:52:42 +02:00
2019-10-05 12:23:10 +02:00