Baseline 2025
Newly available
map()
㯠Iterator
ã¤ã³ã¹ã¿ã³ã¹ã®ã¡ã½ããã§ããããã³ã°é¢æ°ã«ãã£ã¦ãããã夿ãããã¤ãã¬ã¼ã¿ã¼ã®è¦ç´ ãçæããæ°ããã¤ãã¬ã¼ã¿ã¼ãã«ãã¼ãªãã¸ã§ã¯ããè¿ãã¾ãã
callbackFn
ã¤ãã¬ã¼ã¿ã¼ã«ãã£ã¦çæãããåè¦ç´ ã«å¯¾ãã¦å®è¡ãã颿°ããã®è¿å¤ã¯ã¤ãã¬ã¼ã¿ã¼ãã«ãã¼ã«ãã£ã¦çæããã¾ãã颿°ã¯æ¬¡ã®å¼æ°ã¨ã¨ãã«å¼ã³åºããã¾ãã
element
å¦çä¸ã®ç¾å¨ã®è¦ç´ ã§ãã
index
å¦çä¸ã®ç¾å¨ã®è¦ç´ ã®ã¤ã³ããã¯ã¹ã§ãã
æ°ããã¤ãã¬ã¼ã¿ã¼ãã«ãã¼ãªãã¸ã§ã¯ãã§ããã¤ãã¬ã¼ã¿ã¼ãã«ãã¼ã® next()
ã¡ã½ãããå¼ã³åºããããã³ã«ããã®ã¤ãã¬ã¼ã¿ã¼ãã«ãã¼ã¯åºç¤ã¨ãªãã¤ãã¬ã¼ã¿ã¼ããæ¬¡ã®è¦ç´ ãåå¾ãã callbackFn
ãé©ç¨ãããã®è¿å¤ãè¿ãã¾ããåºç¤ã¨ãªãã¤ãã¬ã¼ã¿ã¼ãå®äºããã¨ãã¤ãã¬ã¼ã¿ã¼ãã«ãã¼ãå®äºãã¾ãï¼next()
ã¡ã½ãã㯠{ value: undefined, done: true }
ãçæãã¾ãï¼ã
é
åã¡ã½ãããããã¤ãã¬ã¼ã¿ã¼ãã«ãã¼ã®ã»ããåªãã¦ãã主ãªç¹ã¯ãé
å»¶çã§ããã¨ãããã¨ãã¤ã¾ããè¦æ±ãããã¨ãã«ã®ã¿æ¬¡ã®å¤ãçæããã¨ããæå³ã§ããããã«ãããä¸å¿
è¦ãªã³ã³ãã¥ã¼ã¿ã¼å¦çãé¿ãããã¨ãã§ããã¾ããç¡éã¤ãã¬ã¼ã¿ã¼ã§ä½¿ç¨ãããã¨ãã§ãã¾ãã map()
ã¡ã½ããã使ç¨ããã¨ãå復å¦çããã¨ãã«å¤æãããè¦ç´ ãçæããæ°ããã¤ãã¬ã¼ã¿ã¼ã使ãããã¨ãã§ãã¾ãã
次ã®ä¾ã§ã¯ããã£ããããæ°åã®é ãçæããã¤ãã¬ã¼ã¿ã¼ã使ãããããåé ã 2 ä¹ããæ°ããæ°åã«å¤æããæåã®ããã¤ãã®é ãèªã¿åãã¾ãã
function* fibonacci() {
let current = 1;
let next = 1;
while (true) {
yield current;
[current, next] = [next, current + next];
}
}
const seq = fibonacci().map((x) => x ** 2);
console.log(seq.next().value); // 1
console.log(seq.next().value); // 1
console.log(seq.next().value); // 4
map() ã® for...of ã«ã¼ãã§ã®ä½¿ç¨
map()
ã¯ãã¤ãã¬ã¼ã¿ã¼ãæä½æ¥ã§ä½æããªãå ´åã«æã便å©ã§ããã¤ãã¬ã¼ã¿ã¼ãå復å¯è½ãªãã¸ã§ã¯ãã§ããããã for...of
ã«ã¼ãã使ç¨ãã¦ãè¿ããããã«ãã¼ãå復å¦çãããã¨ãã§ãã¾ãã
for (const n of fibonacci().map((x) => x ** 2)) {
console.log(n);
if (n > 30) {
break;
}
}
// Logs:
// 1
// 1
// 4
// 9
// 25
// 64
This is equivalent to:
for (const n of fibonacci()) {
const n2 = n ** 2;
console.log(n2);
if (n2 > 30) {
break;
}
}
仿§æ¸ ãã©ã¦ã¶ã¼ã®äºææ§ é¢é£æ
å ±
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