Tojot

4 ms·

1.
by Tojot 2y ago
Dangling pointer. Case closed. Period. Period period. :)
2.
SFML 2.6.0 is finally out(github.com)
19 points by Tojot 3y ago|5 comments
3.
by Tojot 3y ago
SFML is the most idiomatic C++ Graphics/Multimedia library out there. After a bit of a hiatus, and a lot of effort, it is back.
4.
by Tojot 7y ago
Only USA and Eritrea to be specific.
5.
by Tojot 8y ago
The article says a lot about concurrent programming, but little about parallel programming. The naming is misleading.
6.
by Tojot 9y ago
It's frustrating. First, I've got proof no. 3. I can offer a nice 4 argument proof, but you wouldn't let me provide it. Second, I tried proof no. 2, where I'm offered words like given and algebra I have no use for. To ma
7.
by Tojot 10y ago
I'm a Bazel person myself as well, but tup with the lua syntax might be getting somewhere.
8.
by Tojot 10y ago
I'm afraid it's not going to work. Turning vaguely defined task into something tangible is usually the most difficult, and most important part of the task, but it requires some experience. In the beginning you need to learn the in
9.
by Tojot 10y ago
Thanks! Looks like it worked.
10.
by Tojot 10y ago
It so happens that a large part of my PhD was on this very subject. The result I've got N log(N), this is more visible when you get to larger RAM (I had 0,5 TB RAM at the time). We have an empirical result, a justification and a rigoro
11.
by Tojot 10y ago
In response to "The Myth of RAM" https://news.ycombinator.com/item?id=12383012 It so happens that a large part of my PhD was on this very subject. The result I've got N log(N), this is more visible when you g
12.
Accessing RAM sometimes costs extra log(N)(arxiv.org)
50 points by Tojot 10y ago|3 comments