Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
darthdeus
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
8 ms
·
1.
▲
The Language That Never Was
(blog.celes42.com)
31 points
by
darthdeus
1y ago
|
1 comments
2.
▲
by
darthdeus
2y ago
Author here, sorry about that, I just deployed a fix, should be readable now. If it's not, here's the first few points - Once you get good at Rust all of these problems will go away - Rust being great at big refactorings solves a
3.
▲
Leaving Rust gamedev after 3 years
(loglog.games)
1484 points
by
darthdeus
2y ago
|
972 comments
4.
▲
by
darthdeus
3y ago
Author of Comfy here, happy to answer any questions :) A few relevant links: - website https://comfyengine.org/ - announcement blog post https://comfyengine.org/blog/first/
5.
▲
by
darthdeus
3y ago
build.rs is a source file that you can audit. A binary that has no reproducible build is not auditable even if anyone wanted to. A single person does not audit all of their dependency tree, but many people do read the source code of some if
6.
▲
LLaMA-rs: a Rust port of llama.cpp for fast LLaMA inference on CPU
(github.com)
8 points
by
darthdeus
4y ago
|
0 comments
7.
▲
by
darthdeus
6y ago
Stan gives you the ability to do probabilistic reasoning. There is actually Tensorflow Probability ( https://www.tensorflow.org/probability ) which has a lot of overlapping algorithms, but isn't as mature and approaches
8.
▲
Git Command Overview with Useful Flags and Aliases
(blog.jakuba.net)
3 points
by
darthdeus
6y ago
|
0 comments
9.
▲
by
darthdeus
8y ago
VIM, and overall just being fast. It is extremely perceptible, especially if you ever use something like Arch Linux + st (or one of the faster terminals). iTerm is slow as shit compared to that.
10.
▲
Let's Write a 2D Platformer from Scratch, Part 3: Collision Detection
(nlogn.xyz)
4 points
by
darthdeus
9y ago
|
0 comments
11.
▲
Binary Heap (Priority Queue) in JavaScript
(nlogn.xyz)
1 points
by
darthdeus
9y ago
|
0 comments
12.
▲
Visualizing TensorFlow Graphs in Jupyter Notebooks
(blog.jakuba.net)
3 points
by
darthdeus
9y ago
|
0 comments
13.
▲
by
darthdeus
10y ago
You mention you wrote most of the parsing yourself. Is there any reason why you didn't use something like LLVM to do the heavy lifting?
14.
▲
by
darthdeus
10y ago
In that case you have a much bigger problem :P
15.
▲
by
darthdeus
10y ago
I'm glad I found someone who shares my point of view. You're right about IDEs and debuggers. > Instead, I believe in thinking carefully about the problem. Close your eyes and visualise the program and its data and control flow
16.
▲
by
darthdeus
10y ago
> This is why interview code tests are... badly misguided. Most "fizzbuzz" screening is grossly artificial, denying one the feedback loops which are a critical element of productivity, and without which one is relegated to spen
17.
▲
by
darthdeus
10y ago
> High latency feedback forces you to be more methodical in your development and think about the changes you're making. This! People rely on their fancy REPLs and super fast feedback loops and 1000 unit tests too much these days. Wh
18.
▲
by
darthdeus
10y ago
And all of those choices are utterly horrible (IDEs, not editors).
19.
▲
by
darthdeus
11y ago
And here I was, thinking this would be about statistics.
20.
▲
by
darthdeus
11y ago
I understand, I do like the idea of Phoenix, and it is definitely great to be able to keep 2M connections open at all. I'm just wondering where is the per-connection overhead going into. Is there some inherent limitation of the WebSock
21.
▲
by
darthdeus
11y ago
> which is going to be peanuts for a company requiring this kind of scale That depends. Two million connections from people in an e-commerce site is a lot, but two million connections for a side-thingy like some analytics/ads/b
22.
▲
by
darthdeus
11y ago
That's only about twice as much as in your case (I'm not saying it's not a lot, just pointing it out). Still, I wonder how low could one get when implementing this at a much lower level. 41kB per connection seems like a lot o
23.
▲
Different approaches to calculating Fibonacci Numbers
(blog.jakubarnold.cz)
2 points
by
darthdeus
11y ago
|
0 comments
24.
▲
by
darthdeus
11y ago
I wonder how Meteor's performance would hold up for a game like this.
25.
▲
by
darthdeus
11y ago
This is interesting, when I opened the link I thoguht to myself "this might be a nice and faster way to browse HN" ... but wow, this thing I slow. Not just slow, but the back button isn't working as well. Or maybe it is, but
26.
▲
by
darthdeus
12y ago
Why do node people feel like they have to re-invent everything UNIX?
27.
▲
Thoughts on OS X Yosemite, Arch Linux and Xmonad
(blog.jakubarnold.cz)
7 points
by
darthdeus
12y ago
|
1 comments
28.
▲
Tips for Building a Single Page Application
(blog.trackets.com)
15 points
by
darthdeus
12y ago
|
0 comments
29.
▲
Unit Testing JavaScript with QUnit
(blog.trackets.com)
5 points
by
darthdeus
12y ago
|
0 comments
30.
▲
Parsing CSS with Parsec
(blog.jakubarnold.cz)
15 points
by
darthdeus
12y ago
|
1 comments
More ›