예제 #1
0
 ConcurrentPriorityQueue(int initialCapacity)
 {
     __heap = new ConcurrentBinaryMinHeap <T>(initialCapacity);
     __numQueuedItemsLock = new object();
     NumQueuedItems       = 0L;
 }
예제 #2
0
 ConcurrentPriorityQueue()
 {
     __heap = new ConcurrentBinaryMinHeap <T>();
     __numQueuedItemsLock = new object();
     NumQueuedItems       = 0L;
 }