aboutsummaryrefslogtreecommitdiff
path: root/Ryujinx.Memory/WindowsShared/MappingTree.cs
diff options
context:
space:
mode:
authorTSR Berry <20988865+TSRBerry@users.noreply.github.com>2023-04-08 01:22:00 +0200
committerMary <thog@protonmail.com>2023-04-27 23:51:14 +0200
commitcee712105850ac3385cd0091a923438167433f9f (patch)
tree4a5274b21d8b7f938c0d0ce18736d3f2993b11b1 /Ryujinx.Memory/WindowsShared/MappingTree.cs
parentcd124bda587ef09668a971fa1cac1c3f0cfc9f21 (diff)
Move solution and projects to src
Diffstat (limited to 'Ryujinx.Memory/WindowsShared/MappingTree.cs')
-rw-r--r--Ryujinx.Memory/WindowsShared/MappingTree.cs87
1 files changed, 0 insertions, 87 deletions
diff --git a/Ryujinx.Memory/WindowsShared/MappingTree.cs b/Ryujinx.Memory/WindowsShared/MappingTree.cs
deleted file mode 100644
index 97758c2b..00000000
--- a/Ryujinx.Memory/WindowsShared/MappingTree.cs
+++ /dev/null
@@ -1,87 +0,0 @@
-using Ryujinx.Common.Collections;
-using System;
-
-namespace Ryujinx.Memory.WindowsShared
-{
- /// <summary>
- /// A intrusive Red-Black Tree that also supports getting nodes overlapping a given range.
- /// </summary>
- /// <typeparam name="T">Type of the value stored on the node</typeparam>
- class MappingTree<T> : IntrusiveRedBlackTree<RangeNode<T>>
- {
- private const int ArrayGrowthSize = 16;
-
- public int GetNodes(ulong start, ulong end, ref RangeNode<T>[] overlaps, int overlapCount = 0)
- {
- RangeNode<T> node = this.GetNodeByKey(start);
-
- for (; node != null; node = node.Successor)
- {
- if (overlaps.Length <= overlapCount)
- {
- Array.Resize(ref overlaps, overlapCount + ArrayGrowthSize);
- }
-
- overlaps[overlapCount++] = node;
-
- if (node.End >= end)
- {
- break;
- }
- }
-
- return overlapCount;
- }
- }
-
- class RangeNode<T> : IntrusiveRedBlackTreeNode<RangeNode<T>>, IComparable<RangeNode<T>>, IComparable<ulong>
- {
- public ulong Start { get; }
- public ulong End { get; private set; }
- public T Value { get; }
-
- public RangeNode(ulong start, ulong end, T value)
- {
- Start = start;
- End = end;
- Value = value;
- }
-
- public void Extend(ulong sizeDelta)
- {
- End += sizeDelta;
- }
-
- public int CompareTo(RangeNode<T> other)
- {
- if (Start < other.Start)
- {
- return -1;
- }
- else if (Start <= other.End - 1UL)
- {
- return 0;
- }
- else
- {
- return 1;
- }
- }
-
- public int CompareTo(ulong address)
- {
- if (address < Start)
- {
- return 1;
- }
- else if (address <= End - 1UL)
- {
- return 0;
- }
- else
- {
- return -1;
- }
- }
- }
-} \ No newline at end of file