Lexicographic encoding of UTF-8 byte sequences matches lexicographic order of the sequence of Unicode code-points. So you can sort UTF-8 strings as byte strings. Not that sorting by code-points has much meaning, but you…
Maybe we can generalize the becquerel to mean the average number of events per second of an arbitrary Poisson process? (The number requests per second and the number of decayed particles per second usually follow…
Interesting, but the summary does not mention an important fact: the data structure can contain at most 67108864 items, which is a quite low limit.
I don't think that it's silly - it's just over-engineered :) What the author describes is a general data structure called a "number tree", which is a general mapping from integers to arbitrary objects, represented as a…
There is an old Slavic word "vtorý" for "second" (not sure about spelling, but it is documented for example in old church Slavonic). Russian still uses "vtoroj" for "second". Several other Slavic languages have a word…
Lexicographic encoding of UTF-8 byte sequences matches lexicographic order of the sequence of Unicode code-points. So you can sort UTF-8 strings as byte strings. Not that sorting by code-points has much meaning, but you…
Maybe we can generalize the becquerel to mean the average number of events per second of an arbitrary Poisson process? (The number requests per second and the number of decayed particles per second usually follow…
Interesting, but the summary does not mention an important fact: the data structure can contain at most 67108864 items, which is a quite low limit.
I don't think that it's silly - it's just over-engineered :) What the author describes is a general data structure called a "number tree", which is a general mapping from integers to arbitrary objects, represented as a…
There is an old Slavic word "vtorý" for "second" (not sure about spelling, but it is documented for example in old church Slavonic). Russian still uses "vtoroj" for "second". Several other Slavic languages have a word…