vectoraccess.h

Go to the documentation of this file.

#ifndef vectoraccess_h
#define vectoraccess_h

/*+
________________________________________________________________________

 (C) dGB Beheer B.V.; (LICENSE) http://opendtect.org/OpendTect_license.txt
 Author:        A.H.Bril
 Date:          Mar 2002
 Contents:      Access to STL vector class with extensions
 RCS:           $Id$
________________________________________________________________________

-*/

#include "debug.h"
#include "gendefs.h"
#include <algorithm>
#include <vector>
#include <stdexcept>

template <class T,class I>
mClass(Basic) VectorAccess
{
public:

    typedef I           size_type;
    typedef T           object_type;

    inline              VectorAccess()                  {}
    inline              VectorAccess( I n ) : v_(n)     {}
    inline              VectorAccess( I n, const T& t )
                                : v_(n,t)               {}
    inline              VectorAccess( const VectorAccess& v2 )
                                : v_(v2.v_)             {}
    inline std::vector<T>&       vec()                  { return v_; }
    inline const std::vector<T>& vec() const            { return v_; }

    inline T&           operator[](I idx);
    inline const T&     operator[](I idx) const;
    inline T&           first()                         { return v_.front(); }
    inline const T&     first() const                   { return v_.front(); }
    inline T&           last()                          { return v_.back(); }
    inline const T&     last() const                    { return v_.back(); }
    inline I            size() const                    { return (I)v_.size(); }
    inline bool         setCapacity(I sz, bool withmargin);
    inline I            getCapacity() const             { return v_.capacity();}
    inline bool         setSize(I sz,T val);
    
    inline bool         validIdx(I idx) const { return idx>=0 && idx<size(); }
    inline I            indexOf(const T&,bool forward,I start=-1) const;
    inline I            count(const T&) const;
    inline bool         isPresent(const T&) const;

    inline VectorAccess& operator =( const VectorAccess& v2 )
                        { v_ = v2.v_; return *this; }
    inline bool         push_back( const T& t );
    inline T            pop_back();
    inline void         insert( I pos, const T& val )
                        { v_.insert(v_.begin() + pos,val); }
    inline void         erase()
                        { v_.clear(); }
    inline void         erase( const T& t )
                        {
                            for ( I idx=size()-1; idx!=-1; idx-- )
                                { if ( v_[idx] == t ) { remove(idx); return; } }
                        }
    inline void         remove( I idx )
                        {
                            if ( idx < size() )
                                v_.erase( v_.begin() + idx );
                        }
    inline void         remove( I i1, I i2 )
                        {
                            if ( i1 == i2 ) { remove( i1 ); return; }
                            if ( i1 > i2 ) std::swap( i1, i2 );
                            const I sz = size();
                            if ( i1 >= sz ) return;

                            if ( i2 >= sz-1 ) i2 = sz-1;
                            v_.erase( v_.begin()+i1, v_.begin()+i2+1 );
                        }
    inline void         swap( I i, I j )
                        { std::swap( v_[i], v_[j] ); }

    inline void         fillWith( const T& val )
                        { std::fill( v_.begin(), v_.end(), val ); }
    inline void         replace( const T& val, const T& newval )
                        {
                            std::replace( v_.begin(), v_.end(), val, newval );
                        }

    void moveAfter( const T& t, const T& aft )
    {
        if ( t == aft || size() < 2 ) return;
        I tidx = -1; I aftidx = -1;
        for ( I idx=size()-1; idx!=-1; idx-- )
        {
            if ( v_[idx] == t )
                { tidx = idx; if ( aftidx != -1 ) break; }
            if ( v_[idx] == aft )
                { aftidx = idx; if ( tidx != -1 ) break; }
        }
        if ( tidx == -1 || aftidx == -1 || tidx == aftidx ) return;
        if ( aftidx > tidx )
            for ( I idx=tidx; idx<aftidx; idx++ )
                swap( idx, idx+1 );
        else
            for ( I idx=tidx; idx>aftidx+1; idx-- )
                swap( idx, idx-1 );
    }

    void moveToStart( const T& t )
    {
        if ( size() < 2 ) return;
        I tidx = -1;
        for ( I idx=size()-1; idx!=-1; idx-- )
            if ( v_[idx] == t ) { tidx = idx; break; }
        for ( I idx=tidx; idx>0; idx-- )
            swap( idx, idx-1 );
    }

protected:

    std::vector<T>      v_;

};


#define mExportVectorAccess(mod,tp,itp) \
template mExpClass(mod) std::allocator<tp>;\
template mExpClass(mod) std::_Vector_val<tp,std::allocator<tp> >;\
template mExpClass(mod) std::vector<tp>;\
template mExpClass(mod) VectorAccess<tp,itp>;\


template<class T,class I> inline
bool VectorAccess<T,I>::setCapacity( I sz, bool withmargin )
{
    if ( sz<=v_.capacity() )
        return true;

    if ( withmargin )
    {
        I tmp = sz-1;
        sz = 1;

        while ( tmp )
        {
            tmp >>= 1;
            sz <<= 1;
        }
    }

    try { v_.reserve(sz); }
    catch ( std::bad_alloc )
    { return false; }
    catch ( std::length_error )
    { return false; }

    return true;
}


template<class T,class I> inline
bool VectorAccess<T,I>::push_back( const T& t )
{
    try
        { v_.push_back(t); }
    catch ( std::bad_alloc )
        { return false; }

    return true;
}


template<class T,class I> inline
T VectorAccess<T,I>::pop_back()
{
    const T lastelem = v_.back();
    v_.pop_back();
    return lastelem;
}


template<class T,class I> inline
bool VectorAccess<T,I>::setSize( I sz, T val )
{
    try { v_.resize(sz,val); }
    catch ( std::bad_alloc )
    { return false; }

    return true;
}

#ifdef __debug__

#define mImplOperator \
    try { return v_.at(idx); } \
    catch ( std::out_of_range ) \
    { DBG::forceCrash(true); } \
    return v_[(typename std::vector<T>::size_type)idx]

#else

#define mImplOperator \
    return v_[(typename std::vector<T>::size_type)idx]

#endif


template<class T,class I> inline
T& VectorAccess<T,I>::operator[]( I idx )
{
    mImplOperator;
}


template<class T,class I> inline
const T& VectorAccess<T,I>::operator[]( I idx ) const
{
    mImplOperator;
}

#undef mImplOperator


template<class T,class I> inline
I VectorAccess<T,I>::indexOf( const T& t, bool forward, I start ) const
{
    if ( forward )
    {
        typename std::vector<T>::const_iterator begin = v_.begin();
        const typename std::vector<T>::const_iterator end = v_.end();
        if ( start>0 )
            begin += start;
        
        const typename std::vector<T>::const_iterator res =
                                                    std::find( begin, end, t );
        if ( res==end )
            return -1;
        
        return mCast(I,res-v_.begin());
    }

    typename std::vector<T>::const_reverse_iterator begin = v_.rbegin();
    const typename std::vector<T>::const_reverse_iterator end = v_.rend();
    if ( start>0 )
    {
        const I nrskipped = size()-1-start;
        begin += nrskipped;
    }
    
    const typename std::vector<T>::const_reverse_iterator res =
                                                    std::find( begin, end, t );
    if ( res==end )
        return -1;
    
    return mCast(I,end-res)-1;
}
    

template<class T,class I> inline
I VectorAccess<T,I>::count( const T& t ) const
{
    return mCast(I,std::count(v_.begin(),v_.end(),t));
}


template<class T,class I> inline
bool VectorAccess<T,I>::isPresent( const T& t ) const
{
    const typename std::vector<T>::const_iterator end = v_.end();
    return std::find( v_.begin(), end, t )!=end;
}

#endif