{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreiaxvl3jsa7seqodwmyut4x2w3diaqgmnwrom7jlf33k4s4xyal2mq",
    "uri": "at://did:plc:ivbknywyskln22er3nkssdhl/app.bsky.feed.post/3mkb57pai6ds2"
  },
  "path": "/t/could-collections-hypothetically-store-keys-and-values-inline/24195#post_6",
  "publishedAt": "2026-04-24T17:25:22.000Z",
  "site": "https://internals.rust-lang.org",
  "textContent": "Vorpal:\n\n> even a guarantee of not inlining doesn't give you address stability\n\nIt gives you address stability so long as you don’t mutate the `HashMap`.\n\nIn particular, the following three operations (in any quantity and order) wouldn’t invalidate references to heap data: moves (by a no-inlining + no-`noalias` guarantee), operations on a `&HashMap` (otherwise, stable behavior would break), coercions (basically just a combination of moves and immutable operations, listing this separately just since it feels like a bit of an edge case).",
  "title": "Could collections hypothetically store keys and values inline?"
}