gorset

10 ms·

61.
by gorset 15y ago
A few questions: * What kind of limits and performance does this implementation have? * Will data be fetched from the database for each query? * Is it possible to have dimensions with millions of values and expect reasonable que
62.
by gorset 15y ago
"b += 15 * (b & 0x00000000ffffffffULL)" might look more magical than it actually is. The crux is: b * 4 is the same as b << 2 thus b += 3 * b is the same as b = b << 2 So plus, a multi
63.
by gorset 15y ago
Do you think they are safer or more dangerous than threads?
64.
by gorset 15y ago
Wouldn't "create", "getcurrent" and "switch" be better primitives for coroutines [0]? Having a concept of caller and callee complicates the maintenance of a large number of "concurrent" coroutines that does different things, and "yield" can
65.
by gorset 15y ago
Thanks. Which values are you using for the matching? I was assuming a fingerprint of the cert. Have you considered compressing the domains? Compiling them to a DFA should yield a very small structure, and you then will need far fewer bits f
66.
by gorset 15y ago
The article says 400K revoked certificates leading to 51MB uncompressed bloom filter. That's like 133 bytes per certificate, which seems wrong. Am I missing something? If 1 out of 1024 false positive is the target, then using 8 bytes per en
67.
by gorset 15y ago
Appending to a immutable string in a loop is O(n^2). I'm surprised the author is surprised by this. Python and Java is the same. Sure, it's possible for the vm to optimize this by either using ropes or convert to a buffer based on some kind
68.
Radix sort is faster than quicksort for int arrays(erik.gorset.no)
1 points by gorset 15y ago|0 comments
69.
by gorset 15y ago
Floats doesn't complicate radix sort that much. To quote McIlroy et al. (1993) "the troubles with radix sort are in implementation, not in conception". Finding the median strikes me as more of a academic problem than a real life problem. Ho
70.
by gorset 15y ago
I feel that radix sort would be a better choice, and maybe faster as well. MSB in-place radix sort can sort an arbitrary range, which can be used to find the median very quickly. You simply count the elements for each buckets, and then cont
71.
by gorset 16y ago
But you can skip ahead without parsing all the bytes since UTF-8 is self-synchronizing. The only scenario I can envision is that gnu grep wants to perform unicode normalization, to catch equivalent codepoints, and that this is implemented i
72.
by gorset 16y ago
Nice! That fixed it. Now it's 3 seconds. I'm still surprised why it's so much slower with UTF-8, though. I guess gnu grep is naively converting back and forth between representations? There's nothing in UTF-8 that should prevent it from doi
73.
by gorset 16y ago
The other day I was actually surprised over how slow gnu grep was. I wanted to count how many lines in a log file contained a domain. Using grep -c <domain> <file> took 25 seconds for 1.7GB log file, whilst agrep only took 5
74.
by gorset 16y ago
You are already trusting DNS more than CAs. The CN is set to your domain, not to mention that the authorization process for many CAs uses email, which depends on DNS. This is just another reason why it's so important to get technologies suc
75.
by gorset 16y ago
The fundamental problem is with X.509... It uses a flat namespace so all CAs can issue a valid certificate for any domain on the internet. Much of the problem could have been avoided if it was using a proper hierarchical structure, e.g. mir
76.
by gorset 16y ago
CPython aren't actually using unicode strings. Instead of having a sequence of codepoints, you will have either UCS2 or UCS4 strings depending on compile time options. For example, freshly installed python3.2 from macports: >>
77.
by gorset 16y ago
I'm very unhappy with gerrit. It doesn't support git style branches, and instead uses a made up "Change-Id" scheme where you embed some magic in commit messages. If you want to fix issues with a commit after a review, you can reuse this "Ch
78.
by gorset 16y ago
yup. Anchor text is fair game. Keywords taken from anchor texts are usually a good indication on what the linked page is about. A page can have a high page rank without ever being crawled - given that other high ranked pages have linked to