Baseline Widely available
sort()
æ¹æ³åå°æåºç±»ååæ°ç»çå
ç´ ï¼å¹¶ä¸è¿åç±»ååæ°ç»ãè¿ä¸ªæ¹æ³çç®æ³åArray.prototype.sort()
ç¸åãTypedArray æ¯è¿éçç±»ååæ°ç»ç±»å ä¹ä¸ã
compareFunction
å¯é
æå®å®ä¹æåºé¡ºåºç彿°
æåºåçç±»ååæ°ç»ã
ç¤ºä¾æ´å¤ç¤ºä¾è¯·åè Array.prototype.sort()
æ¹æ³ã
var numbers = new Uint8Array([40, 1, 5, 200]);
numbers.sort();
// Uint8Array [ 1, 5, 40, 200 ]
// å¨è¿éï¼ææ°å¼æåºæ°å¼æ¶ï¼
// ä¸éè¦æ¯è¾å½æ°ã
var numbers = [40, 1, 5, 200];
numbers.sort();
// å°å
ç´ ä½ä¸ºåç¬¦ä¸²æ¥æåºã
// [1, 200, 40, 5]
function compareNumbers(a, b) {
return a - b;
}
numbers.sort(compareNumbers);
// [ 1, 5, 40, 200 ]
è§è æµè§å¨å
¼å®¹æ§ åè§
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4