michael@0: /* This Source Code Form is subject to the terms of the Mozilla Public
michael@0:  * License, v. 2.0. If a copy of the MPL was not distributed with this
michael@0:  * file, You can obtain one at http://mozilla.org/MPL/2.0/. */
michael@0: 
michael@0: #include "intcnt.h"
michael@0: 
michael@0: IntCount::IntCount() : numInts(0), iPair(nullptr) { }
michael@0: IntCount::~IntCount() { delete [] iPair;}
michael@0: int IntCount::getSize() {return numInts;}
michael@0: int IntCount::getCount(int pos) {return iPair[pos].cnt;}
michael@0: int IntCount::getIndex(int pos) {return iPair[pos].idx;}
michael@0: 
michael@0: void IntCount::clear()
michael@0: {
michael@0:     delete[] iPair;
michael@0:     iPair = new IntPair[0];
michael@0:     numInts = 0;
michael@0: }
michael@0: 
michael@0: int IntCount::countAdd(int index, int increment)
michael@0: {
michael@0:   if(numInts) {
michael@0:     // Do a binary search to find the element
michael@0:     int divPoint = 0;
michael@0: 
michael@0:     if(index>iPair[numInts-1].idx) {
michael@0: 	    divPoint = numInts;
michael@0:     } else if(index<iPair[0].idx) {
michael@0: 	    divPoint = 0;
michael@0:     } else {
michael@0: 	    int low=0, high=numInts-1;
michael@0: 	    int mid = (low+high)/2;
michael@0: 	    while(1) {
michael@0:         mid = (low+high)/2;
michael@0: 
michael@0:         if(index<iPair[mid].idx) {
michael@0:           high = mid;
michael@0:         } else if(index>iPair[mid].idx) {
michael@0:           if(mid<numInts-1 && index<iPair[mid+1].idx) {
michael@0:             divPoint = mid+1;
michael@0:             break;
michael@0:           } else {
michael@0:             low = mid+1;
michael@0:           }
michael@0:         } else if(index==iPair[mid].idx) {
michael@0:           return iPair[mid].cnt += increment;
michael@0:         }
michael@0: 	    }
michael@0:     }
michael@0: 
michael@0:     int i;
michael@0:     IntPair *tpair = new IntPair[numInts+1];
michael@0:     for(i=0; i<divPoint; i++) {
michael@0:       tpair[i] = iPair[i];
michael@0:     }
michael@0:     for(i=divPoint; i<numInts; i++) {
michael@0:       tpair[i+1] = iPair[i];
michael@0:     }
michael@0:     ++numInts;
michael@0:     delete [] iPair;
michael@0:     iPair = tpair;
michael@0:     iPair[divPoint].idx = index;
michael@0:     iPair[divPoint].cnt = increment;
michael@0:     return increment;
michael@0:   } else {
michael@0:     iPair = new IntPair[1];
michael@0:     numInts = 1;
michael@0:     iPair[0].idx = index;
michael@0:     return iPair[0].cnt = increment;
michael@0:   }
michael@0: }