/****************************************************************************

**

** All rights reserved.

** Contact: Nokia Corporation (qt-info@nokia.com)

**

** This file is part of the Qt Mobility Components.

**

** $QT_BEGIN_LICENSE:LGPL$

** No Commercial Usage

** This file contains pre-release code and may not be distributed.

** You may use this file in accordance with the terms and conditions

** contained in the Technology Preview License Agreement accompanying

** this package.

**

** GNU Lesser General Public License Usage

** Alternatively, this file may be used under the terms of the GNU Lesser

** General Public License version 2.1 as published by the Free Software

** Foundation and appearing in the file LICENSE.LGPL included in the

** packaging of this file.  Please review the following information to

** ensure the GNU Lesser General Public License version 2.1 requirements

** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.

**

** In addition, as a special exception, Nokia gives you certain additional

** rights.  These rights are described in the Nokia Qt LGPL Exception

** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.

**

** If you have questions regarding the use of this file, please contact

** Nokia at qt-info@nokia.com.

**

**

**

**

**

**

**

**

** $QT_END_LICENSE$

**

****************************************************************************/

#include "qmessagesortorder.h"

#include "qmfhelpers_p.h"

#include <qmailmessagesortkey.h>

using namespace QTM_PREPEND_NAMESPACE(QmfHelpers);

QTM_BEGIN_NAMESPACE

class QMessageSortOrderPrivate

{

public:

    QMailMessageSortKey _key;

    //static QMessageSortOrder convert(const QMailMessageSortKey &key);

    static QMailMessageSortKey convert(const QMessageSortOrder &key);

};

/*

QMessageSortOrder QMessageSortOrderPrivate::convert(const QMailMessageSortKey &key)

{

    QMessageSortOrder result;

    result.d_ptr->_key = key;

    return result;

}

*/

QMailMessageSortKey QMessageSortOrderPrivate::convert(const QMessageSortOrder &key)

{

    return key.d_ptr->_key;

}

namespace QmfHelpers {

/*

QMessageSortOrder convert(const QMailMessageSortKey &key)

{

    return QMessageSortOrderPrivate::convert(key);

}

*/

QMailMessageSortKey convert(const QMessageSortOrder &key)

{

    return QMessageSortOrderPrivate::convert(key);

}

}

QMessageSortOrder::QMessageSortOrder()

    : d_ptr(new QMessageSortOrderPrivate)

{

}

QMessageSortOrder::QMessageSortOrder(const QMessageSortOrder &other)

    : d_ptr(new QMessageSortOrderPrivate)

{

    this->operator=(other);

}

QMessageSortOrder::~QMessageSortOrder()

{

    delete d_ptr;

    d_ptr = 0;

}

QMessageSortOrder& QMessageSortOrder::operator=(const QMessageSortOrder& other)

{

    if (&other != this) {

        d_ptr->_key = other.d_ptr->_key;

    }

    return *this;

}

bool QMessageSortOrder::isEmpty() const

{

    return d_ptr->_key.isEmpty();

}

bool QMessageSortOrder::isSupported() const

{

    return true; // stub

}

QMessageSortOrder QMessageSortOrder::operator+(const QMessageSortOrder& other) const

{

    QMessageSortOrder key;

    key.d_ptr->_key = d_ptr->_key & other.d_ptr->_key;

    return key;

}

QMessageSortOrder& QMessageSortOrder::operator+=(const QMessageSortOrder& other)

{

    d_ptr->_key &= other.d_ptr->_key;

    return *this;

}

bool QMessageSortOrder::operator==(const QMessageSortOrder& other) const

{

    return (d_ptr->_key == other.d_ptr->_key);

}

QMessageSortOrder QMessageSortOrder::byType(Qt::SortOrder order)

{

    QMessageSortOrder key;

    key.d_ptr->_key = QMailMessageSortKey::messageType(order);

    return key;

}

QMessageSortOrder QMessageSortOrder::bySender(Qt::SortOrder order)

{

    QMessageSortOrder key;

    key.d_ptr->_key = QMailMessageSortKey::sender(order);

    return key;

}

QMessageSortOrder QMessageSortOrder::byRecipients(Qt::SortOrder order)

{

    QMessageSortOrder key;

    key.d_ptr->_key = QMailMessageSortKey::recipients(order);

    return key;

}

QMessageSortOrder QMessageSortOrder::bySubject(Qt::SortOrder order)

{

    QMessageSortOrder key;

    key.d_ptr->_key = QMailMessageSortKey::subject(order);

    return key;

}

QMessageSortOrder QMessageSortOrder::byTimeStamp(Qt::SortOrder order)

{

    QMessageSortOrder key;

    key.d_ptr->_key = QMailMessageSortKey::timeStamp(order);

    return key;

}

QMessageSortOrder QMessageSortOrder::byReceptionTimeStamp(Qt::SortOrder order)

{

    QMessageSortOrder key;

    key.d_ptr->_key = QMailMessageSortKey::receptionTimeStamp(order);

    return key;

}

QMessageSortOrder QMessageSortOrder::byStatus(QMessage::Status flag, Qt::SortOrder order)

{

    QMessageSortOrder key;

    key.d_ptr->_key = QMailMessageSortKey::status(convert(flag), order);

    return key;

}

QMessageSortOrder QMessageSortOrder::byPriority(Qt::SortOrder order)

{

    QMessageSortOrder key;

    if (order == Qt::DescendingOrder) {

        // Sort HighPriority descending, then LowPriority ascending

        key.d_ptr->_key = QMailMessageSortKey::status(highPriorityMask()) & QMailMessageSortKey::status(lowPriorityMask(), Qt::AscendingOrder);

    } else {

        // Sort LowPriority descending, then HighPriority ascending

        key.d_ptr->_key = QMailMessageSortKey::status(lowPriorityMask()) & QMailMessageSortKey::status(highPriorityMask(), Qt::AscendingOrder);

    }

    return key;

}

QMessageSortOrder QMessageSortOrder::bySize(Qt::SortOrder order)

{

    QMessageSortOrder key;

    key.d_ptr->_key = QMailMessageSortKey::size(order);

    return key;

}

QTM_END_NAMESPACE