What are the new es6 data structures?
The new structures are: 1. Symbol, which represents a unique value and is a function structure; 2. Set, which refers to a "set" structure, similar to an array, allowing the storage of unordered and non-repeated data; 3. WeakSet, similar to Set, the internal data cannot have duplicate values; 4. Map, refers to the "dictionary" structure, which can store mapping relationships.
The operating environment of this tutorial: Windows 7 system, ECMAScript version 6, Dell G3 computer.
ES6 new data structure
1, Symbol
Symbol
isES6 One of the new basic data types in
is a function. Each Symbol
value returned from the Symbol
function is unique, and the symbol
value serves as the identifier of the object attribute and has its only purpose.
const s1 = Symbol() const s2 = Symbol() console.log(s1 === s2); // false
symbol as key
The first way is to add it directly to the literal of the object.
// symbol作为key const obj = { [s1]:'abc', [s2]:'cc', }
The second way is to add it by adding an array.
// 需要用数组方式来获取,不能通过点语法,否则会获取到字符串key console.log(obj[s1]);
The third way is to add it through the defineProperty
method in the object.
const s4=Symbol() Object.defineProperty(obj,s4,{ configurable:true, enumerable:true, writable:true, value:'ff' })
Get the corresponding value through symbol
It needs to be obtained in array mode, not through dot syntax, otherwise the string key will be obtained.
console.log(obj[s1]);
symbol
cannot be implicitly converted to type string
.
Note: The parameter in the Symbol function is the symbol descriptor, which is a new feature in ES10
let Sym = Symbol("Sym") alert(Sym) // TypeError: Cannot convert a Symbol value to a string
We cannot alert
one directly symbol
object, but we can get the descriptor of the symbol
object through toString
or .description
.
let sym = Symbol('a') console.log(sym.description); // 'a'
Traversing symbol
cannot obtain symbol when using
for traversal and
object.keys
Healthy, object
also provides the getOwnPropertySymbols
method, which is used to obtain the keys of all symbols in the object.
const sKeys=(Object.getOwnPropertySymbols(obj)); for(const skey of sKeys){ console.log(obj[skey]); }
Global symbol object registration
Sometimes, we may need the values of multiple symbol
to be consistent, we can pass symbol
The static method provided for
method passes in the same descriptor to make their values consistent.
Symbol.for
This method searches the runtime symbol registry for an existing symbol using the given key and returns it if found. Otherwise, a new symbol is created in the global symbol registry using this key.
const sa=Symbol.for('cc') const sb=Symbol.for('cc') console.log(sa===sb); //true
Symbol.keyFor
This method is used to obtain the descriptor of the global symbol
.
const key =Symbol.keyFor(sb) console.log(key); // c
2. Set
Set
object (similar to an array) allows you to store any data type, but the Value cannot be repeated.
const s1 = new Set() s1.add(10) s1.add(20) s1.add(30) s1.add(40) console.log(s1) // Set(4) { 10, 20, 30, 40 } s1.add(20) console.log(s1) // Set(4) { 10, 20, 30, 40 }
Set common methods
Method | Return value | Description |
---|---|---|
size | set The number in the object | Returns the number in the set object Quantity |
add | Set Object | Add element |
delete | boolean | Delete element |
has | boolean | Set Whether this value exists in the object |
clear | None | Clear the value in the Set object |
##3. WeakSet
WeakSet is another data structure similar to
Set, and the internal data cannot have duplicate values.
- The difference between it and
- Set
- WeakSet
can only store object types, not basic data types
- WeakSet
It is a weak reference to the element
- WeakSet
Basic use
const weakSet = new WeakSet(); let obj = { name: "_island" }; weakSet.add(obj);
WeakSet common methods
Return value | Description | |
---|---|---|
add
| weaksetObject | Add element|
delete
| boolean
| Delete element|
has
| boolean
| weaksetWhether this value exists in the object |
方法 | 返回值 | 说明 |
---|---|---|
get | 获取对应的元素 | 通过key 获取对应元素 |
size | Map 对象中的数量 | 返回Map 对象中的数量 |
set | Map 对象 | 添加元素 |
delete | boolean | 删除元素 |
has | boolean | Set 对象中是否存在这个值 |
clear | 无 | 清空Set 对象中的值 |
遍历Map
通过foreach
语句遍历Map
map2.forEach((item) => console.log(item));
通过for..of
遍历Map
for ([val, key] of map2) { console.log(`${key}---${val}`); }
5、WeakMap
和Map
类似,也是以键值对的形式存在的
- 和Map的区别
WeakMap
的key
只能使用对象,不接受其他的类型作为key
WeakMap
的key
对对象是弱引用
基本使用
const weakMap = new WeakMap(); weakMap.set(obj, "a"); console.log(weakMap.get(obj)); // a
WeakMap常用方法
方法 | 返回值 | 说明 |
---|---|---|
get |
weakmap 对象 |
获取元素 |
delete |
boolean |
删除元素 |
has |
boolean |
weaksmap 对象中是否存在这个值 |
关于遍历
和WeakSet
一样,正因为它是弱引用,WeakMap
的key
是不可枚举的,如果key
可枚举那其列表将会受GC
影响。
【相关推荐:javascript视频教程、web前端】
The above is the detailed content of What are the new es6 data structures?. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics



When using complex data structures in Java, Comparator is used to provide a flexible comparison mechanism. Specific steps include: defining the comparator class, rewriting the compare method to define the comparison logic. Create a comparator instance. Use the Collections.sort method, passing in the collection and comparator instances.

Data structures and algorithms are the basis of Java development. This article deeply explores the key data structures (such as arrays, linked lists, trees, etc.) and algorithms (such as sorting, search, graph algorithms, etc.) in Java. These structures are illustrated through practical examples, including using arrays to store scores, linked lists to manage shopping lists, stacks to implement recursion, queues to synchronize threads, and trees and hash tables for fast search and authentication. Understanding these concepts allows you to write efficient and maintainable Java code.

Reference types are a special data type in the Go language. Their values do not directly store the data itself, but the address of the stored data. In the Go language, reference types include slices, maps, channels, and pointers. A deep understanding of reference types is crucial to understanding the memory management and data transfer methods of the Go language. This article will combine specific code examples to introduce the characteristics and usage of reference types in Go language. 1. Slices Slices are one of the most commonly used reference types in the Go language.

AVL tree is a balanced binary search tree that ensures fast and efficient data operations. To achieve balance, it performs left- and right-turn operations, adjusting subtrees that violate balance. AVL trees utilize height balancing to ensure that the height of the tree is always small relative to the number of nodes, thereby achieving logarithmic time complexity (O(logn)) search operations and maintaining the efficiency of the data structure even on large data sets.

Overview of Java Collection Framework The Java collection framework is an important part of the Java programming language. It provides a series of container class libraries that can store and manage data. These container class libraries have different data structures to meet the data storage and processing needs in different scenarios. The advantage of the collection framework is that it provides a unified interface, allowing developers to operate different container class libraries in the same way, thereby reducing the difficulty of development. Data structures of the Java collection framework The Java collection framework contains a variety of data structures, each of which has its own unique characteristics and applicable scenarios. The following are several common Java collection framework data structures: 1. List: List is an ordered collection that allows elements to be repeated. Li

Overview of the PHPSPL Data Structure Library The PHPSPL (Standard PHP Library) data structure library contains a set of classes and interfaces for storing and manipulating various data structures. These data structures include arrays, linked lists, stacks, queues, and sets, each of which provides a specific set of methods and properties for manipulating data. Arrays In PHP, an array is an ordered collection that stores a sequence of elements. The SPL array class provides enhanced functions for native PHP arrays, including sorting, filtering, and mapping. Here is an example of using the SPL array class: useSplArrayObject;$array=newArrayObject(["foo","bar","baz"]);$array

The hash table can be used to optimize PHP array intersection and union calculations, reducing the time complexity from O(n*m) to O(n+m). The specific steps are as follows: Use a hash table to map the elements of the first array to a Boolean value to quickly find whether the element in the second array exists and improve the efficiency of intersection calculation. Use a hash table to mark the elements of the first array as existing, and then add the elements of the second array one by one, ignoring existing elements to improve the efficiency of union calculations.

In-depth study of the mysteries of Go language data structure requires specific code examples. As a concise and efficient programming language, Go language also shows its unique charm in processing data structures. Data structure is a basic concept in computer science, which aims to organize and manage data so that it can be accessed and manipulated more efficiently. By in-depth learning the mysteries of Go language data structure, we can better understand how data is stored and operated, thereby improving programming efficiency and code quality. 1. Array Array is one of the simplest data structures
