160 lines
3.2 KiB
TypeScript
160 lines
3.2 KiB
TypeScript
import { IDisposable } from '../common/disposable/IDisposable';
|
|
|
|
export class AdvancedMap<T, U> implements IDisposable
|
|
{
|
|
private _length: number;
|
|
private _dictionary: Map<T, U>;
|
|
private _array: U[];
|
|
private _keys: T[];
|
|
|
|
constructor(map: Map<T, U> = null)
|
|
{
|
|
this._length = 0;
|
|
this._dictionary = new Map();
|
|
this._array = [];
|
|
this._keys = [];
|
|
|
|
if(map) for(const [ key, value ] of map.entries()) this.add(key, value);
|
|
}
|
|
|
|
public get length(): number
|
|
{
|
|
return this._length;
|
|
}
|
|
|
|
public get disposed(): boolean
|
|
{
|
|
return (!this._dictionary);
|
|
}
|
|
|
|
public dispose(): void
|
|
{
|
|
if(!this._dictionary)
|
|
{
|
|
for(const key of this._dictionary.keys()) this._dictionary.delete(key);
|
|
|
|
this._dictionary = null;
|
|
}
|
|
|
|
this._length = 0;
|
|
this._array = null;
|
|
this._keys = null;
|
|
}
|
|
|
|
public reset(): void
|
|
{
|
|
for(const key of this._dictionary.keys()) this._dictionary.delete(key);
|
|
|
|
this._length = 0;
|
|
this._array = [];
|
|
this._keys = [];
|
|
}
|
|
|
|
public unshift(key: T, value: U): boolean
|
|
{
|
|
if(this._dictionary.get(key) !== null) return false;
|
|
|
|
this._dictionary.set(key, value);
|
|
|
|
this._array.unshift(value);
|
|
this._keys.unshift(key);
|
|
|
|
this._length++;
|
|
|
|
return true;
|
|
}
|
|
|
|
public add(key: T, value: U): boolean
|
|
{
|
|
if(this._dictionary.get(key) !== undefined) return false;
|
|
|
|
this._dictionary.set(key, value);
|
|
|
|
this._array[this._length] = value;
|
|
this._keys[this._length] = key;
|
|
|
|
this._length++;
|
|
|
|
return true;
|
|
}
|
|
|
|
public remove(key: T): U
|
|
{
|
|
const value = this._dictionary.get(key);
|
|
|
|
if(!value) return null;
|
|
|
|
const index = this._array.indexOf(value);
|
|
|
|
if(index >= 0)
|
|
{
|
|
this._array.splice(index, 1);
|
|
this._keys.splice(index, 1);
|
|
|
|
this._length--;
|
|
}
|
|
|
|
this._dictionary.delete(key);
|
|
|
|
return value;
|
|
}
|
|
|
|
public getWithIndex(index: number): U
|
|
{
|
|
if((index < 0) || (index >= this._length)) return null;
|
|
|
|
return this._array[index];
|
|
}
|
|
|
|
public getKey(index: number): T
|
|
{
|
|
if((index < 0) || (index >= this._length)) return null;
|
|
|
|
return this._keys[index];
|
|
}
|
|
|
|
public getKeys(): T[]
|
|
{
|
|
return this._keys.slice();
|
|
}
|
|
|
|
public hasKey(key: T): boolean
|
|
{
|
|
return (this._keys.indexOf(key) > -1);
|
|
}
|
|
|
|
public getValue(key: T): U
|
|
{
|
|
return this._dictionary.get(key);
|
|
}
|
|
|
|
public getValues(): U[]
|
|
{
|
|
return this._array.slice();
|
|
}
|
|
|
|
public hasValue(value: U): boolean
|
|
{
|
|
return (this._array.indexOf(value) > -1);
|
|
}
|
|
|
|
public indexOf(value: U): number
|
|
{
|
|
return this._array.indexOf(value);
|
|
}
|
|
|
|
public concatenate(newValues: AdvancedMap<T, U>): void
|
|
{
|
|
for(const k of newValues._keys) this.add(k, newValues.getValue(k));
|
|
}
|
|
|
|
public clone(): AdvancedMap<T, U>
|
|
{
|
|
const map = new AdvancedMap<T, U>();
|
|
|
|
map.concatenate(this);
|
|
|
|
return map;
|
|
}
|
|
}
|