hamok
Version:
Lightweight Distributed Object Storage on RAFT consensus algorithm
114 lines (113 loc) • 3.47 kB
JavaScript
;
var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
if (k2 === undefined) k2 = k;
var desc = Object.getOwnPropertyDescriptor(m, k);
if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
desc = { enumerable: true, get: function() { return m[k]; } };
}
Object.defineProperty(o, k2, desc);
}) : (function(o, m, k, k2) {
if (k2 === undefined) k2 = k;
o[k2] = m[k];
}));
var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
Object.defineProperty(o, "default", { enumerable: true, value: v });
}) : function(o, v) {
o["default"] = v;
});
var __importStar = (this && this.__importStar) || function (mod) {
if (mod && mod.__esModule) return mod;
var result = {};
if (mod != null) for (var k in mod) if (k !== "default" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);
__setModuleDefault(result, mod);
return result;
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.MemoryBaseMap = void 0;
const Collections = __importStar(require("../common/Collections"));
class MemoryBaseMap extends Map {
constructor(entries) {
super(entries);
}
getAll(keys) {
const result = new Map();
for (const key of keys) {
const value = this.get(key);
if (value) {
result.set(key, value);
}
}
return Collections.unmodifiableMap(result);
}
set(key, value, callback) {
const oldValue = this.get(key);
super.set(key, value);
callback?.(oldValue);
return this;
}
setAll(entries, callback) {
const inserted = [];
const updated = [];
for (const [key, value] of entries) {
this.set(key, value, (oldValue) => {
if (oldValue !== undefined)
updated.push([key, oldValue, value]);
else
inserted.push([key, value]);
});
}
callback?.({
inserted,
updated,
});
return this;
}
insert(key, value) {
const existingValue = this.get(key);
if (existingValue) {
return existingValue;
}
super.set(key, value);
}
insertAll(entries) {
const result = new Map();
for (const [key, value] of entries) {
const existingValue = this.get(key);
if (existingValue) {
result.set(key, existingValue);
continue;
}
super.set(key, value);
}
return result;
}
deleteAll(keys) {
const result = [];
for (const key of keys) {
if (!this.has(key))
continue;
result.push(key);
this.delete(key);
}
return result;
}
remove(key) {
const value = this.get(key);
if (!value)
return;
super.delete(key);
return value;
}
removeAll(keys) {
const result = [];
for (const key of keys) {
const value = this.get(key);
if (!value)
continue;
super.delete(key);
result.push([key, value]);
}
return new Map(result);
}
}
exports.MemoryBaseMap = MemoryBaseMap;