static void Main()
{
set = new RankedSet <int>()
{
Capacity = 5
};
Console.WriteLine("Create sequentially loaded tree of order 5:");
for (int i = 2; i <= 10; i += 2)
{
set.Add(i);
}
WriteInfo(true);
Console.WriteLine("Add 12-40:");
for (int i = 12; i <= 40; i += 2)
{
set.Add(i);
}
WriteInfo(true);
Console.WriteLine("Add 42:");
set.Add(42);
WriteInfo(true);
}
static void Main()
{
set = new RankedSet <int>()
{
Capacity = 4
};
Console.WriteLine("Empty tree is a single leaf:");
WriteInfo(true);
Console.WriteLine("Create sequentially loaded tree of order 4:");
for (int i = 2; i <= 24; i += 2)
{
set.Add(i);
}
WriteInfo(true);
Console.WriteLine("Cascade split by adding 17:");
set.Add(17);
WriteInfo();
Console.WriteLine("Split a leaf by adding 3:");
set.Add(3);
WriteInfo();
Console.WriteLine("Create non-rightmost branch with 2 children by adding 9:");
set.Add(9);
WriteInfo();
Console.WriteLine("Cascade coalesce by removing 2:");
set.Remove(2);
WriteInfo();
}
public void UnitRsc_SetEquals2()
{
#if TEST_BCL
var cp = SortedSet <User> .CreateSetComparer();
var user1 = new SortedSet <User>(new UserComparer());
var user2 = new SortedSet <User>(new UserComparer());
#else
var cp = RankedSet <User> .CreateSetComparer();
var user1 = new RankedSet <User>(new UserComparer());
var user2 = new RankedSet <User>(new UserComparer());
#endif
bool eq0 = cp.Equals(user1, user2);
Assert.IsTrue(eq0);
user1.Add(new User("admin"));
user2.Add(new User("tester"));
bool eq1 = cp.Equals(user1, user2);
Assert.IsFalse(eq1);
user1.Add(new User("tester"));
user2.Add(new User("admin"));
bool eq2 = cp.Equals(user1, user2);
Assert.IsTrue(eq2);
}
static void Main()
{
var musicians = new RankedSet <string> (StringComparer.InvariantCultureIgnoreCase);
foreach (var m1 in new string[] { "Falco", "k.d. lang", "Madonna", "Tom Petty",
"Joni Mitchell", "Grimes", "Warren Zevon" })
{
musicians.Add(m1);
}
Console.WriteLine("Candidates:");
foreach (var item in musicians)
{
Console.WriteLine($" {item}");
}
musicians.Remove("Falco");
musicians.RemoveWhere(IsPolynymous);
musicians.RemoveRange(1, musicians.Count - 1);
Console.WriteLine("\nFavorite:");
foreach (var item in musicians)
{
Console.WriteLine($" {item}");
}
}
static void Main()
{
set = new RankedSet <int>()
{
Capacity = 6
};
Console.WriteLine("Create sequentially loaded tree of order 6:");
for (int i = 2; i <= 60; i += 2)
{
set.Add(i);
}
WriteInfo(true);
Console.WriteLine("Create rightmost nodes with 1 key by appending 62:");
set.Add(62);
WriteInfo();
Console.WriteLine("Split leaf by adding 5:");
set.Add(5);
WriteInfo();
Console.WriteLine("Split leaf, cascade split branches by adding 25:");
set.Add(25);
WriteInfo();
Console.WriteLine("Balance leaves, replace 2 pivots by removing 6:");
set.Remove(6);
WriteInfo();
Console.WriteLine("Prune leaf by removing 62:");
set.Remove(62);
WriteInfo();
Console.WriteLine("Remove 54-60:");
set.Remove(54);
set.Remove(56);
set.Remove(58);
set.Remove(60);
WriteInfo();
Console.WriteLine("Prune leaf and branch by removing 52:");
set.Remove(52);
WriteInfo();
}
static void Main()
{
set = new RankedSet <int>()
{
Capacity = 4
};
Console.WriteLine("Create tree of order 4:");
for (int i = 2; i <= 50; i += 2)
{
set.Add(i);
}
for (int i = 3; i <= 50; i += 6)
{
set.Add(i);
}
WriteInfo();
Console.WriteLine("Add 29,35:");
set.Add(29);
set.Add(35);
WriteInfo();
Console.WriteLine("Remove 27:");
set.Remove(27);
WriteInfo();
Console.WriteLine("Remove 21:");
set.Remove(21);
WriteInfo();
Console.WriteLine("Remove 22:");
set.Remove(22);
WriteInfo();
Console.WriteLine("Remove 24:");
set.Remove(24);
WriteInfo();
}
static void Main()
{
var set1 = new RankedSet <Person> (new PersonComparer());
set1.Add(new Person("Hugh", "Mann"));
set1.Add(new Person("Hammond", "Egger"));
string fileName = "Persons.bin";
IFormatter formatter = new BinaryFormatter();
SerializePersons(fileName, set1, formatter);
Console.WriteLine($"Wrote {set1.Count} items to file '{fileName}'.");
Console.WriteLine();
RankedSet <Person> set2 = DeserializePersons(fileName, formatter);
Console.WriteLine($"Read back {set2.Count} items:");
foreach (var p2 in set2)
{
Console.WriteLine(p2);
}
}
static void Main()
{
var watch = new Stopwatch();
Console.WriteLine("RankedSet Bulk Add and indexing");
Console.WriteLine($"{divs} increments of {(reps / divs)}");
Console.WriteLine("RankedSet Size;SortedSet Size;RankedSet Add;SortedSet Add;RankedSet ElementAt;SortedSet ELementAt;RankedSetLast;SortedSet Last");
for (int k1 = 0; k1 <= divs; ++k1)
{
int reps0 = k1 == 0 ? reps : (reps / divs) * k1;
rs.Clear();
System.Threading.Thread.Sleep(200);
watch.Reset(); watch.Start();
for (int ix = 0; ix < reps0; ++ix)
{
rs.Add(ix);
}
var loadRs = watch.ElapsedMilliseconds;
ss.Clear();
System.Threading.Thread.Sleep(200);
watch.Reset(); watch.Start();
for (int ix = 0; ix < reps0; ++ix)
{
ss.Add(ix);
}
var loadSs = watch.ElapsedMilliseconds;
watch.Reset(); watch.Start();
var ss1 = ss.Last();
var lastSs = watch.ElapsedMilliseconds;
watch.Reset(); watch.Start();
var ss2 = ss.ElementAt(reps0 - 1);
var elAtSs = watch.ElapsedMilliseconds;
watch.Reset(); watch.Start();
var rs1 = rs.Last();
var lastRs = watch.ElapsedMilliseconds;
watch.Reset(); watch.Start();
var rs2 = rs.ElementAt(reps0 - 1);
var elAtRs = watch.ElapsedMilliseconds;
if (k1 > 0)
{
Console.WriteLine($"{rs.Count,8};{ss.Count,8};{loadRs,5};{loadSs,5};{lastRs,2};{lastSs,4};{elAtRs,2};{elAtSs,4}");
}
}
}
static void Main()
{
int maxN = 500000;
var watch = new Stopwatch();
bool isPass1 = true;
Console.WriteLine("Removals in Thousands,Set Size in Thousands,RankedSet,SortedSet");
for (int n = maxN / 10; n <= maxN;)
{
var c1 = new RankedSet <int>();
for (int i = 0; i < n; ++i)
{
c1.Add(i);
}
watch.Reset(); watch.Start();
c1.RemoveWhere(IsCull);
var c1Time = watch.ElapsedMilliseconds;
int c1Count = c1.Count; c1.Clear();
var c2 = new SortedSet <int>();
for (int i = 0; i < n; ++i)
{
c2.Add(i);
}
watch.Reset(); watch.Start();
c2.RemoveWhere(IsCull);
var c2Time = watch.ElapsedMilliseconds;
int c2Count = c2.Count; c2.Clear();
int removes = n * division / divisionCount;
if (c1Count != n - removes || c2Count != n - removes)
{
Console.WriteLine($"*** ERROR *** {c1Count}, {c2Count}");
}
if (isPass1)
{
isPass1 = false;
}
else
{
Console.WriteLine($"{removes/1000},{n/1000},{c1Time},{c2Time}");
n += maxN / 10;
}
}
}
static void Main()
{
set = new RankedSet <int>()
{
Capacity = 5
};
Console.WriteLine("Create sequentially loaded tree of order 5:");
for (int i = 2; i <= 66; i += 2)
{
set.Add(i);
}
WriteInfo();
Console.WriteLine("Thin the tree by removing several keys:");
foreach (int i in new int[] { 4, 6, 14, 16, 18, 20, 22, 24, 26, 30, 36, 38, 46 })
{
set.Remove(i);
}
WriteInfo();
Console.WriteLine("Coalesce leaves, balance branches by removing 12:");
set.Remove(12);
WriteInfo();
Console.WriteLine("Change a branch by removing 10:");
set.Remove(10);
WriteInfo();
Console.WriteLine("Change the root by removing 50:");
set.Remove(50);
WriteInfo();
Console.WriteLine("Coalesce leaves by removing 40:");
set.Remove(40);
WriteInfo();
Console.WriteLine("Prune rightmost leaf by removing 66:");
set.Remove(66);
WriteInfo();
Console.WriteLine("Coalesce leaves and branches, prune root by removing 8:");
set.Remove(8);
WriteInfo();
}
static void Main()
{
for (int width = 1; ; ++width)
{
Console.Write(width + " ");
for (int count = 0; count <= width; ++count)
{
for (int index = 0; index <= width - count; ++index)
{
for (int order = 4; order <= 7; ++order)
{
set = new RankedSet <int> {
Capacity = order
};
for (int ii = 0; ii < width; ++ii)
{
set.Add(ii);
}
try
{
set.RemoveRange(index, count);
Debug.Assert(set.Count == width - count);
Debug.Assert(set.Count == set.Count());
Debug.Assert(set.Count == set.Reverse().Count());
#if DEBUG
set.SanityCheck();
#endif
}
catch (Exception)
{
Console.WriteLine($"\nwidth={width}, index={index}, count={count}, order={order}");
throw;
}
}
}
}
}
}
static void Main()
{
for (int i = 1; i <= 12; i += 1)
{
var set = new RankedSet <int>()
{
Capacity = 4
};
foreach (int kk in new int[] { 3, 5, 6, 7, 9, 10, 11 })
{
set.Add(kk);
}
set.Remove(6); set.Remove(10);
WriteInfo(set);
set.SymmetricExceptWith(new int[] { i });
Console.WriteLine("SymmetricExceptWith " + i + ":");
WriteInfo(set);
Console.WriteLine("----");
}
}
static void Main()
{
set = new RankedSet <int>()
{
Capacity = 4
};
Console.WriteLine("Create sequentially loaded tree of order 4:");
for (int i = 2; i <= 44; i += 2)
{
set.Add(i);
}
WriteInfo();
Console.WriteLine("Add 1,21:");
set.Add(1);
set.Add(21);
WriteInfo();
Console.WriteLine("Add 9:");
set.Add(9);
WriteInfo();
Console.WriteLine("Add 27:");
set.Add(27);
WriteInfo();
Console.WriteLine("Remove 44:");
set.Remove(44);
WriteInfo();
Console.WriteLine("Remove 40,42:");
set.Remove(40);
set.Remove(42);
WriteInfo();
Console.WriteLine("Remove 38:");
set.Remove(38);
WriteInfo();
Console.WriteLine("Remove 34,36:");
set.Remove(34);
set.Remove(36);
WriteInfo();
Console.WriteLine("Remove 32:");
set.Remove(32);
WriteInfo();
Console.WriteLine("Remove 28:");
set.Remove(28);
WriteInfo();
Console.WriteLine("Seek 30:");
var isOk = set.Contains(30);
Console.WriteLine();
Console.WriteLine("Result = " + isOk);
Console.WriteLine();
Console.WriteLine("Remove 30:");
set.Remove(30);
WriteInfo();
}
static void Main()
{
Console.WriteLine("RankedBag: ");
#region RbSkip
var bag = new RankedSet <int>()
{
295
};
for (var i = 2; i < 500; i += 2)
{
bag.Add(i);
}
foreach (int x in bag.Skip(100).SkipWhile(i => i % 2 == 0).Skip(100))
{
Console.Write($"{x} ");
}
// Output: 494 496 498
#endregion
Console.WriteLine("\nRankedSet: ");
#region RsSkip
var set = new RankedSet <int>()
{
295
};
for (int i = 2; i < 500; i += 2)
{
set.Add(i);
}
foreach (var x in set.Skip(100).SkipWhile(i => i % 2 == 0).Skip(100))
{
Console.Write($"{x} ");
}
// Output: 494 496 498
#endregion
Console.WriteLine("\nRankedDictionary: ");
#region RdSkip
var dary = new RankedDictionary <int, int>()
{
{ 295, -295 }
};
for (int i = 2; i < 500; i += 2)
{
dary.Add(i, -i);
}
foreach (var x in dary.Skip(100).SkipWhile(kv => kv.Key % 2 == 0).Skip(100))
{
Console.Write($"{x} ");
}
// Output: [494, -494] [496, -496] [498, -498]
#endregion
Console.WriteLine("\nRankedDictionary.Keys: ");
#region RdkSkip
var daryk = new RankedMap <int, int>()
{
{ 295, -295 }
};
for (int i = 2; i < 500; i += 2)
{
daryk.Add(i, -i);
}
foreach (var x in daryk.Keys.Skip(100).SkipWhile(k => k % 2 == 0).Skip(100))
{
Console.Write($"{x} ");
}
// Output: 494 496 498
#endregion
Console.WriteLine("\nRankedDictionary.Values: ");
#region RdvSkip
var daryv = new RankedMap <int, int>()
{
{ 295, -295 }
};
for (int i = 2; i < 500; i += 2)
{
daryv.Add(i, -i);
}
foreach (var x in daryv.Values.Skip(100).SkipWhile(k => k % 2 == 0).Skip(100))
{
Console.Write($"{x} ");
}
// Output: -494 -496 -498
#endregion
Console.WriteLine("\nRankedMap: ");
#region RmSkip
var map = new RankedMap <int, int>()
{
{ 295, -295 }
};
for (int i = 2; i < 500; i += 2)
{
map.Add(i, -i);
}
foreach (var x in map.Skip(100).SkipWhile(kv => kv.Key % 2 == 0).Skip(100))
{
Console.Write($"{x} ");
}
// Output: [494, -494] [496, -496] [498, -498]
#endregion
Console.WriteLine("\nRankedMap.Keys: ");
#region RmkSkip
var mapk = new RankedMap <int, int>()
{
{ 295, -295 }
};
for (int i = 2; i < 500; i += 2)
{
mapk.Add(i, -i);
}
foreach (var x in mapk.Keys.Skip(100).SkipWhile(k => k % 2 == 0).Skip(100))
{
Console.Write($"{x} ");
}
// Output: 494 496 498
#endregion
Console.WriteLine("\nRankedMap.Values: ");
#region RmvSkip
var mapv = new RankedMap <int, int>()
{
{ 295, -295 }
};
for (int i = 2; i < 500; i += 2)
{
mapv.Add(i, -i);
}
foreach (var x in mapv.Values.Skip(100).SkipWhile(k => k % 2 == 0).Skip(100))
{
Console.Write($"{x} ");
}
// Output: -494 -496 -498
#endregion
Console.WriteLine();
}
