javascript 数据结构和算法读书笔记 > 第三章 列表

function List(){
    this.listSize = 0;
    this.dataStore = [];
    this.pos = 0;

    this.length = function(){ 
        return this.listSize;
    };
    this.getPos = function(){
        return this.pos;
    };
    this.prev = function(){
        this.pos--;
    };
    this.next = function(){
        this.pos++;
    };
    this.front = function(){
        this.pos = 0;
        return 0;
    };
    this.end = function(){
        this.pos = this.listSize;
        return this.listSize;
    };
    this.find = function(ele){
        for(var i=0; i<this.listSize; i++){
            if(this.dataStore[i] === ele){
                return i;
            }
        }
        return -1;
    };
    this.add= function(ele){
        this.dataStore[this.listSize++] = ele;
    };
    this.insert = function(ele, afterEle){
        var index = this.find(afterEle);
        if(index > -1){
            this.dataStore.splice(index, 0, ele);
            this.listSize++;
            return true;
        }else{
            return false;
        }
    };
    this.remove = function(ele){
        var index = this.find(ele);
        if(index > -1){
            this.dataStore.splice(index, 1);
            this.listSize--;
            return true;
        }
        return false;
    };
    this.clear = function(){
        delete this.dataStore;
        this.dataStore = [];
        this.listSize = this.pos = 0;
    };
    this.contains = function(ele){
        if(this.find(ele) > -1){
            return true;
        }else{
            return false;
        }
    };
    this.get = function(index){
        return this.dataStore[index];
    };
    this.toString = function(){
        return this.dataStore.toString();
    };
}

var users = [‘Jenny‘, ‘Penny‘, ‘Tenny‘, ‘Anny‘, ‘Lily‘];
var list = new List();
for (var i = 0; i <users.length - 1; i++) {
    list.add(users[i]);
}
for(list.front(); list.getPos()<list.length(); list.next()){
    console.info(list.getPos() + ":" + list.get(list.curPos()));
}