objectset.h

Go to the documentation of this file.

#ifndef objectset_h
#define objectset_h

/*+
________________________________________________________________________

 (C) dGB Beheer B.V.; (LICENSE) http://opendtect.org/OpendTect_license.txt
 Author:        Bert / many others
 Date:          Apr 1995 / Feb 2009
 RCS:           $Id$
________________________________________________________________________

-*/

#ifndef odset_h
#include "odset.h"
#endif
#ifndef vectoraccess_h
#include "vectoraccess.h"
#endif

#ifdef __debug__
# include "debug.h"
#endif


template <class T>
mClass(Basic) ObjectSet : public OD::Set
{
public:

    typedef int                 size_type;
    typedef T                   object_type;

    inline                      ObjectSet();
    inline                      ObjectSet(const ObjectSet<T>&);
    inline virtual              ~ObjectSet()            {}
    inline ObjectSet<T>&        operator=(const ObjectSet<T>&);
    virtual bool                isManaged() const       { return false; }

    inline bool                 nullAllowed() const     { return allow0_; }
    inline void                 allowNull(bool yn=true);
    inline size_type            size() const            { return vec_.size(); }
    inline virtual od_int64     nrItems() const         { return size(); }

#ifdef __MAC_LLVM_COMPILER_ERROR__
    inline T*                   operator[](size_type);
    inline const T*             operator[](size_type) const;
#else
    inline virtual T*           operator[](size_type);
    inline virtual const T*     operator[](size_type) const;
#endif
    inline virtual T*           operator[](const T*) const; 

    inline virtual bool         validIdx(od_int64) const;
    inline virtual bool         isPresent(const T*) const;
    inline virtual size_type    indexOf(const T*) const;
    inline T*                   first();
    inline const T*             first() const;
    inline T*                   last();
    inline const T*             last() const;

    inline ObjectSet<T>&        add( T* t )             { return doAdd(t); }
    inline ObjectSet<T>&        operator +=( T* t )     { return doAdd( t ); }
    inline void                 push( T* t )            { doAdd( t ); }
    inline bool                 addIfNew(T*);
    inline virtual T*           replace(size_type idx,T*);
    inline virtual void         insertAt(T* newptr,size_type);
    inline virtual void         insertAfter(T* newptr,size_type);

    inline virtual void         copy(const ObjectSet<T>&);
    inline virtual void         append(const ObjectSet<T>&);
    inline virtual void         swap(od_int64,od_int64);
    inline virtual void         reverse(); 
    

    inline virtual void         erase()                 { plainErase(); }
    inline virtual T*           pop();
    virtual inline T*           removeSingle(size_type,bool keep_order=true);
    virtual void                removeRange(size_type from,size_type to);
    virtual ObjectSet<T>&       operator -=(T*);

protected:

    VectorAccess<void*,size_type> vec_;
    bool                        allow0_;

    inline virtual ObjectSet<T>& doAdd(T*);

public:

    inline void                 plainErase()    { vec_.erase(); }
};


#define mObjectSetApplyToAll( os, op ) \
    mODSetApplyToAll( ObjectSet<int>::size_type, os, op )

#define mObjectSetApplyToAllFunc( fn, op, extra ) \
template <class T> \
inline void fn( ObjectSet<T>& os ) \
{ \
    mObjectSetApplyToAll( os, op ); \
    extra; \
}


mObjectSetApplyToAllFunc( deepErase, delete os.removeSingle(idx),  )


mObjectSetApplyToAllFunc( deepEraseArr, delete [] os.removeSingle(idx), )


template <class T,class S>
inline void deepAppend( ObjectSet<T>& to, const ObjectSet<S>& from )
{
    const int sz = from.size();
    for ( int idx=0; idx<sz; idx++ )
        to.add( from[idx] ? new T( *from[idx] ) : 0 );
}


template <class T,class S>
inline void deepAppendClone( ObjectSet<T>& to, const ObjectSet<S>& from )
{
    const int sz = from.size();
    for ( int idx=0; idx<sz; idx++ )
        to.add( from[idx] ? from[idx]->clone() : 0 );
}


template <class T,class S>
inline void deepCopy( ObjectSet<T>& to, const ObjectSet<S>& from )
{
    if ( &to == &from ) return;
    deepErase( to );
    to.allowNull( from.nullAllowed() );
    deepAppend( to, from );
}


template <class T,class S>
inline void deepCopyClone( ObjectSet<T>& to, const ObjectSet<S>& from )
{
    if ( &to == &from ) return;
    deepErase( to );
    to.allowNull( from.nullAllowed() );
    deepAppendClone( to, from );
}


template <class T,class S>
inline typename ObjectSet<T>::size_type indexOf( const ObjectSet<T>& os,
                                                 const S& val )
{
    for ( int idx=0; idx<os.size(); idx++ )
    {
        if ( *os[idx] == val )
            return idx;
    }
    return -1;
}


template <class T,class S>
inline const T* find( const ObjectSet<T>& os, const S& val )
{
    const typename ObjectSet<T>::size_type idx = indexOf( os, val );
    return idx == -1 ? 0 : os[idx];
}


template <class T,class S>
inline T* find( ObjectSet<T>& os, const S& val )
{
    const typename ObjectSet<T>::size_type idx = indexOf( os, val );
    return idx == -1 ? 0 : os[idx];
}

template <class T>
inline void _ObjectSet_sortWithNull( ObjectSet<T>& os )
{
    const typename ObjectSet<T>::size_type sz = os.size();
    for ( typename ObjectSet<T>::size_type d=sz/2; d>0; d=d/2 )
    {
        for ( typename ObjectSet<T>::size_type i=d; i<sz; i++ )
        {
            for ( typename ObjectSet<T>::size_type j=i-d; j>=0; j-=d )
            {
                T* o1 = os[j]; T* o2 = os[j+d];
                if ( !o2 || o1 == o2 || (o1 && !(*o1 > *o2) ) )
                    break;
                os.swap( j, j+d );
            }
        }
    }
}

template <class T>
inline void sort( ObjectSet<T>& os )
{
    if ( os.nullAllowed() )
        _ObjectSet_sortWithNull(os);
    else
    {
        const typename ObjectSet<T>::size_type sz = os.size();
        for ( typename ObjectSet<T>::size_type d=sz/2; d>0; d=d/2 )
        {
            for ( typename ObjectSet<T>::size_type i=d; i<sz; i++ )
            {
                for ( typename ObjectSet<T>::size_type j=i-d;
                     j>=0 && *os[j]>*os[j+d]; j-=d )
                {
                    os.swap( j, j+d );
                }
            }
        }
    }
}


template <class T>
inline bool equalObjects( const ObjectSet<T>& os1, const ObjectSet<T>& os2 )
{
    typedef typename ObjectSet<T>::size_type size_type;
    const size_type sz = os1.size();
    if ( os2.size() != sz )
        return false;

    for ( size_type idx=0; idx<sz; idx++ )
        if ( os1[idx] != os2[idx] )
            return false;

    return true;
}


template <class T>
inline bool equalContents( const ObjectSet<T>& os1, const ObjectSet<T>& os2 )
{
    typedef typename ObjectSet<T>::size_type size_type;
    const size_type sz = os1.size();
    if ( os2.size() != sz )
        return false;

    for ( size_type idx=0; idx<sz; idx++ )
    {
        const T* o1 = os1[idx]; const T* o2 = os2[idx];
        if ( !o1 && !o2 )
            continue;
        if ( !o1 || !o2 || (!(*o1 == *o2)) )
            return false;
    }
    return true;
}


// Member function implementations
template <class T> inline
ObjectSet<T>::ObjectSet() : allow0_(false)
{}


template <class T> inline
ObjectSet<T>::ObjectSet( const ObjectSet<T>& t )
{ *this = t; }


template <class T> inline
ObjectSet<T>& ObjectSet<T>::operator =( const ObjectSet<T>& os )
{ allow0_ = os.allow0_; copy(os); return *this; }


template <class T> inline
void ObjectSet<T>::allowNull( bool yn )
{ allow0_ = yn; }


template <class T> inline
bool ObjectSet<T>::validIdx( od_int64 idx ) const
{ return idx>=0 && idx<size(); }


template <class T> inline
T* ObjectSet<T>::operator[]( size_type idx )
{
#ifdef __debug__
    if ( !validIdx(idx) )
        DBG::forceCrash(true);
#endif
    return (T*)vec_[idx];
}


template <class T> inline
const T* ObjectSet<T>::operator[]( size_type idx ) const
{
#ifdef __debug__
    if ( !validIdx(idx) )
        DBG::forceCrash(true);
#endif
    return (const T*)vec_[idx];
}


template <class T> inline
T* ObjectSet<T>::operator[]( const T* t ) const
{
    const size_type idx = indexOf(t);
    return idx < 0 ? 0 : const_cast<T*>(t);
}


template <class T> inline
typename ObjectSet<T>::size_type ObjectSet<T>::indexOf( const T* ptr ) const
{
    return vec_.indexOf( (void*) ptr, true );
}


template <class T> inline
bool ObjectSet<T>::isPresent( const T* ptr ) const
{
    return vec_.isPresent( (void*) ptr );
}


template <class T> inline
ObjectSet<T>& ObjectSet<T>::doAdd( T* ptr )
{
    if ( ptr || allow0_ )
        vec_.push_back( (void*)ptr );
    return *this;
}


template <class T> inline
ObjectSet<T>& ObjectSet<T>::operator -=( T* ptr )
{
    if ( ptr || allow0_ )
        vec_.erase( (void*)ptr );
    return *this;
}


template <class T> inline
void ObjectSet<T>::swap( od_int64 idx0, od_int64 idx1 )
{
#ifdef __debug__
    if ( !validIdx(idx0) || !validIdx(idx1) )
        DBG::forceCrash(true);
#endif
    vec_.swap( mCast(size_type,idx0), mCast(size_type,idx1) );
}


template <class T> inline
void ObjectSet<T>::reverse()
{
    const size_type sz = size();
    const size_type hsz = sz/2;
    for ( size_type idx=0; idx<hsz; idx++ )
        swap( idx, sz-1-idx );
}


template <class T> inline
T* ObjectSet<T>::replace( size_type idx, T* newptr )
{
    if ( !validIdx(idx) )
#ifdef __debug__
        DBG::forceCrash(true);
#else
        return 0;
#endif
    T* ptr = (T*)vec_[idx];
    vec_[idx] = (void*)newptr;
    return ptr;
}


template <class T> inline
void ObjectSet<T>::insertAt( T* newptr, size_type idx )
{
    vec_.insert( idx, (void*)newptr );
}


template <class T> inline
void ObjectSet<T>::insertAfter( T* newptr, size_type idx )
{
    add( newptr );
    if ( idx < 0 )
        vec_.moveToStart( (void*)newptr );
    else
        vec_.moveAfter( (void*)newptr, vec_[idx] );
}


template <class T> inline
void ObjectSet<T>::copy( const ObjectSet<T>& os )
{
    if ( &os != this )
    {
        erase();
        allow0_ = os.allow0_;
        append( os );
    }
}


template <class T> inline
void ObjectSet<T>::append( const ObjectSet<T>& os )
{
    const size_type sz = os.size();
    vec_.setCapacity( size()+sz, true );
    for ( size_type idx=0; idx<sz; idx++ )
        add( const_cast<T*>( os[idx] ) );
}

template <class T> inline
T* ObjectSet<T>::pop()
{ return (T*)vec_.pop_back(); }


template <class T> inline
bool ObjectSet<T>::addIfNew( T* ptr )
{
    if ( isPresent(ptr) )
        return false;

    add( ptr );
    return true;
}


template <class T> inline
T* ObjectSet<T>::removeSingle( size_type idx, bool kporder )
{
    T* res = (T*)vec_[idx];
    if ( kporder )
        vec_.remove( idx );
    else
    {
        const size_type lastidx = size()-1;
        if ( idx!=lastidx )
            vec_[idx] = vec_[lastidx];
        vec_.remove( lastidx );
    }
    return res;
}


template <class T> inline
void ObjectSet<T>::removeRange( size_type i1, size_type i2 )
{ vec_.remove( i1, i2 ); }
template <class T> inline T* ObjectSet<T>::first()
{ return isEmpty() ? 0 : (*this)[0]; }
template <class T> inline const T* ObjectSet<T>::first() const
{ return isEmpty() ? 0 : (*this)[0]; }
template <class T> inline T* ObjectSet<T>::last()
{ return isEmpty() ? 0 : (*this)[size()-1]; }
template <class T> inline const T* ObjectSet<T>::last() const
{ return isEmpty() ? 0 : (*this)[size()-1]; }


#endif