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

**

** Copyright (C) 2010 Nokia Corporation and/or its subsidiary(-ies).

** All rights reserved.

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

**

** This file is part of the QtXmlPatterns module of the Qt Toolkit.

**

** $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 "qbuiltintypes_p.h"

#include "qcommonsequencetypes_p.h"

#include "qcommonvalues_p.h"

#include "qliteral_p.h"

#include "qschemanumeric_p.h"

#include "qdeepequalfn_p.h"

QT_BEGIN_NAMESPACE

using namespace QPatternist;

bool DeepEqualFN::evaluateEBV(const DynamicContext::Ptr &context) const

{

    const Item::Iterator::Ptr it1(m_operands.first()->evaluateSequence(context));

    const Item::Iterator::Ptr it2(m_operands.at(1)->evaluateSequence(context));

    while(true)

    {

        const Item item1(it1->next());

        const Item item2(it2->next());

        if(!item1)

        {

            if(item2)

                return false;

            else

                return true;

        }

        else if(!item2)

        {

            if(item1)

                return false;

            else

                return true;

        }

        else if(item1.isNode())

        {

            if(item2.isNode())

            {

                if(item1.asNode().isDeepEqual(item2.asNode()))

                    continue;

                else

                    return false;

            }

            else

                return false;

        }

        else if(item2.isNode())

        {

            /* We know that item1 is not a node due to the check above. */

            return false;

        }

        else if(flexibleCompare(item1, item2, context))

            continue;

        else if(BuiltinTypes::numeric->itemMatches(item1) &&

                item1.as<Numeric>()->isNaN() &&

                item2.as<Numeric>()->isNaN())

        {

            // TODO

            /* Handle the specific NaN circumstances. item2 isn't checked whether it's of

             * type numeric, since the AtomicComparator lookup would have failed if both weren't

             * numeric. */

            continue;

        }

        else

            return false;

    };

}

Expression::Ptr DeepEqualFN::typeCheck(const StaticContext::Ptr &context,

                                       const SequenceType::Ptr &reqType)

{

    const Expression::Ptr me(FunctionCall::typeCheck(context, reqType));

    const ItemType::Ptr t1(m_operands.first()->staticType()->itemType());

    const ItemType::Ptr t2(m_operands.at(1)->staticType()->itemType());

    /* TODO This can be much more improved, and the optimizations should be moved

     * to compress(). */

    if(*CommonSequenceTypes::Empty == *t1)

    {

        if(*CommonSequenceTypes::Empty == *t2)

            return wrapLiteral(CommonValues::BooleanTrue, context, this);

        else

            return me;

    }

    else if(*CommonSequenceTypes::Empty == *t2)

    {

        if(*CommonSequenceTypes::Empty == *t1)

            return wrapLiteral(CommonValues::BooleanTrue, context, this);

        else

            return me;

    }

    else if(BuiltinTypes::node->xdtTypeMatches(t1) &&

            BuiltinTypes::node->xdtTypeMatches(t2))

        return me; /* We're comparing nodes. */

    else if(BuiltinTypes::xsAnyAtomicType->xdtTypeMatches(t1) &&

            BuiltinTypes::xsAnyAtomicType->xdtTypeMatches(t2))

    {

        prepareComparison(fetchComparator(t1, t2, context));

        return me;

    }

    else

    {

        if ((BuiltinTypes::node->xdtTypeMatches(t1) && BuiltinTypes::xsAnyAtomicType->xdtTypeMatches(t2))

            || (BuiltinTypes::node->xdtTypeMatches(t2) && BuiltinTypes::xsAnyAtomicType->xdtTypeMatches(t1)))

        {

            /* One operand contains nodes and the other atomic values, or vice versa. They can never

             * be identical. */

        // TODO warn?

            return wrapLiteral(CommonValues::BooleanFalse, context, this);

        }

        else

        {

            // TODO Warn?

            return me;

        }

    }

}

QT_END_NAMESPACE