class-description NEWS COMMUNITY STORE TUTORIALS SIGN UP LOGIN LOGOUT ROKOJORI NEWSLETTER SIGN UP LOGIN LOGOUT NEWS COMMUNITY STORE TUTORIALS TOGGLE FULLSCREEN VOLLBILD AN/AUS Object TreeWalker<N>
protected TreeWalker<N> TreeWalker<N><>():TreeWalker<N> protected

public N Parent<>( N node=, node:N=, ):N public

public N ChildAt<>( N node=, node:N=, int index=, index:int=, ):N public

public int NumChildren<>( N node=, node:N=, ):int public

public bool HasChildren<>( N node=, node:N=, ):bool public

public bool HasParent<>( N node=, node:N=, ):bool public

public int ChildIndexOf<>( N node=, node:N=, ):int public

public N SiblingAt<>( N node=, node:N=, int index=, index:int=, ):N public

public N NextSibling<>( N node=, node:N=, ):N public

public N PreviousSibling<>( N node=, node:N=, ):N public

public bool HasSiblingAt<>( N node=, node:N=, int index=, index:int=, ):bool public

public int NumSiblings<>( N node=, node:N=, ):int public

public Void IterateSiblings<>( N node=, node:N=, System.Action<N> action=, action:System.Action<N>=, ):Void public

public N FindSibling<>( N node=, node:N=, Func<N,bool> evaluater=, evaluater:Func<N,bool>=, ):N public

public N FirstChild<>( N node=, node:N=, ):N public

public N LastChild<>( N node=, node:N=, ):N public

public Void ForEachChild<>( N node=, node:N=, bool directChildrenOnly=, directChildrenOnly:bool=, System.Action<N> action=, action:System.Action<N>=, ):Void public

public N FindDirectChild<>( N node=, node:N=, Predicate<N> selector=, selector:Predicate<N>=, ):N public

public N FindAnyChild<>( N node=, node:N=, Predicate<N> selector=, selector:Predicate<N>=, ):N public

public N FindChild<>( N node=, node:N=, bool directChildrenOnly=, directChildrenOnly:bool=, Predicate<N> selector=, selector:Predicate<N>=, ):N public

public N GetDirectChildWithLowestValue<>( N node=, node:N=, Func<N,float> getValue=, getValue:Func<N,float>=, ):N public

public N GetAnyChildWithLowestValue<>( N node=, node:N=, Func<N,float> getValue=, getValue:Func<N,float>=, ):N public

public N GetChildWithLowestValue<>( N node=, node:N=, bool directChildrenOnly=, directChildrenOnly:bool=, Func<N,float> getValue=, getValue:Func<N,float>=, ):N public

public N GetDirectChildWithHighestValue<>( N node=, node:N=, Func<N,float> getValue=, getValue:Func<N,float>=, ):N public

public N GetAnyChildWithHighestValue<>( N node=, node:N=, Func<N,float> getValue=, getValue:Func<N,float>=, ):N public

public N GetChildWithHighestValue<>( N node=, node:N=, bool directChildrenOnly=, directChildrenOnly:bool=, Func<N,float> getValue=, getValue:Func<N,float>=, ):N public

public N NextNode<>( N node=, node:N=, ):N public

public N PreviousNode<>( N node=, node:N=, ):N public

public N RootParent<>( N node=, node:N=, ):N public

public N LastGrandChild<>( N node=, node:N=, ):N public

public N NextAfterChildren<>( N node=, node:N=, ):N public

public bool IsChildOf<>( N child=, child:N=, N parent=, parent:N=, ):bool public

public int NumParents<>( N node=, node:N=, ):int public

public N LastOuterNode<>( N node=, node:N=, ):N public

public N NextNonChild<>( N node=, node:N=, ):N public

public N IterationEndOf<>( N node=, node:N=, ):N public

public N GetInParents<>( N node=, node:N=, Func<N,bool> predicate=, predicate:Func<N,bool>=, ):N public

public int GetAncestorDistance<>( N child=, child:N=, N ancestor=, ancestor:N=, ):int public

public int GetDepth<>( N node=, node:N=, Dictionary<N,int> depthMap=, depthMap:Dictionary<N,int>=, ):int public

public Void DepthIterate<>( N node=, node:N=, System.Action<N,int> callback=, callback:System.Action<N,int>=, bool childrenOnly=, childrenOnly:bool=, Dictionary<N,int> depthMap=, depthMap:Dictionary<N,int>=, ):Void public

public Void Iterate<>( N node=, node:N=, System.Action<N> callback=, callback:System.Action<N>=, bool childrenOnly=, childrenOnly:bool=, ):Void public

public Task IterateAsync<>( N node=, node:N=, Func<N,Task> callback=, callback:Func<N,Task>=, bool childrenOnly=, childrenOnly:bool=, ):Task public

public N Find<>( N node=, node:N=, Predicate<N> predicate=, predicate:Predicate<N>=, bool childrenOnly=, childrenOnly:bool=, ):N public

public Void Filter<>( List<N> list=, list:List<N>=, N node=, node:N=, Predicate<N> predicate=, predicate:Predicate<N>=, bool childrenOnly=, childrenOnly:bool=, ):Void public

public Void FilterAndMap<>( List<U> list=, list:List<U>=, N node=, node:N=, Predicate<N> predicate=, predicate:Predicate<N>=, Func<N,U> mapper=, mapper:Func<N,U>=, bool childrenOnly=, childrenOnly:bool=, ):Void public

public Void Map<>( List<U> list=, list:List<U>=, N node=, node:N=, Predicate<N> predicate=, predicate:Predicate<N>=, Func<N,U> mapper=, mapper:Func<N,U>=, bool childrenOnly=, childrenOnly:bool=, ):Void public

public Void PruneChildTraversal<>( N root=, root:N=, Func<N,bool> callback=, callback:Func<N,bool>=, ):Void public

All social media brands are registrated trademarks and belong to their respective owners.





CONTACT IMPRINT TERMS OF USE PRIVACY © ROKOROJI ® 2021 rokojori.com CONTACT IMPRINT TERMS OF USE PRIVACY © ROKOROJI ® 2021 rokojori.com We are using cookies on this site. Read more... Wir benutzen Cookies auf dieser Seite. Mehr lesen...