blob: 0e1aef29866a5bbb9385348db72e3902f32d23ba (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
#ifndef QPID_BROKER_MESSAGEDEQUE_H
#define QPID_BROKER_MESSAGEDEQUE_H
/*
*
* 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/Messages.h"
#include "qpid/broker/QueuedMessage.h"
#include <deque>
namespace qpid {
namespace broker {
/**
* Provides the standard FIFO queue behaviour.
*/
class MessageDeque : public Messages
{
public:
size_t size();
bool empty();
void reinsert(const QueuedMessage&);
bool remove(const framing::SequenceNumber&, QueuedMessage&);
bool find(const framing::SequenceNumber&, QueuedMessage&);
bool next(const framing::SequenceNumber&, QueuedMessage&);
QueuedMessage& front();
void pop();
bool pop(QueuedMessage&);
bool push(const QueuedMessage& added, QueuedMessage& removed);
void foreach(Functor);
void removeIf(Predicate);
private:
typedef std::deque<QueuedMessage> Deque;
Deque messages;
Deque::iterator seek(const framing::SequenceNumber&);
bool find(const framing::SequenceNumber&, QueuedMessage&, bool remove);
};
}} // namespace qpid::broker
#endif /*!QPID_BROKER_MESSAGEDEQUE_H*/
|
