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
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
|
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* 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 XPCOM Array implementation.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corp.
* Portions created by the Initial Developer are Copyright (C) 2002
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
* Alec Flett <alecf@netscape.com>
*
* Alternatively, the contents of this file may be used under the terms of
* either the GNU General Public License Version 2 or later (the "GPL"), or
* the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
#include "nsArray.h"
#include "nsArrayEnumerator.h"
#include "nsWeakReference.h"
// used by IndexOf()
struct findIndexOfClosure
{
nsISupports *targetElement;
PRUint32 startIndex;
PRUint32 resultIndex;
};
PR_STATIC_CALLBACK(PRBool) FindElementCallback(void* aElement, void* aClosure);
NS_IMPL_ISUPPORTS2(nsArray, nsIArray, nsIMutableArray)
nsArray::~nsArray()
{
Clear();
}
NS_IMETHODIMP
nsArray::GetLength(PRUint32* aLength)
{
*aLength = mArray.Count();
return NS_OK;
}
NS_IMETHODIMP
nsArray::QueryElementAt(PRUint32 aIndex,
const nsIID& aIID,
void ** aResult)
{
nsISupports * obj = mArray.ObjectAt(aIndex);
if (!obj) return NS_ERROR_UNEXPECTED;
// no need to worry about a leak here, because ObjectAt() doesn't
// addref its result
return obj->QueryInterface(aIID, aResult);
}
NS_IMETHODIMP
nsArray::IndexOf(PRUint32 aStartIndex, nsISupports* aElement,
PRUint32* aResult)
{
// optimize for the common case by forwarding to mArray
if (aStartIndex == 0) {
*aResult = mArray.IndexOf(aElement);
if (*aResult == -1)
return NS_ERROR_FAILURE;
return NS_OK;
}
findIndexOfClosure closure = { aElement, aStartIndex, 0 };
PRBool notFound = mArray.EnumerateForwards(FindElementCallback, &closure);
if (notFound)
return NS_ERROR_FAILURE;
*aResult = closure.resultIndex;
return NS_OK;
}
NS_IMETHODIMP
nsArray::Enumerate(nsISimpleEnumerator **aResult)
{
return NS_NewArrayEnumerator(aResult, NS_STATIC_CAST(nsIArray*, this));
}
// nsIMutableArray implementation
NS_IMETHODIMP
nsArray::AppendElement(nsISupports* aElement, PRBool aWeak)
{
PRBool result;
if (aWeak) {
nsCOMPtr<nsISupports> elementRef =
getter_AddRefs(NS_STATIC_CAST(nsISupports*,
NS_GetWeakReference(aElement)));
NS_ASSERTION(elementRef, "AppendElement: Trying to use weak references on an object that doesn't support it");
if (!elementRef)
return NS_ERROR_FAILURE;
result = mArray.AppendObject(elementRef);
}
else {
// add the object directly
result = mArray.AppendObject(aElement);
}
return result ? NS_OK : NS_ERROR_FAILURE;
}
NS_IMETHODIMP
nsArray::RemoveElementAt(PRUint32 aIndex)
{
PRBool result = mArray.RemoveObjectAt(aIndex);
return result ? NS_OK : NS_ERROR_FAILURE;
}
NS_IMETHODIMP
nsArray::InsertElementAt(nsISupports* aElement, PRUint32 aIndex, PRBool aWeak)
{
nsCOMPtr<nsISupports> elementRef;
if (aWeak) {
elementRef =
getter_AddRefs(NS_STATIC_CAST(nsISupports*,
NS_GetWeakReference(aElement)));
NS_ASSERTION(elementRef, "InsertElementAt: Trying to use weak references on an object that doesn't support it");
if (!elementRef)
return NS_ERROR_FAILURE;
} else {
elementRef = aElement;
}
PRBool result = mArray.InsertObjectAt(elementRef, aIndex);
return result ? NS_OK : NS_ERROR_FAILURE;
}
NS_IMETHODIMP
nsArray::Clear()
{
mArray.Clear();
return NS_OK;
}
//
// static helper routines
//
PRBool
FindElementCallback(void *aElement, void* aClosure)
{
findIndexOfClosure* closure =
NS_STATIC_CAST(findIndexOfClosure*, aClosure);
nsISupports* element =
NS_STATIC_CAST(nsISupports*, aElement);
// don't start searching until we're past the startIndex
if (closure->resultIndex >= closure->startIndex &&
element == closure->targetElement) {
return PR_FALSE; // stop! We found it
}
closure->resultIndex++;
return PR_TRUE;
}
//
// do_QueryElementAt helper stuff
//
nsresult
nsQueryArrayElementAt::operator()(const nsIID& aIID, void** aResult) const
{
nsresult status = mArray
? mArray->QueryElementAt(mIndex, aIID, aResult)
: NS_ERROR_NULL_POINTER;
if (mErrorPtr)
*mErrorPtr = status;
return status;
}
//
// exported constructor routines
//
nsresult
NS_NewArray(nsIMutableArray** aResult)
{
nsArray* arr = new nsArray;
if (!arr) return NS_ERROR_OUT_OF_MEMORY;
*aResult = NS_STATIC_CAST(nsIMutableArray*,arr);
NS_ADDREF(*aResult);
return NS_OK;
}
nsresult
NS_NewArray(nsIMutableArray** aResult, const nsCOMArray_base& aBaseArray)
{
nsArray* arr = new nsArray(aBaseArray);
if (!arr) return NS_ERROR_OUT_OF_MEMORY;
*aResult = NS_STATIC_CAST(nsIMutableArray*, arr);
NS_ADDREF(*aResult);
return NS_OK;
}
|
