REDCODE/SlaveMatrix-SDL
Public Access
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

linting

Browse Source 
removed some dead code and fixed a few bugs i introduced
This commit is contained in:
lewd-alt
2025-08-03 13:09:54 -07:00
parent 300f10dbd7
commit 8fb31d38bb
46 changed files with 160 additions and 73842 deletions
Download Patch File Download Diff File Expand all files Collapse all files

92
2DGAMELIB/_2DGAMELIB/OrderedDictionary.cs
View File

@@ -56,22 +56,11 @@ namespace _2DGAMELIB
values = new Dictionary<T1, T2>();
}
public OrderedDictionary(int capacity)
{
keys = new List<T1>(capacity);
values = new Dictionary<T1, T2>(capacity);
}
public int IndexOf(T1 Key)
{
return keys.IndexOf(Key);
}
public int IndexOf(ref T1 Key)
{
return keys.IndexOf(Key);
}
public int IndexOf(T2 Value)
{
int num = 0;
@@ -86,30 +75,11 @@ namespace _2DGAMELIB
return -1;
}
public int IndexOf(ref T2 Value)
{
int num = 0;
foreach (T2 value in Values)
{
if (value.Equals(Value))
{
return num;
}
num++;
}
return -1;
}
public int LastIndexOf(T1 Key)
{
return keys.LastIndexOf(Key);
}
public int LastIndexOf(ref T1 Key)
{
return keys.LastIndexOf(Key);
}
public int LastIndexOf(T2 Value)
{
int num = keys.Count - 1;
@@ -124,84 +94,22 @@ namespace _2DGAMELIB
return -1;
}
public int LastIndexOf(ref T2 Value)
{
int num = keys.Count - 1;
foreach (T2 item in Values.Reverse())
{
if (item.Equals(Value))
{
return num;
}
num--;
}
return -1;
}
public void Add(T1 Key, T2 Value)
{
keys.Add(Key);
values.Add(Key, Value);
}
public void Add(ref T1 Key, ref T2 Value)
{
keys.Add(Key);
values.Add(Key, Value);
}
public void Insert(int Index, T1 Key, T2 Value)
{
keys.Insert(Index, Key);
values.Add(Key, Value);
}
public void Insert(int Index, ref T1 Key, ref T2 Value)
{
keys.Insert(Index, Key);
values.Add(Key, Value);
}
public void Remove(T1 Key)
{
keys.Remove(Key);
values.Remove(Key);
}
public void Remove(ref T1 Key)
{
keys.Remove(Key);
values.Remove(Key);
}
public void Reverse()
{
keys.Reverse();
}
public void Reverse(int Index, int Count)
{
keys.Reverse(Index, Count);
}
public bool ContainsKey(T1 Key)
{
return values.ContainsKey(Key);
}
public bool ContainsKey(ref T1 Key)
{
return values.ContainsKey(Key);
}
public bool ContainsValue(T2 Value)
{
return values.ContainsValue(Value);
}
public bool ContainsValue(ref T2 Value)
{
return values.ContainsValue(Value);
}
}
}