kde-playground/kdepimlibs/kabc/resource.cpp

/*
    This file is part of libkabc.
    Copyright (c) 2001 Cornelius Schumacher <schumacher@kde.org>

    This library is free software; you can redistribute it and/or
    modify it under the terms of the GNU Library General Public
    License as published by the Free Software Foundation; either
    version 2 of the License, or (at your option) any later version.

    This library 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., 51 Franklin Street, Fifth Floor,
    Boston, MA 02110-1301, USA.
*/

#include "resource.h"

#include <kdebug.h>
#include <klocalizedstring.h>

using namespace KABC;

class Ticket::Private
{
  public:
    Private( Resource *resource )
      : mResource( resource )
    {
    }

    Resource *mResource;
};

Ticket::Ticket( Resource *resource )
  : d( new Private( resource ) )
{
}

Ticket::~Ticket()
{
  delete d;
}

Resource *Ticket::resource()
{
  return d->mResource;
}

class Resource::Iterator::Private
{
  public:
    Addressee::Map::Iterator mIt;
};

class Resource::ConstIterator::Private
{
  public:
    Addressee::Map::ConstIterator mIt;
};

Resource::Iterator::Iterator()
  : d( new Private )
{
}

Resource::Iterator::Iterator( const Resource::Iterator &other )
  : d( new Private )
{
  d->mIt = other.d->mIt;
}

Resource::Iterator &Resource::Iterator::operator=( const Resource::Iterator &other )
{
  if ( this != &other ) {
    d->mIt = other.d->mIt;
  }

  return *this;
}

Resource::Iterator::~Iterator()
{
  delete d;
}

const Addressee &Resource::Iterator::operator*() const
{
  return d->mIt.value();
}

Addressee &Resource::Iterator::operator*()
{
  return d->mIt.value();
}

Resource::Iterator &Resource::Iterator::operator++()
{
  ( d->mIt )++;
  return *this;
}

Resource::Iterator &Resource::Iterator::operator++( int )
{
  ( d->mIt )++;
  return *this;
}

Resource::Iterator &Resource::Iterator::operator--()
{
  ( d->mIt )--;
  return *this;
}

Resource::Iterator &Resource::Iterator::operator--( int )
{
  ( d->mIt )--;
  return *this;
}

bool Resource::Iterator::operator==( const Iterator &it ) const
{
  return d->mIt == it.d->mIt;
}

bool Resource::Iterator::operator!=( const Iterator &it ) const
{
  return d->mIt != it.d->mIt;
}

Resource::ConstIterator::ConstIterator()
  : d( new Private )
{
}

Resource::ConstIterator::ConstIterator( const Resource::ConstIterator &other )
  : d( new Private )
{
  d->mIt = other.d->mIt;
}

#ifndef QT_STRICT_ITERATORS
Resource::ConstIterator::ConstIterator( const Resource::Iterator &other )
  : d( new Private )
{
  d->mIt = other.d->mIt;
}
#endif

Resource::ConstIterator &Resource::ConstIterator::operator=( const Resource::ConstIterator &other )
{
  if ( this != &other ) {
    d->mIt = other.d->mIt;
  }

  return *this;
}

Resource::ConstIterator::~ConstIterator()
{
  delete d;
}

const Addressee &Resource::ConstIterator::operator*() const
{
  return *( d->mIt );
}

Resource::ConstIterator &Resource::ConstIterator::operator++()
{
  ( d->mIt )++;
  return *this;
}

Resource::ConstIterator &Resource::ConstIterator::operator++( int )
{
  ( d->mIt )++;
  return *this;
}

Resource::ConstIterator &Resource::ConstIterator::operator--()
{
  --( d->mIt );
  return *this;
}

Resource::ConstIterator &Resource::ConstIterator::operator--( int )
{
  --( d->mIt );
  return *this;
}

bool Resource::ConstIterator::operator==( const ConstIterator &it ) const
{
  return d->mIt == it.d->mIt;
}

bool Resource::ConstIterator::operator!=( const ConstIterator &it ) const
{
  return d->mIt != it.d->mIt;
}

class Resource::Private
{
  public:
    Private()
      : mAddressBook( 0 )
    {
    }

    AddressBook *mAddressBook;
};

Resource::Resource()
  : KRES::Resource(), d( new Private )
{
}

Resource::Resource( const KConfigGroup &group )
  : KRES::Resource( group ), d( new Private )
{
}

Resource::~Resource()
{
  clear();
  delete d;
}

Resource::Iterator Resource::begin()
{
  Iterator it;
  it.d->mIt = mAddrMap.begin();

  return it;
}

Resource::ConstIterator Resource::begin() const
{
  ConstIterator it;
  it.d->mIt = mAddrMap.constBegin();
  return it;
}

Resource::Iterator Resource::end()
{
  Iterator it;
  it.d->mIt = mAddrMap.end();

  return it;
}

Resource::ConstIterator Resource::end() const
{
  ConstIterator it;
  it.d->mIt = mAddrMap.constEnd();
  return it;
}

void Resource::writeConfig( KConfigGroup &group )
{
  KRES::Resource::writeConfig( group );
}

void Resource::setAddressBook( AddressBook *ab )
{
  d->mAddressBook = ab;
}

AddressBook *Resource::addressBook()
{
  return d->mAddressBook;
}

Ticket *Resource::createTicket( Resource *resource )
{
  return new Ticket( resource );
}

void Resource::insertAddressee( const Addressee &addr )
{
  mAddrMap.insert( addr.uid(), addr );
}

void Resource::removeAddressee( const Addressee &addr )
{
  mAddrMap.remove( addr.uid() );
}

Addressee Resource::findByUid( const QString &uid )
{
  Addressee::Map::ConstIterator it = mAddrMap.constFind( uid );

  if ( it != mAddrMap.constEnd() ) {
    return it.value();
  }

  return Addressee();
}

Addressee::List Resource::findByName( const QString &name ) // TODO: const
{
  Addressee::List results;

  ConstIterator it;
  ConstIterator end( constEnd() );
  for ( it = constBegin(); it != end; ++it ) {
    if ( name == ( *it ).name() ) {
      results.append( *it );
    }
  }

  return results;
}

Addressee::List Resource::findByEmail( const QString &email ) // TODO: const
{
  Addressee::List results;
  const QString lowerEmail = email.toLower();

  ConstIterator it;
  for ( it = constBegin(); it != constEnd(); ++it ) {
    const QStringList mailList = ( *it ).emails();
    const QStringList::ConstIterator end( mailList.end() );
    for ( QStringList::ConstIterator ite = mailList.begin(); ite != end; ++ite ) {
      if ( lowerEmail == ( *ite ).toLower() ) {
        results.append( *it );
      }
    }
  }

  return results;
}

Addressee::List Resource::findByCategory( const QString &category ) // TODO: const
{
  Addressee::List results;

  ConstIterator it;
  ConstIterator end( constEnd() );
  for ( it = constBegin(); it != end; ++it ) {
    if ( ( *it ).hasCategory( category ) ) {
      results.append( *it );
    }
  }

  return results;
}

void Resource::clear()
{
  mAddrMap.clear();

  // take a copy of mDistListMap, then clear it and finally qDeleteAll
  // the copy to avoid problems with removeDistributionList() called by
  // ~DistributionList().
  DistributionListMap tempDistListMap( mDistListMap );
  mDistListMap.clear();
  qDeleteAll( tempDistListMap );
}

void Resource::insertDistributionList( DistributionList *list )
{
  Q_ASSERT( list );

  mDistListMap.insert( list->identifier(), list );
}

void Resource::removeDistributionList( DistributionList *list )
{
  Q_ASSERT( list );

  DistributionListMap::iterator it = mDistListMap.find( list->identifier() );
  if ( it != mDistListMap.end() ) {
    if ( it.value() == list ) {
      mDistListMap.erase( it );
    }
  }
}

DistributionList *Resource::findDistributionListByIdentifier( const QString &identifier )
{
  return mDistListMap.value( identifier );
}

DistributionList *Resource::findDistributionListByName( const QString &name,
                                                        Qt::CaseSensitivity caseSensitivity )
{
  QString searchName = name;
  if ( caseSensitivity == Qt::CaseInsensitive ) {
    searchName = name.toLower();
  }

  DistributionListMap::const_iterator it    = mDistListMap.constBegin();
  DistributionListMap::const_iterator endIt = mDistListMap.constEnd();
  for ( ; it != endIt; ++it ) {
    if ( caseSensitivity == Qt::CaseSensitive ) {
      if ( searchName == it.value()->name() ) {
        return it.value();
      }
    } else {
      if ( searchName == it.value()->name().toLower() ) {
        return it.value();
      }
    }
  }

  return 0;
}

QList<DistributionList*> Resource::allDistributionLists()
{
  return mDistListMap.values();
}

QStringList Resource::allDistributionListNames() const
{
  QStringList results;

  DistributionListMap::const_iterator it    = mDistListMap.constBegin();
  DistributionListMap::const_iterator endIt = mDistListMap.constEnd();
  for ( ; it != endIt; ++it ) {
    results += it.value()->name();
  }

  return results;
}

bool Resource::asyncLoad()
{
  bool ok = load();
  if ( !ok ) {
    emit loadingError( this, i18n( "Loading resource '%1' failed.", resourceName() ) );
  } else {
    emit loadingFinished( this );
  }

  return ok;
}

bool Resource::asyncSave( Ticket *ticket )
{
  bool ok = save( ticket );
  if ( !ok ) {
    emit savingError( this, i18n( "Saving resource '%1' failed.", resourceName() ) );
  } else {
    emit savingFinished( this );
  }

  return ok;
}