ring.inc

Go to the documentation of this file.

 
#pragma once
 
#pragma GCC visibility push(default)
namespace abacus {
 
 
template <class Type>
inline AbaRing<Type>::AbaRing(int size)
    :
    ring_(size),
    head_(0),
    filled_(false)
{ }
 
 
template <class Type>
std::ostream &operator<<(std::ostream &out, const AbaRing<Type> &rhs)
{
    if(rhs.filled_) {
        const int s = rhs.size();
 
        for(int i = rhs.head_; i < s; i++)
            out << rhs.ring_[i] << " ";
    }
 
    for (int i = 0; i < rhs.head_; i++)
        out << rhs.ring_[i] << " ";
 
    out << std::endl;
 
    return out;
}
 
 
template <class Type>
inline Type& AbaRing<Type>::operator[](int i)
{
    return ring_[i];
}
 
 
template <class Type>
inline const Type& AbaRing<Type>::operator[](int i) const
{
    return ring_[i];
}
 
 
template <class Type>
void AbaRing<Type>::insert(Type elem)
{
    ring_[head_] = elem;
 
    if (++head_ == size()) {
        if (!filled_) filled_ = true;
        head_ = 0;
    }
}
 
 
template <class Type>
inline void AbaRing<Type>::clear()
{
    head_ = 0;
    filled_ = false;
}
 
 
template <class Type>
inline int AbaRing<Type>::size() const
{
    return ring_.size();
}
 
 
template <class Type>
inline int AbaRing<Type>::number() const
{
    if (filled_)
        return size();
    else
        return head_;
}
 
 
template <class Type>
inline Type AbaRing<Type>::oldest() const
{
    if(filled_) return ring_[head_];
    else return ring_[0];
}
 
 
template <class Type>
inline int AbaRing<Type>::oldestIndex() const
{
    if(filled_) return head_;
    else return 0;
}
 
 
template <class Type>
inline Type AbaRing<Type>::newest() const
{
    if (head_)  return ring_[head_ - 1];
    else return ring_[size() - 1];
}
 
 
template <class Type>
inline int AbaRing<Type>::newestIndex() const
{
    if (head_)  return head_ - 1;
    else return size() - 1;
}
 
 
template <class Type>
int AbaRing<Type>::previous(int i, Type &p) const
{
    int j = head_ - 1 - i;
 
    if (j >= 0) {
        p = ring_[j];
        return 0;
    }
    else if (filled_) {
        p = ring_[size() + j];
        return 0;
    }
    else return 1;
}
 
 
template <class Type>
inline bool AbaRing<Type>::empty() const
{
    return !(head_ || filled_);
}
 
 
template <class Type>
inline bool AbaRing<Type>::filled() const
{
    return filled_;
}
 
 
template <class Type>
void AbaRing<Type>::realloc(int newSize)
{
    Array<Type> tmp = ring_;
    int oldSize = size();
    int oldHead = head_;
    int i;
 
    ring_.realloc(newSize);
 
    if(newSize > oldSize) {
        // increase ring
        /* If the ring is increased yet has not been filled, nothing has to be
        * done. Otherwise, the elements of the old ring are copied in the correct
        * order.
        */
        if (filled_) {
            head_ = 0;
            for(i = oldHead; i < oldSize; i++) ring_[head_++] = tmp[i];
            for(i = 0; i < oldHead; i++) ring_[head_++] = tmp[i];
            filled_ = false;
        }
    }
    else {
        // decrease ring
        /* If the ring is decreased and it is filled, then we copy the elements of the
        * old ring in the correct order. If the ring is not filled we only have
        * to copy the elements if by decreasing the ring elements are removed.
        */
        if (filled_) {
            for (head_ = size() - 1, i = oldHead - 1; head_ >= 0; head_--, i--) {
                if (i < 0) i = oldSize - 1;
                ring_[head_] = tmp[i];
            }
            head_ = 0;
        }
        else if (oldHead > size()) {
            for (head_ = size() - 1, i = oldHead - 1; head_ >= 0; --head_, --i)
                ring_[head_] = tmp[i];
            head_ = 0;
            filled_ = true;
        }
    }
}
 
}
#pragma GCC visibility pop