Baseline Widely available
sort()
㯠TypedArray
ã¤ã³ã¹ã¿ã³ã¹ã®ã¡ã½ããã§ãåä»ãé
åã®è¦ç´ ããã®å ´ (in-place) ã§ã½ã¼ããããã®åä»ãé
åãè¿ãã¾ãããã®ã¡ã½ãã㯠Array.prototype.sort()
ã¨åãã¢ã«ã´ãªãºã ã§ãããæ¢å®ã§æååã¨ãã¦ã§ã¯ãªãæ°å¤ã¨ãã¦å¤ãã½ã¼ãããç¹ãç°ãªãã¾ãã
const uint8 = new Uint8Array([40, 10, 50, 20, 30]);
uint8.sort();
console.log(uint8);
// Expected output: Uint8Array [10, 20, 30, 40, 50]
æ§æ 弿°
compareFn
çç¥å¯
ã½ã¼ãé ãå®ç¾©ãã颿°ã§ããè¿å¤ã¯ã 2 ã¤ã®è¦ç´ ã®ç¸å¯¾é åºã示ã符å·ãæã¤æ°å¤ã§ãªããã°ãªãã¾ããã a
ã b
ããå°ããå ´åã¯è² ã®å¤ãa
ã b
ãã大ããå ´åã¯æ£ã®å¤ãçããå ´å㯠0 ã§ãã NaN
㯠0
ã¨ãã¦æ±ããã¾ãããã®é¢æ°ã¯ä»¥ä¸ã®å¼æ°ã§å¼ã³åºããã¾ãã
a
æ¯è¼ã®ããã®æåã®è¦ç´ ãæ±ºã㦠undefined
ã«ã¯ãªãã¾ããã
b
æ¯è¼ã®ããã®2ã¤ç®ã®è¦ç´ ãæ±ºã㦠undefined
ã«ã¯ãªãã¾ããã
çç¥ããå ´åãåä»ãé åã®è¦ç´ ã¯æ°å¤é ã«ã½ã¼ãããã¾ãã
ã½ã¼ããããåä»ãé åã®å é åã¸ã®åç §ã§ããåä»ãé åã¯ãã®å ´ (in-place) ã§ã½ã¼ãããï¼ã³ãã¼ã¯è¡ãããªããã¨ã«æ³¨æãã¦ãã ããã
解説詳細ã«ã¤ãã¦ã¯ã Array.prototype.sort()
ãã覧ãã ããããã®ã¡ã½ããã¯æ±ç¨çã§ã¯ãªããåä»ãé
åã¤ã³ã¹ã¿ã³ã¹ã«å¯¾ãã¦ã®ã¿å¼ã³åºããã¨ãã§ãã¾ãã
ä»ã®ä¾ã¯ã Array.prototype.sort()
ã¡ã½ããã§ãã
let numbers = new Uint8Array([40, 1, 5, 200]);
numbers.sort();
// Uint8Array [ 1, 5, 40, 200 ]
// ãµã¤ãã®é
åã¨ã¯ç°ãªããæ°å¤çã«æ°å¤ãä¸¦ã¹æ¿ããããã«ã¯
// æ¯è¼é¢æ°ã¯å¿
è¦ããã¾ããã
// ãµã¤ãã®é
åã¯æ°å¤ã§ä¸¦ã¹æ¿ããããã«æ¯è¼é¢æ°ãå¿
è¦ã¨ãã¾ãã
numbers = [40, 1, 5, 200];
numbers.sort();
// [1, 200, 40, 5]
numbers.sort((a, b) => a - b); // æ°å¤ãæ¯è¼
// [ 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