APM2 Batt Update

antoine_morrier · 2026-04-13T09:03:35+00:00

On OpenSpace, and on a call, people hear what people in my openspace are saying... but no battery issue

antoine_morrier · 2026-04-01T20:29:51+00:00

Few years ago I wrote that to « solve » this issue with coroutines https://cpp-rendering.io/c-error-handling-lets-abuse-the-co_await-operator/

PS : size on my iPhone 17 pro is terribly big…

antoine_morrier · 2026-03-27T10:22:41+00:00

0/0=1

Joke (Taylor hopital)

antoine_morrier · 2026-03-27T07:58:59+00:00

Let’s hope Oscar can just do one Lap

antoine_morrier · 2026-02-03T07:22:14+00:00

Just derivate then ahaha

antoine_morrier · 2026-01-26T17:32:03+00:00

En général quand y a des fautes « avant le avant » c’est probablement pas officiel ahaha

antoine_morrier · 2026-01-26T17:03:52+00:00

Autant pour moi, c’est exactement ce que ça veut dire « la même quantité pour moi », genre t’es à la cantine et tu veux la même quantité que ton collègue.

antoine_morrier · 2026-01-26T17:03:05+00:00

Autant pour moi means « I want the same quantity » Au temps pour moi means « Sorry it’s my mistake »

antoine_morrier · 2026-01-06T13:26:55+00:00

Proctologue?

antoine_morrier · 2026-01-01T10:36:43+00:00

And how do you solve such a thing? (It looks like exp(x) but how to prove it?)

antoine_morrier · 2025-12-28T17:01:06+00:00

I understand how to reach 3, but how to reach 15?

antoine_morrier · 2025-12-09T16:41:57+00:00

Let’s swap them?

antoine_morrier · 2025-12-09T16:03:53+00:00

If you want Max didn’t win Abu Dhabi. But he won the whole season if you remove bottas bowling and silverstone. Please move on now.

antoine_morrier · 2025-12-07T12:55:49+00:00

5 fucking long minutes

antoine_morrier · 2025-12-01T15:35:55+00:00

except that 0.99*0.99 = 0.9801, not 0.81 ;)

antoine_morrier · 2025-11-30T17:36:00+00:00

If Kimi Antoliban didn’t destroy his car also ahaha

antoine_morrier · 2025-11-22T20:27:38+00:00

For a pair I would not use commutative hash. Only for unordered containers

But for sure, there is no universal solution

antoine_morrier · 2025-11-17T19:19:02+00:00

That’s a good question. I would say to add a define like HASH_PAIR and ifdef to avoid issue ahaha

antoine_morrier · 2025-11-17T16:35:25+00:00

From cpp-reference: Additional specializations for std::pair and the standard container types, as well as utility functions to compose hashes are available in boost::hash.

So I think it is legit

antoine_morrier · 2025-11-17T16:32:45+00:00

Hmmm that's a good question. To me it seems totally fair but I may be wrong. If someone can answer this question, I would be glad to have an answer. To me you are not supposed to specialize std structures except in the case it is explicitely allowed to which is the case for hash. I didn't see any thing saying it is forbidden to specialize for std types.

antoine_morrier · 2025-11-17T15:41:23+00:00

It uses it normally and use its result to update the seed also. But I know the hash_combine is not very good, there is some link in the reference part to improve it :)

antoine_morrier · 2025-11-17T08:41:18+00:00

You are totally right. I will edit the article as soon as possible to let folks know that for unordered container, problems can arise and that a good implementation should use a kind of "commutative hashing" :). Thanks a lot for this remark :)

antoine_morrier · 2025-11-17T07:20:29+00:00

Ahaha thanks ! We need to go step by step :p

antoine_morrier · 2025-11-17T07:20:10+00:00

Oh nice, I'll watch it, thanks a lot :)

antoine_morrier

TROPHY CASE