theseoafs

6 ms·

1.
by theseoafs 8y ago
You were being overpessimistic: Python's GC handles cyclic references perfectly well.
2.
by theseoafs 9y ago
I don't think anyone manually counts out their tabs and spaces, but I think every major text editor has a mode or plugin to make this automatic.
3.
by theseoafs 9y ago
A is indented with a tab. B is indented with a tab, plus the requisite number of spaces to line up with the above line. C is indented with a tab.
4.
by theseoafs 9y ago
> My girlfriend is MOSTLY supportive but I don't dump everything on her. Learn to deal with stuff yourself and you'll be happier. Learning to deal with stuff yourself doesn't preclude asking your partner for help with maki
5.
by theseoafs 9y ago
What kind of guarantees do you want from your type system? Strictly speaking the only guarantee that linear types give you is that every single linear value will be consumed at some point, which generally means that no resources ever get
6.
by theseoafs 9y ago
Yep -- actually, if you look at how the IO type is defined in Haskell, it looks basically like this (there is an object that represents the "state of the world" that gets threaded through computations).
7.
by theseoafs 9y ago
Not sure what you're asking here. Usually the semantics behind what happens to an unused variable (i.e. is the file automatically closed, etc.) come down to how the language is designed. It could be automatically destroyed (like RAII
8.
by theseoafs 9y ago
Depends on the implementation of the language. In a typical functional language with linear types, the functions that mutate an object return a "new value" that is conceptually a modified version of the first value. So fleshing
9.
by theseoafs 9y ago
Linear types = "you must use this value exactly one time" Affine (uniqueness) types = "you can use this value either zero or one times, but you can't use it more than once" As an example, compare two languages: one
10.
by theseoafs 9y ago
Why are you under the impression that what Apple calls "ARC" is substantially different than reference counting?
11.
by theseoafs 9y ago
> I mean... you could have just called it a ref. ref T instead of &T. And then just ref(foo) or foo.ref to get a ref to foo. Ugh, no. There are references all over the place when I write Rust code -- it would be a serious bummer for
12.
by theseoafs 10y ago
Haskell is a compiled language.
13.
by theseoafs 10y ago
I have not seen any evidence that GC is the primary bottleneck in Haskell, or that a form of compiler-driven manual memory management would be faster.
14.
by theseoafs 10y ago
> Except you can bound it, and you can escape it that way. IE "not gotten anywhere after 30 iterations, so don't know". It should go without saying that this system is not Turing-complete anymore if you bound the runtime.
15.
by theseoafs 10y ago
Have there been writings on what exactly git's migration strategy to a new hash function will be? Apparently they have a seamless transition designed that won't require anyone to update their repositories, which seems like a prett
16.
by theseoafs 10y ago
The problem isn't the length of the text representation of the hash, it's the length of the actual binary representation of the hash.
17.
by theseoafs 10y ago
You wait for other games to come out, like any other console?
18.
by theseoafs 10y ago
That's nearly as in "most of C's features are supported by C++", not "most of C++'s features are C features".
19.
by theseoafs 10y ago
There's nothing stopping you from downloading the script and peeking at it yourself. There's also nothing stopping you from using the many other installation methods available.
20.
by theseoafs 10y ago
So why did you make an HN post to share a result that you admit doesn't mean anything?
21.
by theseoafs 10y ago
> A computer sceince background inherently implies software development background. > An algorithm that takes infinite time for 1 instruction is O(1) and still constant time. > An algorithm that takes infinite memory for every run
22.
by theseoafs 10y ago
Rust actually started with a model like this. The idea was when starting out for the first time you can use garbage collected pointers for everything and then switch to the manual model when you needed it. Problem is then that unless your s
23.
by theseoafs 10y ago
No.
24.
by theseoafs 10y ago
No fines for fake news are "on the table" in the US. Obviously policies that are meant to target fake news wouldn't touch opinion pieces about the best Christmas gifts.
25.
by theseoafs 10y ago
What a bad article. I mean, starting from the very first parapgraph: > What puzzles me about the discussions around “fake news”, is how everybody in favor of free speech is now calling for censorship. Like, really? Don’t you see where th
26.
by theseoafs 10y ago
They surely do not. Malloc is specified in such a way such that the request for memory can fail (which leads to returning NULL).
27.
by theseoafs 10y ago
`void` in C does not have a value. You can't make a variable and put a void in it because there is no such object as "void".
28.
by theseoafs 10y ago
I assure you that "malloc" and "free" don't "provide the illusion of infinite memory". Quite the opposite, in fact.
29.
by theseoafs 10y ago
I mean, obviously because some system gives you more freedoms than others doesn't mean it's the system that best preserves freedom. In the USA we don't have the freedom to enslave people but that doesn't make us less fre
30.
by theseoafs 10y ago
You can't fake it yourself from within the C stdlib is what the author means.

More ›