That-One-Nerd/SrcMod
1
0
Fork 0
Code Issues 30 Pull Requests Actions Packages Projects Releases 9 Wiki Activity

Reworked the vkv tree node. I think I'm done with it?

Browse Source
This commit is contained in:
That_One_Nerd 2023-05-30 09:02:07 -04:00
parent e5e34e248e
commit 7cc36c1401
1 changed files with 92 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

103
SrcMod/Valve.NET/Vkv/VkvTreeNode.cs
View File

@ -1,27 +1,63 @@
namespace Valve.Vkv; namespace Valve.Vkv;
public class VkvTreeNode : VkvNode, IEnumerable<KeyValuePair<string, VkvNode?>> public class VkvTreeNode : VkvNode, IEnumerable<KeyValuePair<string, VkvNode>>
{ {
public int SubNodeCount => p_subNodes.Count; public int SubNodeCount => p_subNodes.Count;
private readonly Dictionary<string, VkvNode?> p_subNodes; // These should never get out of sync, or bad things will happen.
private readonly List<string> p_subNodeKeys;
private readonly List<VkvNode> p_subNodes;
public VkvTreeNode(Dictionary<string, VkvNode?>? subNodes = null) : base() public VkvTreeNode(Dictionary<string, VkvNode?>? subNodes = null) : base()
{ {
p_subNodes = subNodes ?? new(); p_subNodeKeys = new();
p_subNodes = new();
if (subNodes is not null)
{
for (int i = 0; i < subNodes.Count; i++)
{
string key = subNodes.Keys.ElementAt(i);
VkvNode? value = subNodes.Values.ElementAt(i);
if (value is not null)
{
p_subNodeKeys.Add(key);
p_subNodes.Add(value);
}
}
}
} }
public VkvNode? this[string key] public VkvNode? this[string key]
{ {
get get
{ {
if (p_subNodes.TryGetValue(key, out VkvNode? value)) return value; int index = p_subNodeKeys.IndexOf(key);
else return null;
if (index == -1) return null;
else return p_subNodes[index];
} }
set set
{ {
if (p_subNodes.ContainsKey(key)) p_subNodes[key] = value; int index = p_subNodeKeys.IndexOf(key);
else p_subNodes.Add(key, value);
if (index == -1)
{
if (value is null) return;
p_subNodeKeys.Add(key);
p_subNodes.Add(value);
}
else
{
if (value is null)
{
p_subNodeKeys.RemoveAt(index);
p_subNodes.RemoveAt(index);
}
else p_subNodes[index] = value;
}
} }
} }
public VkvNode? this[int index] public VkvNode? this[int index]
@ -29,17 +65,62 @@ public class VkvTreeNode : VkvNode, IEnumerable<KeyValuePair<string, VkvNode?>>
get get
{ {
if (p_subNodes.Count >= index || index < 0) return null; if (p_subNodes.Count >= index || index < 0) return null;
return p_subNodes.Values.ElementAt(index); return p_subNodes[index];
} }
set set
{ {
if (p_subNodes.Count >= index || index < 0) throw new IndexOutOfRangeException(); if (p_subNodes.Count >= index || index < 0) throw new IndexOutOfRangeException();
p_subNodes[p_subNodes.Keys.ElementAt(index)] = value;
if (value is null)
{
p_subNodeKeys.RemoveAt(index);
p_subNodes.RemoveAt(index);
}
else p_subNodes[index] = value;
}
}
public KeyValuePair<string, VkvNode>? this[Func<int, KeyValuePair<string, VkvNode>, bool> predicate]
{
get
{
for (int i = 0; i < SubNodeCount; i++)
{
KeyValuePair<string, VkvNode> pair = new(p_subNodeKeys[i], p_subNodes[i]);
if (predicate(i, pair)) return pair;
}
return null;
}
set
{
for (int i = 0; i < SubNodeCount; i++)
{
KeyValuePair<string, VkvNode> pair = new(p_subNodeKeys[i], p_subNodes[i]);
if (predicate(i, pair))
{
if (value.HasValue)
{
p_subNodeKeys[i] = value.Value.Key;
p_subNodes[i] = value.Value.Value;
}
else
{
p_subNodeKeys.RemoveAt(i);
p_subNodes.RemoveAt(i);
i--;
}
}
}
} }
} }
public void Add(string key, VkvNode? value) => this[key] = value; public void Add(string key, VkvNode value) => this[key] = value;
IEnumerator IEnumerable.GetEnumerator() => GetEnumerator(); IEnumerator IEnumerable.GetEnumerator() => GetEnumerator();
public IEnumerator<KeyValuePair<string, VkvNode?>> GetEnumerator() => p_subNodes.GetEnumerator(); public IEnumerator<KeyValuePair<string, VkvNode>> GetEnumerator()
{
for (int i = 0; i < SubNodeCount; i++)
{
yield return new(p_subNodeKeys[i], p_subNodes[i]);
}
}
} }