|
@@ -45,7 +45,7 @@ public:
|
|
|
RingQueue(long size, T defaultValue);
|
|
|
~RingQueue();
|
|
|
|
|
|
- /* 入队,默认是阻塞入队 */
|
|
|
+ /* 入队,默认是阻塞入队,队列满就阻塞住,直到有位置 */
|
|
|
void push(const T& value);
|
|
|
void push(T&& value);
|
|
|
bool push_noBlock(const T& value);
|
|
@@ -415,7 +415,7 @@ T RingQueue<T>::front_pop()
|
|
|
m_rear = -1;
|
|
|
}
|
|
|
m_cond_NoFull.notify_all();
|
|
|
- return m_queue[front];
|
|
|
+ return std::move(m_queue[front]);
|
|
|
}
|
|
|
}
|
|
|
|
|
@@ -465,7 +465,7 @@ T RingQueue<T>::front_pop_noBlock()
|
|
|
m_rear = -1;
|
|
|
}
|
|
|
m_cond_NoFull.notify_all();
|
|
|
- return m_queue[front];
|
|
|
+ return std::move(m_queue[front]);
|
|
|
}
|
|
|
}
|
|
|
|