Baseline Widely available
entries()
㯠TypedArray
ã¤ã³ã¹ã¿ã³ã¹ã®ã¡ã½ããã§ãåä»ãé
åã®åã¤ã³ããã¯ã¹ã®ãã¼ã¨å¤ãå«ãæ°ããé
åã®ã¤ãã¬ã¼ã¿ã¼ãªãã¸ã§ã¯ããè¿ãã¾ãããã®ã¡ã½ãã㯠Array.prototype.entries()
ã¨åãã¢ã«ã´ãªãºã ã§ãã
const uint8 = new Uint8Array([10, 20, 30, 40, 50]);
const eArr = uint8.entries();
eArr.next();
eArr.next();
console.log(eArr.next().value);
// Expected output: Array [2, 30]
æ§æ 弿°
ãªãã
è¿å¤æ°ããé åã¤ãã¬ã¼ã¿ã¼ãªãã¸ã§ã¯ãã§ãã
解説詳細ã«ã¤ãã¦ã¯ã Array.prototype.entries()
ãã覧ãã ããããã®ã¡ã½ããã¯æ±ç¨çã§ã¯ãªããåä»ãé
åã¤ã³ã¹ã¿ã³ã¹ã«å¯¾ãã¦ã®ã¿å¼ã³åºããã¨ãã§ãã¾ãã
const array = new Uint8Array([10, 20, 30, 40, 50]);
const arrayEntries = arr.entries();
for (const element of arrayEntries) {
console.log(element);
}
ä»ã®å復å¦ç
const array = new Uint8Array([10, 20, 30, 40, 50]);
const arrayEntries = arr.entries();
console.log(arrayEntries.next().value); // [0, 10]
console.log(arrayEntries.next().value); // [1, 20]
console.log(arrayEntries.next().value); // [2, 30]
console.log(arrayEntries.next().value); // [3, 40]
console.log(arrayEntries.next().value); // [4, 50]
仿§æ¸ ãã©ã¦ã¶ã¼ã®äºææ§ é¢é£æ
å ±
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