public Heap()
{
this.allNode = new List <global::CJBasic.ObjectManagement.Trees.Binary.Node <TVal> >();
this._smartRWLocker = null;
this.heapType = global::CJBasic.ObjectManagement.Trees.Binary.HeapType.Max;
this.count = 0;
}
protected SortedArray2()
{
this.lazyCopy = null;
this.minCapacityForShrink = 0x20;
this.array = new T[0x20];
this.validCount = 0;
this.comparer4Key = null;
this.smartRWLocker = new global::CJBasic.Threading.Synchronize.SmartRWLocker();
}
public SortedArray2(IComparer <T> comparer, ICollection <T> collection)
{
this.lazyCopy = null;
this.minCapacityForShrink = 0x20;
this.array = new T[0x20];
this.validCount = 0;
this.comparer4Key = null;
this.smartRWLocker = new global::CJBasic.Threading.Synchronize.SmartRWLocker();
this.comparer4Key = comparer;
this.Rebuild(collection);
}
public SortedArray2(IComparer <TKey> _comparer4Key, IDictionary <TKey, TVal> dictionary)
{
this.lazyCopy = null;
this.comparer4Key = null;
this.minCapacityForShrink = 0x20;
this.keyArray = new TKey[0x20];
this.valArray = new TVal[0x20];
this.validCount = 0;
this.smartRWLocker = new global::CJBasic.Threading.Synchronize.SmartRWLocker();
this.comparer4Key = _comparer4Key;
this.Rebuild(dictionary);
}
public MultiTree()
{
this._smartRWLocker = null;
}
public CompleteBinaryTree()
{
this.allNode = new List <global::CJBasic.ObjectManagement.Trees.Binary.Node <TVal> >();
this._smartRWLocker = null;
this.count = 0;
}
