Interface HierarchyCircularNode<Datum>

interface HierarchyCircularNode {
    new HierarchyCircularNodenew (data): HierarchyCircularNode<Datum>;
    children?: HierarchyCircularNode<Datum>[];
    data: Datum;
    depth: number;
    height: number;
    id?: string;
    parent: HierarchyCircularNode<Datum>;
    r: number;
    value?: number;
    x: number;
    y: number;
    [iterator](): Iterator<HierarchyCircularNode<Datum>, any, undefined>;
    ancestors(): HierarchyCircularNode<Datum>[];
    copy(): HierarchyCircularNode<Datum>;
    count(): HierarchyCircularNode<Datum>;
    descendants(): HierarchyCircularNode<Datum>[];
    each<T>(func, that?): HierarchyCircularNode<Datum>;
    eachAfter<T>(func, that?): HierarchyCircularNode<Datum>;
    eachBefore<T>(func, that?): HierarchyCircularNode<Datum>;
    find(filter): HierarchyCircularNode<Datum>;
    leaves(): HierarchyCircularNode<Datum>[];
    links(): HierarchyCircularLink<Datum>[];
    path(target): HierarchyCircularNode<Datum>[];
    sort(compare): HierarchyCircularNode<Datum>;
    sum(value): HierarchyCircularNode<Datum>;
}

Type Parameters

  • Datum

Hierarchy

Constructors

Methods

  • Return a deep copy of the subtree starting at this node. The returned deep copy shares the same data, however. The returned node is the root of a new tree; the returned node’s parent is always null and its depth is always zero.

    Returns HierarchyCircularNode<Datum>

  • Invokes the specified function for node and each descendant in breadth-first order, such that a given node is only visited if all nodes of lesser depth have already been visited, as well as all preceding nodes of the same depth.

    Type Parameters

    • T = undefined

    Parameters

    • func: ((this, node, index, thisNode) => void)

      The specified function is passed the current descendant, the zero-based traversal index, and this node.

    • Optional that: T

      If that is specified, it is the this context of the callback.

    Returns HierarchyCircularNode<Datum>

  • Invokes the specified function for node and each descendant in post-order traversal, such that a given node is only visited after all of its descendants have already been visited.

    Type Parameters

    • T = undefined

    Parameters

    • func: ((this, node, index, thisNode) => void)

      The specified function is passed the current descendant, the zero-based traversal index, and this node.

    • Optional that: T

      If that is specified, it is the this context of the callback.

    Returns HierarchyCircularNode<Datum>

  • Invokes the specified function for node and each descendant in pre-order traversal, such that a given node is only visited after all of its ancestors have already been visited.

    Type Parameters

    • T = undefined

    Parameters

    • func: ((this, node, index, thisNode) => void)

      The specified function is passed the current descendant, the zero-based traversal index, and this node.

    • Optional that: T

      If that is specified, it is the this context of the callback.

    Returns HierarchyCircularNode<Datum>

  • Returns the shortest path through the hierarchy from this node to the specified target node. The path starts at this node, ascends to the least common ancestor of this node and the target node, and then descends to the target node.

    Parameters

    Returns HierarchyCircularNode<Datum>[]

  • Sorts the children of this node, if any, and each of this node’s descendants’ children, in pre-order traversal using the specified compare function, and returns this node.

    Parameters

    • compare: ((a, b) => number)

      The compare function is passed two nodes a and b to compare. If a should be before b, the function must return a value less than zero; if b should be before a, the function must return a value greater than zero; otherwise, the relative order of a and b are not specified. See array.sort for more.

    Returns HierarchyCircularNode<Datum>

  • Evaluates the specified value function for this node and each descendant in post-order traversal, and returns this node. The node.value property of each node is set to the numeric value returned by the specified function plus the combined value of all descendants.

    Parameters

    • value: ((d) => number)

      The value function is passed the node’s data, and must return a non-negative number.

        • (d): number
        • Parameters

          • d: Datum

          Returns number

    Returns HierarchyCircularNode<Datum>

Properties

children?: HierarchyCircularNode<Datum>[]

An array of child nodes, if any; undefined for leaf nodes.

data: Datum

The associated data, as specified to the constructor.

depth: number

Zero for the root node, and increasing by one for each descendant generation.

height: number

Zero for leaf nodes, and the greatest distance from any descendant leaf for internal nodes.

id?: string

Optional node id string set by StratifyOperator, if hierarchical data was created from tabular data using stratify().

parent: HierarchyCircularNode<Datum>

The parent node, or null for the root node.

r: number

The radius of the circle.

value?: number

Aggregated numeric value as calculated by sum(value) or count(), if previously invoked.

x: number

The x-coordinate of the circle’s center.

y: number

The y-coordinate of the circle’s center.