summaryrefslogtreecommitdiff
path: root/Library/PackageCache/com.unity.timeline@1.2.13/Editor/Utilities/SpacePartitioner.cs
blob: 1539a1d4c2aa6180d541828014dfc5cb52b4ba9f (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
using System;
using System.Collections.Generic;
using UnityEngine;
using UnityEngine.Timeline;

namespace UnityEditor.Timeline
{
    interface IBounds
    {
        Rect boundingRect { get; }
    }

    class SpacePartitioner
    {
        internal class CachedList<T>
        {
            public static readonly List<T> Instance = new List<T>(1000);
        }

        struct Entry : IInterval
        {
            public object item { get; set; }
            public long intervalStart { get; set; }
            public long intervalEnd { get; set; }
            public Rect bounds { get; set; }

            private const float kPrecision = 100.0f;
            private const float kMaxFloat = (float)long.MaxValue;
            private const float kMinFloat = (float)long.MinValue;

            static public Int64 FromFloat(float f)
            {
                if (Single.IsPositiveInfinity(f))
                    return long.MaxValue;
                if (Single.IsNegativeInfinity(f))
                    return long.MinValue;

                f = Mathf.Clamp(f, kMinFloat, kMaxFloat);              // prevent overflow of floats
                f = Mathf.Clamp(f * kPrecision, kMinFloat, kMaxFloat); // clamp to 'long' range
                return (long)(f);
            }
        }

        const EventType k_GuiEventLock = EventType.Repaint;

        IntervalTree<Entry> m_Tree = new IntervalTree<Entry>();
        List<Entry> m_CacheList = new List<Entry>();

        public void Clear()
        {
            m_Tree.Clear();
        }

        public void AddBounds(IBounds bounds)
        {
            AddBounds(bounds, bounds.boundingRect);
        }

        public void AddBounds(object item, Rect rect)
        {
            if (item == null)
                throw new ArgumentNullException("item");

            m_Tree.Add(new Entry()
            {
                intervalStart = Entry.FromFloat(rect.yMin),
                intervalEnd = Entry.FromFloat(rect.yMax),
                bounds = rect,
                item = item
            }
            );
        }

        /// <summary>
        /// Get items of type T at a given position
        /// </summary>
        /// <param name="position"></param>
        /// <param name="inClipSpace"></param>
        /// <typeparam name="T"></typeparam>
        /// <remarks>
        /// Uses a (1,1) sized box
        /// Use .ToList() or .ToArray() when not enumerating the result immediately
        /// </remarks>
        /// <returns></returns>
        public IEnumerable<T> GetItemsAtPosition<T>(Vector2 position)
        {
            return GetItemsInArea<T>(new Rect(position.x, position.y, 1, 1));
        }

        /// <summary>
        ///
        /// </summary>
        /// <param name="area"></param>
        /// <param name="inClipSpace"></param>
        /// <typeparam name="T"></typeparam>
        /// <returns></returns>
        public IEnumerable<T> GetItemsInArea<T>(Rect area)
        {
            m_CacheList.Clear();
            m_Tree.IntersectsWithRange(long.MinValue, long.MaxValue, m_CacheList);

            var list = CachedList<T>.Instance;
            list.Clear();
            foreach (var i in m_CacheList)
            {
                if (i.item is T && i.bounds.Overlaps(area))
                    list.Add((T)i.item);
            }
            return list;
        }

        public void DebugDraw()
        {
            var kFillColor = new Color(1.0f, 1.0f, 1.0f, 0.1f);
            var kOutlineColor = Color.yellow;

            m_CacheList.Clear();
            m_Tree.IntersectsWithRange(long.MinValue, long.MaxValue, m_CacheList);
            HandleUtility.ApplyWireMaterial();

            foreach (var item in m_CacheList)
            {
                Handles.DrawSolidRectangleWithOutline(item.bounds, kFillColor, kOutlineColor);
            }
        }
    }
}