Baseline Widely available *
Map
æ¯ä¿åäºéµå¼å°ï¼key-value pairsï¼çç©ä»¶ãä»»ä½å¼ï¼å
æ¬ç©ä»¶ååºæ¬åå¥ï¼primitiveï¼å¼ï¼é½å¯ä»¥ä½çºéµæå¼ã
iterable
çºä¸åé£å
æå
¶ä»å
ç´ æéµå¼å°çå¯è¿ä»£ç©ä»¶ï¼æå
©åå
ç´ çé£åï¼ä¾å¦ [[ 1, 'one' ],[ 2, 'two' ]]
ï¼ãæ¯ä¸åéµå¼å°é½æè¢«å å
¥è³æ°ç Map
ï¼null
æè¢«è¦çº undefined
ã
ä¸å Map
ç©ä»¶ææ ¹æå
ç´ çæ°å¢é åºèµ°è¨ªèªèº«çææå
ç´ â for...of
è¿´åæå¨æ¯æ¬¡è¿ä»£åå³ä¸å [key, value]
é£åã
éµç¸çæ¯åºæ¼ SameValueZero çæ¼ç®æ³ï¼NaN
被èªçºè NaN
ç¸åï¼å³ä½¿ NaN !== NaN
ï¼ä¸¦ä¸æ ¹æ ===
éç®ç¬¦çèªç¾©ï¼ææå
¶ä»å¼é½è¢«èªçºç¸çãå¨ç®åç ECMAScript è¦ç¯ä¸ï¼-0
å +0
被èªçºæ¯ç¸ççï¼åç®¡å¨æ©æçèæ¡ä¸ä¸¦é妿¤ã詳細çå
§å®¹è«åé± ç覽å¨ç¸å®¹æ§ 表ä¸ç "Value equality for -0 and 0"ã
Object
å Map
é¡ä¼¼ãå
©è
é½å
è¨±ä½ è¨ç½®å°æçéµå¼å°ï¼æª¢ç´¢éäºå¼ï¼åªé¤éµï¼ä¸¦æª¢æ¸¬æ¯å¦æä»éº¼åå²å¨éµä¸ãæ£å çºå¦æ¤ï¼ä¹å çºæ²æå
§ç½®çæ¿ä»£åï¼ï¼Object
卿·å²ä¸ä¸ç´è¢«ç¶ä½ Map
使ç¨ï¼ç¶èå¨æäºæ
æ³ä¸ï¼ä½¿ç¨ Map
æä¸äºéè¦çä¸åä¹è:
Object
ç鵿¯ å串
å Symbol
ï¼èå®åå¨ Map
ä¸å¯ä»¥æ¯ä»»æçè³æåæ
ï¼å
æ¬å½æ¸ï¼å°è±¡ä»¥ååå§çè³æåæ
ãsize
屬æ§è¼é¬å°ç²å¾ Map
ç大å°ï¼è Object
ä¸çå±¬æ§æ¸éå¿
é æå確èªãMap
æ¯å¯è¿ä»£ï¼iterableï¼çï¼å æ¤å¯ä»¥ç´æ¥è¿ä»£ï¼èå¨ Object
ä¸è¿ä»£åéè¦ä»¥æç¨®æ¹å¼ç²åå
¶éµä¸¦å°å
¶é²è¡è¿ä»£ãObject
æä¸åååï¼æä»¥å¦æä¸å°å¿ï¼æ å°ä¸æä¸äºé»èªéµå¯è½èéµç¼çè¡çªãå¾ ES5 éå§ï¼éå¯ä»¥ééä½¿ç¨ map = Object.create(null)
ä¾ç¹ééååé¡ï¼ä½æ¯å¾å°é樣åãMap
å¯è½è¡¨ç¾å¾æ´å¥½ãMap.length
length
屬æ§çå¼çº 0 è¦è¨ç® Map
䏿å¤å°å
ç´ ï¼å¯ä»¥ä½¿ç¨ Map.prototype.size
ã
Map[Symbol.species]
ç¨æ¼åµå»ºæ´¾çç©ä»¶çæ§é 彿¸ã
Map.prototype
表示 Map
æ§é 彿¸çååï¼å
è¨±å°ææç Map
ç©ä»¶æ·»å 屬æ§
Map
ç©ä»¶å¯¦é«
ææç Map
實ä¾é½ç¹¼æ¿èª Map.prototype
.
Map.prototype[Symbol.toStringTag]
The initial value of the Symbol.toStringTag
property is the string "Map"
. This property is used in Object.prototype.toString()
.
Map.prototype.size
Returns the number of key/value pairs in the Map
object.
Map.prototype.clear()
Removes all key-value pairs from the Map
object.
Map.prototype.delete()
Returns true
if an element in the Map
object existed and has been removed, or false
if the element does not exist. map.has(key)
will return false
afterwards.
Map.prototype.get()
Returns the value associated to the passed key, or undefined
if there is none.
Map.prototype.has()
Returns a boolean indicating whether a value has been associated with the passed key in the Map
object or not.
Map.prototype.set()
Sets the value for the passed key in the Map
object. Returns the Map
object.
Map.prototype[Symbol.iterator]()
Returns a new Iterator object that contains a two-member array of [key, value]
for each element in the Map
object in insertion order.
Map.prototype.keys()
Returns a new Iterator object that contains the keys for each element in the Map
object in insertion order.
Map.prototype.values()
Returns a new Iterator object that contains the values for each element in the Map
object in insertion order.
Map.prototype.entries()
Returns a new Iterator object that contains a two-member array of [key, value]
for each element in the Map
object in insertion order.
Map.prototype.forEach()
Calls callbackFn
once for each key-value pair present in the Map
object, in insertion order. If a thisArg
parameter is provided to forEach
, it will be used as the this
value for each callback.
Map
ç©ä»¶
var myMap = new Map();
var keyString = "a string",
keyObj = {},
keyFunc = function () {};
// setting the values
myMap.set(keyString, "value associated with 'a string'");
myMap.set(keyObj, "value associated with keyObj");
myMap.set(keyFunc, "value associated with keyFunc");
myMap.size; // 3
// getting the values
myMap.get(keyString); // "value associated with 'a string'"
myMap.get(keyObj); // "value associated with keyObj"
myMap.get(keyFunc); // "value associated with keyFunc"
myMap.get("a string"); // "value associated with 'a string'"
// because keyString === 'a string'
myMap.get({}); // undefined, because keyObj !== {}
myMap.get(function () {}); // undefined, because keyFunc !== function () {}
ä½¿ç¨ NaN
ä½çº Map
çéµ
NaN
忍£å¯ä»¥ä½çº Map
ç keyï¼éç¶æ¯å NaN
é½ä¸çæ¼èªå·±æ¬èº«ï¼ä¸é¢çä¾åæ¯ææçï¼å çº NaN
ç¡æ³ååå½¼æ¤ã
var myMap = new Map();
myMap.set(NaN, "not a number");
myMap.get(NaN); // "not a number"
var otherNaN = Number("foo");
myMap.get(otherNaN); // "not a number"
éé for..of
è¿ä»£ Map
Map å¯ä»¥ä½¿ç¨ for..of
è¿´åé²è¡è¿ä»£ï¼
var myMap = new Map();
myMap.set(0, "zero");
myMap.set(1, "one");
for (var [key, value] of myMap) {
console.log(key + " = " + value);
}
// 0 = zero
// 1 = one
for (var key of myMap.keys()) {
console.log(key);
}
// 0
// 1
for (var value of myMap.values()) {
console.log(value);
}
// zero
// one
for (var [key, value] of myMap.entries()) {
console.log(key + " = " + value);
}
// 0 = zero
// 1 = one
éé forEach()
è¿ä»£ Map
Map
å¯ä»¥ä½¿ç¨ forEach()
æ¹æ³é²è¡è¿ä»£ï¼
myMap.forEach(function (value, key) {
console.log(key + " = " + value);
});
// Will show 2 logs; first with "0 = zero" and second with "1 = one"
è Array
ç©ä»¶éè¯
var kvArray = [
["key1", "value1"],
["key2", "value2"],
];
// Use the regular Map constructor to transform a 2D key-value Array into a map
var myMap = new Map(kvArray);
myMap.get("key1"); // returns "value1"
// Use the Array.from function to transform a map into a 2D key-value Array
console.log(Array.from(myMap)); // Will show you exactly the same Array as kvArray
// Or use the keys or values iterators and convert them to an array
console.log(Array.from(myMap.keys())); // Will show ["key1", "key2"]
è¤è£½èåä½µ Map
å°±å Array
䏿¨£ï¼Map
å¯ä»¥è¢«è¤è£½:
var original = new Map([[1, "one"]]);
var clone = new Map(original);
console.log(clone.get(1)); // one
console.log(original === clone); // false. Useful for shallow comparison
è«è¨ä½ï¼æ¸ææ¬èº«ä¸¦éå éçã
Map
å¯ä»¥è¢«åä½µï¼ä¿æéµçå¯ä¸æ§:
var first = new Map([
[1, "one"],
[2, "two"],
[3, "three"],
]);
var second = new Map([
[1, "uno"],
[2, "dos"],
]);
// Merge two maps. The last repeated key wins.
// Spread operator essentially converts a Map to an Array
var merged = new Map([...first, ...second]);
console.log(merged.get(1)); // uno
console.log(merged.get(2)); // dos
console.log(merged.get(3)); // three
Map
ä¹å¯ä»¥è· Array
åä½µï¼
var first = new Map([
[1, "one"],
[2, "two"],
[3, "three"],
]);
var second = new Map([
[1, "uno"],
[2, "dos"],
]);
// Merge maps with an array. The last repeated key wins.
var merged = new Map([...first, ...second, [1, "eins"]]);
console.log(merged.get(1)); // eins
console.log(merged.get(2)); // dos
console.log(merged.get(3)); // three
è¦æ ¼ ç覽å¨ç¸å®¹æ§ åè¦
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