protected override AListInnerBase <int, T> SplitRoot(AListNode <int, T> left, AListNode <int, T> right)
{
return(new AListInner <T>(left, right, _maxInnerSize));
}
protected SparseAList(AListBase <int, T> original, AListNode <int, T> section) : base(original, section)
{
}
public void NodeAdded(AListNode <K, T> child, AListInnerBase <K, T> parent)
{
NodeCount++;
}
public void NodeRemoved(AListNode <K, T> child, AListInnerBase <K, T> parent)
{
NodeCount--;
}
public void Detach(AListBase <K, T> list, AListNode <K, T> root)
{
throw new NotImplementedException(); // should not be called
}
protected BList(BList <T> original, AListNode <T, T> section)
: base(original, section)
{
_compareItems = original._compareItems;
}
void IAListTreeObserver <K, T> .RemoveAll(AListNode <K, T> node) => Forget(node);
void IAListTreeObserver <K, T> .NodeRemoved(AListNode <K, T> child, AListInnerBase <K, T> parent) => Forget(parent);
void IAListTreeObserver <K, T> .AddAll(AListNode <K, T> node)
{
}
protected override AListInnerBase <K, KeyValuePair <K, V> > SplitRoot(AListNode <K, KeyValuePair <K, V> > left, AListNode <K, KeyValuePair <K, V> > right)
{
return(new BDictionaryInner <K, V>(left, right, _maxInnerSize));
}
protected BDictionary(BDictionary <K, V> original, AListNode <K, KeyValuePair <K, V> > section)
: base(original, section)
{
_compareKeys = original._compareKeys;
}