namark @namark@qoto.org

unnecessary indirection,
unnecessary allocation,
unnecessary bound checks,
runtime type information,
overuse of abstractions,
global state in libraries,
long names.
repeated half-assed reference counting,
repeated half-assed implementations of common data structures/algorithms,
tons of fragile platform specific code.

#programming

> I know that I don't know
meh, obvi, how dumb must you be to think you know everything, pfft... I know everything that's important though.

> I know that I don't know
okay, there might be some important things I don't know yet... the priests know it though.

> I know that I don't know
ok, actually, it turns out there are some really important things that I neither know nor can ever hope to know... send help.

fixed http://ix.io/2uwE/cpp

#cpp

Why does arrow operator not drill through raw pointers to the final value? Pointers don't have members anyway :V

#cpp

An index of an array of references? That's just a pointer to a pointer, duh. I finally achieved the second level of indirection in its pure form.

#programming

javascript: I'm pushing around some code to get it to work.

c++: the code is pushing me around to get me to work.

yeah it took me a month to commit a function, so what? how long can you last?

#programming

Since it was a tie between map, progress and linin, I obviously had to go with way.

https://git.sr.ht/~namark/libsimple_support/tree/95f5932b9d61c0badd2d87d9ae8def074b47a22b/source/simple/support/algorithm.hpp#L285
https://git.sr.ht/~namark/sketchbook/commit/85f2009edc65171dbc6a06f8bfb4dc7405ed69eb

#cpp

it's not for me it's for your eyes, cause the alternative is:
while(true) if(auto x = get(); !x) stuff(x);
else break;

can:
while( auto x = get() ) stuff(x);
can't:
while( !(auto x = get()) ) stuff(x);

someone write a proposal ToT

#cpp

Why is it so hard to set up basic auto-indent in vim? Am I stupid or something? I just want basic indentation for custom blocks and no lining-things-up-in-columns cruft.

#vim

I'm going to go with 4 as a shorthand of the successor function in cases where it makes sense (naturals, integers) and as a generalization in cases where it doesn't (rationals).

The only problem is that it doesn't optimize well for IEEE floats. It emits an add instruction because of a special case -
0.0 + (-0.0) = 0.0,
which makes negative zero the actual addition identity, as opposed to positive zero that floats are initialized with by default. However this seems to be a well known problem (I guess comes up often with accumulate/reduce type algorithms), so I would expect the user to be aware of this if it's a bottleneck for them, and either use -ffast-math or a custom type that initializes to negative zero.

#cpp #float

husk is back but all the blackmail on @boob is gone... knew I should have saved it...

A very difficult question indeed, I must confess, without a doubt in my mind, all things considered.