Baseline Widely available
entries()
æ¹æ³åå³ä¸å Iterator
ç©ä»¶ï¼å
¶å
å«èä¸åç±æå
¥é åºæåºï¼Set
ç©ä»¶ä¸æ¯åå
ç´ ç [value, value]
é£åãåç®¡å° Set
ç©ä»¶ä¾èªªæ²æå Map
䏿¨£ç key
æ¦å¿µï¼çºäºç¢ºä¿éå API éä½çè Map
ç¸ä¼¼ï¼æ¯å entry 齿忍£çå¼åæä½çºå
¶ key å value ï¼å æ¤åå³çæ¯ä¸å [value, value]
çé£åã
const set1 = new Set();
set1.add(42);
set1.add("forty two");
const iterator1 = set1.entries();
for (const entry of iterator1) {
console.log(entry);
// Expected output: Array [42, 42]
// Expected output: Array ["forty two", "forty two"]
}
èªæ³ åå³å¼
ä¸åæ°ç Iterator
ç©ä»¶ï¼å
å«èä¸åç±æå
¥é åºæåºï¼Set
ç©ä»¶ä¸æ¯åå
ç´ ç [value, value]
é£åã
entries()
var mySet = new Set();
mySet.add("foobar");
mySet.add(1);
mySet.add("baz");
var setIter = mySet.entries();
console.log(setIter.next().value); // ["foobar", "foobar"]
console.log(setIter.next().value); // [1, 1]
console.log(setIter.next().value); // ["baz", "baz"]
è¦ç¯ ç覽å¨ç¸å®¹æ§ åè¦
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