{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreidiormdiaffyaycuva5t2uhy6toy6mnp6ytbpbf6jrtakb2u7o7zy",
    "uri": "at://did:plc:ivbknywyskln22er3nkssdhl/app.bsky.feed.post/3mkqlzf44rc52"
  },
  "path": "/t/could-collections-hypothetically-store-keys-and-values-inline/24195#post_19",
  "publishedAt": "2026-04-30T20:49:22.000Z",
  "site": "https://internals.rust-lang.org",
  "textContent": "yaksher:\n\n> In my experience, having a large number of small hash maps is very rare—in part because a hash map is a bad implementation for tiny sets/maps anyway (faster to do linear search over an array than hash stuff).\n\nNothing stops a hash map implementation from doing linear search (i.e. using a single bucket) for tiny sets of keys.",
  "title": "Could collections hypothetically store keys and values inline?"
}