• js原生继承之——组合式继承实例


    <!DOCTYPE html>
    <html lang="en">
    <head>
        <meta charset="UTF-8">
        <title>groupInherit</title>
        <script type="text/javascript">
        //声明父类
        function superClass(name){
            this.name = name;
            this.books = ['html','css','js'];
        }
        superClass.prototype.getName = function(){
            console.log(this.name);
        }
        superClass.prototype.getBooks = function(){
            console.log(this.books);
        }
        //声明子类
        function subClass(name,time){
            superClass.call(this,name);//让子this指向父this,后面带的是父类需传入的参数name
            this.time = time;
        }
        subClass.prototype = new superClass();//类式继承
        subClass.prototype.getTime = function(){
            console.log(this.time);
        }
        //测试用例:实例化对象测试
        var test1 = new subClass('js book',2015);
        var test2 = new subClass('css book',2014);
        test1.books.push('php');//test2插入的数据'php'不影响test1

        console.log(test1.name);      //'js book'
        console.log(test1.books);   //["html", "css", "js", "php"]
        test1.getName();              //'js book'
        test1.getBooks();           //["html", "css", "js", "php"]
        test1.getTime();            //2015

        console.log(test2.name);      //'css book'
        console.log(test2.books);   //["html", "css", "js"]
        test2.getName();              //'css book'
        test2.getBooks();           //["html", "css", "js"]
        test2.getTime();            //2014

        //本例已经通过验证,this属性和原型方法均能访问
        </script>
    </head>
    <body>
        
    </body>
    </html>

  • 相关阅读:
    200. Number of Islands
    [Leetcode] 70. Climbing Stairs Java
    LeetCode 64. Minimum Path Sum Java
    LeetCode 63. Unique Paths II Java
    LeetCode 62. Unique Paths Java
    [LeetCode 241] Different Ways to Add Parentheses Java
    LeetCode 240. Search a 2D Matrix II Java
    LeetCode 215. Kth Largest Element in an Array Java
    LeetCode 169. Majority Element Java
    LeetCode 53. Maximum Subarray Java
  • 原文地址:https://www.cnblogs.com/koleyang/p/4916827.html
Copyright © 2020-2023  润新知