/*
 *
 * 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();
}