Checks if the queue is empty The original segmented queue algorithm does not allow to check emptiness accurately because \p empty() is unlinearizable. This function tests queue's emptiness checking size() == 0 , so, the item counting feature is an essential part of queue's algorithm. */
| 375 | so, the item counting feature is an essential part of queue's algorithm. |
| 376 | */ |
| 377 | bool empty() const |
| 378 | { |
| 379 | return base_class::empty(); |
| 380 | } |
| 381 | |
| 382 | /// Clear the queue |
| 383 | /** |