blob: e4f3d1f3584e296bdaacbaa273bc4a709c1d6e99 (
plain)
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
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*-
* vim: sw=2 ts=2 et lcs=trail\:.,tab\:>~ :
* 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/. */
#include "mozStorageRow.h"
#include "mozStorageResultSet.h"
namespace mozilla {
namespace storage {
////////////////////////////////////////////////////////////////////////////////
//// ResultSet
ResultSet::ResultSet()
: mCurrentIndex(0)
{
}
ResultSet::~ResultSet()
{
mData.Clear();
}
nsresult
ResultSet::add(mozIStorageRow *aRow)
{
return mData.AppendObject(aRow) ? NS_OK : NS_ERROR_OUT_OF_MEMORY;
}
/**
* Note: This object is only ever accessed on one thread at a time. It it not
* threadsafe, but it does need threadsafe AddRef and Release.
*/
NS_IMPL_ISUPPORTS(
ResultSet,
mozIStorageResultSet
)
////////////////////////////////////////////////////////////////////////////////
//// mozIStorageResultSet
NS_IMETHODIMP
ResultSet::GetNextRow(mozIStorageRow **_row)
{
NS_ENSURE_ARG_POINTER(_row);
if (mCurrentIndex >= mData.Count()) {
// Just return null here
return NS_OK;
}
NS_ADDREF(*_row = mData.ObjectAt(mCurrentIndex++));
return NS_OK;
}
} // namespace storage
} // namespace mozilla
|
