예제 #1
0
 protected override AListInnerBase <K, KeyValuePair <K, V> > SplitAt(int divAt, out AListNode <K, KeyValuePair <K, V> > right)
 {
     right = new BDictionaryInner <K, V>(this, divAt, LocalCount - divAt, _children[divAt].Index, MaxNodeSize);
     return(new BDictionaryInner <K, V>(this, 0, divAt, 0, MaxNodeSize));
 }
예제 #2
0
 protected BDictionaryInner(BDictionaryInner <K, V> original, int localIndex, int localCount, uint baseIndex, int maxNodeSize) : base(original, localIndex, localCount, baseIndex, maxNodeSize)
 {
 }
예제 #3
0
 protected BDictionaryInner(BDictionaryInner <K, V> original, uint index, uint count, AListBase <K, KeyValuePair <K, V> > list) : base(original, index, count, list)
 {
 }
예제 #4
0
 protected BDictionaryInner(BDictionaryInner <K, V> frozen) : base(frozen)
 {
 }