GoJS.GraphObject.Panel.Part.Node.Methods

collapseTree_ :: forall n. IsNode n => n -> Effect Unit

expandTree_ :: forall n. IsNode n => n -> Effect Unit

findCommonTreeParent_ :: forall n1 n2 @n3. IsNode n1 => IsNode n2 => IsNode n3 => n1 -> n2 -> Effect (Maybe n3)

findExternalTreeLinksConnected_ :: forall n. IsNode n => n -> Effect (Iterator_ Link_)

findLinksBetween_ :: forall n. IsNode n => n -> String -> String -> n -> Effect (Iterator_ Link_)

findLinksConnected_ :: forall n. IsNode n => String -> n -> Effect (Iterator_ Link_)

findLinksInto_ :: forall n. IsNode n => n -> Effect (Iterator_ Link_)

findLinksOutOf_ :: forall n. IsNode n => n -> Effect (Iterator_ Link_)

findLinksTo_ :: forall n1 n2. IsNode n1 => IsNode n2 => n1 -> String -> String -> n2 -> Effect (Iterator_ Link_)

findNodesConnected_ :: forall n1 @n2. IsNode n1 => IsNode n2 => String -> n1 -> Effect (Iterator_ Node_)

findNodesInto_ :: forall n1 @n2. IsNode n1 => IsNode n2 => String -> n1 -> Effect (Iterator_ Node_)

findNodesOutOf_ :: forall n1 @n2. IsNode n1 => IsNode n2 => String -> n1 -> Effect (Iterator_ Node_)

findPort_ :: forall n @g. IsNode n => IsGraphObject g => String -> n -> Effect (Maybe g)

findTreeChildrenLinks_ :: forall n. IsNode n => n -> Effect (Iterator_ Link_)

findTreeChildrenNodes_ :: forall n1 @n2. IsNode n1 => IsNode n2 => n1 -> Effect (Iterator_ Node_)

findTreeLevel_ :: forall n. IsNode n => n -> Effect Number

findTreeParentChain_ :: forall n @p. IsPart p => n -> Effect (Set_ p)

findTreeParentLink_ :: forall n. IsNode n => n -> Effect (Maybe Link_)

findTreeParentNode_ :: forall n1 @n2. IsNode n1 => IsNode n2 => n1 -> Effect (Maybe n2)

findTreeParts_ :: forall n. IsNode n => n -> Effect (Set_ Part_)

findTreeRoot_ :: forall @n. IsNode n => n -> Effect n

findVisibleNode_ :: forall @n. IsNode n => n -> Effect n

getAvoidableRect_ :: forall n. IsNode n => Rect_ -> n -> Effect Rect_

isInTreeOf_ :: forall n1 n2. IsNode n1 => IsNode n2 => n1 -> n2 -> Effect Boolean