#include <stddef.h>
#include <dpl/binary_queue.h>
#include <dpl/assert.h>
-#include <dpl/scoped_free.h>
+#include <dpl/free_deleter.h>
+#include <memory>
#include <algorithm>
#include <malloc.h>
#include <cstring>
Clear();
}
-const BinaryQueue &BinaryQueue::operator=(const BinaryQueue &other)
+BinaryQueue &BinaryQueue::operator=(const BinaryQueue &other)
{
if (this != &other) {
Clear();
// Simulate input stream
size_t available = std::min(size, m_size);
- ScopedFree<void> bufferCopy(malloc(available));
+ std::unique_ptr<void,free_deleter> bufferCopy(malloc(available));
if (!bufferCopy) {
throw std::bad_alloc();
BinaryQueueAutoPtr result(new BinaryQueue());
- Flatten(bufferCopy.Get(), available);
+ Flatten(bufferCopy.get(), available);
result->AppendUnmanaged(
- bufferCopy.Get(), available, &BufferDeleterFree, NULL);
- bufferCopy.Release();
+ bufferCopy.get(), available, &BufferDeleterFree, NULL);
+ bufferCopy.release();
Consume(available);
return result;