QCAD js实现Map

js实现Map

//qcad/scripts/map.js
// Public domain
function Map(compareFunction) {
    this.keyArray = [];
    this.valArray = [];
    this.compareFunction = compareFunction;
}

Map.prototype.put = function(key, val) {
    var elementIndex = this.findKey(key);
    if (elementIndex === (-1)) {
        this.keyArray.push(key);
        this.valArray.push(val);
    } else {
        this.valArray[elementIndex] = val;
    }
};

Map.prototype.get = function(key, def) {
    var result = def;
    var elementIndex = this.findKey(key);
    if (elementIndex !== (-1)) {
        result = this.valArray[elementIndex];
    }
    return result;
};

Map.prototype.remove = function(key) {
    var result = null;
    var elementIndex = this.findKey(key);
    if (elementIndex !== (-1)) {
        this.keyArray = this.keyArray.removeAt(elementIndex);
        this.valArray = this.valArray.removeAt(elementIndex);
    }
    return;
};

Map.prototype.size = function() {
    return (this.keyArray.length);
};

Map.prototype.clear = function() {
    for ( var i = 0; i < this.keyArray.length; i++) {
        this.keyArray.pop();
        this.valArray.pop();
    }
};

Map.prototype.getKeys = function() {
    return (this.keyArray);
};

Map.prototype.getValues = function() {
    return (this.valArray);
};

Map.prototype.toString = function() {
    var result = "";
    for ( var i = 0; i < this.keyArray.length; i++) {
        result += "Key: " + this.keyArray[i] + "\tValue: " + this.valArray[i]
                + "\n";
    }
    return result;
};

Map.prototype.hasKey = function(key) {
    return this.findKey(key)!==-1;
};

Map.prototype.findKey = function(key) {
    var result = (-1);
    for ( var i = 0; i < this.keyArray.length; i++) {
        if (typeof(this.compareFunction)!=="undefined") {
            if (this.compareFunction(this.keyArray[i], key)) {
                result = i;
                break;
            }
        }
        else {
            if (this.keyArray[i] == key) {
                result = i;
                break;
            }
        }
    }
    return result;
};
// Map.prototype.remove用到数组的删除操作
Array.prototype.removeAt = function(index) {
    var part1 = this.slice(0, index);
    var part2 = this.slice(index + 1);
    return (part1.concat(part2));
};

原文链接:https://blog.csdn.net/mrbaolong/article/details/111998220

  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 1
    评论
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值