stinkypete

5 ms·

1.
by stinkypete 9y ago
Si is also incredibly useful but requires industrial processing to turn into something useful from an industrial standpoint. Au is indeed useful, but not so much as nearly indicated by its current pricing. There's a _long_ history of h
2.
by stinkypete 13y ago
Source links for everything but the Erlang version are there at the end of the article.
3.
by stinkypete 13y ago
Gotcha. The parent comment made it seem like that was a link to information about retrospectively adding GC to other languages, especially given that Lisp already has GC as nearly an assumption at the language level. But I can see what he w
4.
by stinkypete 13y ago
/x?fnid=KxPuWC6qnkl4nxcUTDh4xs resolves to "unknown or expired link". Do you have a full URL?
5.
by stinkypete 13y ago
Immutable data structures let you use compare-and-swap to guarantee all updates to a shared reference are atomic. This can be a win if the amount of contention is low enough such that optimistically generating and setting the modified versi
6.
by stinkypete 13y ago
I don't know about an official answer but using a simple variation on a round-robin database (RRD) ought to do the trick. Basically: day count = [last 23 hour buckets] + hour count hour count = [last 59 minute buckets] + minute c
7.
by stinkypete 14y ago
You might try starting rlwrap with the `-m' option (--multi-line) which by default escapes " \ " into newlines. By itself this isn't all that useful but this enables editing the line in your $EDITOR via `ctrl-^'. When you do this the editor
8.
by stinkypete 14y ago
Probably has something to do with this statement, repeated many times on the page: We are able to do this, because starting our LISP-VM and doing all these processes on every request, is still many times faster that having a VM (with
9.
by stinkypete 14y ago
I also question the sanity of anyone spending that much on equipment and seemingly nothing on room treatments. If your goal is accurate sound reproduction, your room is going to be one of the biggest sources of problems (phase smearing, sta
10.
by stinkypete 14y ago
Nope, not the same. From the descriptions you give above it is very similar (a modified B-tree with heaps of delayed insertions in internal nodes), though the analysis in the paper does not use CO techniques. This tweak to B-trees to suppor
11.
by stinkypete 14y ago
Sounds like a Y-Tree to me: "A Novel Index Supporting High Volume Data Warehouse Insertions," C. Jermaine et. al, VLDB '99. How are fractal trees different?