blob: cdb32d8c8c740f6a36e7079cb129e91de01a05fa [file] [log] [blame]
/*
*
* Licensed to the Apache Software Foundation (ASF) under one
* or more contributor license agreements. See the NOTICE file
* distributed with this work for additional information
* regarding copyright ownership. The ASF licenses this file
* to you under the Apache License, Version 2.0 (the
* "License"); you may not use this file except in compliance
* with the License. You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing,
* software distributed under the License is distributed on an
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
* KIND, either express or implied. See the License for the
* specific language governing permissions and limitations
* under the License.
*
*/
#include "qpid/broker/Queue.h"
#include "qpid/broker/FifoDistributor.h"
using namespace qpid::broker;
FifoDistributor::FifoDistributor(Messages& container)
: messages(container) {}
bool FifoDistributor::nextConsumableMessage( Consumer::shared_ptr&, QueuedMessage& next )
{
if (!messages.empty()) {
next = messages.front(); // by default, consume oldest msg
return true;
}
return false;
}
bool FifoDistributor::allocate(const std::string&, const QueuedMessage& )
{
// by default, all messages present on the queue may be allocated as they have yet to
// be acquired.
return true;
}
bool FifoDistributor::nextBrowsableMessage( Consumer::shared_ptr& c, QueuedMessage& next )
{
if (!messages.empty() && messages.next(c->position, next))
return true;
return false;
}
void FifoDistributor::query(qpid::types::Variant::Map&) const
{
// nothing to see here....
}