https://github.com/rust-lang/rust http://git.dreamy.place/mirrors/rust/atom?h=try 2025-06-09T14:08:12+00:00 2025-06-09T14:08:12+00:00 Jack Wrenn jack@wrenn.fyi 2025-06-04T15:58:01+00:00 urn:sha1:e9eae28eee0a99c64e81f4fdf87d3c76241e56bd Previously, `rustc_transmute`'s layout representations were genericized over `R`, a reference. Now, it's instead genericized over representations of type and region. This allows us to move reference transmutability logic from `rustc_trait_selection` to `rustc_transmutability` (and thus unit test it independently of the compiler), and — in a follow-up PR — will make it possible to support analyzing function pointer transmutability with minimal surgery. 2025-06-07T11:42:30+00:00 Ralf Jung post@ralfj.de 2025-06-07T09:32:09+00:00 urn:sha1:17946c22b1d7abd2dd990bf6998c8491b534fe62 also adjust the wording a little so that we don't say "the error occurred here" for two different spans 2025-06-04T17:50:24+00:00 Matthias Krüger 476013+matthiaskrgr@users.noreply.github.com 2025-06-04T17:50:24+00:00 urn:sha1:23ba088502f4e05a9f79cfa6e6a3494161d5f09e Ensure query keys are printed with reduced queries Using `-Z query-dep-graph` and debug assertions leads to an ICE that was originally discovered in rust-lang/rust#141700: > This isn't an incremental bug per se, but instead a bug that has to do with debug printing query keys when debug assertions and `-Z query-dep-graph` is enabled. We end up printing a const (b/c we're using generic const args here) whose debug printing for -Z query-dep-graph requires invoking the same query cyclically 😃 > > I've pushed a commit which should fix this. This isn't related to the standard library changes, but instead b/c it seems to be the first usage of `feature(adt_const_params)` in the standard library that ends up being triggered in incremental tests. r? oli-obk 2025-06-03T20:56:52+00:00 Michael Goulet michael@errs.io 2025-05-31T11:48:29+00:00 urn:sha1:cbb3a847d25f998486248a8db201773eeb489d60 2025-06-02T15:37:15+00:00 Oli Scherer github333195615777966@oli-obk.de 2025-05-30T14:06:35+00:00 urn:sha1:020216c31c1e4f1f56a689df8f04580504354613 2025-06-02T15:37:15+00:00 Oli Scherer github333195615777966@oli-obk.de 2025-05-28T10:29:08+00:00 urn:sha1:b331b8b96d86a6433df957a3cc49ed51f3656135 2025-05-28T14:14:34+00:00 beetrees b@beetr.ee 2025-03-09T19:03:12+00:00 urn:sha1:467eeabbb5e876abc6bf552670199695172ad07a 2025-05-09T15:31:27+00:00 Oli Scherer github333195615777966@oli-obk.de 2025-05-09T15:16:26+00:00 urn:sha1:0b6e493515d92d4b269eb07c05bf706b64fa5db8 2025-04-29T18:42:43+00:00 Tomasz Miąsko tomasz.miasko@gmail.com 2025-04-27T05:37:27+00:00 urn:sha1:88a86794b9e5bcda28b8f89e6b6264bb7bc042c4 The previous implementation was inconsistent about transitions that apply for an init byte. For example, when answering a query, an init byte could use corresponding init transition. Init byte could also use uninit transition, but only when the corresponding init transition was absent. This behaviour was incompatible with DFA union construction. Define an uninit transition to match an uninit byte only and update implementation accordingly. To describe that `Tree::uninit` is valid for any value, build an automaton that accepts any byte value. Additionally, represent byte ranges uniformly as a pair of integers to avoid special case for uninit byte. 2025-04-25T19:55:50+00:00 Joshua Liebow-Feeser hello@joshlf.com 2025-04-22T22:43:34+00:00 urn:sha1:ae0c2fe3d8173f03878671e0bba38a03efa44c93 Note that `NonZero` support is not wired up, as the author encountered bugs while attempting this. A future commit will wire up `NonZero` support.