657 karma · joined May 24, 2024
Care to link it? It should be easy to do, if there's so much of it.
> gouvernement.fr info.gouv.fr
These are the same website. gouvernement.fr is a legacy URL that redirects to info.gouv.fr. Why did you include both?
> ameli.fr
As I'm sure you know, in France, social security is not administered by the government directly but by the social partners. They're in charge of managing ameli.fr, not the government. Go there, you won't find any logo from any ministry. Why did you include it? With this and the previous example, I cannot shake the feeling that you're on a mission to denigrate with little regard to the facts.
> vie-publique.fr santepubliquefrance.fr
These websites are basically blogs about respectively the institutions of the republic and about public health.
> service-public.fr
General informational website. For most sensitive procedures, you're redirected to a .gouv.fr website. Yes, it could have had a .gouv.fr URL, that's true.
> impots.gouv.fr
Yep, that's the tax website. You can notice it's official thanks to gouv.fr, like all website where you do actual online procedures.
In any case, my point was more that it's not "piecewise linear". Piecewise linear means that the map is defined on some interval; it's not, it's defined on a discrete set of values. To take your example, the map isn't defined on e.g., 2.3. You can decide to interpolate linearly between the value at 2.25 and the value at 2.5, but that's a decision you make which isn't reflected in the code.
Or said differently: do you consider that any map defined on a discrete subset of R is really a piecewise linear map?
The formulas for the floats have typos. They should read (-1)^S, not -1^S (which always equals -1).
Interpreting the raw bit patterns isn't a piecewise linear approximation of the logarithm. The lines between the data points on the blue graph don't actually exist, it's not possible for a bit to be half set to 1. It's rather a discrete version of the logarithm: the only data points that exist - where the red and blue lines meet - are literally equal to the (scaled, shifted) logarithm.
Other than that, nice post!
https://devblogs.microsoft.com/oldnewthing/20240530-00/?p=10... A graphical depiction of the steps in building a C++ executable, enhanced for classic Win32
https://devblogs.microsoft.com/oldnewthing/20240529-25/?p=10... A graphical depiction of the steps in building a C++ executable, basics
Or use a library to do it. The core fetch functionality shouldn't have to deal with HSTS. There may be legitimate reasons to fetch over HTTP even after you received an HSTS header - for testing purposes, for example.
> Why not just implement your own fetch wrapper that throws if it's not an https connection?
That's the developer dealing with HSTS.
However, if I do the same from my rpi, a few devices respond (my tv box, the rpi itself, etc)... including my windows machine!
According to https://superuser.com/a/467559, "The Windows ping program cannot send a ping request to broadcast addresses". That's multicast, there's no broadcast in ipv6; but maybe there's the same issue. I tried a quick https://learn.microsoft.com/en-us/dotnet/api/system.net.netw... and it times out too.
Much more reasonable than what the clickbait title seems to say.