https://github.com/rust-lang/rust http://git.dreamy.place/mirrors/rust/atom?h=1.24.0 2017-12-13T13:53:39+00:00 2017-12-13T13:53:39+00:00 Konrad Borowski konrad@borowski.pw 2017-12-13T13:53:39+00:00 urn:sha1:524c3ff472a54a42c75257b803abc9dc34c7302c The implementation was introduced when changing hash storage from Unique to *mut, but it was changed back to Unique. 2017-12-09T22:18:33+00:00 Matt Brubeck mbrubeck@limpet.net 2017-12-09T01:32:04+00:00 urn:sha1:3024c1434a667425d30e4b0785857381323712aa 2017-11-11T18:45:32+00:00 Jeroen Bollen contact@jeroenbollen.eu 2017-11-11T15:21:49+00:00 urn:sha1:0fb37fc67d0d0278022f355bed2aac0c2b772835 The current examples should be more realistic. 2017-11-11T15:23:16+00:00 Jeroen Bollen contact@jeroenbollen.eu 2017-10-12T09:18:16+00:00 urn:sha1:0f8ee171b2d78acaee2fb3c7774af531510d945b 2017-11-11T15:23:16+00:00 Jeroen Bollen contact@jeroenbollen.eu 2017-10-09T19:06:20+00:00 urn:sha1:0df7f00a0430df0d9c14e4c51919062f44aadaad This commit renames the `replace` function to `replace_entry`, and creates a seperate `replace_key` function for `OccupiedEntry`. The original `replace` function did not solve the use-case where the key needed to be replaced, but not the value. Documentation and naming has also been updated to better reflect what the original replace function does. 2017-11-09T04:41:17+00:00 Alex Crichton alex@alexcrichton.com 2017-11-01T19:32:13+00:00 urn:sha1:6bc8f164b09b9994e6a2d4c4ca60d7d36c09d3fe This commit removes the `rand` crate from the standard library facade as well as the `__rand` module in the standard library. Neither of these were used in any meaningful way in the standard library itself. The only need for randomness in libstd is to initialize the thread-local keys of a `HashMap`, and that unconditionally used `OsRng` defined in the standard library anyway. The cruft of the `rand` crate and the extra `rand` support in the standard library makes libstd slightly more difficult to port to new platforms, namely WebAssembly which doesn't have any randomness at all (without interfacing with JS). The purpose of this commit is to clarify and streamline randomness in libstd, focusing on how it's only required in one location, hashmap seeds. Note that the `rand` crate out of tree has almost always been a drop-in replacement for the `rand` crate in-tree, so any usage (accidental or purposeful) of the crate in-tree should switch to the `rand` crate on crates.io. This then also has the further benefit of avoiding duplication (mostly) between the two crates! 2017-10-20T18:49:36+00:00 Alex Crichton alex@alexcrichton.com 2017-10-20T18:40:04+00:00 urn:sha1:d01427f53e81a24e1c49d1672f37d4809c04a004 2017-10-14T14:21:52+00:00 Manish Goregaokar manishsmail@gmail.com 2017-10-13T17:19:15+00:00 urn:sha1:e8e7715bebdd401ebacfabb66928d0f7e4733120 This isn't strictly necessary for hashmap cloning to work. The tag is used to hint for an upcoming resize, so it's good to copy this information over. (We can do cleverer things like actually resizing the hashmap when we see the tag, or even cleaning up the entry order, but this requires more thought and might not be worth it) 2017-10-14T14:21:50+00:00 Manish Goregaokar manishsmail@gmail.com 2017-10-13T17:09:35+00:00 urn:sha1:bb9e850246092d3931080ddbac551a0857b28364 This offset is always zero, and we don't consistently take it into account. This is okay, because it's zero, but if it ever changes we're going to have bugs (e.g. in the `dealloc` call, where we don't take it into account). It's better to remove this for now; if we ever have a need for a nonzero offset we can add it back, and handle it properly when we do so. 2017-10-06T12:51:11+00:00 bors bors@rust-lang.org 2017-10-06T12:51:11+00:00 urn:sha1:a8feaee5b6b54c03f49481fe04a9ad9e8f659f7c Implement `and_modify` on `Entry` ## Motivation `Entry`s are useful for allowing access to existing values in a map while also allowing default values to be inserted for absent keys. The existing API is similar to that of `Option`, where `or` and `or_with` can be used if the option variant is `None`. The `Entry` API is, however, missing an equivalent of `Option`'s `and_then` method. If it were present it would be possible to modify an existing entry before calling `or_insert` without resorting to matching on the entry variant. Tracking issue: https://github.com/rust-lang/rust/issues/44733.