*/
#include <stddef.h>
#include <dpl/binary_queue.h>
-#include <dpl/assert.h>
+#include <cassert>
#include <algorithm>
#include <functional>
#include <malloc.h>
size_t bytesLeft = bufferSize;
void *ptr = buffer;
BucketList::const_iterator bucketIterator = m_buckets.begin();
- Assert(m_buckets.end() != bucketIterator);
+ assert(m_buckets.end() != bucketIterator);
// Flatten data
while (bytesLeft > 0) {
deleter(dataDeleter),
param(userParam)
{
- Assert(data != NULL);
- Assert(deleter != NULL);
+ assert(data != NULL);
+ assert(deleter != NULL);
}
BinaryQueue::Bucket::~Bucket()
void BinaryQueue::VisitBuckets(BucketVisitor *visitor) const
{
- Assert(visitor != NULL);
+ assert(visitor != NULL);
// Visit all buckets
std::for_each(m_buckets.begin(), m_buckets.end(), BucketVisitorCall(visitor));