HN user
You can get the full stack of the crash point (and a few extra frames that handles the stack generation) in a deferred recover, ie https://play.golang.org/p/XvZteY6Y6fh
github.com/pkg/errors is a simple way to dump expensive stacktraces into each new/wrapped error. Or you can just panic and recover in your own app, it's possible though discouraged.
You wrote a promise library in Swift on a whiteboard? What?
How large was this whiteboard?
If we're talking outliers then Titan, the largest moon of Saturn has a surface atmospheric pressure 1.4x more than Earth's, while being 2.3% of Earth's weight
And then there's Venus' atmospheric pressure :-)
A legit criticism, but who would transmit an 8Mb datablock using LZ4 over a network? There are far better compression schemes whose lower performance tradeoffs become negligible when network latency is involved.
I am using LZ4 currently for a project compressing Netflow-derived data for a major ISP, even then it's in 64Kb chunks for quick access and decompression.
This classic article from Mario Wolczko first appeared on Usenet in 1986.
An argument could be made that [1986] would be more accurate.
I wonder how much it'd shock Eugene if someone pointed it out to him that, in American racial discourse, Irish and Italian folk were once considered "not white."
The title of his article is "How the Asians became white" which as Eugene pointed out in the comments, is an allusion to "How the Irish Became White," by Noel Ignatiev.
So it wouldn't shock him at all, that's his point.
No, that is a backronym.
> That means that no number may be more than 100 away from any other number once fully sorted (7 bits) It's possible that 90% of numbers are <1 million, and the remaining 10% are > 91 million. That's a 90 million delta possibility.
Most people will visit the page, scroll down a screen or two and leave it since they're not game programmers.
So, just speculating, he's no stranger to bandwidth spikes so perhaps the approach employed significantly saves on bandwidth during these periods, ultimately whether it's a conscious attempt to save or just a webdev quirk I don't know.
My experience with their B+ Tree database is that when your database size hits a Gb or more, closing the database can take up to 10mins or more (depending on writes queued), and opening a database that was not closed correctly rebuilds the entire database.
I've not found any such limitations with LevelDB
To most Americans, the best known Dane would be Dane Cook
Prince Frederik for Australians.
No. It's a free energy scam. It will go away and in a couple years another scam will bubble up against all odds and make it into mainstream media. Call it zero-point quantum energy, call it magnetism, cold fusion, free energy by any other name.
Research the people, not the techno babble. If they don't submit to independent scientific scrutiny and approach ignorant investors individually, well there you go.
> ... and I posit it has little to do with "presenting the facts" (where is their outrage about the claim that the stig can blink horizontally or is non-human?)
Just, wow. How does one even reply to a comment so profoundly stupid?
I don't know of a book reference, but if you sit down for half an hour and play though the algebra of stddev you can figure it how to combine multiple standard deviations into a single stddev. It's fairly simple and quite satisfying. The sum of squares can be computed by multiplying the mean with the number of elements. So, by storing the number of elements, mean of those elements and the population stddev of those elements, you can take two or more sets of numbers and compute their combined standard deviation as a simple formula based on their stddev, mean and nelems.
There's a wikipedia entry in combining standard deviations (Standard_deviation#Combining_standard_deviations) but it's dense if you don't have a math background (I don't have one). The crux of it is, to compute the stddev of a set you need to compute the average, then sum of squares of the delta [ie sum([elem[i] - avg] for 1 .. i)]. You don't have the individual elements any more so you can't compute the sum of squares of mean_deltas, but using the stored stddevs, means and averages you can recompute that information out when computing the new stddev.
Well, it's a lot of easier to explain with a whiteboard. You're basically subtracting out the information you don't have based on the stddev/mean-aka-avg/nelems data you do have, you're subtracting out infinite series and it all works out perfectly.
numsum1 = SUM(nelems[i] * (stddev[i]^2 + mean[i]^2))
numsum2 = SUM( nelems[i] * mean[i] )^2 / SUM(nelems[i])
combined_stddev = SQRT((numsum1 - numsum2) / SUM(nelems[i]))
> Bzzzt! Thanks for playing!
Please don't do this.
Do you know which developer in UW2 was responsible for the Servant Strike bug? That glitch wasted 6 weeks of my life! I recently started playing UW2 again through Dosbox, using a character editor written in 1994 to change save files is humbling.
I would read a book or 10 full of these old-school game developing anecdotes.