Popping the stack on the problem with using ordinal type comparisons?

by Michael S. Kaplan, published on 2007/04/24 03:01 -04:00, original URI: http://blogs.msdn.com/b/michkap/archive/2007/04/24/2256377.aspx

About a week ago I was talking about The problem with using ordinal (a.k.a. lexicographic, a.k.a. binary) type comparisons and I mentioned that I talk about it a bit tomorrow.

Well, it was one of those newfangled tomorrows that happen about a week later.... :-)

One of the alternate ideas that has been really popular in one developer's mind (I won't say who!) is the notion of doing a regular linguistic comparison, and then if the two strings are equal doing a binary comparison in order to tell the two apart, like maybe comparing their code points.

Anyone care to venture a guess why that might be a bad idea?

And then as a bonus how that wrong answer can perhaps lead toward an answer that is better than the wrong one and also better than the current one?

I'll talk more about this tomorrow -- the old fashioned kind of tomorrow that is just 24 hours away!


This post brought to you by ؟ (U+061f, a.k.a. ARABIC QUESTION MARK)

no comments

Please consider a donation to keep this archive running, maintained and free of advertising.
Donate €20 or more to receive an offline copy of the whole archive including all images.

referenced by

2007/04/25 Building your own better Ordinal comparison

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