Lines Matching refs:queue
18 #include "platform/queuepool/queue.h"
48 * @tc.desc: Get singleton of queue pool.
62 * @tc.desc: Pop a queue from queue pool.
70 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
71 ASSERT_NE(queue, nullptr);
78 * @tc.desc: Get the singleton of queue pool and test the number of busy queues.
94 * @tc.desc: Test the number of busy queues when pop a queue.
102 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
103 ASSERT_NE(queue, nullptr);
112 * @tc.desc: Pop a queue first, then push a queue to Test the busy queue number.
120 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
121 ASSERT_NE(queue, nullptr);
122 queuePool->Push(queue);
131 * @tc.desc: Release singleton of queue pool.
147 * @tc.desc: Test the capacity of queue pool.
156 std::shared_ptr<Queue<int>> queue;
158 queue = queuePool->Pop();
159 ASSERT_NE(queue, nullptr);
162 queue = queuePool->Pop();
163 ASSERT_EQ(queue, nullptr);
170 * @tc.desc: Push a queue to test whether the busy queue is abnormal.
179 std::shared_ptr<Queue<int>> queue;
180 queuePool->Push(queue);
189 * @tc.desc: Pop a queue and verify it is empty.
197 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
199 bool empty = queue->IsEmpty();
215 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
216 ASSERT_NE(queue, nullptr);
219 queue->PushBack(iv);
220 bool notEmpty = !queue->IsEmpty();
228 * @tc.desc: Fill up a queue and test if it is full.
236 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
237 ASSERT_NE(queue, nullptr);
240 queue->PushBack(i);
242 ASSERT_TRUE(queue->IsFull());
249 * @tc.desc: Pop a queue and verify it is not full.
257 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
258 ASSERT_NE(queue, nullptr);
259 ASSERT_FALSE(queue->IsFull());
266 * @tc.desc: Push back an element and verify the queue is not full.
274 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
275 ASSERT_NE(queue, nullptr);
278 queue->PushBack(iv);
279 ASSERT_FALSE(queue->IsFull());
286 * @tc.desc: Push back an element into queue.
294 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
295 ASSERT_NE(queue, nullptr);
298 int result = queue->PushBack(iv);
306 * @tc.desc: Push back elements that exceed the capacity of queue, and verify the queue is full.
314 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
315 ASSERT_NE(queue, nullptr);
319 result = queue->PushBack(i);
324 result = queue->PushBack(iv);
332 * @tc.desc: Pop Front element of empty queue.
340 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
341 ASSERT_NE(queue, nullptr);
344 int result = queue->PopFront(iv);
352 * @tc.desc: Push back an element into queue, then pop it and verify its value.
360 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
361 ASSERT_NE(queue, nullptr);
364 queue->PushBack(iv);
365 int result = queue->PopFront(iv);
374 * @tc.desc: Test the availability of queue under capacity constraints.
382 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
383 ASSERT_NE(queue, nullptr);
387 result = queue->PushBack(i);
393 result = queue->PopFront(iv);
403 * @tc.desc: Test the count of element in the empty queue.
411 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
412 ASSERT_NE(queue, nullptr);
413 int count = queue->Count();
421 * @tc.desc: Test capacity limit of queue.
429 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
430 ASSERT_NE(queue, nullptr);
436 queue->PushBack(i);
437 count = queue->Count();
441 queue->PushBack(i);
442 count = queue->Count();
450 * @tc.desc: Test the count of element in the queue when push back and pop repeatedly.
458 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
459 ASSERT_NE(queue, nullptr);
462 queue->PushBack(i);
468 queue->PopFront(iv);
469 count = queue->Count();
473 queue->PopFront(iv);
474 count = queue->Count();
482 * @tc.desc: Pop more than one queue.
490 std::shared_ptr<Queue<int>> queue = queuePool->Pop();
491 ASSERT_NE(queue, nullptr);
493 queuePool->Push(queue);
495 queue = queuePool->Pop();
496 ASSERT_NE(queue, nullptr);