Uses of Class ini.trakem2.display.Node (Fiji Javadocs 0-SNAPSHOT API)

Packages that use Node
Package Description

ini.trakem2.display

ini.trakem2.utils

Packages that use Node
Package	Description
ini.trakem2.display
ini.trakem2.utils

Uses of Node in ini.trakem2.display

Subclasses of Node in ini.trakem2.display
Modifier and Type	Class and Description
`static class`	`AreaTree.AreaNode`
`static class`	`Connector.ConnectorNode`
`static class`	`Treeline.RadiusNode`

Fields in ini.trakem2.display declared as Node
Modifier and Type	Field and Description
`Node<T>`	Tree.Pair.`a` Two nodes of a tree; there is a unique path that goes from a to b.
`Node<T>`	Tree.Pair.`b` Two nodes of a tree; there is a unique path that goes from a to b.
`protected Node<T>[]`	Node.`children`
`protected Node<T>`	Node.`parent`
`protected Node<T>`	Tree.`root`

Fields in ini.trakem2.display with type parameters of type Node
Modifier and Type	Field and Description
`protected Set<Node<T>>`	Tree.`end_nodes`
`protected Map<Layer,Set<Node<T>>>`	Tree.`node_layer_map`
`protected List<Node<T>>`	Tree.NodePath.`path` The ordered list of nodes from a to b, both included.

Methods in ini.trakem2.display with type parameters of type Node
Modifier and Type	Method and Description
`static <A extends Tree<?>,B extends Node<?>> A`	Tree.`copyAs(Tree<?> src, Class<A> tree_class, Class<B> node_class)` Can copy a Treeline to an AreaTree and viceversa.

Methods in ini.trakem2.display that return Node
Modifier and Type	Method and Description
`protected Node<T>`	Tree.`adjustEdgeConfidence(int inc, float x, float y, Layer layer, DisplayCanvas dc)` Expects world coordinates.
`protected Node<Float>`	Treeline.`adjustNodeRadius(float inc, float x, float y, Layer layer, DisplayCanvas dc)`
`Node<T>`	Node.`clone(Project pr)` Returns a recursive copy of this Node subtree, where the copy of this Node is the root.
`protected Node<T>`	Tree.`createNewNode(float lx, float ly, Layer layer, Node<?> modelNode)` Create a new node, copying some properties from the modelNode such as radius or color.
`Node<T>`	Tree.`findClosestNode(Collection<Node<T>> nodes, float lx, float ly, double magnification)` Expects local coords; with precision depending on magnification.
`Node<T>`	Tree.`findClosestNodeW(Collection<Node<T>> nodes, float wx, float wy, double magnification)` Expects world coords; with precision depending on magnification.
`Node<T>`	Tree.`findClosestNodeW(float wx, float wy, Layer layer, double magnification)` Expects world coords; with precision depending on magnification.
`protected Node<T>`	Tree.`findFirstIntersectingNode(Set<Node<T>> nodes, Area a)` Expects an Area in local coordinates.
`Node<T>[]`	Tree.`findNearestEdge(float x_pl, float y_pl, Layer layer, double magnification)` Considering only the set of consecutive layers currently painted, find a point near an edge with accuracy depending upon magnification.
`Node<T>`	Tree.`findNearestEndNode(float lx, float ly, Layer layer)` Find the spatially closest node, in calibrated coords.
`Node<T>`	Tree.`findNearestNode(float lx, float ly, Layer layer)` Find the spatially closest node, in calibrated coords; expects local coords.
`Node<T>`	Node.`findNextBranchOrEndPoint()` Assumes there aren't any cycles.
`Node<T>`	Tree.`findNode(float lx, float ly, Layer layer, double magnification)` Find a node in @param layer near the local coords lx,ly, with precision depending on magnification.
`protected Node<T>`	Tree.`findNodeNear(float x, float y, Layer layer, DisplayCanvas dc)`
`protected Node<T>`	Tree.`findNodeNear(float x, float y, Layer layer, DisplayCanvas dc, boolean use_receiver_when_null)` Expects world coordinates.
`Node<T>`	Node.`findPreviousBranchOrRootPoint()`
`Node<T>`	Tree.`firstIntersectingNode(Layer layer, Area area)` Expects Area in world coords.
`protected Node<T>`	Tree.`getActive()` The node currently being dragged or edited in some way.
`Node<T>`	Tree.`getLastVisited()`
`Node<T>`	Tree.`getMarked()`
`Node<T>`	Node.`getParent()`
`Node<T>`	Tree.`getRoot()`
`Node<Float>`	Treeline.RadiusNode.`newInstance(float lx, float ly, Layer layer)`
`abstract Node<T>`	Node.`newInstance(float x, float y, Layer layer)`
`Node<Float>`	Connector.ConnectorNode.`newInstance(float lx, float ly, Layer layer)`
`Node<Area>`	AreaTree.AreaNode.`newInstance(float lx, float ly, Layer layer)`
`Node<Float>`	Treeline.`newNode(float lx, float ly, Layer la, Node<?> modelNode)`
`protected abstract Node<T>`	Tree.`newNode(float lx, float ly, Layer layer, Node<?> modelNode)`
`Node<Float>`	Connector.`newNode(float lx, float ly, Layer la, Node<?> modelNode)`
`Node<Area>`	AreaTree.`newNode(float lx, float ly, Layer la, Node<?> modelNode)`
`Node<Float>`	Treeline.`newNode(HashMap<String,String> ht_attr)`
`abstract Node<T>`	Tree.`newNode(HashMap<String,String> ht_attr)` To reconstruct from XML.
`Node<Float>`	Connector.`newNode(HashMap<String,String> ht_attr)`
`Node<Area>`	AreaTree.`newNode(HashMap<String,String> ht_attr)`
`Node<I>`	Node.BreadthFirstSubtreeIterator.`next()`
`Node<I>`	Node.FilteredIterator.`next()`
`Node<I>`	Node.SlabIterator.`next()`
`protected Node<T>`	Tree.`setEdgeConfidence(byte confidence)` Find an edge near the world coords x,y,layer with precision depending upon magnification, and adjust its confidence to @param confidence.
`Node<I>[]`	Node.NodeCollection.`toArray()` Override to avoid calling size(), which would iterate the whole list just for that.

Methods in ini.trakem2.display that return types with arguments of type Node
Modifier and Type	Method and Description
`HashMap<Node<T>,Vertex<Node<T>>>`	Tree.`asVertices()` Return a representation of this Tree with Vertex instead of Node.
`HashMap<Node<T>,Vertex<Node<T>>>`	Tree.`asVertices()` Return a representation of this Tree with Vertex instead of Node.
`HashMap<Node<T>,Integer>`	Tree.`computeAllDegrees()`
`HashMap<Node<T>,Integer>`	Node.`computeAllDegrees()` Return a map of node vs degree of that node, for the entire subtree (including this node).
`HashMap<Node<T>,Float>`	Tree.`computeCentrality()` Computes betweenness centrality of each node in the tree, using Ulrik Brandes betweenness centrality algorithm.
`protected Coordinate<Node<T>>`	Tree.`createCoordinate(Node<T> nd)`
`Map<Node<T>,Collection<Displayable>>`	Tree.`findIntersecting(Class<?> c)`
`protected Coordinate<Node<T>>`	Tree.`findNearAndGetNext(float x, float y, Layer layer, DisplayCanvas dc)`
`protected Coordinate<Node<T>>`	Tree.`findNearAndGetPrevious(float x, float y, Layer layer, DisplayCanvas dc)`
`Coordinate<Node<T>>`	Tree.`findNextBranchOrEndPoint(float x, float y, Layer layer, DisplayCanvas dc)` If the node found near x,y,layer is a branch point, returns it; otherwise the next down the chain; on reaching an end point, returns it.
`static <I> List<Node<I>>`	Node.`findPath(Node<I> a, Node<I> b)` Obtain the (only) list from node a to node b, including both a (the first element) and b (the last element).
`Coordinate<Node<T>>`	Tree.`findPreviousBranchOrRootPoint(float x, float y, Layer layer, DisplayCanvas dc)`
`LinkedList<Region<Node<T>>>`	Tree.`generateRegions(Node<T> first, Node<T> last, int width, int height, double magnification)`
`Collection<Node<T>>`	Tree.`getBranchAndEndNodes()`
`Collection<Node<T>>`	Node.`getBranchAndEndNodes()` Returns a lazy read-only Collection of all branch and end nodes under this node.
`Collection<Node<T>>`	Tree.`getBranchNodes()`
`Collection<Node<T>>`	Node.`getBranchNodes()` Returns a lazy read-only Collection of all branch nodes under this node.
`Map<Node<T>,Byte>`	Node.`getChildren()`
`ArrayList<Node<T>>`	Node.`getChildrenNodes()`
`Coordinate<Node<Float>>`	Connector.`getCoordinate(int i)` Get a coordinate for target i.
`Coordinate<Node<Float>>`	Connector.`getCoordinateAtOrigin()`
`Set<Node<T>>`	Tree.`getEndNodes()`
`Collection<Node<T>>`	Node.`getEndNodes()` Returns a lazy read-only Collection of all end nodes under this node.
`Coordinate<Node<T>>`	Tree.`getLastAdded()`
`Coordinate<Node<T>>`	Tree.`getLastEdited()`
`Set<Node<T>>`	Tree.`getNodesAt(Layer layer)` Get a copy of the `Set` of `Node` that exist at `layer`; the `Node` instances are the originals.
`protected Set<Node<T>>`	Tree.`getNodesToPaint(Layer active_layer)`
`protected Set<Node<T>>`	Tree.`getNodesToPaint(Layer active_layer, List<Layer> color_cue_layers)`
`List<Node<I>>`	Tree.MeasurePathDistance.`getPath()`
`List<Node<T>>`	Tree.NodePath.`getPath()`
`Collection<Node<T>>`	Node.`getSlabNodes()` Returns a lazy read-only Collection of the nodes from this node up to the next branch node or end node, inclusive.
`Collection<Node<T>>`	Node.`getSubtreeNodes()` Returns a lazy read-only Collection of the nodes belonging to the subtree of this node, including the node itself as the root.
`Iterator<Node<I>>`	Node.NodeCollection.`iterator()`

Methods in ini.trakem2.display with parameters of type Node
Modifier and Type	Method and Description
`abstract boolean`	Node.FilteredIterator.`accept(Node<I> node)`
`boolean`	Node.BranchAndEndNodeIterator.`accept(Node<I> node)`
`boolean`	Node.BranchNodeIterator.`accept(Node<I> node)`
`boolean`	Node.EndNodeIterator.`accept(Node<I> node)`
`int`	Node.`add(Node<T> child, byte conf)` Returns -1 when not added (e.g.
`boolean`	Tree.`addNode(Node<T> parent, Node<T> child, byte confidence)` Will call calculateBoundingBox and repaint.
`boolean`	Tree.`addNode(Node<T> parent, Node<T> child, byte confidence)` Will call calculateBoundingBox and repaint.
`protected void`	Tree.`addToLinkLater(Node<T> nd)`
`void`	AreaTree.`addWorldAreaTo(Node<?> nd, Area a)` Assumes `nd` is an AreaNode.
`protected boolean`	Tree.`adjustNodeColors(Node<T> nd)`
`void`	Node.Operation.`apply(Node<I> nd)`
`protected boolean`	Treeline.`askAdjustRadius(Node<Float> nd)`
`Point3f`	Tree.`asPoint(Node<T> nd, boolean calibrated)` Return the `Node` as a point in space.
`protected void`	Node.`copyProperties(Node<?> nd)`
`protected Coordinate<Node<T>>`	Tree.`createCoordinate(Node<T> nd)`
`protected Node<T>`	Tree.`createNewNode(float lx, float ly, Layer layer, Node<?> modelNode)` Create a new node, copying some properties from the modelNode such as radius or color.
`void`	Tree.`createReviewStack(Node<T> first, Node<T> last, Tag tag, String filepath, int width, int height, double magnification, int image_type)` The behavior is undefined if @param last is not a descendant of @param first.
`void`	Tree.`createReviewStack(Node<T> first, Node<T> last, Tag tag, String filepath, int width, int height, double magnification, int image_type)` The behavior is undefined if @param last is not a descendant of @param first.
`protected boolean`	AreaTree.`exportXMLNodeAttributes(StringBuilder indent, StringBuilder sb, Node<Area> node)`
`protected boolean`	Treeline.`exportXMLNodeAttributes(StringBuilder indent, StringBuilder sb, Node<Float> node)` Export the radius only if it is larger than zero.
`protected abstract boolean`	Tree.`exportXMLNodeAttributes(StringBuilder indent, StringBuilder sb, Node<T> node)`
`protected boolean`	AreaTree.`exportXMLNodeData(StringBuilder indent, StringBuilder sb, Node<Area> node)`
`protected boolean`	Treeline.`exportXMLNodeData(StringBuilder indent, StringBuilder sb, Node<Float> node)`
`protected abstract boolean`	Tree.`exportXMLNodeData(StringBuilder indent, StringBuilder sb, Node<T> node)`
`static <I> List<Node<I>>`	Node.`findPath(Node<I> a, Node<I> b)` Obtain the (only) list from node a to node b, including both a (the first element) and b (the last element).
`static <I> List<Node<I>>`	Node.`findPath(Node<I> a, Node<I> b)` Obtain the (only) list from node a to node b, including both a (the first element) and b (the last element).
`protected void`	Tree.`fireNodeRemoved(Node<T> nd)`
`ij.ImagePlus`	Tree.`flyThrough(Node<T> first, Node<T> last, int width, int height, double magnification, int type, String dir)` Fly-through image stack from first to last node.
`ij.ImagePlus`	Tree.`flyThrough(Node<T> first, Node<T> last, int width, int height, double magnification, int type, String dir)` Fly-through image stack from first to last node.
`LinkedList<Region<Node<T>>>`	Tree.`generateRegions(Node<T> first, Node<T> last, int width, int height, double magnification)`
`LinkedList<Region<Node<T>>>`	Tree.`generateRegions(Node<T> first, Node<T> last, int width, int height, double magnification)`
`Bureaucrat`	Tree.`generateReviewStackForSlab(Node<T> node)` Generate a review stack from the previous branch node or root, to the next branch node or end node.
`Bureaucrat`	Tree.`generateSubtreeReviewStacks(Node<T> root)`
`byte`	Node.`getEdgeConfidence(Node<T> child)`
`boolean`	Node.`hasSameTags(Node<?> other)`
`boolean`	Tree.`insertNode(Node<T> parent, Node<T> child, Node<T> in_between, byte confidence)`
`boolean`	Tree.`insertNode(Node<T> parent, Node<T> child, Node<T> in_between, byte confidence)`
`boolean`	Tree.`insertNode(Node<T> parent, Node<T> child, Node<T> in_between, byte confidence)`
`boolean`	AreaTree.`interpolateTowardsParent(Node<Area> nd, boolean node_centric, boolean always_use_distance_map)` Find the nearest parent with a non-null, non-empty Area, and interpolate from `nd` to it.
`double`	Tree.`measurePathDistance(Node<T> a, Node<T> b)` Measure the distance, in calibrated units, between nodes a and b of this tree.
`double`	Tree.`measurePathDistance(Node<T> a, Node<T> b)` Measure the distance, in calibrated units, between nodes a and b of this tree.
`ij.measure.ResultsTable`	Tree.`measurePathDistance(Node<T> a, Node<T> b, ij.measure.ResultsTable rt)` Reuses @param rt unless it is null, in which case it creates a new one.
`ij.measure.ResultsTable`	Tree.`measurePathDistance(Node<T> a, Node<T> b, ij.measure.ResultsTable rt)` Reuses @param rt unless it is null, in which case it creates a new one.
`Node<Float>`	Treeline.`newNode(float lx, float ly, Layer la, Node<?> modelNode)`
`protected abstract Node<T>`	Tree.`newNode(float lx, float ly, Layer layer, Node<?> modelNode)`
`Node<Float>`	Connector.`newNode(float lx, float ly, Layer la, Node<?> modelNode)`
`Node<Area>`	AreaTree.`newNode(float lx, float ly, Layer la, Node<?> modelNode)`
`boolean`	Tree.`popNode(Node<T> node)` Remove a node only (not its subtree).
`boolean`	Node.`remove(Node<T> child)`
`protected void`	Tree.`removeFromLinkLater(Node<T> nd)`
`void`	Tree.`removeNode(Node<T> node)` If the tree is a cyclic graph, it may destroy all.
`boolean`	Tree.`reRoot(Node<T> nd)`
`protected void`	Tree.`setActive(Node<T> nd)` The node currently being dragged or edited in some way.
`protected void`	Tree.`setLastAdded(Node<T> nd)`
`protected void`	Tree.`setLastEdited(Node<T> nd)`
`void`	Tree.`setLastMarked(Node<T> nd)`
`protected void`	Tree.`setLastVisited(Node<T> nd)` The node that paints in green, which is the receiver of events.
`void`	Tree.`setRoot(Node<T> new_root)` Used when reconstructing from XML.
`List<Tree<T>>`	Tree.`splitAt(Node<T> nd)`
`protected void`	Tree.`updateViewData(Node<?> node)`

Method parameters in ini.trakem2.display with type arguments of type Node
Modifier and Type	Method and Description
`protected void`	Node.`apply(Node.Operation<T> op, Iterator<Node<T>> nodes)`
`protected void`	Tree.`cacheSubtree(Iterable<Node<T>> nodes)`
`Node<T>`	Tree.`findClosestNode(Collection<Node<T>> nodes, float lx, float ly, double magnification)` Expects local coords; with precision depending on magnification.
`Node<T>`	Tree.`findClosestNodeW(Collection<Node<T>> nodes, float wx, float wy, double magnification)` Expects world coords; with precision depending on magnification.
`protected Node<T>`	Tree.`findFirstIntersectingNode(Set<Node<T>> nodes, Area a)` Expects an Area in local coordinates.
`protected Rectangle`	AreaTree.`getBounds(Collection<? extends Node<Area>> nodes)`
`protected Rectangle`	Treeline.`getBounds(Collection<? extends Node<Float>> nodes)`
`protected Rectangle`	Connector.`getBounds(Collection<? extends Node<Float>> nodes)`
`protected Rectangle`	Tree.`getBounds(Collection<? extends Node<T>> nodes)`
`protected boolean`	AreaTree.`isAnyNear(Collection<Node<Area>> nodes, float lx, float ly, float radius)` Returns true if the given point falls within a certain distance of any of the treeline segments, where a segment is defined as the line between a clicked point and the next.
`protected boolean`	Tree.`isAnyNear(Collection<Node<T>> nodes, float lx, float ly, float radius)`

Constructors in ini.trakem2.display with parameters of type Node
Constructor and Description
`BranchAndEndNodeIterator(Node<I> first)`
`BranchNodeIterator(Node<I> first)`
`BreadthFirstSubtreeIterator(Node<I> first)`
`EndNodeIterator(Node<I> first)`
`FilteredIterator(Node<I> first)`
`MeasurementPair(Node<T> a, Node<T> b, List<Node<T>> path)`
`MeasurementPair(Node<T> a, Node<T> b, List<Node<T>> path)`
`MeasurePathDistance(Tree<I> tree, Node<I> a, Node<I> b)`
`MeasurePathDistance(Tree<I> tree, Node<I> a, Node<I> b)`
`NodeCollection(Node<I> first, Class<?> type)`
`NodeIterator(Node<I> first)`
`NodePath(Node<T> a, Node<T> b)`
`NodePath(Node<T> a, Node<T> b)`
`NodePath(Node<T> a, Node<T> b, List<Node<T>> path)` Assumes that a is the first element in path, and b the last, and that a has a lower degree than b (that is, a is upstream of b).
`NodePath(Node<T> a, Node<T> b, List<Node<T>> path)` Assumes that a is the first element in path, and b the last, and that a has a lower degree than b (that is, a is upstream of b).
`Pair(Node<T> a, Node<T> b)`
`Pair(Node<T> a, Node<T> b)`
`SlabIterator(Node<I> first)`
`SubtreeIterator(Node<I> first)`

Constructor parameters in ini.trakem2.display with type arguments of type Node
Constructor and Description
`MeasurementPair(Node<T> a, Node<T> b, List<Node<T>> path)`
`NodePath(Node<T> a, Node<T> b, List<Node<T>> path)` Assumes that a is the first element in path, and b the last, and that a has a lower degree than b (that is, a is upstream of b).

Uses of Node in ini.trakem2.utils

Methods in ini.trakem2.utils with parameters of type Node
Modifier and Type	Method and Description
`static List<Set<Tag>>`	Merger.`compareTags(Node<?> nd1, Node<?> nd2)` Returns three lists: the tags in common, the tags in this node but not in the other, and the tags in the other but not in this node.
`static List<Set<Tag>>`	Merger.`compareTags(Node<?> nd1, Node<?> nd2)` Returns three lists: the tags in common, the tags in this node but not in the other, and the tags in the other but not in this node.

Uses of Classini.trakem2.display.Node

Uses of Node in ini.trakem2.display

Uses of Node in ini.trakem2.utils

Uses of Class
ini.trakem2.display.Node