axel%pike.org 026441d1ea Bustage fix for sicking ...

git-svn-id: svn://10.0.0.236/trunk@113705 18797224-902f-48f8-a5cc-f745e15eee43

2002-02-05 15:24:52 +00:00

..

AdditiveExpr.cpp

…

AttributeExpr.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

AttributeValueTemplate.cpp

…

BasicNodeExpr.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

BooleanExpr.cpp

…

BooleanFunctionCall.cpp

…

BooleanResult.cpp

…

ElementExpr.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

ErrorFunctionCall.cpp

…

Expr.cpp

…

Expr.h

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

ExprLexer.cpp

…

ExprLexer.h

…

ExprLexerChars.cpp

…

ExprParser.cpp

…

ExprParser.h

…

ExprResult.h

…

ExtensionFunctionCall.cpp

…

FilterExpr.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

FunctionCall.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

FunctionLib.h

…

LocationStep.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

Makefile.in

…

makefile.win

…

MultiplicativeExpr.cpp

…

NodeSet.cpp

Bustage fix for sicking

2002-02-05 15:24:52 +00:00

NodeSet.h

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

NodeSetFunctionCall.cpp

…

nsNodeSet.cpp

…

nsNodeSet.h

…

NumberExpr.cpp

…

NumberFunctionCall.cpp

…

NumberResult.cpp

…

PathExpr.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

PredicateList.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

RelationalExpr.cpp

Fix IRIX bustage

2002-02-03 21:36:03 +00:00

RootExpr.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

StringExpr.cpp

…

StringFunctionCall.cpp

…

StringResult.cpp

…

TextExpr.cpp

…

txXPathAtomList.h

…

UnaryExpr.cpp

…

UnionExpr.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

VariableRefExpr.cpp

Speed up NodeSets by always keeping them in document order. Only sort when we get nodes in random order (such as for id()) or when merging NodeSets.

2002-02-05 14:22:34 +00:00

XPathNames.cpp

…

XPathProcessor.cpp

…

XPathProcessor.h

…