On reversing the irreversible (The Set-Up)

by Michael S. Kaplan, published on 2008/01/14 10:16 -05:00, original URI: http://blogs.msdn.com/b/michkap/archive/2008/01/14/7102809.aspx

The first blog in this series was On reversing the irreversible (the introduction).

First we'll lay put some requirements....

This is not a "call it once and then never again" kind of functionality, since the initial cost of building up the data needed to interpret sort keys is non-trivial in nature and there is a high fixed cost for that setup. So what we really need is just a few functions:

Now there are some truths relating to collation that are kind of implicit in the contract that these functions will be promising -- such as:

Anyway, if you're reading the series you can think about the kind of data you will bring to the party for the future blogs in the series.

Next up: initializing the data, after deciding what we want the data to look like....

What we really want is a good hashtable algorithm that we can give the byte arrays and strings to 9the former as index entries, the latter as content). Let me know if you have any in particular you like best....


This post brought to you by 𐄭 (U+1012d, aka AEGEAN NUMBER THIRTY THOUSAND)

no comments

referenced by

2008/03/03 On reversing the irreversible (grabbing the data, part II: the weirdness not so related to locales)

2008/01/25 On reversing the irreversible (grabbing the data, part I)

go to newer or older post, or back to index or month or day