| 204 | } |
| 205 | |
| 206 | void ByteQueue::Clear() |
| 207 | { |
| 208 | for (ByteQueueNode *next, *current=m_head->next; current; current=next) |
| 209 | { |
| 210 | next=current->next; |
| 211 | delete current; |
| 212 | } |
| 213 | |
| 214 | m_tail = m_head; |
| 215 | m_head->Clear(); |
| 216 | m_head->next = NULL; |
| 217 | m_lazyLength = 0; |
| 218 | } |
| 219 | |
| 220 | size_t ByteQueue::Put2(const byte *inString, size_t length, int messageEnd, bool blocking) |
| 221 | { |