25 years ago, on 20th February 1991, Python 0.9.0 was released publicly… I absolutely love it and use it everyday, and it seems to be as successful as ever… For another great 25 years! Cheers!
I’ve been playing recently an online game that has recently launched, that uses the following idea. When a user starts a match, it spawns a process in the server that acts as the opponent, generating the actions against the user. The game had a rough launch, with a lot of problems due it being played by a lot of people. And, IMHO, a lot of the problems can be traced to that idea. I see it’s a seductive one. If a user generates an interaction with the service that takes time (for example, a match for… Read More
What is cache More than a formal definition, I think that the best way of thinking about cache is an result from an operation (data) that gets saved (cached) for future use. The cache value should be identifiable with a key that is reasonably small. This normally is the call name and the parameters, in some sort of hashed way. A proper cache has the following three properties: The result is always replicable. The value can be scrapped without remorse. Obtaining the result from cache is faster than generate it. The same result will be used… Read More
Load testing is something very important in my job. I spend a decent amount of time checking how performant are some systems. There are some good tools out there (I’ve used Tsung extensively, and ab is brilliant for small checks), but I found that it’s difficult to create flows, where you produce several requests in succession and the input depends on the returned values of previous calls. Also, normally load test tools are focused in HTTP requests, which is fine most of the time, but sometimes is limiting. So, I got the idea… Read More
Right now there is a lot of discussion about how invasive and intrusive online advertising is, including the effects it has in performance. The funny part? I am still getting advertising that hardly qualifies as “targeted” or “interesting“. By now the whole internet should have a lot of contextual information on where I spend my time, what are the pages I read, and what interest me. What kind of ads I see? The same products I see on the broad TV. Just the usual cars, insurance, cleaning products. Plus the spammy “you’re the 10,000,000th… Read More
I have to say that sometimes I am incredibly surprised with some things. The last one has been to transform an old typewriter into a valid USB keyboard. This baffles me, because I am old enough to remember a word with typewriters. Well, I’m not that old. I only used a typewriter very briefly, on my school years, but I was close enough to people using them, most in particular, my grandfather. My grandfather was a journalist and writer, and for most of his life, he used a typewriter for quite a long time… Read More
Because Fibonacci numbers are quite abused in programming, a similar concept. My first impulse is to describe them in recursive way: But this is not very efficient to calculate them, as for each is calculating all the previous ones, recursively. Here memoization works beautifully Taking into account that it uses more memory, and that calculating the Nth element without calculating the previous ones is also costly. I saw this on Programming Praxis, and I like a lot the solution proposed by Graham on the comments, using an iterator. The code is really clean.
Good news everyone! The new version of find (0.8) is available in GitHub and PyPi. This version includes performance improvements, man page and fuzzy search support. Enjoy!