// Test queue with concurrency. TEST(ThreadSafePriorityQueue, Concurrent) { #define MIN 0 #define MAX 9 #define LEN 11 typedef ThreadSafePriorityQueue<U32, F32, true> MinQueue; typedef ThreadSafePriorityQueue<U32, F32, false> MaxQueue; struct ProducerThread : public Thread { MinQueue& minQueue; MaxQueue& maxQueue; ProducerThread(MinQueue& min, MaxQueue& max) : minQueue(min), maxQueue(max) {} virtual void run(void*) { U32 indices[LEN] = { 2, 7, 4, 6, 1, 5, 3, 8, 6, 9, 0}; F32 priorities[LEN] = {0.2, 0.7, 0.4, 0.6, 0.1, 0.5, 0.3, 0.8, 0.6, 0.9, 0}; for(U32 i = 0; i < LEN; i++) { minQueue.insert(priorities[i], indices[i]); maxQueue.insert(priorities[i], indices[i]); } } }; MinQueue minQueue; MaxQueue maxQueue; ProducerThread producers[] = { ProducerThread(minQueue, maxQueue), ProducerThread(minQueue, maxQueue), ProducerThread(minQueue, maxQueue) }; const U32 len = sizeof(producers) / sizeof(ProducerThread); for(U32 i = 0; i < len; i++) producers[i].start(); for(U32 i = 0; i < len; i++) producers[i].join(); U32 index = MIN; for(U32 i = 0; i < LEN * len; i++) { U32 popped; EXPECT_TRUE(minQueue.takeNext(popped)) << "Failed to pop element from minQueue"; EXPECT_LE(index, popped) << "Element from minQueue was not in sort order"; index = popped; } index = MAX; for(U32 i = 0; i < LEN * len; i++) { U32 popped; EXPECT_TRUE(maxQueue.takeNext(popped)) << "Failed to pop element from maxQueue"; EXPECT_GE(index, popped) << "Element from maxQueue was not in sort order"; index = popped; } #undef MIN #undef MAX #undef LEN }