TypeScript definitions for @babel/traverse. 

TypeScript definitions for @babel/traverse

types

@types/babel__traverse

// Type definitions for @babel/traverse 7.0

// Project: https://github.com/babel/babel/tree/master/packages/babel-traverse

// Definitions by: Troy Gerwien <https://github.com/yortus>

//                 Marvin Hagemeister <https://github.com/marvinhagemeister>

//                 Ryan Petrich <https://github.com/rpetrich>

//                 Melvin Groenhoff <https://github.com/mgroenhoff>

// Definitions: https://github.com/DefinitelyTyped/DefinitelyTyped

export default function traverse<S>(parent: Node | Node[], opts: TraverseOptions<S>, scope: Scope, state: S, parentPath?: NodePath): void;

export default function traverse(parent: Node | Node[], opts: TraverseOptions, scope?: Scope, state?: any, parentPath?: NodePath): void;

export interface TraverseOptions<S = Node> extends Visitor<S> {

    constructor(path: NodePath, parentScope?: Scope);

    bindings: { [name: string]: Binding; };

    /** Traverse node with current scope and path. */

    traverse<S>(node: Node | Node[], opts: TraverseOptions<S>, state: S): void;

    traverse(node: Node | Node[], opts?: TraverseOptions, state?: any): void;

    /** Generate a unique identifier and add it to the current scope. */

    generateDeclaredUidIdentifier(name?: string): t.Identifier;

    generateUidIdentifier(name?: string): t.Identifier;

    /** Generate a unique `_id1` binding. */

    /** Generate a unique identifier based on a node. */

    generateUidIdentifierBasedOnNode(parent: Node, defaultName?: string): t.Identifier;

     * Determine whether evaluating the specific input `node` is a consequenceless reference. ie.

     * evaluating it wont result in potentially arbitrary code from being ran. The following are

     * whitelisted and determined not to cause side effects:

    /** Possibly generate a memoised identifier if it is not static and has consequences. */

    maybeGenerateMemoised(node: Node, dontPush?: boolean): t.Identifier;

    checkBlockScopedCollisions(local: Node, kind: string, name: string, id: object): void;

    rename(oldName: string, newName?: string, block?: Node): void;

    toArray(node: Node, i?: number): Node;

    registerDeclaration(path: NodePath): void;

    registerConstantViolation(path: NodePath): void;

    registerBinding(kind: string, path: NodePath, bindingPath?: NodePath): void;

    isPure(node: Node, constantsOnly?: boolean): boolean;

    [Type in Node["type"]]?: VisitNode<S, Extract<Node, { type: Type; }>>;

    [K in keyof t.Aliases]?: VisitNode<S, t.Aliases[K]>

export type VisitNode<S, P> = VisitNodeFunction<S, P> | VisitNodeObject<S, P>;

export type VisitNodeFunction<S, P> = (this: S, path: NodePath<P>, state: S) => void;

    type: T extends undefined | null ? string | null : string;

    getData(key: string, def?: any): any;

    buildCodeFrameError<TError extends Error>(msg: string, Error?: new (msg: string) => TError): TError;

    traverse<T>(visitor: Visitor<T>, state: T): void;

    // Example: https://github.com/babel/babel/blob/63204ae51e020d84a5b246312f5eeb4d981ab952/packages/babel-traverse/src/path/modification.js#L83

    debug(buildMessage: () => string): void;

    // ------------------------- ancestry -------------------------

     * Call the provided `callback` with the `NodePath`s of all the parents.

     * When the `callback` returns a truthy value, we return that node path.

    findParent(callback: (path: NodePath) => boolean): NodePath;

    find(callback: (path: NodePath) => boolean): NodePath;

    /** Get the parent function of the current path. */

    getFunctionParent(): NodePath<t.Function>;

    /** Walk up the tree until we hit a parent node path in a list. */

    getStatementParent(): NodePath<t.Statement>;

     * Get the deepest common ancestor and then from it, get the earliest relationship path

     * Earliest is defined as being "before" all the other nodes in terms of list container

    getEarliestCommonAncestorFrom(paths: NodePath[]): NodePath[];

    /** Get the earliest path in the tree where the provided `paths` intersect. */

        filter?: (deepest: Node, i: number, ancestries: NodePath[]) => NodePath

     * Build an array of node paths containing the entire ancestry of the current node path.

     * NOTE: The current node path is included in this.

    inType(...candidateTypes: string[]): boolean;

    // ------------------------- inference -------------------------

    /** Infer the type of the current `NodePath`. */

    isBaseType(baseName: string, soft?: boolean): boolean;

    couldBeBaseType(name: string): boolean;

    baseTypeStrictlyMatches(right: NodePath): boolean;

    "description": "TypeScript definitions for @babel/traverse",

            "url": "https://github.com/yortus",

            "name": "Marvin Hagemeister",

            "url": "https://github.com/marvinhagemeister",

            "githubUsername": "marvinhagemeister"

            "url": "https://github.com/rpetrich",

            "url": "https://github.com/mgroenhoff",

            "githubUsername": "mgroenhoff"

        "url": "https://github.com/DefinitelyTyped/DefinitelyTyped.git"

    "typesPublisherContentHash": "aaf7d783940ca51afbd94c510281fcac1a54180b94b54f58bea2e3815fda0c16",

    "typesPublisherContentHash": "1f4c68d02e439639444aed402e1d7aba70c4455bcca57235759296fe8bc8b095",

> `npm install --save @types/babel__traverse`

This package contains type definitions for @babel/traverse (https://github.com/babel/babel/tree/master/packages/babel-traverse).

This package contains type definitions for @babel/traverse ( https://github.com/babel/babel/tree/master/packages/babel-traverse ).

Files were exported from https://github.com/DefinitelyTyped/DefinitelyTyped/tree/master/types/babel__traverse

 * Last updated: Mon, 03 Dec 2018 00:23:15 GMT

 * Last updated: Mon, 28 Jan 2019 16:39:30 GMT

These definitions were written by Troy Gerwien <https://github.com/yortus>, Marvin Hagemeister <https://github.com/marvinhagemeister>, Ryan Petrich <https://github.com/rpetrich>, Melvin Groenhoff <https://github.com/mgroenhoff>.

		{
		"name": "@types/babel__traverse",
		"version": "7.0.4",
		"version": "7.0.5",
		"description": "TypeScript definitions for @babel/traverse",
		@@ -36,6 +36,6 @@ "license": "MIT",
		"dependencies": {
		"@babel/types": "^7.0.0"
		"@babel/types": "^7.3.0"
		},
		"typesPublisherContentHash": "aaf7d783940ca51afbd94c510281fcac1a54180b94b54f58bea2e3815fda0c16",
		"typesPublisherContentHash": "1f4c68d02e439639444aed402e1d7aba70c4455bcca57235759296fe8bc8b095",
		"typeScriptVersion": "2.9"
		}

		@@ -5,3 +5,3 @@ # Installation
		# Summary
		This package contains type definitions for @babel/traverse (https://github.com/babel/babel/tree/master/packages/babel-traverse).
		This package contains type definitions for @babel/traverse ( https://github.com/babel/babel/tree/master/packages/babel-traverse ).

		@@ -12,3 +12,3 @@ # Details
		Additional Details
		* Last updated: Mon, 03 Dec 2018 00:23:15 GMT
		* Last updated: Mon, 28 Jan 2019 16:39:30 GMT
		* Dependencies: @types/babel__types
		@@ -15,0 +15,0 @@ * Global values: none

Improved metrics

Dependency changes

		@@ -148,2 +148,4 @@ // Type definitions for @babel/traverse 7.0
		[Type in Node["type"]]?: VisitNode<S, Extract<Node, { type: Type; }>>;
		} & {
		[K in keyof t.Aliases]?: VisitNode<S, t.Aliases[K]>
		};
		@@ -150,0 +152,0 @@