peterv%netscape.com 8a538c4480 Part of bug 88623 (Cleanup Transformiix code). Remove unnecesary comment lines, no code changes. r=Pike, rs=jst.
git-svn-id: svn://10.0.0.236/trunk@98504 18797224-902f-48f8-a5cc-f745e15eee43
2001-07-03 00:47:47 +00:00

229 lines
8.2 KiB
C++

/*
* The contents of this file are subject to the Mozilla Public
* License Version 1.1 (the "License"); you may not use this file
* except in compliance with the License. You may obtain a copy of
* the License at http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
* implied. See the License for the specific language governing
* rights and limitations under the License.
*
* The Original Code is TransforMiiX XSLT processor.
*
* The Initial Developer of the Original Code is The MITRE Corporation.
* Portions created by MITRE are Copyright (C) 1999 The MITRE Corporation.
*
* Portions created by Keith Visco as a Non MITRE employee,
* (C) 1999 Keith Visco. All Rights Reserved.
*
* Contributor(s):
* Keith Visco, kvisco@ziplink.net
* -- original author.
*
* Marina Mechtcheriakova, mmarina@mindspring.com
* -- changed some behavoir to be more compliant with spec
*
*/
/**
* NodeSetFunctionCall
* A representation of the XPath NodeSet funtions
**/
#include "FunctionLib.h"
#include "XMLUtils.h"
#include "XMLDOMUtils.h"
#include <math.h>
/**
* Creates a NodeSetFunctionCall of the given type
**/
NodeSetFunctionCall::NodeSetFunctionCall(short type) : FunctionCall() {
this->type = type;
switch ( type ) {
case COUNT :
name = XPathNames::COUNT_FN;
break;
case ID :
name = XPathNames::ID_FN;
break;
case LAST :
name = XPathNames::LAST_FN;
break;
case LOCAL_NAME:
name = XPathNames::LOCAL_NAME_FN;
break;
case NAME:
name = XPathNames::NAME_FN;
break;
case NAMESPACE_URI:
name = XPathNames::NAMESPACE_URI_FN;
break;
default:
name = XPathNames::POSITION_FN;
break;
}
} //-- NodeSetFunctionCall
/**
* Evaluates this Expr based on the given context node and processor state
* @param context the context node for evaluation of this Expr
* @param ps the ContextState containing the stack information needed
* for evaluation
* @return the result of the evaluation
**/
ExprResult* NodeSetFunctionCall::evaluate(Node* context, ContextState* cs) {
NodeSet* nodeSet = (NodeSet*)cs->getNodeSetStack()->peek();
ListIterator* iter = params.iterator();
PRInt32 argc = params.getLength();
ExprResult* result = 0;
Expr* param = 0;
switch ( type ) {
case COUNT :
if ( argc == 1 ) {
double count = 0.0;
param = (Expr*)iter->next();
ExprResult* exprResult = param->evaluate(context, cs);
if ( exprResult->getResultType() != ExprResult::NODESET ) {
String err("NodeSet expected as argument to count()");
cs->recieveError(err);
}
else count = (double) ((NodeSet*)exprResult)->size();
delete exprResult;
result = new NumberResult(count);
}
else {
String err(INVALID_PARAM_COUNT);
this->toString(err);
cs->recieveError(err);
result = new NumberResult(0.0);
}
break;
case ID :
if ( requireParams(1, 1, cs) ) {
NodeSet* resultSet = new NodeSet();
param = (Expr*)iter->next();
ExprResult* exprResult = param->evaluate(context, cs);
String lIDList;
if ( exprResult->getResultType() == ExprResult::NODESET ) {
NodeSet *lNList = (NodeSet *)exprResult;
NodeSet tmp;
for (int i=0; i<lNList->size(); i++){
tmp.add(0,lNList->get(i));
tmp.stringValue(lIDList);
lIDList.append(' ');
};
} else {
exprResult->stringValue(lIDList);
};
lIDList.trim();
PRInt32 start=0,end;
MBool hasSpace = MB_FALSE, isSpace;
UNICODE_CHAR cc;
String thisID;
for (end=0; end<lIDList.length(); end++){
cc = lIDList.charAt(end);
isSpace = (cc==' ' || cc=='\n' || cc=='\t'|| cc=='\r');
if (isSpace && !hasSpace){
hasSpace = MB_TRUE;
lIDList.subString(start, end, thisID);
resultSet->add(context->getOwnerDocument()->getElementById(thisID));
} else if (!isSpace && hasSpace){
start = end;
hasSpace = MB_FALSE;
};
};
lIDList.subString(start, end, thisID);
resultSet->add(context->getOwnerDocument()->getElementById(thisID));
result = resultSet;
};
break;
case LAST :
if ( nodeSet ) result = new NumberResult((double)nodeSet->size());
else result = new NumberResult(0.0);
break;
case LOCAL_NAME:
case NAME:
case NAMESPACE_URI :
{
String name;
Node* node = 0;
if ( argc < 2 ) {
//-- check for optional arg
if ( argc == 1) {
param = (Expr*)iter->next();
ExprResult* exprResult = param->evaluate(context, cs);
if ( exprResult->getResultType() != ExprResult::NODESET ) {
String err("NodeSet expected as argument to ");
this->toString(err);
cs->recieveError(err);
}
else {
NodeSet* nodes = (NodeSet*)exprResult;
if (nodes->size() > 0) node = nodes->get(0);
}
delete exprResult;
}
//if ( !node ) node = context; ///Marina
else node = context;
//-- if no node was found just return an empty string (Marina)
if ( !node ) {
result = new StringResult("");
break;
}
switch ( type ) {
case LOCAL_NAME :
switch (node->getNodeType()) {
case Node::ATTRIBUTE_NODE :
case Node::ELEMENT_NODE :
case Node::PROCESSING_INSTRUCTION_NODE :
// XXX Namespace: namespaces have a local name
XMLUtils::getLocalPart(node->getNodeName(),name);
break;
default:
break;
}
break;
case NAMESPACE_URI :
XMLUtils::getNameSpace(node->getNodeName(),name);
break;
default:
switch (node->getNodeType()) {
case Node::ATTRIBUTE_NODE :
case Node::ELEMENT_NODE :
case Node::PROCESSING_INSTRUCTION_NODE :
// XXX Namespace: namespaces have a name
name = node->getNodeName();
break;
default:
break;
}
break;
}
result = new StringResult(name);
}
else {
String err(INVALID_PARAM_COUNT);
this->toString(err);
cs->recieveError(err);
result = new StringResult("");
}
break;
}
default : //-- position
if ( nodeSet )
result = new NumberResult((double)nodeSet->indexOf(context)+1);
else
result = new NumberResult(0.0);
break;
}
delete iter;
return result;
} //-- evaluate