353 lines
11 KiB
TypeScript
353 lines
11 KiB
TypeScript
/**
|
|
* @license
|
|
* Copyright Google Inc. All Rights Reserved.
|
|
*
|
|
* Use of this source code is governed by an MIT-style license that can be
|
|
* found in the LICENSE file at https://angular.io/license
|
|
*/
|
|
|
|
import {getSymbolIterator, global, isArray, isBlank, isJsObject, isPresent} from './lang';
|
|
|
|
export var Map = global.Map;
|
|
export var Set = global.Set;
|
|
|
|
// Safari and Internet Explorer do not support the iterable parameter to the
|
|
// Map constructor. We work around that by manually adding the items.
|
|
var createMapFromPairs: {(pairs: any[]): Map<any, any>} = (function() {
|
|
try {
|
|
if (new Map(<any>[[1, 2]]).size === 1) {
|
|
return function createMapFromPairs(pairs: any[]): Map<any, any> { return new Map(pairs); };
|
|
}
|
|
} catch (e) {
|
|
}
|
|
return function createMapAndPopulateFromPairs(pairs: any[]): Map<any, any> {
|
|
var map = new Map();
|
|
for (var i = 0; i < pairs.length; i++) {
|
|
var pair = pairs[i];
|
|
map.set(pair[0], pair[1]);
|
|
}
|
|
return map;
|
|
};
|
|
})();
|
|
var createMapFromMap: {(m: Map<any, any>): Map<any, any>} = (function() {
|
|
try {
|
|
if (new Map(<any>new Map())) {
|
|
return function createMapFromMap(m: Map<any, any>): Map<any, any> { return new Map(<any>m); };
|
|
}
|
|
} catch (e) {
|
|
}
|
|
return function createMapAndPopulateFromMap(m: Map<any, any>): Map<any, any> {
|
|
var map = new Map();
|
|
m.forEach((v, k) => { map.set(k, v); });
|
|
return map;
|
|
};
|
|
})();
|
|
var _clearValues: {(m: Map<any, any>): void} = (function() {
|
|
if ((<any>(new Map()).keys()).next) {
|
|
return function _clearValues(m: Map<any, any>) {
|
|
var keyIterator = m.keys();
|
|
var k: any /** TODO #???? */;
|
|
while (!((k = (<any>keyIterator).next()).done)) {
|
|
m.set(k.value, null);
|
|
}
|
|
};
|
|
} else {
|
|
return function _clearValuesWithForeEach(m: Map<any, any>) {
|
|
m.forEach((v, k) => { m.set(k, null); });
|
|
};
|
|
}
|
|
})();
|
|
// Safari doesn't implement MapIterator.next(), which is used is Traceur's polyfill of Array.from
|
|
// TODO(mlaval): remove the work around once we have a working polyfill of Array.from
|
|
var _arrayFromMap: {(m: Map<any, any>, getValues: boolean): any[]} = (function() {
|
|
try {
|
|
if ((<any>(new Map()).values()).next) {
|
|
return function createArrayFromMap(m: Map<any, any>, getValues: boolean): any[] {
|
|
return getValues ? (<any>Array).from(m.values()) : (<any>Array).from(m.keys());
|
|
};
|
|
}
|
|
} catch (e) {
|
|
}
|
|
return function createArrayFromMapWithForeach(m: Map<any, any>, getValues: boolean): any[] {
|
|
var res = ListWrapper.createFixedSize(m.size), i = 0;
|
|
m.forEach((v, k) => {
|
|
res[i] = getValues ? v : k;
|
|
i++;
|
|
});
|
|
return res;
|
|
};
|
|
})();
|
|
|
|
export class MapWrapper {
|
|
static clone<K, V>(m: Map<K, V>): Map<K, V> { return createMapFromMap(m); }
|
|
static createFromStringMap<T>(stringMap: {[key: string]: T}): Map<string, T> {
|
|
var result = new Map<string, T>();
|
|
for (var prop in stringMap) {
|
|
result.set(prop, stringMap[prop]);
|
|
}
|
|
return result;
|
|
}
|
|
static toStringMap<T>(m: Map<string, T>): {[key: string]: T} {
|
|
var r: {[key: string]: T} = {};
|
|
m.forEach((v, k) => r[k] = v);
|
|
return r;
|
|
}
|
|
static createFromPairs(pairs: any[]): Map<any, any> { return createMapFromPairs(pairs); }
|
|
static clearValues(m: Map<any, any>) { _clearValues(m); }
|
|
static iterable<T>(m: T): T { return m; }
|
|
static keys<K>(m: Map<K, any>): K[] { return _arrayFromMap(m, false); }
|
|
static values<V>(m: Map<any, V>): V[] { return _arrayFromMap(m, true); }
|
|
}
|
|
|
|
/**
|
|
* Wraps Javascript Objects
|
|
*/
|
|
export class StringMapWrapper {
|
|
static create(): {[k: /*any*/ string]: any} {
|
|
// Note: We are not using Object.create(null) here due to
|
|
// performance!
|
|
// http://jsperf.com/ng2-object-create-null
|
|
return {};
|
|
}
|
|
static contains(map: {[key: string]: any}, key: string): boolean {
|
|
return map.hasOwnProperty(key);
|
|
}
|
|
static get<V>(map: {[key: string]: V}, key: string): V {
|
|
return map.hasOwnProperty(key) ? map[key] : undefined;
|
|
}
|
|
static set<V>(map: {[key: string]: V}, key: string, value: V) { map[key] = value; }
|
|
|
|
static keys(map: {[key: string]: any}): string[] { return Object.keys(map); }
|
|
static values<T>(map: {[key: string]: T}): T[] {
|
|
return Object.keys(map).map((k: string): T => map[k]);
|
|
}
|
|
static isEmpty(map: {[key: string]: any}): boolean {
|
|
for (var prop in map) {
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
static delete (map: {[key: string]: any}, key: string) { delete map[key]; }
|
|
static forEach<K, V>(map: {[key: string]: V}, callback: (v: V, K: string) => void) {
|
|
for (let k of Object.keys(map)) {
|
|
callback(map[k], k);
|
|
}
|
|
}
|
|
|
|
static merge<V>(m1: {[key: string]: V}, m2: {[key: string]: V}): {[key: string]: V} {
|
|
var m: {[key: string]: V} = {};
|
|
|
|
for (let k of Object.keys(m1)) {
|
|
m[k] = m1[k];
|
|
}
|
|
|
|
for (let k of Object.keys(m2)) {
|
|
m[k] = m2[k];
|
|
}
|
|
|
|
return m;
|
|
}
|
|
|
|
static equals<V>(m1: {[key: string]: V}, m2: {[key: string]: V}): boolean {
|
|
var k1 = Object.keys(m1);
|
|
var k2 = Object.keys(m2);
|
|
if (k1.length != k2.length) {
|
|
return false;
|
|
}
|
|
var key: any /** TODO #???? */;
|
|
for (var i = 0; i < k1.length; i++) {
|
|
key = k1[i];
|
|
if (m1[key] !== m2[key]) {
|
|
return false;
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* A boolean-valued function over a value, possibly including context information
|
|
* regarding that value's position in an array.
|
|
*/
|
|
export interface Predicate<T> { (value: T, index?: number, array?: T[]): boolean; }
|
|
|
|
export class ListWrapper {
|
|
// JS has no way to express a statically fixed size list, but dart does so we
|
|
// keep both methods.
|
|
static createFixedSize(size: number): any[] { return new Array(size); }
|
|
static createGrowableSize(size: number): any[] { return new Array(size); }
|
|
static clone<T>(array: T[]): T[] { return array.slice(0); }
|
|
static forEachWithIndex<T>(array: T[], fn: (t: T, n: number) => void) {
|
|
for (var i = 0; i < array.length; i++) {
|
|
fn(array[i], i);
|
|
}
|
|
}
|
|
static first<T>(array: T[]): T {
|
|
if (!array) return null;
|
|
return array[0];
|
|
}
|
|
static last<T>(array: T[]): T {
|
|
if (!array || array.length == 0) return null;
|
|
return array[array.length - 1];
|
|
}
|
|
static indexOf<T>(array: T[], value: T, startIndex: number = 0): number {
|
|
return array.indexOf(value, startIndex);
|
|
}
|
|
static contains<T>(list: T[], el: T): boolean { return list.indexOf(el) !== -1; }
|
|
static reversed<T>(array: T[]): T[] {
|
|
var a = ListWrapper.clone(array);
|
|
return a.reverse();
|
|
}
|
|
static concat(a: any[], b: any[]): any[] { return a.concat(b); }
|
|
static insert<T>(list: T[], index: number, value: T) { list.splice(index, 0, value); }
|
|
static removeAt<T>(list: T[], index: number): T {
|
|
var res = list[index];
|
|
list.splice(index, 1);
|
|
return res;
|
|
}
|
|
static removeAll<T>(list: T[], items: T[]) {
|
|
for (var i = 0; i < items.length; ++i) {
|
|
var index = list.indexOf(items[i]);
|
|
list.splice(index, 1);
|
|
}
|
|
}
|
|
static remove<T>(list: T[], el: T): boolean {
|
|
var index = list.indexOf(el);
|
|
if (index > -1) {
|
|
list.splice(index, 1);
|
|
return true;
|
|
}
|
|
return false;
|
|
}
|
|
static clear(list: any[]) { list.length = 0; }
|
|
static isEmpty(list: any[]): boolean { return list.length == 0; }
|
|
static fill(list: any[], value: any, start: number = 0, end: number = null) {
|
|
list.fill(value, start, end === null ? list.length : end);
|
|
}
|
|
static equals(a: any[], b: any[]): boolean {
|
|
if (a.length != b.length) return false;
|
|
for (var i = 0; i < a.length; ++i) {
|
|
if (a[i] !== b[i]) return false;
|
|
}
|
|
return true;
|
|
}
|
|
static slice<T>(l: T[], from: number = 0, to: number = null): T[] {
|
|
return l.slice(from, to === null ? undefined : to);
|
|
}
|
|
static splice<T>(l: T[], from: number, length: number): T[] { return l.splice(from, length); }
|
|
static sort<T>(l: T[], compareFn?: (a: T, b: T) => number) {
|
|
if (isPresent(compareFn)) {
|
|
l.sort(compareFn);
|
|
} else {
|
|
l.sort();
|
|
}
|
|
}
|
|
static toString<T>(l: T[]): string { return l.toString(); }
|
|
static toJSON<T>(l: T[]): string { return JSON.stringify(l); }
|
|
|
|
static maximum<T>(list: T[], predicate: (t: T) => number): T {
|
|
if (list.length == 0) {
|
|
return null;
|
|
}
|
|
var solution: any /** TODO #???? */ = null;
|
|
var maxValue = -Infinity;
|
|
for (var index = 0; index < list.length; index++) {
|
|
var candidate = list[index];
|
|
if (isBlank(candidate)) {
|
|
continue;
|
|
}
|
|
var candidateValue = predicate(candidate);
|
|
if (candidateValue > maxValue) {
|
|
solution = candidate;
|
|
maxValue = candidateValue;
|
|
}
|
|
}
|
|
return solution;
|
|
}
|
|
|
|
static flatten<T>(list: Array<T|T[]>): T[] {
|
|
var target: any[] = [];
|
|
_flattenArray(list, target);
|
|
return target;
|
|
}
|
|
|
|
static addAll<T>(list: Array<T>, source: Array<T>): void {
|
|
for (var i = 0; i < source.length; i++) {
|
|
list.push(source[i]);
|
|
}
|
|
}
|
|
}
|
|
|
|
function _flattenArray(source: any[], target: any[]): any[] {
|
|
if (isPresent(source)) {
|
|
for (var i = 0; i < source.length; i++) {
|
|
var item = source[i];
|
|
if (isArray(item)) {
|
|
_flattenArray(item, target);
|
|
} else {
|
|
target.push(item);
|
|
}
|
|
}
|
|
}
|
|
return target;
|
|
}
|
|
|
|
|
|
export function isListLikeIterable(obj: any): boolean {
|
|
if (!isJsObject(obj)) return false;
|
|
return isArray(obj) ||
|
|
(!(obj instanceof Map) && // JS Map are iterables but return entries as [k, v]
|
|
getSymbolIterator() in obj); // JS Iterable have a Symbol.iterator prop
|
|
}
|
|
|
|
export function areIterablesEqual(a: any, b: any, comparator: Function): boolean {
|
|
var iterator1 = a[getSymbolIterator()]();
|
|
var iterator2 = b[getSymbolIterator()]();
|
|
|
|
while (true) {
|
|
let item1 = iterator1.next();
|
|
let item2 = iterator2.next();
|
|
if (item1.done && item2.done) return true;
|
|
if (item1.done || item2.done) return false;
|
|
if (!comparator(item1.value, item2.value)) return false;
|
|
}
|
|
}
|
|
|
|
export function iterateListLike(obj: any, fn: Function) {
|
|
if (isArray(obj)) {
|
|
for (var i = 0; i < obj.length; i++) {
|
|
fn(obj[i]);
|
|
}
|
|
} else {
|
|
var iterator = obj[getSymbolIterator()]();
|
|
var item: any /** TODO #???? */;
|
|
while (!((item = iterator.next()).done)) {
|
|
fn(item.value);
|
|
}
|
|
}
|
|
}
|
|
|
|
// Safari and Internet Explorer do not support the iterable parameter to the
|
|
// Set constructor. We work around that by manually adding the items.
|
|
var createSetFromList: {(lst: any[]): Set<any>} = (function() {
|
|
var test = new Set([1, 2, 3]);
|
|
if (test.size === 3) {
|
|
return function createSetFromList(lst: any[]): Set<any> { return new Set(lst); };
|
|
} else {
|
|
return function createSetAndPopulateFromList(lst: any[]): Set<any> {
|
|
var res = new Set(lst);
|
|
if (res.size !== lst.length) {
|
|
for (var i = 0; i < lst.length; i++) {
|
|
res.add(lst[i]);
|
|
}
|
|
}
|
|
return res;
|
|
};
|
|
}
|
|
})();
|
|
export class SetWrapper {
|
|
static createFromList<T>(lst: T[]): Set<T> { return createSetFromList(lst); }
|
|
static has<T>(s: Set<T>, key: T): boolean { return s.has(key); }
|
|
static delete<K>(m: Set<K>, k: K) { m.delete(k); }
|
|
}
|