Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
flebron
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
14 ms
·
91.
▲
by
flebron
14y ago
I like the 'sanity check' at the bottom. :)
92.
▲
by
flebron
14y ago
Right, because alloca is the only thing (as far as I know) that can resize the stack. There is not going to be anything else that does the same thing. The best one can do is those stack allocators which overflow to heap, or an alloca-based
93.
▲
by
flebron
14y ago
I think if you don't go under the white arch, you can stay indefinitely in Lorentz transformations mode. At least, I stayed that way for several seconds if I avoided that arch.
94.
▲
by
flebron
14y ago
There's several projects that have seen the need to allocate variable length things on the stack, Chromium was one[1]. A quick googling sends me to [2] as well. I haven't ever found myself in a situation where I _needed_ my stuff to be stac
95.
▲
by
flebron
14y ago
Sorry, I misspoke - I didn't mean the runtime (what would that really be?) but the compilers. That is, I do not know, a priori, that the internal type system would deal equally well with constant sized arrays, as with variable based ones. C
96.
▲
by
flebron
14y ago
There is no real need for runtime sized arrays, as one could already use vectors (which are more comfortable to use than C-style arrays anyway) and allocate them on the stack (that's one of the template parameters of std::vector, its alloca
97.
▲
by
flebron
14y ago
I wrote this as a comment there, but I'll repaste it here since it's not showing up. ----------- One other thing I'd like to add, when considering asymptotic analysis, one needs to take into account both the cost model (i.e. what is assumed
98.
▲
by
flebron
14y ago
I did an internship last winter, and will likely do one again this winter. It was a great experience, and I'd consider it an awesome place to work at :)
99.
▲
by
flebron
14y ago
It's not about optimisim, but about eventual dominance of functions. If you have n^7 and 5(n^6 + 7n^2), then for every n >= 6, the first is larger. In general, for every pair of polynomials f and g of max degrees s and t respectively, a
100.
▲
by
flebron
14y ago
There will be time for popularization for the laymen. It is not now. It's more important that the knowledge be transmitted accurately and completely, than it is to give a reader's digest for the laymen. We'll have to wait until all of the d
101.
▲
A categorical view of covariance and contravariance in C++
(fedelebron.com)
2 points
by
flebron
15y ago
|
0 comments