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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
|
/*
*
* 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/MessageMap.h"
#include "qpid/broker/QueuedMessage.h"
namespace qpid {
namespace broker {
namespace {
const std::string EMPTY;
}
std::string MessageMap::getKey(const QueuedMessage& message)
{
const framing::FieldTable* ft = message.payload->getApplicationHeaders();
if (ft) return ft->getAsString(key);
else return EMPTY;
}
size_t MessageMap::size()
{
return messages.size();
}
bool MessageMap::empty()
{
return messages.empty();
}
void MessageMap::reinsert(const QueuedMessage& message)
{
std::string key = getKey(message);
Index::iterator i = index.find(key);
if (i == index.end()) {
index[key] = message;
messages[message.position] = message;
} //else message has already been replaced
}
bool MessageMap::remove(const framing::SequenceNumber& position, QueuedMessage& message)
{
Ordering::iterator i = messages.find(position);
if (i != messages.end()) {
message = i->second;
erase(i);
return true;
} else {
return false;
}
}
bool MessageMap::find(const framing::SequenceNumber& position, QueuedMessage& message)
{
Ordering::iterator i = messages.find(position);
if (i != messages.end()) {
message = i->second;
return true;
} else {
return false;
}
}
bool MessageMap::next(const framing::SequenceNumber& position, QueuedMessage& message)
{
if (!messages.empty() && position < front().position) {
message = front();
return true;
} else {
Ordering::iterator i = messages.lower_bound(position+1);
if (i != messages.end()) {
message = i->second;
return true;
} else {
return false;
}
}
}
QueuedMessage& MessageMap::front()
{
return messages.begin()->second;
}
void MessageMap::pop()
{
QueuedMessage dummy;
pop(dummy);
}
bool MessageMap::pop(QueuedMessage& out)
{
Ordering::iterator i = messages.begin();
if (i != messages.end()) {
out = i->second;
erase(i);
return true;
} else {
return false;
}
}
const QueuedMessage& MessageMap::replace(const QueuedMessage& original, const QueuedMessage& update)
{
messages.erase(original.position);
messages[update.position] = update;
return update;
}
bool MessageMap::push(const QueuedMessage& added, QueuedMessage& removed)
{
std::pair<Index::iterator, bool> result = index.insert(Index::value_type(getKey(added), added));
if (result.second) {
//there was no previous message for this key; nothing needs to
//be removed, just add the message into its correct position
messages[added.position] = added;
return false;
} else {
//there is already a message with that key which needs to be replaced
removed = result.first->second;
result.first->second = replace(result.first->second, added);
return true;
}
}
void MessageMap::foreach(Functor f)
{
for (Ordering::iterator i = messages.begin(); i != messages.end(); ++i) {
f(i->second);
}
}
void MessageMap::removeIf(Predicate p)
{
for (Ordering::iterator i = messages.begin(); i != messages.end(); i++) {
if (p(i->second)) {
erase(i);
}
}
}
void MessageMap::erase(Ordering::iterator i)
{
index.erase(getKey(i->second));
messages.erase(i);
}
MessageMap::MessageMap(const std::string& k) : key(k) {}
}} // namespace qpid::broker
|
