amacocian/SystemExtensions
1
0
Fork 0
mirror of https://github.com/AlexMacocian/SystemExtensions.git synced 2026-07-24 03:56:27 +00:00
Code Issues Packages Projects Releases Wiki Activity

Modified Add method for consistency

Browse Source
This commit is contained in:
Alexandru Victor Macocian
2019-06-20 12:08:34 +02:00
parent 047635723b
commit c2a5860867
5 changed files with 33 additions and 33 deletions
Download Patch File Download Diff File Expand all files Collapse all files
SystemExtensionsTests/Collections/BinaryHeapTests.cs
+8 -8
View File
@@ -40,7 +40,7 @@ namespace SystemExtensions.Collections.Tests
{
for (int i = 0; i < 100; i++)
{
binaryHeap.Insert(i * 20 - (50 + i));
binaryHeap.Add(i * 20 - (50 + i));
}
}
catch (Exception e)
@@ -81,7 +81,7 @@ namespace SystemExtensions.Collections.Tests
{
for (int i = 0; i < 1000; i++)
{
binaryHeap.Insert(i);
binaryHeap.Add(i);
}
if (binaryHeap.Min != 0 || binaryHeap.Max != 999)
{
@@ -94,7 +94,7 @@ namespace SystemExtensions.Collections.Tests
{
for (int i = 0; i < 100; i++)
{
binaryHeap.Insert(i);
binaryHeap.Add(i);
}
binaryHeap.Clear();
if (binaryHeap.Count > 0 || binaryHeap.Capacity != 160)
@@ -108,7 +108,7 @@ namespace SystemExtensions.Collections.Tests
{
for (int i = 100; i < 200; i++)
{
binaryHeap.Insert(i);
binaryHeap.Add(i);
}
binaryHeap.Clear(false);
int[] array = binaryHeap.ToArray();
@@ -130,7 +130,7 @@ namespace SystemExtensions.Collections.Tests
[TestMethod()]
public void ContainsTest()
{
binaryHeap.Insert(100);
binaryHeap.Add(100);
if (!binaryHeap.Contains(100))
{
Assert.Fail();
@@ -142,7 +142,7 @@ namespace SystemExtensions.Collections.Tests
{
for(int i = 0; i < 1000; i++)
{
binaryHeap.Insert(i);
binaryHeap.Add(i);
}
int[] array = binaryHeap.ToArray();
if(array.Length != binaryHeap.Count)
@@ -160,7 +160,7 @@ namespace SystemExtensions.Collections.Tests
{
for (int i = 0; i < 1000; i++)
{
binaryHeap.Insert(i);
binaryHeap.Add(i);
}
int count = 0;
foreach(int value in binaryHeap)
@@ -183,7 +183,7 @@ namespace SystemExtensions.Collections.Tests
BinaryHeap<int> binaryHeap2 = new BinaryHeap<int>();
for (int i = 0; i < 100; i++)
{
binaryHeap.Insert(i);
binaryHeap.Add(i);
}
BinaryFormatter serializer = new BinaryFormatter();
string s = string.Empty;
SystemExtensionsTests/Collections/FibonacciHeapTests.cs
+17 -17
View File
@@ -20,7 +20,7 @@ namespace SystemExtensions.Collections.Tests
{
for (int i = 0; i < 1000; i++)
{
fibonacciHeap.Insert(i);
fibonacciHeap.Add(i);
}
}
@@ -42,12 +42,12 @@ namespace SystemExtensions.Collections.Tests
for(int i = 0; i < 100; i++)
{
fibonacciHeap1.Insert(i);
fibonacciHeap1.Add(i);
}
for(int i = 100; i < 300; i++)
{
fibonacciHeap2.Insert(i);
fibonacciHeap2.Add(i);
}
fibonacciHeap1.Merge(fibonacciHeap2);
@@ -65,7 +65,7 @@ namespace SystemExtensions.Collections.Tests
{
try
{
fibonacciHeap.RemoveMinimum();
fibonacciHeap.Remove();
Assert.Fail();
}
catch(IndexOutOfRangeException exception)
@@ -78,11 +78,11 @@ namespace SystemExtensions.Collections.Tests
}
for (int i = 0; i < 1000; i++)
{
fibonacciHeap.Insert(i);
fibonacciHeap.Add(i);
}
for (int i = 0; i < 1000; i++)
{
if (fibonacciHeap.RemoveMinimum() != i)
if (fibonacciHeap.Remove() != i)
{
Assert.Fail();
}
@@ -92,16 +92,16 @@ namespace SystemExtensions.Collections.Tests
[TestMethod()]
public void DecreaseKeyTest()
{
fibonacciHeap.Insert(5);
fibonacciHeap.Insert(10);
fibonacciHeap.Insert(7);
fibonacciHeap.Add(5);
fibonacciHeap.Add(10);
fibonacciHeap.Add(7);
fibonacciHeap.DecreaseKey(5, 3);
if(fibonacciHeap.Contains(5) || !fibonacciHeap.Contains(3))
{
Assert.Fail();
}
fibonacciHeap.DecreaseKey(10, 1);
if(fibonacciHeap.RemoveMinimum() != 1)
if(fibonacciHeap.Remove() != 1)
{
Assert.Fail();
}
@@ -112,7 +112,7 @@ namespace SystemExtensions.Collections.Tests
{
for(int i = 0; i < 10000; i++)
{
fibonacciHeap.Insert(i);
fibonacciHeap.Add(i);
}
if (!fibonacciHeap.Contains(5124))
{
@@ -125,9 +125,9 @@ namespace SystemExtensions.Collections.Tests
{
for(int i = 0; i < 10000; i++)
{
fibonacciHeap.Insert(i);
fibonacciHeap.Add(i);
}
fibonacciHeap.RemoveMinimum();
fibonacciHeap.Remove();
fibonacciHeap.Clear();
if(fibonacciHeap.Count > 0)
{
@@ -140,9 +140,9 @@ namespace SystemExtensions.Collections.Tests
{
for(int i = 999; i >= 0; i--)
{
fibonacciHeap.Insert(i);
fibonacciHeap.Add(i);
}
fibonacciHeap.RemoveMinimum();
fibonacciHeap.Remove();
int[] arr = fibonacciHeap.ToArray();
for(int i = 1; i < 512; i++)
@@ -159,7 +159,7 @@ namespace SystemExtensions.Collections.Tests
{
for (int i = 999; i >= 0; i--)
{
fibonacciHeap.Insert(i);
fibonacciHeap.Add(i);
}
int count = 0;
@@ -184,7 +184,7 @@ namespace SystemExtensions.Collections.Tests
FibonacciHeap<int> fibonacciHeap2 = new FibonacciHeap<int>();
for (int i = 0; i < 100; i++)
{
fibonacciHeap.Insert(i);
fibonacciHeap.Add(i);
}
BinaryFormatter serializer = new BinaryFormatter();
string s = string.Empty;