UNPKG

gentyl

Version:

A Generator That You'll Love

27 lines (26 loc) 1.72 kB
declare namespace Gentyl { namespace Util { function identity(x: any): any; function weightedChoice(weights: number[]): number; function range(...args: any[]): any[]; function translator(node: any, translation: any): any; function melder(node1: any, node2: any, merge?: (a: any, b: any) => any, concatArrays?: boolean): any; function deeplyEquals(node1: any, node2: any, allowIdentical?: boolean): boolean; function deeplyEqualsThrow(node1: any, node2: any, derefstack: any, seen: any, allowIdentical?: boolean): boolean; function isDeepReplica(node1: any, node2: any): void; function isDeepReplicaThrow(node1: any, node2: any, derefstack: any): void; function softAssoc(from: any, onto: any): void; function parassoc(from: any, onto: any): void; function assoc(from: any, onto: any): void; function deepCopy(thing: any): any; function applyMixins(derivedCtor: any, baseCtors: any[]): void; function isPrimative(thing: any): boolean; function isVanillaObject(thing: any): boolean; function isVanillaArray(thing: any): boolean; function isTree(thing: any, stack?: any[]): any; function isVanillaTree(thing: any, stack?: any[]): any; function typeCaseSplitR(objectOrAllFunction: any, arrayFunc?: any, primativeFunc?: any): (inThing: any, initial?: any, reductor?: (a: any, b: any, k: any) => void) => any; function typeCaseSplitF(objectOrAllFunction: any, arrayFunc?: any, primativeFunc?: any): (inThing: any) => any; function typeCaseSplitM(objectOrAllFunction: any, arrayFunc?: any, primativeFunc?: any): (inThing: any) => void; } }