We didn't try any of the others, I know that there are quite a few in Golang and Java, but we're pretty python centric at the moment and felt that building it with the tools we have was a better approach.
25 karma · joined July 18, 2010
We didn't try any of the others, I know that there are quite a few in Golang and Java, but we're pretty python centric at the moment and felt that building it with the tools we have was a better approach.
I got a remote-job and since I could live anywhere I took the opportunity to also get away from Indiana and I haven't looked back since.
A negative answer to the question posed here would simply mean that you don't dislike Oculus.
Here are some notes I took while playing with the site:
1. It would be great to have a way to add multiple books to your queue at the same time, or at least to not have to re-do your search after you've added a book. Especially when you're loading in a back-log.
2. Have more than 10 search results.
3. If you hit the back button, after a book has been added, you get the book twice. (It happened when I added Anathem to the 'will read' list.)
4. Make Author name clickable, so it shows a list of books by that author.
5. Why would I want to edit the description/title/author of a book that's already in the system? I think you might consider making this an admin function and have a way to submit changes, rather than letting users deal directly with that.
6. It would be great to have a recommendation system, or maybe more orthogonal to the system would be to specifically recommend someone's next book. I know I often have problems deciding what my next book should be.
Ms Shinder must own a farm to have come up with that much straw.
In the comic he is using a 2048 word dictionary, which gives 11 bits of entropy per word (log2(2048)), with a password made up of four words that gives a total of 44 bits of entropy.
But if we were to assume that the cracker knows nothing about our password, say other than it being all lowercase a-z, then we have an entropy per character of log2(26) or 4.7. For the phrase "correct horse battery staple", which has a length of 28, the bit entropy of that phrase, under those conditions is 4.7 * 28 = 131.6. Which is nearly to the point of the cracker being more likely to find a collision.
To answer the actual question, we use godaddy.
Speed wise, I haven't benchmarked it, but it uses regex (admittedly not the best way) and jquery.append() to do the heavy-lifting, that combined with the fact it's doing very little, it should be very fast.
I'm working on making it parse the template first that way I can get rid of the regex, or at least minimize it's usage.