SBCS中代码点的实际数目可能要少一些。
DBCS中代码点的实际数目可能要少一些。
排序序列将代码点映射至每个字符在已排序序列中的期望位置。
The collating sequence maps the code point to the desired position of each character in a sorted sequence.
Thing I've got a little procedure that could do that, but you know the simplest thing I could do is to say well, gee, wait a minute, why don't I just check to see if these are the same thing?
这两个点是同一个点么?,我已经写了一小块代码,可以提供这个功能,但是你知道的我可以做的,最简单的事情就是说好,嗯?,等等,我为什么不直接去看看,这两个东西相等不相等呢?
Once your programs get fairly complex, it becomes harder and harder to find things and to tweak things if you're not being organized.
一旦代码稍微复杂点,而你又不规范你的代码,那么你想找什么东西就很困难了。
And when I do this test, what I want to do, is say I'm going to pick the middle spot, and depending on the test, if I know it's in the upper half, I'm going to set my start at the mid point and the end stays the same, if it's in the front half I'm going to keep the front the same and I'm going to change the endpoint.
如果我知道目标数可能,再比中值点大的区间里,我可能就会把开始点设为中值点,而尾点不变,如果在小的那个区间里,就保持开始点不变而把尾点设为中值点,你们可以看到这儿的代码,就是这么做的,对不对?它是怎么做的?
应用推荐