summaryrefslogtreecommitdiff
path: root/cpp/src/qpid/broker/AccumulatedAck.cpp
diff options
context:
space:
mode:
authorGordon Sim <gsim@apache.org>2006-10-30 19:27:54 +0000
committerGordon Sim <gsim@apache.org>2006-10-30 19:27:54 +0000
commitb0a120b4edfdb49a08bd7c8c2479e7b1cadc5233 (patch)
treed2b4ca0e774100285e116e5442bff9e55b4a3f92 /cpp/src/qpid/broker/AccumulatedAck.cpp
parentf491af49008a2ed219ad4507cd507b4317afa4cb (diff)
downloadqpid-python-b0a120b4edfdb49a08bd7c8c2479e7b1cadc5233.tar.gz
Initial implementation for tx class.
git-svn-id: https://svn.apache.org/repos/asf/incubator/qpid/trunk/qpid@469242 13f79535-47bb-0310-9956-ffa450edef68
Diffstat (limited to 'cpp/src/qpid/broker/AccumulatedAck.cpp')
-rw-r--r--cpp/src/qpid/broker/AccumulatedAck.cpp46
1 files changed, 46 insertions, 0 deletions
diff --git a/cpp/src/qpid/broker/AccumulatedAck.cpp b/cpp/src/qpid/broker/AccumulatedAck.cpp
new file mode 100644
index 0000000000..86e1a5e786
--- /dev/null
+++ b/cpp/src/qpid/broker/AccumulatedAck.cpp
@@ -0,0 +1,46 @@
+/*
+ *
+ * Copyright (c) 2006 The Apache Software Foundation
+ *
+ * Licensed 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/AccumulatedAck.h"
+
+using std::less_equal;
+using std::bind2nd;
+using namespace qpid::broker;
+
+void AccumulatedAck::update(u_int64_t tag, bool multiple){
+ if(multiple){
+ if(tag > range) range = tag;
+ //else don't care, it is already counted
+ }else if(tag < range){
+ individual.push_back(tag);
+ }
+}
+
+void AccumulatedAck::consolidate(){
+ individual.sort();
+ //remove any individual tags that are covered by range
+ individual.remove_if(bind2nd(less_equal<u_int64_t>(), range));
+}
+
+void AccumulatedAck::clear(){
+ range = 0;
+ individual.clear();
+}
+
+bool AccumulatedAck::covers(u_int64_t tag) const{
+ return tag < range || find(individual.begin(), individual.end(), tag) != individual.end();
+}