is there a version of reference counting that delays heap-ification 🤔
like suppose I have a value that I can represent on the stack cheaply, and I only want to create a heap version of it when I know that it might need to outlive its lifetime on the stack
lawless polymorph /
npub1e9…2vdd5
2024-04-10 20:50:20
Author Public Key
npub1e9y64jhalql35k2cfhntmkvnnz5937pwrq0267578qrpty6uafzsc2vdd5Published at
2024-04-10 20:50:20Event JSON
{
"id": "00d27c672d83e43cdbfe2d38f513bcff612472ba12aa2450dc4121edeb26eebd",
"pubkey": "c949aacafdf83f1a59584de6bdd99398a858f82e181ead7a9e380615935cea45",
"created_at": 1712782220,
"kind": 1,
"tags": [
[
"proxy",
"https://gamedev.lgbt/users/typeswitch/statuses/112248895625695411",
"activitypub"
],
[
"L",
"pink.momostr"
],
[
"l",
"pink.momostr.activitypub:https://gamedev.lgbt/users/typeswitch/statuses/112248895625695411",
"pink.momostr"
]
],
"content": "is there a version of reference counting that delays heap-ification 🤔 \n\nlike suppose I have a value that I can represent on the stack cheaply, and I only want to create a heap version of it when I know that it might need to outlive its lifetime on the stack",
"sig": "9e3df1b20e664e631d4ebe0e7be9a6360d4b1ae42eda1b2d27da06ec84a23bfe3fccab8413ccb1b9149de3dae49b633668f3ec725c0ca98bc05bfc6a829d22ef"
}