• es6 语法 (对象扩展)


    {
        //简洁表示法
        let o = 1;
        let k = 2;
        let es5 = {
            o:o,
            k:k
        };
        let es6 = {
            o,k
        };
        console.log(es5,es6); //1,2;1,2
    
        let es5_method = {
            hello:function(){
                console.log('hello'); //hello
            }
        };
        let es6_method = {
            hello(){
                console.log('hello'); //hello
            }
        };
        console.log(es5_method.hello(),es6_method.hello()); //undefined undefined
    }
    {
        //属性表达式
        let a = 'b';
        let es5_obj = {
            a:'c',
            b:'c'
        };
        let es6_obj = {
            [a]:'c'
        };
        console.log(es5_obj,es6_obj) //{a:'c',b:'c'};{b:'c'};
    }
    
    {
        //新增api
        console.log('字符串',Object.is('abc','abc'),'abc'==='abc'); //true true
        console.log('数组',Object.is([],[]),[]===[]); //false false
        console.log('拷贝',Object.assign({a:'a'},{b:'b'}));//{a: "a", b: "b"}
        let test = {k:123,o:456};
        for(let [key,value] of Object.entries(test)){
            console.log(key,value); // k 123,o 456
        }
    }
    
    // {
    //     //扩展运算符(支持不友好)
    //     let {a,b,...c} = {a:'test',b:'kill',c:'ddd',d:'ccc'};
    //     c = {
    //         c:'ddd',
    //         d:'ccc'
    //     }
    // }
  • 相关阅读:
    最短路(Floyed、Dijkstra、Bellman-Ford、SPFA)
    查找技术
    简单线段树
    dfs
    bfs
    插件工具集合
    Web前端代码规范
    Javascript 判断手机横竖屏状态
    Git 笔记2
    git 笔记 1
  • 原文地址:https://www.cnblogs.com/Byme/p/7648238.html
Copyright © 2020-2023  润新知