aliceryhl

13 ms·

91.
by aliceryhl 5y ago
I have to disagree with "powerful IDEs do the work much better". It's just not true. Neovim with a few plugins (less than 10 is certainly enough) can definitely compete with IDEs.
92.
by aliceryhl 5y ago
Regarding this, see this other comment: https://news.ycombinator.com/item?id=27173290
93.
by aliceryhl 5y ago
That 90% of all overflows are bugs doesn't surprise me at all, even if you include unsigned integers.
94.
by aliceryhl 5y ago
Fair enough. I guess it really is that bad in the US.
95.
by aliceryhl 5y ago
If you go by the numbers in the post I responded to, this isn't true, at least not where I live. The $1400 figure is pretty much exactly what I pay in rent, and I have no problems getting to work with public transport for $100/mon
96.
by aliceryhl 5y ago
Couldn't you do without the car? I've heard that the US has bad public transport, but is it really that bad?
97.
by aliceryhl 5y ago
I don't know much about GraphQL, but my instinctive reaction to it is that it seems like it has a lot of hidden consequences that I would not be able to predict in advance. For example, from what I've seen it seems like it would b
98.
by aliceryhl 5y ago
Yeah, interviews should really be asking more questions about graph algorithms instead. Those are so much more useful.
99.
by aliceryhl 5y ago
Recursion is not the same as divide and conquer. Divide and conquer is a category of algorithms that you would often implement with recursion, but you don't have to. For example, consider the bottom-up implementation of merge sort [1].
100.
by aliceryhl 6y ago
Yes, the reason you can't use char here is that a char is always 4 bytes, so a &[char] is a type that already exists, and that type uses four bytes per character.
101.
by aliceryhl 6y ago
Because there's no possible choice for T. You can't use u8, because then you would allow non-utf8 data. You can't use char, because a &[char] uses four bytes per character, whereas a &str stores the characters in utf-
102.
by aliceryhl 6y ago
That description seems very similar to how Rust's type system enforces thread safety. You have two kinds of references: shared and exclusive. The shared references will typically only provide immutable access, whereas if you have an ex
103.
by aliceryhl 6y ago
It probably is easier with appimage, but I don't think the difference would be that large. Certainly not a ton of effort.
104.
by aliceryhl 6y ago
As I understand it, the difference is basically whether it is possible to end up in a situation where you are out of the game going forward. E.g. with repeated bets, you eventually hit zero money, and then you are stuck at zero forever.
105.
by aliceryhl 6y ago
It's badly phrased. What they mean is that we know that it will take at least n^2 operations, and that it would be nice to find an algorithm that is actually that fast.
106.
by aliceryhl 6y ago
If the key length is constant, the map as an upper limit on the number of possible elements, so all operations are constant time.
107.
by aliceryhl 6y ago
Generally when you just delete a file, its contents are marked as "unused", but not actually erased. This is why deleting a large file takes the same time as deleting a small file. Then, whenever a new file is created, it might be
108.
by aliceryhl 6y ago
Do you also think that it should be optional to wear a seatbelt?
109.
by aliceryhl 6y ago
I'm well aware which languages are statically typed and which are not. I was answering your question: > Have I misunderstood what is meant by strong type checker?
110.
by aliceryhl 6y ago
Maybe precompile is the wrong word, and I should have called it JIT or something else. I don't know. The point is that running a .jl script that calls my algorithm on a small test case takes 40 seconds to run. If I change the script to
111.
by aliceryhl 6y ago
Thanks, I'll have to check this out. I really wish these things were more discoverable. It took me a month of using Julia until I figured out that the compile-times were even avoidable on the REPL by using Revise.jl.
112.
by aliceryhl 6y ago
This is not a problem for me. I can write a `.jl` file and call it from the command-line with imports in that file. The problem is compile-times, since every run is first run when running a script.
113.
by aliceryhl 6y ago
Because if I run it from the command-line, it takes 40 seconds before it has precompiled and prepared my project for use. The only way to avoid that wait on every change is to use the REPL, where I only need to wait on the first run. Outsid
114.
by aliceryhl 6y ago
I really wish the language doesn't force me to use the REPL.
115.
by aliceryhl 6y ago
What do you even mean? It doesn't even catch that an argument's type doesn't match on a function call with types specified. It also can't catch trivial stuff like misspelling a struct field on a variable of known type. I
116.
by aliceryhl 6y ago
It would be a perfectly fine use-case for Julia if it wasn't so damn slow.
117.
by aliceryhl 6y ago
It obviously depends on the company, but it is possible in lots of places.
118.
by aliceryhl 6y ago
No.
119.
by aliceryhl 6y ago
No, it is not solved. To solve it, you would need to investigate all possible continuations of the game, all the way until the game ends, but there are so many continuations that this is impossible.
120.
by aliceryhl 6y ago
I never realized that the logo means "up". I think that is far from well-known information.

More ›