private static void LoadTree(IOrderedMap <int, int> tree, int count, int[] keys)
{
for (int i = 0; i < count; i++)
{
int key = keys[i];
tree.Add(key, key);
}
}
private void EnumerateCore(IOrderedMap <int, float> map, int count, bool fast)
{
for (int i = 0; i < count; i++)
{
map.Add(i, i);
}
foreach (EntryMap <int, float> entry in fast ? map.GetFastEnumerable() : map.GetRobustEnumerable())
{
}
}
private void BasicMapCore(IOrderedMap <int, float> map, int count)
{
for (int j = 0; j < 2; j++)
{
for (int i = 0; i < count; i++)
{
map.Add(i, i);
}
for (int i = 0; i < count; i++)
{
map.Remove(i);
}
}
}
public override void Add()
{
int key;
do
{
key = random.Next();
} while (reference.ContainsKey(key));
float value = (float)random.NextDouble();
actual.Add(key, value); // throws when capacity locked & exhausted
reference.Add(key, value);
}
public void CouldCompleteObserver(IOrderedMap <int, int> map)
{
var subscriber = new SumValuesObserver();
var series = map as Series <int, int>;
var cursor = (series + series).GetCursor();
cursor.Source.Subscribe(subscriber);
var expectedSum = 0;
for (int i = 0; i < 10; i++)
{
map.Add(i, i);
expectedSum += i;
}
Assert.IsFalse(subscriber.IsCompleted);
map.Complete();
Thread.Sleep(100);
Assert.IsTrue(subscriber.IsCompleted);
Thread.Sleep(1000);
Assert.AreEqual(expectedSum * 2, subscriber.Sum);
}
public void Add(K k, Vdest v)
{
_innerMap.Add(k, _destToSrc(v));
}
public void Add(DateTime k, V v)
{
_map.Add(k.ConvertToUtcWithUncpecifiedKind(_tz), v);
}
