1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* 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 http://mozilla.org/MPL/2.0/. */
#ifndef TRANSFRMX_NODESORTER_H
#define TRANSFRMX_NODESORTER_H
#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 {
public:
txNodeSorter();
~txNodeSorter();
nsresult addSortElement(Expr* aSelectExpr, Expr* aLangExpr,
Expr* aDataTypeExpr, Expr* aOrderExpr,
Expr* aCaseOrderExpr, txIEvalContext* aContext);
nsresult sortNodeSet(txNodeSet* aNodes, txExecutionState* aEs,
txNodeSet** aResult);
private:
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, uint32_t aNodeIndex);
txList mSortKeys;
unsigned int mNKeys;
};
#endif
|
