07:57 <lulf[m]> zeenix: For that, size must be known, so I think your options are:... (full message at <https://catircservices.org/_irc/v1/media/download/AdRoBJewSy0-oyXF9ysI86OJxEgL7uEkVAoNa65ABoAuR6uLJZH1QTE48DbPta0xPjgjyVQ_1SRfPGK_XQqRQki_8AAAAAAAAGNhdGlyY3NlcnZpY2VzLm9yZy90T25iSFRzeWdqVGZiZHlsQ3JGclVRQms>)

10:06 <zeenix[m]> lulf: yeah I know that size needs to be known. I don't follow the first and 3rd option. Are you suggesting a manual implementation? That's what I'm hoping to avoid. 😉

10:07 <zeenix[m]> * @lulf_:matrix.org: Thanks. Yeah I know that size needs to be known. I don't follow the first and 3rd option. Are you suggesting a manual implementation? That's what I'm hoping to avoid. 😉

10:07 <zeenix[m]> I was more hoping someone else already has done this and provided a crate

12:30 <datdenkikniet[m]> Is "arbitrary/dynamic" in this case unbounded or with a known fixed upper limit? If you do not have a way to compute that at compile time, surely there is no non-alloc way of doing that? Even heapless requires some upper bound

12:52 <danielb[m]> how come heapless::Vec comes with NOTE order is important for optimizations. but isn't repr(C)?

14:45 <pvdrz[m]> dirbaioreitermarkusnewamare there any items on https://github.com/rust-embedded/heapless/issues/535 that need special attention or should I just start with whatever I can find?

15:18 <zeenix[m]> <datdenkikniet[m]> "Is "arbitrary/dynamic" in this..." <- fixed upper limit of course. Otherwise, it can't possibly work. That's why I mentioned heapless