using System; using System.Collections.Generic; using System.Linq; using Avalonia.Rendering; namespace Avalonia.VisualTree { /// /// Provides extension methods for working with the visual tree. /// public static class VisualExtensions { /// /// Calculates the distance from a visual's ancestor. /// /// The visual. /// The ancestor visual. /// /// The number of steps from the visual to the ancestor or -1 if /// is not a descendent of . /// public static int CalculateDistanceFromAncestor(this IVisual visual, IVisual? ancestor) { IVisual? v = visual ?? throw new ArgumentNullException(nameof(visual)); var result = 0; while (v != null && v != ancestor) { v = v.VisualParent; result++; } return v != null ? result : -1; } /// /// Calculates the distance from a visual's root. /// /// The visual. /// /// The number of steps from the visual to the root. /// public static int CalculateDistanceFromRoot(IVisual visual) { IVisual? v = visual ?? throw new ArgumentNullException(nameof(visual)); var result = 0; v = v?.VisualParent; while (v != null) { v = v.VisualParent; result++; } return result; } /// /// Tries to get the first common ancestor of two visuals. /// /// The first visual. /// The second visual. /// The common ancestor, or null if not found. public static IVisual? FindCommonVisualAncestor(this IVisual visual, IVisual target) { IVisual? v = visual ?? throw new ArgumentNullException(nameof(visual)); if (target is null) { return null; } IVisual? t = target; void GoUpwards(ref IVisual? node, int count) { for (int i = 0; i < count; ++i) { node = node?.VisualParent; } } // We want to find lowest node first, then make sure that both nodes are at the same height. // By doing that we can sometimes find out that other node is our lowest common ancestor. var firstHeight = CalculateDistanceFromRoot(v); var secondHeight = CalculateDistanceFromRoot(t); if (firstHeight > secondHeight) { GoUpwards(ref v, firstHeight - secondHeight); } else { GoUpwards(ref t, secondHeight - firstHeight); } if (v == t) { return v; } while (v != null && t != null) { IVisual? firstParent = v.VisualParent; IVisual? secondParent = t.VisualParent; if (firstParent == secondParent) { return firstParent; } v = v.VisualParent; t = t.VisualParent; } return null; } /// /// Enumerates the ancestors of an in the visual tree. /// /// The visual. /// The visual's ancestors. public static IEnumerable GetVisualAncestors(this IVisual visual) { IVisual? v = visual ?? throw new ArgumentNullException(nameof(visual)); v = v.VisualParent; while (v != null) { yield return v; v = v.VisualParent; } } /// /// Finds first ancestor of given type. /// /// Ancestor type. /// The visual. /// If given visual should be included in search. /// First ancestor of given type. public static T? FindAncestorOfType(this IVisual visual, bool includeSelf = false) where T : class { if (visual is null) { return null; } IVisual? parent = includeSelf ? visual : visual.VisualParent; while (parent != null) { if (parent is T result) { return result; } parent = parent.VisualParent; } return null; } /// /// Finds first descendant of given type. /// /// Descendant type. /// The visual. /// If given visual should be included in search. /// First descendant of given type. public static T? FindDescendantOfType(this IVisual visual, bool includeSelf = false) where T : class { if (visual is null) { return null; } if (includeSelf && visual is T result) { return result; } return FindDescendantOfTypeCore(visual); } /// /// Enumerates an and its ancestors in the visual tree. /// /// The visual. /// The visual and its ancestors. public static IEnumerable GetSelfAndVisualAncestors(this IVisual visual) { _ = visual ?? throw new ArgumentNullException(nameof(visual)); yield return visual; foreach (var ancestor in visual.GetVisualAncestors()) { yield return ancestor; } } /// /// Gets the first visual in the visual tree whose bounds contain a point. /// /// The root visual to test. /// The point. /// The visual at the requested point. public static IVisual? GetVisualAt(this IVisual visual, Point p) { _ = visual ?? throw new ArgumentNullException(nameof(visual)); return visual.GetVisualAt(p, x => x.IsVisible); } /// /// Gets the first visual in the visual tree whose bounds contain a point. /// /// The root visual to test. /// The point. /// /// A filter predicate. If the predicate returns false then the visual and all its /// children will be excluded from the results. /// /// The visual at the requested point. public static IVisual? GetVisualAt(this IVisual visual, Point p, Func filter) { _ = visual ?? throw new ArgumentNullException(nameof(visual)); var root = visual.GetVisualRoot(); if (root is null) { return null; } var rootPoint = visual.TranslatePoint(p, root); if (rootPoint.HasValue) { return root.Renderer.HitTestFirst(rootPoint.Value, visual, filter); } return null; } /// /// Enumerates the visible visuals in the visual tree whose bounds contain a point. /// /// The root visual to test. /// The point. /// The visuals at the requested point. public static IEnumerable GetVisualsAt( this IVisual visual, Point p) { _ = visual ?? throw new ArgumentNullException(nameof(visual)); return visual.GetVisualsAt(p, x => x.IsVisible); } /// /// Enumerates the visuals in the visual tree whose bounds contain a point. /// /// The root visual to test. /// The point. /// /// A filter predicate. If the predicate returns false then the visual and all its /// children will be excluded from the results. /// /// The visuals at the requested point. public static IEnumerable GetVisualsAt( this IVisual visual, Point p, Func filter) { _ = visual ?? throw new ArgumentNullException(nameof(visual)); var root = visual.GetVisualRoot(); if (root is null) { return Array.Empty(); } var rootPoint = visual.TranslatePoint(p, root); if (rootPoint.HasValue) { return root.Renderer.HitTest(rootPoint.Value, visual, filter); } return Enumerable.Empty(); } /// /// Enumerates the children of an in the visual tree. /// /// The visual. /// The visual children. public static IEnumerable GetVisualChildren(this IVisual visual) { return visual.VisualChildren; } /// /// Enumerates the descendants of an in the visual tree. /// /// The visual. /// The visual's ancestors. public static IEnumerable GetVisualDescendants(this IVisual visual) { foreach (IVisual child in visual.VisualChildren) { yield return child; foreach (IVisual descendant in child.GetVisualDescendants()) { yield return descendant; } } } /// /// Enumerates an and its descendants in the visual tree. /// /// The visual. /// The visual and its ancestors. public static IEnumerable GetSelfAndVisualDescendants(this IVisual visual) { yield return visual; foreach (var ancestor in visual.GetVisualDescendants()) { yield return ancestor; } } /// /// Gets the visual parent of an . /// /// The visual. /// The parent, or null if the visual is unparented. public static IVisual? GetVisualParent(this IVisual visual) { return visual.VisualParent; } /// /// Gets the visual parent of an . /// /// The type of the visual parent. /// The visual. /// /// The parent, or null if the visual is unparented or its parent is not of type . /// public static T? GetVisualParent(this IVisual visual) where T : class { return visual.VisualParent as T; } /// /// Gets the root visual for an . /// /// The visual. /// /// The root visual or null if the visual is not rooted. /// public static IRenderRoot? GetVisualRoot(this IVisual visual) { _ = visual ?? throw new ArgumentNullException(nameof(visual)); return visual as IRenderRoot ?? visual.VisualRoot; } /// /// Tests whether an is an ancestor of another visual. /// /// The visual. /// The potential descendant. /// /// True if is an ancestor of ; /// otherwise false. /// public static bool IsVisualAncestorOf(this IVisual visual, IVisual target) { IVisual? current = target?.VisualParent; while (current != null) { if (current == visual) { return true; } current = current.VisualParent; } return false; } public static IEnumerable SortByZIndex(this IEnumerable elements) { return elements .Select((element, index) => new ZOrderElement { Element = element, Index = index, ZIndex = element.ZIndex, }) .OrderBy(x => x, ZOrderElement.Comparer) .Select(x => x.Element!); } private static T? FindDescendantOfTypeCore(IVisual visual) where T : class { var visualChildren = visual.VisualChildren; var visualChildrenCount = visualChildren.Count; for (var i = 0; i < visualChildrenCount; i++) { IVisual child = visualChildren[i]; if (child is T result) { return result; } var childResult = FindDescendantOfTypeCore(child); if (!(childResult is null)) { return childResult; } } return null; } private class ZOrderElement : IComparable { public IVisual? Element { get; set; } public int Index { get; set; } public int ZIndex { get; set; } class ZOrderComparer : IComparer { public int Compare(ZOrderElement? x, ZOrderElement? y) { if (ReferenceEquals(x, y)) return 0; if (ReferenceEquals(null, y)) return 1; if (ReferenceEquals(null, x)) return -1; return x.CompareTo(y); } } public static IComparer Comparer { get; } = new ZOrderComparer(); public int CompareTo(ZOrderElement? other) { if (other is null) return 1; var z = other.ZIndex - ZIndex; if (z != 0) { return z; } else { return other.Index - Index; } } } } }