You must log in or # to comment.
The joke missed opportunity to have two ints
Floats aren’t fractions. Use a rational number library if you actually need a fraction.
Isn’t this a looks inside floating point binary representation in memory situation?
This is peak humor
I had to just emulate floating points to save pulling in the giant print float library in stm32 to save flash memory. And then I learned that’s what all the pros do IRL anyway.
I am hard pressed to find anyone irl who would be impressed by this but I made a spreadsheet that converts hexadecimal into float using only standard excel formulas.
I feel obligated to post a link to this excellent (albeit incomplete) writeup of posits and unums, which can more accurately represent common fractions in memory at the same (or lower) bit size compared to traditional floating point.
Said page also includes the single best slightly-above-entry-level explanation of how floating point works I’ve ever seen.
Isn’t a big point of floating point that it can easily have mathematical operators done on them on CPUs? Sure, complex circuitry is no big deal these days, but IIRC, there were very good reasons for what was chosen.
One of the linked papers makes the claim that the circuitry would be less complex than that needed for floats, but also includes this note:
Floats have one advantage over posits for the hardware designer: the fixed location of bits for the exponent and the fraction mean they can be decoded in parallel. With posits, there is a little serialization in having to determine the regime bits before the other bits can be decoded. There is a simple workaround for this in a processor design, similar to a trick used to speed the exception handling of floats: Some extra register bits can be attached to each value to save the need for extracting size information when decoding instructions.
The proposed system also lacks NaN and separate positive/negative infinities, so it wouldn’t be a drop-in replacement.
i have so many protocols to represent the most common fractions perfectly without needing more than just ONE bit. They even work with positive and negative infinity!
The trick is to first negotiate the protocol youre using.
protocol schema 1/2
1 bit, little endian
if one: value is exactly 1/2
If zero: value is NOT one half
Schema 1/3
if one: value is 1/3
I’ve managed to create a compression algorithm that reduces files down to a single bit. I call it “is this file ‘loss.png’?”.
It’s guaranteed 100% lossless with any input!
Reminds me of MetaGolfScript.
But… they are fractions.
They are fractions of the format m/(2^n), but they only mimic fractions like 2/5.
That’s 2¹/5 to you!
I guess op refers to how they’re represented which is a bit complex imo: https://www.geeksforgeeks.org/digital-logic/floating-point-representation-basics/
If you need actual numerators and denominators, there are libraries for that.
Ah, Apache Commons: for those who felt Java’s standard library wasn’t bloated enough already.
(I kid, I kid, though it was always funny just how many basic features seemed to be missing from Java back in the day despite its massive bundled library, leading to seemingly every major project adding Commons as a dependency. Not as much as thing these days AFAIK)
