Baseline 2025
Newly available
some()
㯠Iterator
ã¤ã³ã¹ã¿ã³ã¹ã®ã¡ã½ããã§ã Array.prototype.some()
ã¨ä¼¼ã¦ãã¾ããããã¯ãã¤ãã¬ã¼ã¿ã¼ã«ãã£ã¦çæãããè¦ç´ ã®å°ãªãã¨ã 1 ã¤ããæå®ããã颿°ã§å®è£
ããã¦ããæ¤æ»ã«åæ ¼ãã¦ãããã©ãããå¤å®ãã¾ããè«çå¤ãè¿ãã¾ãã
callbackFn
ã¤ãã¬ã¼ã¿ã¼ã«ãã£ã¦çæãããããããã®è¦ç´ ã«å¯¾ãã¦å®è¡ãã颿°ã è¦ç´ ãæ¤æ»ã«åæ ¼ããå ´åã¯çå¤ãè¿ããããã§ãªããã°å½å¤ãè¿ãããã«ãã¾ãã ãã®é¢æ°ã¯æ¬¡ã®å¼æ°ã§å¼ã³åºããã¾ãã
element
å¦çä¸ã®ç¾å¨ã®è¦ç´ ã§ãã
index
å¦çä¸ã®ç¾å¨ã®è¦ç´ ã®ã¤ã³ããã¯ã¹ã§ãã
ã³ã¼ã«ããã¯é¢æ°ãå°ãªãã¨ã 1 ã¤ã®è¦ç´ ã«å¯¾ãã¦çå¤ãè¿ããå ´åã true
ã§ãããã以å¤ã¯ false
ã§ãã
some()
ã¯ã¤ãã¬ã¼ã¿ã¼ãå復å¦çããããããã®è¦ç´ ã«å¯¾ãã¦ä¸åº¦ã㤠callbackFn
颿°ãå¼ã³åºãã¾ãã ã³ã¼ã«ããã¯é¢æ°ãçå¤ãè¿ããããtrue
ãå³åº§ã«è¿ãã¾ãã ããã§ãªãå ´åã¯ãã¤ãã¬ã¼ã¿ã¼ã®çµããã¾ã§å復å¦çãè¡ãã false
ãè¿ãã¾ãã some()
ã true
ãè¿ããå ´åããã®ã¤ãã¬ã¼ã¿ã¼ã¯ return()
ã¡ã½ãããå¼ã³åºãã¦éãããã¾ãã
ã¤ãã¬ã¼ã¿ã¼ãã«ãã¼ã®ä¸»ãªå©ç¹ã¯ãé
åã¡ã½ããããããé
å»¶çãã§ããã¨ãããã¨ãã¤ã¾ããè¦æ±ãããã¨ãã«ã®ã¿æ¬¡ã®å¤ãçæããã¨ããæå³ã§ããããã«ãããä¸å¿
è¦ãªã³ã³ãã¥ã¼ã¿ã¼å¦çãé¿ãããã¨ãã§ããã¾ããç¡éã¤ãã¬ã¼ã¿ã¼ã§ã使ç¨ãããã¨ãã§ãã¾ããç¡éã¤ãã¬ã¼ã¿ã¼ã§ã¯ã some()
ã¯æåã®çå¤ãå¾ãããã¨ããã« true
ãè¿ãã¾ãã callbackFn
ã常ã«å½å¤ãè¿ãå ´åãã¡ã½ããã¯æ±ºãã¦æ»ãã¾ããã
function* fibonacci() {
let current = 1;
let next = 1;
while (true) {
yield current;
[current, next] = [next, current + next];
}
}
const isEven = (x) => x % 2 === 0;
console.log(fibonacci().some(isEven)); // true
const isNegative = (x) => x < 0;
console.log(fibonacci().take(10).some(isNegative)); // false
console.log(fibonacci().some(isNegative)); // Never completes
some()
ãå¼ã³åºãã¨ãã¡ã½ãããæ©æã«å¾©å¸°ããå ´åã§ãã常ã«ãã®ã¤ãã¬ã¼ã¿ã¼ã¯éãããã¾ãã ã¤ãã¬ã¼ã¿ã¼ãéä¸ã®ç¶æ
ã®ã¾ã¾ã«ãªããã¨ã¯ããã¾ããã
const seq = fibonacci();
console.log(seq.some(isEven)); // true
console.log(seq.next()); // { value: undefined, done: true }
仿§æ¸ ãã©ã¦ã¶ã¼ã®äºææ§ é¢é£æ
å ±
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