author David Anderson <>
Mon, 21 May 2012 14:40:04 -0700
changeset 109823 80e4ab0d24bc64ceaa7693ab5def36faffde7a40
parent 108942 7ceaa303896bae686f83081212fec143d3dfd21d
parent 96742 f4157e8c410708d76703f19e4dfb61859bfe32d8
child 110302 c4f83d9d8243f3f853a5356188164a5fddee2b5a
permissions -rw-r--r--
Merge from mozilla-central.

/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
 * License, v. 2.0. If a copy of the MPL was not distributed with this
 * file, You can obtain one at */


#include "txCore.h"
#include "txList.h"

class Expr;
class txExecutionState;
class txNodeSet;
class txObject;
class txXPathResultComparator;
class txIEvalContext;
class txNodeSetContext;

 * Sorts Nodes as specified by the W3C XSLT 1.0 Recommendation

class txNodeSorter

    nsresult addSortElement(Expr* aSelectExpr, Expr* aLangExpr,
                            Expr* aDataTypeExpr, Expr* aOrderExpr,
                            Expr* aCaseOrderExpr, txIEvalContext* aContext);
    nsresult sortNodeSet(txNodeSet* aNodes, txExecutionState* aEs,
                         txNodeSet** aResult);

    struct SortData
        txNodeSorter* mNodeSorter;
        txNodeSetContext* mContext;
        txObject** mSortValues;
        nsresult mRv;
    struct SortKey
        Expr* mExpr;
        txXPathResultComparator* mComparator;

    static int compareNodes(const void* aIndexA, const void* aIndexB,
                            void* aSortData);
    static bool calcSortValue(txObject*& aSortValue, SortKey* aKey,
                              SortData* aSortData, PRUint32 aNodeIndex);
    txList mSortKeys;
    unsigned int mNKeys;