Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
gnuvince
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
38 ms
·
331.
▲
by
gnuvince
12y ago
Wow. Anyone remembers Rust pre-0.1? When it had typestate, ML syntax, garbage collection, etc.? So nice to see how the language slowly evolved and was molded to fit as best as possible the problem they were trying to solve.
332.
▲
by
gnuvince
12y ago
I was in a class last year, and one of the grad students was working on Nit and gave us a presentation of the language. It was extremely interesting and seemed quite well designed.
333.
▲
by
gnuvince
12y ago
You could add a hook to use evil only in certain modes, for instance: (add-hook 'prog-mode-hook 'evil-local-mode) This activates evil only for modes that derive from prog-mode.
334.
▲
by
gnuvince
12y ago
That sounds like a mighty good idea to me. Not a fan of the Acme interface, but the idea of exposing the editor API through the filesystem means that there is no war like Emacs Lisp vs Scheme in the Emacs world (an no people suggesting tha
335.
▲
by
gnuvince
12y ago
I'm gonna need to read that source code; I've been an Emacs user for a long time now (and vim before that), and although I don't feel the need to switch (yet), I'm always on the lookout for new editors. A recent editor
336.
▲
by
gnuvince
12y ago
I should have mentioned: you have to say the questions out loud, and give out the answers out loud. And yes, your answers should be elaborate (e.g. explain how to do row elimination in a matrix).
337.
▲
by
gnuvince
12y ago
For people still in school, I have found that nothing beats flash cards for learning. It takes a bit of time, effort and discipline to write and use them, but in the long run, it's going to be easier and faster to study for exams.
338.
▲
by
gnuvince
12y ago
Very interesting read, thanks for posting it! I'm not really familiar with that domain, could you tell me whether it's possible that the reason Go bots are not as strong as chess bots (in relation to humans) is simply because che
339.
▲
by
gnuvince
12y ago
> Maybe it's because they exalt one line functional functions over a nice, simple, easy to read FOR loop when the former are so difficult to read, figure out what they really do, what is the performance cost, debug... Why do you eve
340.
▲
by
gnuvince
12y ago
True, what I mean is that I can be "messy" in OCaml for the sake of expediency. In principle, I prefer Haskell's clean approach, in practice I'm a bad programmer who sometimes does naughty things.
341.
▲
by
gnuvince
12y ago
Loops are basically just compares + labels + jumps, yet we abstracted away from those, because we saw that it was common to want to execute a block of code a given number of times (for loop) or as long as a condition held (while and do/
342.
▲
by
gnuvince
12y ago
OCaml is currently my language of choice. I love functional programming, been doing it for a while now, but it's nice to know that if I read an algorithm in a textbook, I can just implement it as-is instead of doing a translation to b
343.
▲
by
gnuvince
12y ago
The cons subsections that say that a generic version can be less optimized than a concrete version should mention which implementation is considered. If you use mono-morphization, then you end up with the same code as you would have writte
344.
▲
by
gnuvince
12y ago
Three questions: 1. what is the technical difference between template and generics? 2. how do we know that what Rust has are generics? 3. considering that the Rust type system was recently demonstrated to be Turing-complete, how can it be l
345.
▲
by
gnuvince
12y ago
I've begun to like having '+' and '+.' operators in OCaml. Not that I'm never tripped up, I often am, but I can never hide implicit conversions. Another thing to consider is how you would implement having 
346.
▲
by
gnuvince
12y ago
[Two steps, eh?]( http://knowyourmeme.com/photos/572078-how-to-draw-an-owl )
347.
▲
by
gnuvince
12y ago
Here's a question: if you write the same code in Rust and C and Rust refuses it on the grounds that you did something wrong and C accepts it, how likely is it that the C code is going to crash at runtime, and you'll have to fix it
348.
▲
by
gnuvince
12y ago
But here's the deal: now the web developer has to manually do something that used to be intrinsic to the way the web worked. Really feels like a step backwards to me.
349.
▲
by
gnuvince
12y ago
I really dislike how a lot of multi-page navigation (i.e. getting results 51-100) is now commonly done with AJAX. It's not really faster than loading a new page, but it breaks the back button. "Oh you clicked on the 287th link a
350.
▲
by
gnuvince
12y ago
So does Rust still "have closures" or are they now just a specific implementation of a trait? Are there other features that could be implemented as traits?
351.
▲
by
gnuvince
12y ago
Not to be that technically-anal guy, but the syntax of OCaml is not ambiguous from a CS point-of-view. However, it does have rules that can be counter-intuitive to humans.
352.
▲
by
gnuvince
12y ago
That's what the prompt answers back. # 3;; - : int = 3 # fun x -> x*x;; - : int -> int = <fun>
353.
▲
by
gnuvince
12y ago
I use ansi-term for quick tasks (e.g. re-run a build command), but you are absolutely right, if there's going to be a lot of output, I'm using my old trusty urxvt,
354.
▲
by
gnuvince
12y ago
Go has a similar problem: function calls and type conversions share the same syntax (or sufficiently the same syntax). If you see `x(t)` in a Go file, there's no way to know if that's a function call or a type conversion without
355.
▲
by
gnuvince
12y ago
I don't code in C very often, but when I do, I'm always annoyed that when I see a declaration `type ∗x`, I don't know whether `x` is meant to be a "simple pointer" or a an array. At least with Go, you clearly decla
356.
▲
by
gnuvince
12y ago
That's not a FreeBSD issue, that's a shell issue. Install bash and you'll have tab completion.
357.
▲
by
gnuvince
12y ago
Busy work: if UI designers did not change everything all the time, they'd all be out of jobs.
358.
▲
by
gnuvince
12y ago
Very cool. After my M.Sc. I'm going to need to find a job, and since OCaml jobs are pretty much inexistant in Montreal, F# is my backup plan.
359.
▲
by
gnuvince
12y ago
How does Rust's borrow checker cause a slowdown of sequential code? It's a purely compile-time construct and allows for the elimination of a GC, so it's actually a net win in code execution speed.
360.
▲
by
gnuvince
12y ago
> C is a compiled language[...] Not off to a great start :/
More ›