opimrecordlist.h

Go to the documentation of this file.

/*
                             This file is part of the Opie Project
                             Copyright (C) The Main Author <main-author@whereever.org>
              =.             Copyright (C) The Opie Team <opie-devel@handhelds.org>
            .=l.
           .>+-=
 _;:,     .>    :=|.         This program is free software; you can
.> <`_,   >  .   <=          redistribute it and/or  modify it under
:`=1 )Y*s>-.--   :           the terms of the GNU Library General Public
.="- .-=="i,     .._         License as published by the Free Software
 - .   .-<_>     .<>         Foundation; either version 2 of the License,
     ._= =}       :          or (at your option) any later version.
    .%`+i>       _;_.
    .i_,=:_.      -<s.       This program is distributed in the hope that
     +  .  -:.       =       it will be useful,  but WITHOUT ANY WARRANTY;
    : ..    .:,     . . .    without even the implied warranty of
    =_        +     =;=|`    MERCHANTABILITY or FITNESS FOR A
  _.=:.       :    :=>`:     PARTICULAR PURPOSE. See the GNU
..}^=.=       =       ;      Library General Public License for more
++=   -.     .`     .:       details.
 :     =  ...= . :.=-
 -.   .:....=;==+<;          You should have received a copy of the GNU
  -_. . .   )=.  =           Library General Public License along with
    --        :-=`           this library; see the file COPYING.LIB.
                             If not, write to the Free Software Foundation,
                             Inc., 59 Temple Place - Suite 330,
                             Boston, MA 02111-1307, USA.
*/

#ifndef ORECORDLIST_H
#define ORECORDLIST_H

/* OPIE */
#include <opie2/opimtemplatebase.h>
#include <opie2/opimrecord.h>
//#include <opie2/odebug.h>

/* QT */
#include <qarray.h>

namespace Opie
{

template<class T> class OPimAccessTemplate;
class OPimRecordListIteratorPrivate;
template <class T> class OPimRecordList;
template <class T = OPimRecord>
class OPimRecordListIterator
{
    friend class OPimRecordList<T>;

  public:
    typedef OTemplateBase<T> Base;

    OPimRecordListIterator( const QArray<int>, const Base* );

    OPimRecordListIterator();
    ~OPimRecordListIterator();

    OPimRecordListIterator( const OPimRecordListIterator& );
    OPimRecordListIterator &operator=( const OPimRecordListIterator& );

    T operator*();
    OPimRecordListIterator &operator++();
    OPimRecordListIterator &operator--();

    bool operator==( const OPimRecordListIterator& it );
    bool operator!=( const OPimRecordListIterator& it );

    uint current() const;

    uint count() const;

    void setCurrent( uint cur );

  private:
    QArray<int> m_uids;
    uint m_current;
    const Base* m_temp;
    bool m_end : 1;
    T m_record;
    bool m_direction : 1;

    /* d pointer for future versions */
    OPimRecordListIteratorPrivate *d;
};


class OPimRecordListPrivate;
template <class T = OPimRecord >
class OPimRecordList
{
   template<class> friend class OPimAccessTemplate;
  public:
    typedef OTemplateBase<T> Base;
    typedef OPimRecordListIterator<T> Iterator;

    OPimRecordList (){}
    OPimRecordList( const QArray<int>& ids,
                    const Base* );
    ~OPimRecordList();

    Iterator begin();

    Iterator end();

    uint count() const;

    T operator[] ( uint i );
    int uidAt( uint i );

    bool remove( int uid );

    /*
      ConstIterator begin()const;
      ConstIterator end()const;
    */
  protected:
    UIDArray uids()const;

  private:
    QArray<int> m_ids;
    const Base* m_acc;
    OPimRecordListPrivate *d;
};


/* ok now implement it  */
template <class T>
OPimRecordListIterator<T>::OPimRecordListIterator()
{
    m_current = 0;
    m_temp = 0l;
    m_end = true;
    m_record = T();
    /* forward */
    m_direction = TRUE;
}


template <class T>
OPimRecordListIterator<T>::~OPimRecordListIterator()
{
    /* nothing to delete */
}


template <class T>
OPimRecordListIterator<T>::OPimRecordListIterator( const OPimRecordListIterator<T>& it )
{
    m_uids = it.m_uids;
    m_current = it.m_current;
    m_temp = it.m_temp;
    m_end = it.m_end;
    m_record = it.m_record;
    m_direction = it.m_direction;
}


template <class T>
OPimRecordListIterator<T> &OPimRecordListIterator<T>::operator=( const OPimRecordListIterator<T>& it )
{
    m_uids = it.m_uids;
    m_current = it.m_current;
    m_temp = it.m_temp;
    m_end = it.m_end;
    m_record = it.m_record;

    return *this;
}


template <class T>
T OPimRecordListIterator<T>::operator*()
{
    if ( !m_end )
        m_record = m_temp->find( m_uids[ m_current ], m_uids, m_current,
                                 m_direction ? Base::Forward :
                                 Base::Reverse );
    else
        m_record = T();

    return m_record;
}


template <class T>
OPimRecordListIterator<T> &OPimRecordListIterator<T>::operator++()
{
    m_direction = true;
    if ( m_current < m_uids.count() )
    {
        m_end = false;
        ++m_current;
    }
    else
        m_end = true;

    return *this;
}


template <class T>
OPimRecordListIterator<T> &OPimRecordListIterator<T>::operator--()
{
    m_direction = false;
    if ( m_current > 0 )
    {
        --m_current;
        m_end = false;
    }
    else
        m_end = true;

    return *this;
}


template <class T>
bool OPimRecordListIterator<T>::operator==( const OPimRecordListIterator<T>& it )
{

    /* if both are at we're the same.... */
    if ( m_end == it.m_end ) return true;

    if ( m_uids != it.m_uids ) return false;
    if ( m_current != it.m_current ) return false;
    if ( m_temp != it.m_temp ) return false;

    return true;
}


template <class T>
bool OPimRecordListIterator<T>::operator!=( const OPimRecordListIterator<T>& it )
{
    return !( *this == it );
}


template <class T>
OPimRecordListIterator<T>::OPimRecordListIterator( const QArray<int> uids,
        const Base* t )
        : m_uids( uids ), m_current( 0 ), m_temp( t ), m_end( false ),
        m_direction( false )
{
    /* if the list is empty we're already at the end of the list */
    if ( uids.count() == 0 )
        m_end = true;
}


template <class T>
uint OPimRecordListIterator<T>::current() const
{
    return m_current;
}


template <class T>
void OPimRecordListIterator<T>::setCurrent( uint cur )
{
    if ( cur < m_uids.count() )
    {
        m_end = false;
        m_current = cur;
    }
}
template <class T>
uint OPimRecordListIterator<T>::count() const
{
    return m_uids.count();
}


template <class T>
OPimRecordList<T>::OPimRecordList( const QArray<int>& ids,
                             const Base* acc )
        : m_ids( ids ), m_acc( acc )
{}


template <class T>
OPimRecordList<T>::~OPimRecordList()
{
    /* nothing to do here */
}


template <class T>
typename OPimRecordList<T>::Iterator OPimRecordList<T>::begin()
{
    Iterator it( m_ids, m_acc );
    return it;
}


template <class T>
typename OPimRecordList<T>::Iterator OPimRecordList<T>::end()
{
    Iterator it( m_ids, m_acc );
    it.m_end = true;
    it.m_current = m_ids.count();

    return it;
}


template <class T>
uint OPimRecordList<T>::count() const
{
    return m_ids.count();
}


template <class T>
T OPimRecordList<T>::operator[] ( uint i )
{
    if ( i >= m_ids.count() )
        return T();
    /* forward */
    return m_acc->find( m_ids[ i ], m_ids, i );
}


template <class T>
int OPimRecordList<T>::uidAt( uint i )
{
    return m_ids[ i ];
}


template <class T>
bool OPimRecordList<T>::remove( int uid )
{
    QArray<int> copy( m_ids.count() );
    int counter = 0;
    bool ret_val = false;

    for ( uint i = 0; i < m_ids.count(); i++ )
    {
        if ( m_ids[ i ] != uid )
        {
            copy[ counter++ ] = m_ids[ i ];

        }
        else
            ret_val = true;
    }

    copy.resize( counter );
    m_ids = copy;


    return ret_val;
}

template<class T>
UIDArray OPimRecordList<T>::uids()const {
    return m_ids;
}

}
#endif

---