tomdeakin

I can never work out the amount of coffee to put in the French press so that the plunger still goes down all the way and the coffee is a good strength. So if you go with a 7g scoop per cup in a (say) 8 cup press, then there is more coffee grounds than there is space for the plunger to go down all the way. Any tips?

Thanks! Registered over there, and there does seem plenty of jobs going.

From the commentary on the news today, it seems that people inadvertently held another card (maybe in a wallet) too close to the reader whilst trying to use Chip and Pin with another card.

I spent a year working on a project in Go, so got pretty used to the language. One thing I did wonder though was how would it fare on very large systems; how could Go hook up to work like MPI across clusters of computers?

Having watched the video my first thoughts were why can't (for eg) the child's grandma reply using her email client. Why does grandma have to login to the website?

Really interesting talk. TED do some great talks in general imo.

This may be a significant reason as to why people won't switch. Why go to the hastle of moving data just to use another service?

Plus, with referrals in Dropbox, the free space difference becomes negligible.

Thirded. They is such a simple way to visualise this.

Tried the "Black and White Squares" one. Was pretty fun and definitely suitable for 'young folders'!

git-add -p is new to me, but looks like something I'd wish I'd known about for a long while. The number of times I end up copying changes (like a new function) into some temp file while I commit is more than I'd care to admit.

It's always amusing asking for "Extra hot" and a slight look of panic as the milk is about to jump out the jug

I gave an old version of this a go a long time ago. It was really very time consuming. I would be interested in doing it again though now that I have more of an idea about compiling from source.. I was still very new to it then. I felt that you have to be pretty switched on to this before you start.

This kind of discussion is lacking in the article. It seems as if the OPs goal is optimisation and of course finding the right algorithm with the lowest complexity is the first port of call. However, the indexOf function seems to rely on properties of the data which may not be present (like the forced example in the middle).

There are other algorithms besides KMP too for this. I'm sure with some thinking on my part the linear time suffix tree algorithms could solve this too off hand.

Would be really interested to see what caused those segfaults! But the link in the table just goes to the table.