ralph

22 ms·

211.
by ralph 14y ago
I agree, good article. A sort -n is also required before the uniq since server logs have the time of the request but are printed when the response is complete so they're not necessarily increasing.
212.
by ralph 14y ago
I don't think this would be necessary if folks ensured their X server's Screens' resolutions were configured correctly. $ xdpyinfo | grep -A 2 '^screen #' screen #0: dimensions: 1920x1080 pixels (483x272 millimeters)
213.
by ralph 14y ago
Unsure why the downvote since the original is wrong. To be clear, cut -d: -f3- | sort | uniq -c | sort -k2 -n would be sorting the output of uniq(1) by the password, treating them all as numeric. Depending on one's locale that give
214.
by ralph 14y ago
Is it mere coincidence that password `123456' is the most frequent with exactly 1667 occurrences?
215.
by ralph 14y ago
Isn't the sort a bit odd too? To sort by uniq's frequency it's more like sort -k1n,1 -k2
216.
by ralph 14y ago
What's the input to that? Is it lines like 133438:remia.eu@hotmail.com:combinate
217.
by ralph 14y ago
I expect some at Google are cogitating over replacing the current certificate method.
218.
by ralph 14y ago
Thanks seldo, interesting. Just been looking at a client's Amazon dashboard where they have a small set-up running, not something I normally deal with but I see their RDS is billing over 2e9 I/Os/month and ends up being a significant part o
219.
by ralph 14y ago
I thought the original post was wrong to choose 6502. "So, it was designed to be written by humans. More modern assembly languages are meant to written by compilers, so let’s leave it to them. Plus, 6502 is fun. Nobody ever called x86 fun.
220.
by ralph 14y ago
BBC BASIC tokenised BASIC keywords before the line was stored in memory, e.g. PRINT was represented by a single byte. Some tokens needed more than one byte, especially in later versions. But I'm talking about assembler here. BBC BASIC has
221.
by ralph 14y ago
STA is `store accumulator' not address. Would you have liked to type STORE_ACCUMULATOR with the high frequency that the instruction occurs on an editor that had no auto-complete? Even reading it is slower than STA. And having them be all th
222.
by ralph 14y ago
Didn't know if you were reticent to blow your own trumpet so thought I'd give a helping hand. Didn't realise a blog post would be in the offing; sorry. Perhaps next time publish the blog post, submit here, then the announce list email, then
223.
by ralph 14y ago
Announcement: http://www.mail-archive.com/tarsnap-announce@tarsnap.com/msg...
224.
by ralph 14y ago
7(b) is new and 13 has been changed from "You may not use the service if you are a citizen or resident of Canada".
225.
Tarsnap now available to residents of Canada(tarsnap.com)
70 points by ralph 14y ago|27 comments
226.
by ralph 14y ago
He refers to it again later; "Engineering apprenticeships have been decimated, and even the old metalwork shops in schools have gone, replaced by ‘craft, design and technology’, which seems to mainly involve making things of cardboard."
227.
by ralph 14y ago
Didn't TTFB become popular because back then the start-up/handover time of the request from the server to the URL handler, CGI, FastCGI, etc., was significant depending on the handler's language, ... Far less significant now. Cutting TCP pa
228.
by ralph 14y ago
Yes, it can return a tuple, in Python-speak, and has a pre-declared error type. http://golang.org/ref/spec#Errors
229.
by ralph 14y ago
True, but if that bus does one day get him then we'd probably hear about it pretty quick on the grapevine (he didn't squeal, just let out a little whine) and start making alternative arrangements en masse.
230.
by ralph 14y ago
It's almost like sometimes it would have handy to do case ch <- defer foo(): and only have foo() be evaluated if ch is ready for writing and also chosen amongst the cases. As the (fixed) code stands either the Sprintf() and Su
231.
by ralph 14y ago
Hi John, https://gist.github.com/3039932 has problems; w.Count() is evaluated every time around the for-loop even if the result isn't sent down the count channel. See http://play.golang.org/p/pbCX13my0q where I've altered lines 60-62 ye
232.
by ralph 14y ago
Have you done the update now? Only there's a NewCounter() that's called but not defined and the text says "it can be passed to counter.New".
233.
by ralph 14y ago
Yeah, sorry, I know they're the public DNS, but they're also jolly handy as unforgettable IP addresses you expect to be able to ping, hence the smiley. Good news about the time{1..4} NTP servers, I'll give them a try, thanks.
234.
by ralph 14y ago
So a VM on G's Compute Engine could in turn run an NTP server that exported G's Production Time? Do I also see GPT on App Engine? Any chance Google could just make a GPT NTP server available as a public service anyway, just as 8.8.8.8 is th
235.
by ralph 14y ago
Do you use (){}[] and others to move about? I rarely need to know the line number to move to on the screen.
236.
by ralph 14y ago
Sorry to criticise but it wasn't what I expected. I wanted to see the pedestrian tubes I used to walk down as a kid represented, as tubes. To see them as flat walk-ways doesn't give the same impression. That said, would be nice to see it e
237.
by ralph 14y ago
Did you use something else instead or just decide not to design around message-queues at all?
238.
by ralph 14y ago
You could be right about the spec. I think gccgo no longer does one OS thread per goroutine as of Go 1.0 but I've been unable to find a clear definition to point to.
239.
by ralph 14y ago
Ada's tasks aren't defined to be greenlets; an implementation can make then OS threads or processes, limiting their number. And rendezvousing is more cumbersome than channels, e.g. passing a channel over a channel.
240.
by ralph 14y ago
Sorry, but having had some dealings with Ada many years ago I'm sure Go is little like it. Go has CSP in its ancestry, what with channels and goroutines, and both are fundamental to it whereas Ada has nothing similar?

More ›