1 : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 : /* ***** BEGIN LICENSE BLOCK *****
3 : * Version: MPL 1.1/GPL 2.0/LGPL 2.1
4 : *
5 : * The contents of this file are subject to the Mozilla Public License Version
6 : * 1.1 (the "License"); you may not use this file except in compliance with
7 : * the License. You may obtain a copy of the License at
8 : * http://www.mozilla.org/MPL/
9 : *
10 : * Software distributed under the License is distributed on an "AS IS" basis,
11 : * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12 : * for the specific language governing rights and limitations under the
13 : * License.
14 : *
15 : * The Original Code is mozilla.org code.
16 : *
17 : * The Initial Developer of the Original Code is
18 : * Peter Van der Beken.
19 : * Portions created by the Initial Developer are Copyright (C) 2005
20 : * the Initial Developer. All Rights Reserved.
21 : *
22 : * Contributor(s):
23 : * Peter Van der Beken <peterv@propagandism.org>
24 : *
25 : *
26 : * Alternatively, the contents of this file may be used under the terms of
27 : * either the GNU General Public License Version 2 or later (the "GPL"), or
28 : * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
29 : * in which case the provisions of the GPL or the LGPL are applicable instead
30 : * of those above. If you wish to allow use of your version of this file only
31 : * under the terms of either the GPL or the LGPL, and not to allow others to
32 : * use your version of this file under the terms of the MPL, indicate your
33 : * decision by deleting the provisions above and replace them with the notice
34 : * and other provisions required by the GPL or the LGPL. If you do not delete
35 : * the provisions above, a recipient may use your version of this file under
36 : * the terms of any one of the MPL, the GPL or the LGPL.
37 : *
38 : * ***** END LICENSE BLOCK ***** */
39 :
40 : #include "txNodeSetAdaptor.h"
41 : #include "txXPathTreeWalker.h"
42 :
43 0 : txNodeSetAdaptor::txNodeSetAdaptor()
44 : : txXPathObjectAdaptor(),
45 0 : mWritable(true)
46 : {
47 0 : }
48 :
49 0 : txNodeSetAdaptor::txNodeSetAdaptor(txNodeSet *aNodeSet)
50 : : txXPathObjectAdaptor(aNodeSet),
51 0 : mWritable(false)
52 : {
53 0 : }
54 :
55 0 : NS_IMPL_ISUPPORTS_INHERITED1(txNodeSetAdaptor, txXPathObjectAdaptor, txINodeSet)
56 :
57 : nsresult
58 0 : txNodeSetAdaptor::Init()
59 : {
60 0 : if (!mValue) {
61 0 : mValue = new txNodeSet(nsnull);
62 : }
63 :
64 0 : return mValue ? NS_OK : NS_ERROR_OUT_OF_MEMORY;
65 : }
66 :
67 : NS_IMETHODIMP
68 0 : txNodeSetAdaptor::Item(PRUint32 aIndex, nsIDOMNode **aResult)
69 : {
70 0 : *aResult = nsnull;
71 :
72 0 : if (aIndex > (PRUint32)NodeSet()->size()) {
73 0 : return NS_ERROR_ILLEGAL_VALUE;
74 : }
75 :
76 0 : return txXPathNativeNode::getNode(NodeSet()->get(aIndex), aResult);
77 : }
78 :
79 : NS_IMETHODIMP
80 0 : txNodeSetAdaptor::ItemAsNumber(PRUint32 aIndex, double *aResult)
81 : {
82 0 : if (aIndex > (PRUint32)NodeSet()->size()) {
83 0 : return NS_ERROR_ILLEGAL_VALUE;
84 : }
85 :
86 0 : nsAutoString result;
87 0 : txXPathNodeUtils::appendNodeValue(NodeSet()->get(aIndex), result);
88 :
89 0 : *aResult = txDouble::toDouble(result);
90 :
91 0 : return NS_OK;
92 : }
93 :
94 : NS_IMETHODIMP
95 0 : txNodeSetAdaptor::ItemAsString(PRUint32 aIndex, nsAString &aResult)
96 : {
97 0 : if (aIndex > (PRUint32)NodeSet()->size()) {
98 0 : return NS_ERROR_ILLEGAL_VALUE;
99 : }
100 :
101 0 : txXPathNodeUtils::appendNodeValue(NodeSet()->get(aIndex), aResult);
102 :
103 0 : return NS_OK;
104 : }
105 :
106 : NS_IMETHODIMP
107 0 : txNodeSetAdaptor::GetLength(PRUint32 *aLength)
108 : {
109 0 : *aLength = (PRUint32)NodeSet()->size();
110 :
111 0 : return NS_OK;
112 : }
113 :
114 : NS_IMETHODIMP
115 0 : txNodeSetAdaptor::Add(nsIDOMNode *aNode)
116 : {
117 0 : NS_ENSURE_TRUE(mWritable, NS_ERROR_FAILURE);
118 :
119 : nsAutoPtr<txXPathNode> node(txXPathNativeNode::createXPathNode(aNode,
120 0 : true));
121 :
122 0 : return node ? NodeSet()->add(*node) : NS_ERROR_OUT_OF_MEMORY;
123 : }
|