https://github.com/rust-lang/rust http://git.dreamy.place/mirrors/rust/atom?h=1.12.0 2016-06-17T22:50:34+00:00 2016-06-17T22:50:34+00:00 Oliver Middleton olliemail27@gmail.com 2016-06-17T22:48:30+00:00 urn:sha1:fdeda33a9a7326ac4979aee5b0c9657298aebe59 Also improve hash_map and hash_set module short summaries. 2016-04-22T10:30:43+00:00 Johannes Oertel johannes.oertel@uni-due.de 2016-03-24T14:39:46+00:00 urn:sha1:241a3e4689d3004daf9e1d36cec2235cbd301fbf The algorithm implemented here is linear in the size of the two b-trees. It firsts creates a `MergeIter` from the two b-trees and then builds a new b-tree by pushing key-value pairs from the `MergeIter` into nodes at the right heights. Three functions for stealing have been added to the implementation of `Handle` as well as a getter for the height of a `NodeRef`. The docs have been updated with performance information about `BTreeMap::append` and the remark about B has been removed now that it is the same for all instances of `BTreeMap`. 2016-03-12T20:31:13+00:00 Alex Crichton alex@alexcrichton.com 2016-03-07T23:42:29+00:00 urn:sha1:b53764c73bd722ea22142bace6249d5950066253 Removes all unstable and deprecated APIs prior to the 1.8 release. All APIs that are deprecated in the 1.8 release are sticking around for the rest of this cycle. Some notable changes are: * The `dynamic_lib` module was moved into `rustc_back` as the compiler still relies on a few bits and pieces. * The `DebugTuple` formatter now special-cases an empty struct name with only one field to append a trailing comma. 2016-02-16T02:50:30+00:00 Jack O'Connor oconnor663@gmail.com 2016-01-30T18:44:45+00:00 urn:sha1:2cac9d7bd3f26072e101ccabcb4913ef05f46d7c The first time I read the docs for `insert()`, I thought it was saying it didn't update existing *values*, and I was confused. Reword the docs to make it clear that `insert()` does update values. 2016-01-26T16:39:07+00:00 Alex Crichton alex@alexcrichton.com 2016-01-21T18:28:39+00:00 urn:sha1:1fa0be2bc038e0575a601ba0273cd83d91d064f2 This commit implements the stabilization of the custom hasher support intended for 1.7 but left out due to some last-minute questions that needed some decisions. A summary of the actions done in this PR are: Stable * `std::hash::BuildHasher` * `BuildHasher::Hasher` * `BuildHasher::build_hasher` * `std::hash::BuildHasherDefault` * `HashMap::with_hasher` * `HashMap::with_capacity_and_hasher` * `HashSet::with_hasher` * `HashSet::with_capacity_and_hasher` * `std::collections::hash_map::RandomState` * `RandomState::new` Deprecated * `std::collections::hash_state` * `std::collections::hash_state::HashState` - this trait was also moved into `std::hash` with a reexport here to ensure that we can have a blanket impl to prevent immediate breakage on nightly. Note that this is unstable in both location. * `HashMap::with_hash_state` - renamed * `HashMap::with_capacity_and_hash_state` - renamed * `HashSet::with_hash_state` - renamed * `HashSet::with_capacity_and_hash_state` - renamed Closes #27713 2015-11-17T22:24:21+00:00 Vadim Petrochenkov vadim.petrochenkov@gmail.com 2015-11-16T16:54:28+00:00 urn:sha1:7e2ffc7090a70fe8c77a0e03fcec3cb1387141f2 2015-10-25T12:03:21+00:00 Tobias Bucher tobiasbucher5991@gmail.com 2015-10-25T12:03:21+00:00 urn:sha1:4b45f39f92ce9f525e96564d8e587c62b18c709c 2015-10-23T00:30:42+00:00 Steve Klabnik steve@steveklabnik.com 2015-08-18T22:38:07+00:00 urn:sha1:e8e3c6f38616acb0b45433454d57f5b2ecf78a96 {BTree,Hash}{Map,Set} will not update their key if it already exists, which can matter with more complex keys. This behavior is now documented. Fixes #26888 2015-08-25T16:20:42+00:00 Georg Brandl georg@python.org 2015-08-25T16:20:34+00:00 urn:sha1:fc7c0f99d7cb5616230f7a61e86bcb4fc01dab5e These have been removed and should not be documented here. 2015-08-16T01:09:17+00:00 Alex Crichton alex@alexcrichton.com 2015-08-13T17:12:38+00:00 urn:sha1:5f625620b5e4e29919400a0ee863942e5bf3d970