js用数组实现List

"use strict";

function List() {
    this.dataStore = [];
    this.pos = 0; // note
    this.listSize = 0;
    this.length = length;
    this.clear = clear;
    this.pos = pos;
    this.append = append;
    this.insert = insert;
    this.remove = remove;
    this.getElement = getElement;
    this.front = front;
    this.end = end;
    this.prev = prev;
    this.next = next;
    this.moveTo = moveTo;
    this.find = find;
    this.toString = toString;
    this.curPos = curPos;
    this.contains = contains;
}

function append(element) {
    this.dataStore[listSize++] = element;
}

function remove(element) {
    var pos = this.find(element);
    if (pos > -1) {
        this.dataStore.splice(pos, 1);
    }
}

function find(element) {
    for (let i = 0; i < listSize; i++) {
        if (this.dataStore[i] === element) {
            return i;
        }
    }

    return -1;
}

function length() {
    return this.dataStore.length;
}

function toString() {
    this.dataStore.toString();
    // this.dataStore.join(",");
}

// method 1
// function insert(element, index) {
//  if (index === 0) {
//      this.dataStore.unshift(element);
//  }
//  this.dataStore.splice(index - 1, 0, element);  // notice the second parameter
//  this.listSize++;
// }

function insert(element, after) {
    let insertPos = this.find(after);
    if (insertPos > -1) {
        this.dataStore.splice(insertPos+1, 0, element);
        this.listSize++;
        return true;
    }
    return false;
}

// notice
function clear() {
    delete this.dataStore;
    this.dataStore = [];
    this.listSize = this.pos = 0; // reset
}

function container(element) {
    for (let i = 0; i < this.dataStore.length; i++) {
        if (dataStore[i] === element) {
            return true;
        }
    }

    return false;
}

// tranverse
function front() {
    this.pos = 0;
}

function end() {
    this.pos = listSize - 1;
}

function prev() {
    if (this.pos > 0) {
        this.pos -= 1;
    }
}

function next() {
    if (this.pos < this.listSize - 1) {
        this.pos += 1;
    }
}

function curPos() {
    return this.pos;
}

function moveTo(position) {
    this.pos = position;
}

function getElement() {
    return this.dataStore[pos];
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值