leshow

93 ms·

421.
by leshow 7y ago
I find that price hard to believe. Has anybody else had an experience like this?
422.
by leshow 7y ago
Is arm an officially supported compiler target or is this just someone's port of swift to arm?
423.
by leshow 7y ago
Oh yeah. It wasn't clear from the blog post that he had implemented some of the std::ops operators for his Vector3 struct. You can get rid of the superfluous & symbols by implementing for &Vector3 also, so again, the ergonomics
424.
by leshow 7y ago
I don't really understand the complaints in the 'ergonomics' section, this code won't even compile: fn dot_product(a: &Vector3, b: &Vector3) -> float { a.x*b.x + a.y*b.y + a.z*b.z } fn do_math(p
425.
by leshow 7y ago
It's not usually used in that context for desktop applications
426.
by leshow 7y ago
How are you going to claim that Gtk doesn't have a 'responsive UI'? It's native, it's very responsive. Unless you mean 'responsive' like 'works on mobile'. Which seems kind of a moot point consid
427.
by leshow 7y ago
It's an apples to oranges comparison, you can't really say that one is "wasting" resources or not. If you want to use windows as an example. Why not take the current version? It uses what like 16GB for a basic install (I
428.
by leshow 7y ago
> I know that polymorphism, async, etc. should be used judiciously anyway, but still. I don't really see this recommended anywhere, especially re: polymorphism. Async _maybe_, but it's pretty situational.
429.
by leshow 7y ago
> There is a theory in the vaping community, or maybe its an urban myth, that the lack of MAO inhibitors is what allows people who vape to essentially lose their addiction. Definitely a myth, I never smoked but vaped for 2 years. I quit
430.
by leshow 7y ago
I'm not making a value judgment about anything, so that particular 'fallacy' doesn't apply. Good arguments don't just call things fallacies and leave it at that. Besides, the existence of a fallacy in an argument do
431.
by leshow 7y ago
> - They describe Google's demonstrated ability to remove malware from user's devices as a "backdoor" from wikipedia "A backdoor is a method, often secret, of bypassing normal authentication or encryption in a co
432.
by leshow 7y ago
Probably because you're just looking at examples; that's selection bias. The combinators/manual implementing Future approach to async IO gets even worse at scale, async/await is infinitely easier. If you don't like
433.
by leshow 7y ago
I managed to get a small doc fix in a release a while ago and was pretty stoked about that. It was nice of them to put me in the contributor list for the release even though it was such a small change. (If I recall, removing superfluous `mu
434.
by leshow 7y ago
Congrats! Like many I was looking forward to async/await in this release but I'm happy they've taken some extra time to work through any existing issues before releasing it.
435.
by leshow 7y ago
Stupid question, why is it often written "_the_ lambda calculus" and not just "lambda calculus"
436.
by leshow 7y ago
> dynamically typed language with type annotations I'm talking about statically typed languages also, just ones with inference. Haskell, Rust, Ocaml, F#, Go, etc, and increasingly languages like C# and Java are adding more and more
437.
by leshow 7y ago
I disagree, magic is magic. If there's sometime done by the compiler that is impossible to do yourself in the language-- that's magic. Everything async/await is doing you could do by yourself. There's no magic in the Fut
438.
by leshow 7y ago
It's not just about the combinators vs specialized syntax. I've had to write a library with 0.1 futures and you have to implement a lot of Futures manually. i.e. you need to implement the Future trait for your types pretty often.
439.
by leshow 7y ago
There's no magic in async/await either. It's all just sugar.
440.
by leshow 7y ago
All of those languages have a runtime that enables this sort of thing. That's not the case in Rust. It's a bit of an unfair thing to knock it for, given the restrictions.
441.
by leshow 7y ago
Personally I think that just makes code harder to read, and more difficult to refactor. You get benefits from leaving things inferred in some places when refactoring, preventing you from having to change a bunch of additional signatures jus
442.
by leshow 7y ago
Type inference is going forwards not backwards. Languages with "modern" type systems (Haskell, Ocaml, Rust, Swift, etc) have had inference from the start and it doesn't compromise type safety. There's a big difference b
443.
by leshow 7y ago
Like runhaskell for Go?
444.
by leshow 7y ago
The degree isn't important IMO. What is important is a strong understanding of algorithms, data structures, memory, cache locality, your chosen language runtime, etc. Granted, it depends somewhat what you are doing. If your job is to m
445.
by leshow 7y ago
Out of curiousity, which languages are you referring to? Assignment in if-statements is possible in C, C++, js, Go, and many other C-like languages. I think the only language I know of that disallows assignment in them is python, and it&#x2
446.
by leshow 7y ago
The problem with 'end' IMO is that you have to actually read the word, with } you don't. Of course, this is all useless to argue about. I quite like that lots of languages look different.
447.
by leshow 7y ago
javascript also has C style syntax, which you claimed to be familiar with. It's subjective, so I can't say that you're wrong. I just don't get it.
448.
by leshow 7y ago
Typescript makes writing large codebases in js actually possible. But it's still missing a few things and there's not much they can do about it. Pattern matching, and real support for sum types (not just having a 'type'
449.
by leshow 7y ago
I don't see where you're coming from honestly. It has familiar C-style syntax, it has type parameters in the form java does with <>.
450.
by leshow 7y ago
I didn't watch the video, does it say how much of the perf gap is due to the unix API's they tried to replicate and how much is due to wasm actually being 'slower'? 50% the speed of native is really not bad, it's no

More ›