JavaScript method to implement pinyin sorting_javascript skills-JS Tutorial-php.cn

JavaScript method to implement pinyin sorting_javascript skills

WBOY

Release： 2016-05-16 17:48:06

Original

1569 people have browsed it

Under normal circumstances, everyone will use the following method to sort the pinyin of Chinese characters

Copy the code The code is as follows:

 
var list = [ 'Wang', 'Zhang', 'Li']; 
list.sort(function (a, b) { 
return a.localeCompare(b); 
} ); 

localeCompare(): Compares two strings in locale-specific order.
The unreliability of pinyin sorting through localeCompare is:
1. Very dependent on the Chinese operating system
2. Very dependent on the browser kernel
In other words, if your website If the visitor is using a non-Chinese system or a non-IE browser (such as Chrome), he will most likely not be able to see the pinyin sorting results we expected.
-------------------------------------------------- ----------------------------------
Let me introduce my solution to this problem. I hope it can inspire others. :
This method supports a total of 20902 Chinese characters from China (including Taiwan), Japan, and South Korea in the continuous area from 0x4E00 to 0x9FA5 in the Unicode character set, that is, CJK (Chinese Japanese Korean) Chinese characters.

Copy code The code is as follows:

 
var CompareStrings = { 
db: '吖A Ah, oh, oh, oh... 袰訨鐢骪鏏霻鶑', // Tens of thousands of characters are omitted 
getOrderedUnicode: function (char) { 
var originalUnicode = char.charCodeAt(); 
 if (originalUnicode >= 0x4E00 && originalUnicode <= 0x9FA5) { 
var index = this.db.indexOf(char); 
if (index > -1) { 
return index 0x4E00; 
} 
} 
return originalUnicode; 
}, 
compare: function (a, b) { 
if (a == b) { return 0; 
} 
// This can be rewritten according to specific needs. The current way of writing is to put the empty string at the end if (a.length == 0) { return 1; } 
if (b.length == 0) { return -1; } 
var count = a.length > b.length ? b.length : a.length; 
for (var i = 0; i < count; i ) { 
　var au = this.getOrderedUnicode(a[i]); 
 var bu = this.getOrderedUnicode(b[i]); 
 if (au > bu) { 
 return 1; 
 } else if (au < bu) { 
　return -1; 
　} 
} 
return a.length > b.length ? 1 : -1; 
　} 
} 
// Rewrite the system’s native localeCompare 
String.prototype.localeCompare = function (param) { 
　 return CompareStrings.compare(this.toString(), param); 
} 

You can download the complete code through the following link http://xiazai.jb51.net/201211/yuanma/js_pinyin_jb51.rar
A brief introduction to the implementation principle:
1. Get the order sorted by pinyin Font library (db): There are many ways to achieve the goal. I used JavaScript C# to complete it. First, I used a script to enumerate all the Chinese characters, then submitted them to the C# background for sorting, and then output them to the front desk. This is just preparation work. Ha, you can do whatever you want.
2. Determine which of the two characters is larger (getOrderedUnicode): Because when sorting, not only Chinese characters must be processed, but also characters other than Chinese characters, so the comparator must be able to recognize all characters. Here we judge a character Whether it is a Chinese character will be treated differently: if it is a Chinese character, then search for its index value in the sorted font library, and the obtained index value plus the position of the first Chinese character in the Unicode character set will be after "calibration" The index value in the Unicode character set; if it is not a Chinese character, then just return its index value in the Unicode character set.
3. Compare two strings (compare): compare each character in the two strings one by one (compare within the valid range, that is, the length of the shorter string), if it is found that a is larger than b , it returns 1, otherwise it returns -1.
4. If the winner has not been determined after the comparison within the valid range, it will depend on which one is longer. For example, a='123', b='1234', then the longer b will be ranked later.
Green channel: If you like good articles, follow me, bookmark this article and contact me.