Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
rix0r
searching Neon…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
by
rix0r
1y ago
Do you fundamentally disagree with the intent of the regulation, or are you just putting on your software engineer's hat and using your decades-long honed skill of trying to find edge case problems in a set of rules?
2.
▲
by
rix0r
2y ago
You are evaluating this as a tool that is intended to train people up to being professional software developers. It's not! It's instead intended to give every child in the world, regardless of inclination, some first-hand experien
3.
▲
by
rix0r
3y ago
There seems to be a mistake in the animation. > On a cache miss, SIEVE checks the object pointed to by the hand. If the object has been visited, its visited bit is reset When the animation gets to the point where the I element is checke
4.
▲
My painful, futile quest for programmable slideshow animations
(buttondown.email)
4 points
by
rix0r
3y ago
|
0 comments
5.
▲
by
rix0r
5y ago
Something very important not covered by the article: Is the tool going to help me detect when I accidentally bypass the declared dependencies? For example, in a basic monorepo it's very easy to accidentally rely on the file layout on d
6.
▲
by
rix0r
5y ago
Shouldn't sock.close() imply sock.shutdown() ? Isn't it pointless to call both?
7.
▲
by
rix0r
9y ago
The UI is not really explained. I hope this is not going to train more generations of Windows user to click "yes yes yes" in response to annoying dialogs.
8.
▲
by
rix0r
10y ago
But how would you go forward in the first place? Not with the "Forward" button, because you haven't visited the page yet. Instead, you press "Right" or "PgDn" or what have you. So I would expect the conver
9.
▲
by
rix0r
10y ago
For index-seeks, yes. For key-seeks, it's a normal tree walk to the leaf (unless an INSERT is found at a higher level, iirc) In practice, the blocks are so huge that any tree is going to have at most depth 3, and the root page is likel
10.
▲
by
rix0r
10y ago
Funny: I implemented the exact same thing, with a focus on AWS and pagination (albeit less well-documented): https://github.com/rix0rrr/libbruce/blob/master/README.md
11.
▲
by
rix0r
10y ago
Saying "use immutable data structures" here assumes garbage collection though. If you didn't have garbage collection, when would you release the memory for these structures? That would bring you back to refcounting.
12.
▲
by
rix0r
11y ago
Well, why would it be? That's internal. Hasn't been published as far as I can Google.
13.
▲
by
rix0r
11y ago
I hate that "Too Many Requests", or "Throttled", or what have you, is a 4xx status code. It renders simple middleware logic like "retry on a 5xx, don't retry on a 4xx" invalid. If you'd call it "
14.
▲
by
rix0r
11y ago
Can someone "explain like I'm five" why calculating a hash and comparing those isn't good enough? Is it to protect against bruteforcing? What if the hash is made expensive to compute?
15.
▲
by
rix0r
11y ago
Given a consensus protocol, it should be easy to connect the servers in a mesh though, right, getting rid of the tree structure and the single links?
16.
▲
by
rix0r
11y ago
Counterpoint: I was with a bunch of friends when I was young, we wanted to play some music, and we had a computer with some MP3s on it, AND speakers, but we happened to not have a screen lying around at that time. Didn't have. A screen
17.
▲
by
rix0r
12y ago
Well, yes and no. TCP has been designed in such a way that it interprets packet drops as a sign of "congestion" (which was typically true in ye olden days of purely wired networking), and it will start sending less data in respons
18.
▲
by
rix0r
12y ago
Out of curiosity, what kind of scanner do you have? I've been wanting to scan all my important mail and documents for a while, but I need the process to be as frictionless as possible for me to actually go through with it and I'm
19.
▲
by
rix0r
12y ago
I would have said "steen schaar papier" (rock scissors paper). I guess, taken all over the world, most permutations show up.
20.
▲
by
rix0r
12y ago
I've been thinking about this for a while: What a good unique selling point for an online IDE would be, is automated online testing--preferably with continuous integration. I've been in the position enough times that I'd like
21.
▲
by
rix0r
12y ago
It's not ENTIRELY obvious. For example, tup[0].extend([1]) would work fine, and the behaviour of __iadd__() seems like it should be the same as extend(). In fact, the reference[1] has the following thing to say: > For instance, to e
22.
▲
by
rix0r
12y ago
File system paths may belong in the shell, but what about paths with spaces? To be honest, I trust myself more manipulating paths in a language like Python than to put all quotes in the correct places in Bash :(
23.
▲
by
rix0r
12y ago
The way I look at it, it's that the admonition, "don't be a cheater," is stated BEFOREHAND, before any cheating has taken place. The child then still has the opportunity to make being a "not-bad" person (i.e.,
24.
▲
by
rix0r
13y ago
Is the entire premise of Neuro-Linguistic Programming (NLP) not that you can influence people's thought patterns by using language as code, as instructions?
25.
▲
by
rix0r
13y ago
To my mind, the cartoon is more of a depiction why you should avoid mutable state and non-local effects.
26.
▲
by
rix0r
13y ago
I actually made one about that :) http://rix0rrr.tumblr.com/image/42866777562
27.
▲
by
rix0r
13y ago
I can't tell if this is sarcasm. People are usually unaware of their own incompetence (I don't mean the term harshly), so I would expect hiring outside expertise seems would usually take a back seat to just buying supplies.
28.
▲
Bad Games People Still Play: Monopoly
(nerdsnestsoup.wordpress.com)
2 points
by
rix0r
13y ago
|
0 comments
29.
▲
by
rix0r
14y ago
Excel and similar tools are never going to go away. It's just got too much utility for that. The best thing we can do is provide spreadsheet users with the same quality of tools as we ourselves are used to. I know a startup in the Netherlan
30.
▲
Two Star Programming
(wordaligned.org)
121 points
by
rix0r
14y ago
|
63 comments
More ›