teo_zero

14 ms·

241.
by teo_zero 1y ago
Before going all in with turing-complete configuration languages, why not simply augmenting existing declarative formats with parameter & arithmetic expansion à la bash? It's a syntax already familiar to many, that would mitigate t
242.
by teo_zero 1y ago
You misunderstood the parent post. They where suggesting to look up the exact string that ends up in the message, without any conversion. So if the message contains INFO, ERROR, etc. then look up "INFO", "ERROR"...
243.
by teo_zero 1y ago
Gitless. I'm a fan of software that allows you to get your feet wet with simple concepts and progressively add complex ones when you feel you're ready. Gitless was my introduction to git.
244.
by teo_zero 1y ago
Doesn't this code leak memory? I mean, even after adding the deinit procs. The point is that when a new_arr is created, the old one is not deleted. Besides, the duo make-delete is easy to understand, but I find disturbing that one has
245.
by teo_zero 1y ago
> [dead keys] should be avoided for common operations in newly designed programming languages. If that's the rationale for choosing which symbols should be allowed, then let's ban {} as they require AltGr+Shift in many layouts.
246.
by teo_zero 1y ago
> If you reserve() space for 1 more element a 1000 times, you will get ~30 reallocations, not 1000. Surely you mean ~10 reallocations, because 2^10=1024, right?
247.
by teo_zero 1y ago
> Run Any App > If it runs on Windows, it can run on WinBoat. Did I miss an asterisk here? One that adds "except apps that require a GPU, that access non-USB devices, those with anti-cheat..."
248.
by teo_zero 1y ago
While I do understand that O(n²) complexitity is frowned upon, I wonder how big should n be before n² multiplications are worse than nlogn loops which include several complex multiplications, complex exp, and various array reshapes...
249.
by teo_zero 1y ago
Anybody knows what exactly prevents Ghostty from being built using the self-hosted x86_64 backend?
250.
by teo_zero 1y ago
> The gold standard for compiler speed so far is TCC. I only wish it supported C23...
251.
by teo_zero 1y ago
> they are very motivated to reduce storage costs whenever possible On the other hand, they are also very motivated to have a large mass of data to train their AI. Which of the two motivations wins, is debatable. Today I'd bet on AI
252.
by teo_zero 1y ago
CMOV is branchless. During all steps of its execution, the CPU doesn't have to invalidate any stage of its pipeline (well, excluding errors like accessing forbidden memory addresses, etc.).
253.
by teo_zero 1y ago
Well, I would say that implementation defined is ok only if you have full control on the full compilation process. If your code aims at universality you should find better tricks. The UB on the add happens in cases where all incarnations of
254.
by teo_zero 1y ago
The former is a piece of hardware from the 70s, the latter is software that emulates the former.
255.
by teo_zero 1y ago
For Windows users, I recommend WinCompose: https://github.com/samhocevar/wincompose I use the Insert key, which would otherwise have no function.
256.
by teo_zero 1y ago
As usual, the title doesn't reflect the message of the article. While critical against learning tons of algorithms and structures by heart , the author advocates understanding what they do and why you would want to use them. This is w
257.
by teo_zero 1y ago
Totally agree! I've never understood the beauty of singleton objects.
258.
by teo_zero 1y ago
I had expected something about algorithms , not Rust-specific implementations .
259.
by teo_zero 1y ago
> If they mean defer + deinit methods, that's not the same thing. No? It's the first thing that came to my mind when I've read RAII.
260.
by teo_zero 1y ago
Maybe the buy-back scheme? > when he dies, the company will buy back his share from his next of kin for less than he originally paid.
261.
by teo_zero 1y ago
I'm lost at the first line of code: char buffer[64]; And then it's not used anywhere! I was curious about the "Why not printf" section, but I found code I don't understand there, too. For example this admitte
262.
by teo_zero 1y ago
I think we agree without understanding each other. It must be possible to sort all system events in an "absolute time line". To do so, the system must know in every moment at what point of this "absolute time line" we ar
263.
by teo_zero 1y ago
> So instead of your settings sometimes being wrong and easily-fixed with a few clicks It can't be easily fixed. Imagine I continuously change the OS's setting to always reflect the local time. Now I read a log of events happen
264.
by teo_zero 1y ago
I assume yours is a general comment about parser generators and not specifically about Lexy, which in fact contradicts your first bullet point by providing templates to express your grammar directly in the C++ code.
265.
by teo_zero 1y ago
> What problem are you thinking it would solve? Traveling.
266.
by teo_zero 1y ago
I must be the dumbest person in the world, then, because that's exactly what I've been doing on all my computers for 20 years (and I don't reside in Iceland).
267.
by teo_zero 1y ago
The ",1" ignores var and keeps 1.
268.
by teo_zero 1y ago
What disturbs me is the need to Init() everything. In the Vec type (the only one I've analyzed, actually) all it does is to fill everything with zeros and add a "magic" field certifying that the initialization happened. So wh
269.
by teo_zero 1y ago
> I do kinda like how foreach is implemented right now. This allows me to perform some strict checking for easy loop iteration based bugs and also it kinda looks cool. Yes but the body in the parameters really is a show stopper. What if
270.
by teo_zero 1y ago
> A modern C11 library I'd say "mostly C11": it uses __VA_OPT__ that's been standardized only in C23. The "foreach" macros need a lot of refinement: passing the body in the parameters is asking for troubles,

More ›