//%2006////////////////////////////////////////////////////////////////////////
//
// Copyright (c) 2000, 2001, 2002 BMC Software; Hewlett-Packard Development
// Company, L.P.; IBM Corp.; The Open Group; Tivoli Systems.
// Copyright (c) 2003 BMC Software; Hewlett-Packard Development Company, L.P.;
// IBM Corp.; EMC Corporation, The Open Group.
// Copyright (c) 2004 BMC Software; Hewlett-Packard Development Company, L.P.;
// IBM Corp.; EMC Corporation; VERITAS Software Corporation; The Open Group.
// Copyright (c) 2005 Hewlett-Packard Development Company, L.P.; IBM Corp.;
// EMC Corporation; VERITAS Software Corporation; The Open Group.
// Copyright (c) 2006 Hewlett-Packard Development Company, L.P.; IBM Corp.;
// EMC Corporation; Symantec Corporation; The Open Group.
//
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to
// deal in the Software without restriction, including without limitation the
// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
// sell copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
// 
// THE ABOVE COPYRIGHT NOTICE AND THIS PERMISSION NOTICE SHALL BE INCLUDED IN
// ALL COPIES OR SUBSTANTIAL PORTIONS OF THE SOFTWARE. THE SOFTWARE IS PROVIDED
// "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT
// LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
// PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT
// HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
//==============================================================================
//
// Authors: David Rosckes (rosckes@us.ibm.com)
//          Bert Rivero (hurivero@us.ibm.com)
//          Chuck Carmack (carmack@us.ibm.com)
//          Brian Lucier (lucier@us.ibm.com) 
//
// Modified By: Vijay Eli, IBM (vijayeli@in.ibm.com) bug#3590
//
//%/////////////////////////////////////////////////////////////////////////////

#include <Pegasus/Common/InternalException.h>
#include "CQLPredicate.h"
#include "CQLSimplePredicate.h"
#include "CQLPredicateRep.h"
#include <Pegasus/CQL/CQLFactory.h>
#include <Pegasus/Query/QueryCommon/QueryContext.h>
#include <Pegasus/Common/Tracer.h>

PEGASUS_NAMESPACE_BEGIN

CQLPredicateRep::CQLPredicateRep():
_invert(false)
{

}

CQLPredicateRep::CQLPredicateRep(const CQLSimplePredicate& inSimplePredicate, Boolean inVerted):
  _simplePredicate(inSimplePredicate), _invert(inVerted)
{

}

CQLPredicateRep::CQLPredicateRep(const CQLPredicate& inPredicate, Boolean inInverted):
_invert(inInverted)
{
  _predicates.append(inPredicate);
}

CQLPredicateRep::CQLPredicateRep(const CQLPredicateRep* rep):
_invert(false)
{
	_predicates = rep->_predicates;
	_simplePredicate = rep->_simplePredicate;
	_operators = rep->_operators;
	_invert = rep->_invert;
}

Boolean CQLPredicateRep::evaluate(CIMInstance CI, QueryContext& QueryCtx)
{
   PEG_METHOD_ENTER(TRC_CQL, "CQLIPredicateRep::evaluate");
	Boolean result = false;
    
  if (isSimple())
  {
    result = _simplePredicate.evaluate(CI, QueryCtx);
  }
  else
  {
    result = _predicates[0].evaluate(CI, QueryCtx);
    for (Uint32 i = 0; i < _operators.size(); i++)
    {
      if (_operators[i] == AND)
      {
        if(result)
        {
          result = _predicates[i+1].evaluate(CI, QueryCtx);
        }
      }
      else
      {
        if(result)
        {
          break;
        }
        else
        {
           result = _predicates[i+1].evaluate(CI, QueryCtx);
	}
      }
    }
  }
  PEG_METHOD_EXIT();
  return (getInverted()) ? !result : result;
}

Boolean CQLPredicateRep::getInverted()const{
	return _invert;
}

void CQLPredicateRep::setInverted(Boolean invert){
	_invert = invert;
}

void CQLPredicateRep::appendPredicate(const CQLPredicate& inPredicate){
	_predicates.append(inPredicate);
}

void CQLPredicateRep::appendPredicate(const CQLPredicate& inPredicate, BooleanOpType inBooleanOperator)
{
	_predicates.append(inPredicate);
	_operators.append(inBooleanOperator);
}

Array<CQLPredicate> CQLPredicateRep::getPredicates()const{
	return _predicates;
}

CQLSimplePredicate CQLPredicateRep::getSimplePredicate()const{
	return _simplePredicate;
}

Array<BooleanOpType> CQLPredicateRep::getOperators()const{
	return _operators;
}

void CQLPredicateRep::applyContext(const QueryContext& queryContext)
{
  PEG_METHOD_ENTER(TRC_CQL, "CQLPredicateRep::applyContext");
  if (isSimple())
  {
    _simplePredicate.applyContext(queryContext);
  }
  else
  {
    for (Uint32 i = 0; i <_predicates.size(); i++)
    {
      _predicates[i].applyContext(queryContext);
    }
  }
  PEG_METHOD_EXIT();
}

Boolean CQLPredicateRep::isSimple()const{
	return (_predicates.size() == 0);
}

Boolean CQLPredicateRep::isSimpleValue()const{
	return (isSimple() && _simplePredicate.isSimpleValue());
}

String CQLPredicateRep::toString()const{
	if(isSimple()){
		String s;
      if(_invert) s = "NOT ";
      s.append(_simplePredicate.toString());
      return s;
	}
	String s;
	if(_invert) s = "NOT ";
	for(Uint32 i = 0; i < _predicates.size(); i++){
		s.append(_predicates[i].toString());
		if(i < _operators.size()){
			switch(_operators[i]){
				case AND: s.append(" AND ");
					break;
				case OR: s.append(" OR ");
					break;
			}
		}
	}
	return s;
}

PEGASUS_NAMESPACE_END