@hpcc-js/util 2.46.1 → 2.47.1

package/types/dispatch.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"dispatch.d.ts","sourceRoot":"","sources":["../src/dispatch.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAG7C,oBAAY,oBAAoB,GAAG,CAAC,QAAQ,EAAE,oBAAoB,KAAK,MAAM,GAAG,SAAS,CAAC;AAC1F,oBAAY,oBAAoB,GAAG,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,GAAG,SAAS,CAAC;AAwBxE,qBAAa,OAAO;IAEhB,IAAI,WAAW,IAAI,OAAO,CAAkB;IAC5C,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAIjC,IAAI,IAAI,OAAO;CAGlB;AACD,aAAK,kBAAkB,CAAC,CAAC,SAAS,OAAO,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AAEvE,oBAAY,QAAQ,CAAC,CAAC,SAAS,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC;AAClE,OAAO,EAAE,eAAe,EAAE,CAAC;AAQ3B,qBAAa,QAAQ,CAAC,CAAC,SAAS,OAAO,GAAG,OAAO;IAE7C,OAAO,CAAC,WAAW,CAAa;IAChC,OAAO,CAAC,UAAU,CAAyB;IAC3C,OAAO,CAAC,cAAc,CAAW;;IAKjC,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,QAAQ;IAUhB,OAAO,CAAC,WAAW;IAKnB,OAAO,CAAC,QAAQ;IAUhB,WAAW,IAAI,OAAO;IAItB,KAAK;IAIL,IAAI,CAAC,GAAG,EAAE,CAAC;IAIX,IAAI,CAAC,GAAG,EAAE,CAAC;IAKX,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAAG,eAAe;CAa/E"}
+{"version":3,"file":"dispatch.d.ts","sourceRoot":"","sources":["../src/dispatch.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAGlD,oBAAY,oBAAoB,GAAG,CAAC,QAAQ,EAAE,oBAAoB,KAAK,MAAM,GAAG,SAAS,CAAC;AAC1F,oBAAY,oBAAoB,GAAG,CAAC,MAAM,EAAE,MAAM,KAAK,IAAI,GAAG,SAAS,CAAC;AAwBxE,qBAAa,OAAO;IAEhB,IAAI,WAAW,IAAI,OAAO,CAAkB;IAC5C,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAIjC,IAAI,IAAI,OAAO;CAGlB;AACD,aAAK,kBAAkB,CAAC,CAAC,SAAS,OAAO,IAAI,KAAK,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;AAEvE,oBAAY,QAAQ,CAAC,CAAC,SAAS,OAAO,IAAI,CAAC,QAAQ,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC;AAClE,OAAO,EAAE,eAAe,EAAE,CAAC;AAQ3B,qBAAa,QAAQ,CAAC,CAAC,SAAS,OAAO,GAAG,OAAO;IAE7C,OAAO,CAAC,WAAW,CAAa;IAChC,OAAO,CAAC,UAAU,CAAyB;IAC3C,OAAO,CAAC,cAAc,CAAW;;IAKjC,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,QAAQ;IAUhB,OAAO,CAAC,WAAW;IAKnB,OAAO,CAAC,QAAQ;IAUhB,WAAW,IAAI,OAAO;IAItB,KAAK;IAIL,IAAI,CAAC,GAAG,EAAE,CAAC;IAIX,IAAI,CAAC,GAAG,EAAE,CAAC;IAKX,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,kBAAkB,CAAC,CAAC,CAAC,GAAG,eAAe;CAa/E"}

package/types/esp.d.ts

@@ -1,2 +1,2 @@
-export declare function espTime2Seconds(duration: string): number;
+export declare function espTime2Seconds(duration: string): number;
 //# sourceMappingURL=esp.d.ts.map

package/types/graph.d.ts

@@ -1,74 +1,74 @@
-export declare class GraphItem<S, V, E> {
-    protected _graph: Graph<S, V, E>;
-    readonly parent: Subgraph<S, V, E> | null;
-    readonly props: {
-        [key: string]: any;
-    };
-    constructor(graph: Graph<S, V, E>, parent: Subgraph<S, V, E> | null);
-}
-export declare class Subgraph<S, V, E> extends GraphItem<S, V, E> {
-    readonly subgraphs: Array<Subgraph<S, V, E>>;
-    readonly vertices: Array<Vertex<S, V, E>>;
-    readonly edges: Array<Edge<S, V, E>>;
-    readonly _?: S;
-    constructor(graph: Graph<S, V, E>, parent: Subgraph<S, V, E> | null, _?: S);
-    remove(full?: boolean): void;
-    createSubgraph(_?: S): Subgraph<S, V, E>;
-    _addSubgraph(subgraph: Subgraph<S, V, E>): void;
-    _removeSubgraph(subgraph: Subgraph<S, V, E>): void;
-    removeAllSubgraphs(): void;
-    createVertex(_?: V): Vertex<S, V, E>;
-    _addVertex(vertex: Vertex<S, V, E>): void;
-    _removeVertex(vertex: Vertex<S, V, E>): void;
-    removeAllVertices(): void;
-    createEdge(source: Vertex<S, V, E>, target: Vertex<S, V, E>, _?: E): Edge<S, V, E>;
-    _addEdge(edge: Edge<S, V, E>): void;
-    _removeEdge(edge: Edge<S, V, E>): void;
-    _add(item: Subgraph<S, V, E> | Vertex<S, V, E> | Edge<S, V, E>): void;
-}
-export declare class Vertex<S, V, E> extends GraphItem<S, V, E> {
-    readonly inEdges: Array<Edge<S, V, E>>;
-    readonly outEdges: Array<Edge<S, V, E>>;
-    get edges(): ReadonlyArray<Edge<S, V, E>>;
-    readonly _?: V;
-    constructor(graph: Graph<S, V, E>, parent: Subgraph<S, V, E>, _?: V);
-    remove(full?: boolean, _?: (source: V, target: V) => E): void;
-    addInEdge(edge: Edge<S, V, E>): void;
-    removeInEdge(edge: Edge<S, V, E>): void;
-    addOutEdge(edge: Edge<S, V, E>): void;
-    removeOutEdge(edge: Edge<S, V, E>): void;
-}
-export declare class Edge<S, V, E> extends GraphItem<S, V, E> {
-    readonly source: Vertex<S, V, E>;
-    readonly target: Vertex<S, V, E>;
-    readonly _?: E;
-    constructor(graph: Graph<S, V, E>, parent: Subgraph<S, V, E>, source: Vertex<S, V, E>, target: Vertex<S, V, E>, _?: E);
-    remove(): void;
-}
-export declare class Graph<S = undefined, V = undefined, E = undefined> {
-    readonly root: Subgraph<S, V, E>;
-    private _allSubgraphs;
-    private _allSubgraphsMap;
-    private _allVertices;
-    private _allVerticesMap;
-    private _allEdges;
-    private _allEdgesMap;
-    idOf: (item: Subgraph<S, V, E> | Vertex<S, V, E> | Edge<S, V, E>) => string;
-    constructor(idOf?: (item: Subgraph<S, V, E> | Vertex<S, V, E> | Edge<S, V, E>) => string, _?: S);
-    createSubgraph(parent?: Subgraph<S, V, E>, _?: S): Subgraph<S, V, E>;
-    removeSubgraph(subgraph: Subgraph<S, V, E>, full?: boolean): void;
-    get subgraphs(): ReadonlyArray<Subgraph<S, V, E>>;
-    subgraph(id: string): Subgraph<S, V, E>;
-    createVertex(parent: Subgraph<S, V, E>, _?: V): Vertex<S, V, E>;
-    removeVertex(vertex: Vertex<S, V, E>, full?: boolean, _?: (source: V, target: V) => E): void;
-    get vertices(): ReadonlyArray<Vertex<S, V, E>>;
-    vertex(id: string): Vertex<S, V, E>;
-    createEdge(parent: Subgraph<S, V, E>, source: Vertex<S, V, E>, target: Vertex<S, V, E>, _?: E): Edge<S, V, E>;
-    removeEdge(edge: Edge<S, V, E>): void;
-    get edges(): ReadonlyArray<Edge<S, V, E>>;
-    edge(id: string): Edge<S, V, E>;
-    private _walk;
-    walk(visitor: (visitor: GraphItem<S, V, E>) => "abort" | "stepover" | void): true | undefined;
-    clone(): Graph<S, V, E>;
-}
+export declare class GraphItem<S, V, E> {
+    protected _graph: Graph<S, V, E>;
+    readonly parent: Subgraph<S, V, E> | null;
+    readonly props: {
+        [key: string]: any;
+    };
+    constructor(graph: Graph<S, V, E>, parent: Subgraph<S, V, E> | null);
+}
+export declare class Subgraph<S, V, E> extends GraphItem<S, V, E> {
+    readonly subgraphs: Array<Subgraph<S, V, E>>;
+    readonly vertices: Array<Vertex<S, V, E>>;
+    readonly edges: Array<Edge<S, V, E>>;
+    readonly _?: S;
+    constructor(graph: Graph<S, V, E>, parent: Subgraph<S, V, E> | null, _?: S);
+    remove(full?: boolean): void;
+    createSubgraph(_?: S): Subgraph<S, V, E>;
+    _addSubgraph(subgraph: Subgraph<S, V, E>): void;
+    _removeSubgraph(subgraph: Subgraph<S, V, E>): void;
+    removeAllSubgraphs(): void;
+    createVertex(_?: V): Vertex<S, V, E>;
+    _addVertex(vertex: Vertex<S, V, E>): void;
+    _removeVertex(vertex: Vertex<S, V, E>): void;
+    removeAllVertices(): void;
+    createEdge(source: Vertex<S, V, E>, target: Vertex<S, V, E>, _?: E): Edge<S, V, E>;
+    _addEdge(edge: Edge<S, V, E>): void;
+    _removeEdge(edge: Edge<S, V, E>): void;
+    _add(item: Subgraph<S, V, E> | Vertex<S, V, E> | Edge<S, V, E>): void;
+}
+export declare class Vertex<S, V, E> extends GraphItem<S, V, E> {
+    readonly inEdges: Array<Edge<S, V, E>>;
+    readonly outEdges: Array<Edge<S, V, E>>;
+    get edges(): ReadonlyArray<Edge<S, V, E>>;
+    readonly _?: V;
+    constructor(graph: Graph<S, V, E>, parent: Subgraph<S, V, E>, _?: V);
+    remove(full?: boolean, _?: (source: V, target: V) => E): void;
+    addInEdge(edge: Edge<S, V, E>): void;
+    removeInEdge(edge: Edge<S, V, E>): void;
+    addOutEdge(edge: Edge<S, V, E>): void;
+    removeOutEdge(edge: Edge<S, V, E>): void;
+}
+export declare class Edge<S, V, E> extends GraphItem<S, V, E> {
+    readonly source: Vertex<S, V, E>;
+    readonly target: Vertex<S, V, E>;
+    readonly _?: E;
+    constructor(graph: Graph<S, V, E>, parent: Subgraph<S, V, E>, source: Vertex<S, V, E>, target: Vertex<S, V, E>, _?: E);
+    remove(): void;
+}
+export declare class Graph<S = undefined, V = undefined, E = undefined> {
+    readonly root: Subgraph<S, V, E>;
+    private _allSubgraphs;
+    private _allSubgraphsMap;
+    private _allVertices;
+    private _allVerticesMap;
+    private _allEdges;
+    private _allEdgesMap;
+    idOf: (item: Subgraph<S, V, E> | Vertex<S, V, E> | Edge<S, V, E>) => string;
+    constructor(idOf?: (item: Subgraph<S, V, E> | Vertex<S, V, E> | Edge<S, V, E>) => string, _?: S);
+    createSubgraph(parent?: Subgraph<S, V, E>, _?: S): Subgraph<S, V, E>;
+    removeSubgraph(subgraph: Subgraph<S, V, E>, full?: boolean): void;
+    get subgraphs(): ReadonlyArray<Subgraph<S, V, E>>;
+    subgraph(id: string): Subgraph<S, V, E>;
+    createVertex(parent: Subgraph<S, V, E>, _?: V): Vertex<S, V, E>;
+    removeVertex(vertex: Vertex<S, V, E>, full?: boolean, _?: (source: V, target: V) => E): void;
+    get vertices(): ReadonlyArray<Vertex<S, V, E>>;
+    vertex(id: string): Vertex<S, V, E>;
+    createEdge(parent: Subgraph<S, V, E>, source: Vertex<S, V, E>, target: Vertex<S, V, E>, _?: E): Edge<S, V, E>;
+    removeEdge(edge: Edge<S, V, E>): void;
+    get edges(): ReadonlyArray<Edge<S, V, E>>;
+    edge(id: string): Edge<S, V, E>;
+    private _walk;
+    walk(visitor: (visitor: GraphItem<S, V, E>) => "abort" | "stepover" | void): true | undefined;
+    clone(): Graph<S, V, E>;
+}
 //# sourceMappingURL=graph.d.ts.map

package/types/graph2.d.ts

@@ -1,112 +1,112 @@
-declare type ID = string | number;
-declare class GraphItem<T = any> {
-    protected _graph: Graph2;
-    _: T;
-    id(): ID;
-    constructor(g: Graph2, _: T);
-}
-declare class ChildGraphItem<S = any> extends GraphItem<S> {
-    private _parent;
-    constructor(g: Graph2, _: S);
-    clearParent(): this;
-    parent(): Subgraph | undefined;
-    parent(_: Subgraph | undefined): this;
-}
-declare class Subgraph<S = any> extends ChildGraphItem<S> {
-    private _children;
-    constructor(g: Graph2, _: S);
-    children(): ChildGraphItem[];
-    addChild(_: ChildGraphItem): void;
-    removeChild(_: ChildGraphItem): void;
-}
-declare class Vertex<V = any> extends ChildGraphItem<V> {
-    private _inEdges;
-    private _outEdges;
-    constructor(g: Graph2, _: V);
-    edges(): Edge<any>[];
-    edgeCount(): number;
-    inEdges(): Edge<any>[];
-    addInEdge(e: Edge): void;
-    removeInEdge(id: ID): void;
-    outEdges(): Edge<any>[];
-    addOutEdge(e: Edge): void;
-    removeOutEdge(id: ID): void;
-}
-declare class Edge<E = any> extends ChildGraphItem<E> {
-    _source: Vertex;
-    _target: Vertex;
-    constructor(g: Graph2, _: E, source: Vertex, target: Vertex);
-}
-export declare type HierarchyFormatter<V, S> = (type: "subgraph" | "vertex", item: V | S, children?: object[]) => object;
-export declare class Graph2<V = any, E = any, S = any> {
-    private _directed;
-    private _subgraphMap;
-    private _vertexMap;
-    private _edgeMap;
-    constructor(directed?: boolean);
-    clear(): this;
-    clearParents(): this;
-    isDirected(): boolean;
-    _idFunc: (_: any) => string;
-    idFunc(_: (_: S | V | E) => string): this;
-    _sourceFunc: (_: any) => ID;
-    sourceFunc(_: (_: E) => ID): this;
-    _targetFunc: (_: any) => ID;
-    targetFunc(_: (_: E) => ID): this;
-    _updateFunc: (before: S | V | E, after: S | V | E) => S | V | E;
-    updateFunc(_: (before: S | V | E, after: S | V | E) => S | V | E): this;
-    id(_: S | V | E): string;
-    type(id: ID): "S" | "V" | "E" | "";
-    isSubgraph(_: S | V | E): _ is S;
-    isVertex(_: S | V | E): _ is V;
-    isEdge(_: S | V | E): _ is E;
-    allItems(): Array<S | V | E>;
-    item(id: ID): S | V | E | undefined;
-    itemExists(id: ID): boolean;
-    allSubgraphs(): S[];
-    subgraphs(): S[];
-    subgraphExists(id: ID): boolean;
-    subgraph(id: ID): S;
-    subgraphSubgraphs(id: ID): S[];
-    subgraphVertices(id: ID): V[];
-    subgraphEdges(id: ID): E[];
-    addSubgraph(s: S, parent?: S): this;
-    mergeSubgraphs(_subgraphs?: S[]): this;
-    updateSubgraph(sg: S): this;
-    removeSubgraph(id: ID, promoteChildren?: boolean): this;
-    subgraphParent(id: ID): S | undefined;
-    subgraphParent(id: ID, parentID: ID): this;
-    allVertices(): V[];
-    vertices(): V[];
-    vertexExists(id: ID): boolean;
-    vertex(id: ID): V;
-    allEdges(): E[];
-    edges(): E[];
-    vertexEdges(vertexID: string): E[];
-    inEdges(vertexID: string): E[];
-    outEdges(vertexID: string): E[];
-    private _neighbors;
-    neighbors(id: ID): V[];
-    singleNeighbors(id: ID): V[];
-    addVertex(v: V, parent?: S): this;
-    mergeVertices(_vertices: V[]): this;
-    updateVertex(v: V): this;
-    removeVertex(id: ID): this;
-    vertexParent(id: ID): S | undefined;
-    vertexParent(id: ID, parentID: ID): this;
-    edgeExists(id: ID): boolean;
-    edge(id: ID): E;
-    addEdge(e: E, parent?: S): this;
-    mergeEdges(_edges: E[]): this;
-    updateEdge(e: E): this;
-    removeEdge(id: ID): this;
-    protected _hwalk(item: Subgraph<S> | Vertex<V>, formatter: HierarchyFormatter<V, S>): object;
-    hierarchy(formatter: HierarchyFormatter<V, S>): object[];
-    dijkstra(source: string, target: string): {
-        ids: string[];
-        len: number;
-    };
-    sort(v_id?: string): V[];
-}
-export {};
+declare type ID = string | number;
+declare class GraphItem<T = any> {
+    protected _graph: Graph2;
+    _: T;
+    id(): ID;
+    constructor(g: Graph2, _: T);
+}
+declare class ChildGraphItem<S = any> extends GraphItem<S> {
+    private _parent;
+    constructor(g: Graph2, _: S);
+    clearParent(): this;
+    parent(): Subgraph | undefined;
+    parent(_: Subgraph | undefined): this;
+}
+declare class Subgraph<S = any> extends ChildGraphItem<S> {
+    private _children;
+    constructor(g: Graph2, _: S);
+    children(): ChildGraphItem[];
+    addChild(_: ChildGraphItem): void;
+    removeChild(_: ChildGraphItem): void;
+}
+declare class Vertex<V = any> extends ChildGraphItem<V> {
+    private _inEdges;
+    private _outEdges;
+    constructor(g: Graph2, _: V);
+    edges(): Edge<any>[];
+    edgeCount(): number;
+    inEdges(): Edge<any>[];
+    addInEdge(e: Edge): void;
+    removeInEdge(id: ID): void;
+    outEdges(): Edge<any>[];
+    addOutEdge(e: Edge): void;
+    removeOutEdge(id: ID): void;
+}
+declare class Edge<E = any> extends ChildGraphItem<E> {
+    _source: Vertex;
+    _target: Vertex;
+    constructor(g: Graph2, _: E, source: Vertex, target: Vertex);
+}
+export declare type HierarchyFormatter<V, S> = (type: "subgraph" | "vertex", item: V | S, children?: object[]) => object;
+export declare class Graph2<V = any, E = any, S = any> {
+    private _directed;
+    private _subgraphMap;
+    private _vertexMap;
+    private _edgeMap;
+    constructor(directed?: boolean);
+    clear(): this;
+    clearParents(): this;
+    isDirected(): boolean;
+    _idFunc: (_: any) => string;
+    idFunc(_: (_: S | V | E) => string): this;
+    _sourceFunc: (_: any) => ID;
+    sourceFunc(_: (_: E) => ID): this;
+    _targetFunc: (_: any) => ID;
+    targetFunc(_: (_: E) => ID): this;
+    _updateFunc: (before: S | V | E, after: S | V | E) => S | V | E;
+    updateFunc(_: (before: S | V | E, after: S | V | E) => S | V | E): this;
+    id(_: S | V | E): string;
+    type(id: ID): "S" | "V" | "E" | "";
+    isSubgraph(_: S | V | E): _ is S;
+    isVertex(_: S | V | E): _ is V;
+    isEdge(_: S | V | E): _ is E;
+    allItems(): Array<S | V | E>;
+    item(id: ID): S | V | E | undefined;
+    itemExists(id: ID): boolean;
+    allSubgraphs(): S[];
+    subgraphs(): S[];
+    subgraphExists(id: ID): boolean;
+    subgraph(id: ID): S;
+    subgraphSubgraphs(id: ID): S[];
+    subgraphVertices(id: ID): V[];
+    subgraphEdges(id: ID): E[];
+    addSubgraph(s: S, parent?: S): this;
+    mergeSubgraphs(_subgraphs?: S[]): this;
+    updateSubgraph(sg: S): this;
+    removeSubgraph(id: ID, promoteChildren?: boolean): this;
+    subgraphParent(id: ID): S | undefined;
+    subgraphParent(id: ID, parentID: ID): this;
+    allVertices(): V[];
+    vertices(): V[];
+    vertexExists(id: ID): boolean;
+    vertex(id: ID): V;
+    allEdges(): E[];
+    edges(): E[];
+    vertexEdges(vertexID: string): E[];
+    inEdges(vertexID: string): E[];
+    outEdges(vertexID: string): E[];
+    private _neighbors;
+    neighbors(id: ID): V[];
+    singleNeighbors(id: ID): V[];
+    addVertex(v: V, parent?: S): this;
+    mergeVertices(_vertices: V[]): this;
+    updateVertex(v: V): this;
+    removeVertex(id: ID): this;
+    vertexParent(id: ID): S | undefined;
+    vertexParent(id: ID, parentID: ID): this;
+    edgeExists(id: ID): boolean;
+    edge(id: ID): E;
+    addEdge(e: E, parent?: S): this;
+    mergeEdges(_edges: E[]): this;
+    updateEdge(e: E): this;
+    removeEdge(id: ID): this;
+    protected _hwalk(item: Subgraph<S> | Vertex<V>, formatter: HierarchyFormatter<V, S>): object;
+    hierarchy(formatter: HierarchyFormatter<V, S>): object[];
+    dijkstra(source: string, target: string): {
+        ids: string[];
+        len: number;
+    };
+    sort(v_id?: string): V[];
+}
+export {};
 //# sourceMappingURL=graph2.d.ts.map

package/types/hashSum.d.ts

@@ -1,2 +1,2 @@
-export declare function hashSum(o: any): string;
+export declare function hashSum(o: any): string;
 //# sourceMappingURL=hashSum.d.ts.map

package/types/immutable.d.ts

@@ -1,3 +1,4 @@
-export declare function deepEquals(a: any, b: any): boolean;
-export declare function update<T>(origItem: T, newItem: T): T;
+export declare function verboseDeepEquals(a: any, b: any): boolean;
+export declare function deepEquals(a: any, b: any): boolean;
+export declare function update<T>(origItem: T, newItem: T): T;
 //# sourceMappingURL=immutable.d.ts.map

package/types/immutable.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"immutable.d.ts","sourceRoot":"","sources":["../src/immutable.ts"],"names":[],"mappings":"AAIA,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,WAgDxC;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAEpD"}
+{"version":3,"file":"immutable.d.ts","sourceRoot":"","sources":["../src/immutable.ts"],"names":[],"mappings":"AAIA,wBAAgB,iBAAiB,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,WA6F/C;AAED,wBAAgB,UAAU,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,WAoDxC;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,GAAG,CAAC,CAEpD"}

package/types/index.d.ts

@@ -1,22 +1,22 @@
-export * from "./__package__";
-export * from "./array";
-export * from "./cache";
-export * from "./debounce";
-export * from "./dictionary";
-export * from "./esp";
-export * from "./graph";
-export * from "./graph2";
-export * from "./hashSum";
-export * from "./immutable";
-export * from "./logging";
-export * from "./math";
-export * from "./object";
-export * from "./observer";
-export * from "./dispatch";
-export * from "./platform";
-export * from "./saxParser";
-export * from "./stack";
-export * from "./stateful";
-export * from "./string";
-export * from "./url";
+export * from "./__package__";
+export * from "./array";
+export * from "./cache";
+export * from "./debounce";
+export * from "./dictionary";
+export * from "./esp";
+export * from "./graph";
+export * from "./graph2";
+export * from "./hashSum";
+export * from "./immutable";
+export * from "./logging";
+export * from "./math";
+export * from "./object";
+export * from "./observer";
+export * from "./dispatch";
+export * from "./platform";
+export * from "./saxParser";
+export * from "./stack";
+export * from "./stateful";
+export * from "./string";
+export * from "./url";
 //# sourceMappingURL=index.d.ts.map

package/types/logging.d.ts

@@ -1,58 +1,58 @@
-export declare enum Level {
-    debug = 0,
-    info = 1,
-    notice = 2,
-    warning = 3,
-    error = 4,
-    critical = 5,
-    alert = 6,
-    emergency = 7
-}
-export interface Writer {
-    write?(dateTime: string, level: Level, id: string, msg: string): void;
-    rawWrite?(dateTime: string, level: Level, id: string, msg: string | object): void;
-}
-export declare class Logging {
-    private static _instance;
-    private _levelStack;
-    private _level;
-    private _filter;
-    private _writer;
-    static Instance(): Logging;
-    private constructor();
-    private stringify;
-    writer(): Writer;
-    writer(_: Writer): Logging;
-    log(level: Level, id: string, msg: string | object): void;
-    debug(id: string, msg: string | object): void;
-    info(id: string, msg: string | object): void;
-    notice(id: string, msg: string | object): void;
-    warning(id: string, msg: string | object): void;
-    error(id: string, msg: string | object): void;
-    critical(id: string, msg: string | object): void;
-    alert(id: string, msg: string | object): void;
-    emergency(id: string, msg: string | object): void;
-    level(): Level;
-    level(_: Level): this;
-    pushLevel(_: Level): this;
-    popLevel(): this;
-    filter(): string;
-    filter(_: string): this;
-}
-export declare const logger: Logging;
-export declare class ScopedLogging {
-    protected _scopeID: string;
-    constructor(scopeID: string);
-    debug(msg: string | object): void;
-    info(msg: string | object): void;
-    notice(msg: string | object): void;
-    warning(msg: string | object): void;
-    error(msg: string | object): void;
-    critical(msg: string | object): void;
-    alert(msg: string | object): void;
-    emergency(msg: string | object): void;
-    pushLevel(_: Level): this;
-    popLevel(): this;
-}
-export declare function scopedLogger(scopeID: string, filter?: boolean): ScopedLogging;
+export declare enum Level {
+    debug = 0,
+    info = 1,
+    notice = 2,
+    warning = 3,
+    error = 4,
+    critical = 5,
+    alert = 6,
+    emergency = 7
+}
+export interface Writer {
+    write?(dateTime: string, level: Level, id: string, msg: string): void;
+    rawWrite?(dateTime: string, level: Level, id: string, msg: string | object): void;
+}
+export declare class Logging {
+    private static _instance;
+    private _levelStack;
+    private _level;
+    private _filter;
+    private _writer;
+    static Instance(): Logging;
+    private constructor();
+    private stringify;
+    writer(): Writer;
+    writer(_: Writer): Logging;
+    log(level: Level, id: string, msg: string | object): void;
+    debug(id: string, msg: string | object): void;
+    info(id: string, msg: string | object): void;
+    notice(id: string, msg: string | object): void;
+    warning(id: string, msg: string | object): void;
+    error(id: string, msg: string | object): void;
+    critical(id: string, msg: string | object): void;
+    alert(id: string, msg: string | object): void;
+    emergency(id: string, msg: string | object): void;
+    level(): Level;
+    level(_: Level): this;
+    pushLevel(_: Level): this;
+    popLevel(): this;
+    filter(): string;
+    filter(_: string): this;
+}
+export declare const logger: Logging;
+export declare class ScopedLogging {
+    protected _scopeID: string;
+    constructor(scopeID: string);
+    debug(msg: string | object): void;
+    info(msg: string | object): void;
+    notice(msg: string | object): void;
+    warning(msg: string | object): void;
+    error(msg: string | object): void;
+    critical(msg: string | object): void;
+    alert(msg: string | object): void;
+    emergency(msg: string | object): void;
+    pushLevel(_: Level): this;
+    popLevel(): this;
+}
+export declare function scopedLogger(scopeID: string, filter?: boolean): ScopedLogging;
 //# sourceMappingURL=logging.d.ts.map

package/types/logging.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"logging.d.ts","sourceRoot":"","sources":["../src/logging.ts"],"names":[],"mappings":"AAGA,oBAAY,KAAK;IACb,KAAK,IAAA;IACL,IAAI,IAAA;IACJ,MAAM,IAAA;IACN,OAAO,IAAA;IACP,KAAK,IAAA;IACL,QAAQ,IAAA;IACR,KAAK,IAAA;IACL,SAAS,IAAA;CACZ;AAaD,MAAM,WAAW,MAAM;IACnB,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IACtE,QAAQ,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CACrF;AAYD,qBAAa,OAAO;IAChB,OAAO,CAAC,MAAM,CAAC,SAAS,CAAU;IAClC,OAAO,CAAC,WAAW,CAAsB;IACzC,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,OAAO,CAAc;IAC7B,OAAO,CAAC,OAAO,CAA+B;WAEhC,QAAQ;IAItB,OAAO;IAGP,OAAO,CAAC,SAAS;IAajB,MAAM,IAAI,MAAM;IAChB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAO1B,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAmBlD,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAItC,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAIrC,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAIvC,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAIxC,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAItC,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAIzC,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAItC,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAI1C,KAAK,IAAI,KAAK;IACd,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;IAOrB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;IAMzB,QAAQ,IAAI,IAAI;IAKhB,MAAM,IAAI,MAAM;IAChB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;CAM1B;AACD,eAAO,MAAM,MAAM,SAAqB,CAAC;AAEzC,qBAAa,aAAa;IACtB,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC;gBAEf,OAAO,EAAE,MAAM;IAI3B,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI1B,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAIzB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI3B,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI5B,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI1B,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI7B,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI1B,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI9B,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;IAKzB,QAAQ,IAAI,IAAI;CAInB;AAED,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,GAAE,OAAe,iBAKpE"}
+{"version":3,"file":"logging.d.ts","sourceRoot":"","sources":["../src/logging.ts"],"names":[],"mappings":"AAIA,oBAAY,KAAK;IACb,KAAK,IAAA;IACL,IAAI,IAAA;IACJ,MAAM,IAAA;IACN,OAAO,IAAA;IACP,KAAK,IAAA;IACL,QAAQ,IAAA;IACR,KAAK,IAAA;IACL,SAAS,IAAA;CACZ;AAaD,MAAM,WAAW,MAAM;IACnB,KAAK,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IACtE,QAAQ,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;CACrF;AAYD,qBAAa,OAAO;IAChB,OAAO,CAAC,MAAM,CAAC,SAAS,CAAU;IAClC,OAAO,CAAC,WAAW,CAAsB;IACzC,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,OAAO,CAAc;IAC7B,OAAO,CAAC,OAAO,CAA+B;WAEhC,QAAQ;IAItB,OAAO;IAGP,OAAO,CAAC,SAAS;IAajB,MAAM,IAAI,MAAM;IAChB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;IAO1B,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAmBlD,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAItC,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAIrC,MAAM,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAIvC,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAIxC,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAItC,QAAQ,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAIzC,KAAK,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAItC,SAAS,CAAC,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM;IAI1C,KAAK,IAAI,KAAK;IACd,KAAK,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;IAOrB,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;IAMzB,QAAQ,IAAI,IAAI;IAKhB,MAAM,IAAI,MAAM;IAChB,MAAM,CAAC,CAAC,EAAE,MAAM,GAAG,IAAI;CAM1B;AACD,eAAO,MAAM,MAAM,SAAqB,CAAC;AAEzC,qBAAa,aAAa;IACtB,SAAS,CAAC,QAAQ,EAAE,MAAM,CAAC;gBAEf,OAAO,EAAE,MAAM;IAI3B,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI1B,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAIzB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI3B,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI5B,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI1B,QAAQ,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI7B,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI1B,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;IAI9B,SAAS,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI;IAKzB,QAAQ,IAAI,IAAI;CAInB;AAED,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,GAAE,OAAe,iBAKpE"}