blob: 08f0dd739f664888aa092ee51a1edff7f3985d40 (
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
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
|
/* simple-result-set.vala
*
* Copyright © 2012 Canonical Ltd.
* By Siegfried-A. Gevatter <siegfried.gevatter@collabora.co.uk>
*
* Based upon a C implementation (© 2009 Canonical Ltd) by:
* Mikkel Kamstrup Erlandsen <mikkel.kamstrup@canonical.com>
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License as published by
* the Free Software Foundation, either version 2.1 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*
*/
namespace Zeitgeist
{
public class SimpleResultSet : Object, ResultSet
{
private GenericArray<Event> events;
private uint num_estimated_matches;
private uint cursor;
public SimpleResultSet (GenericArray<Event> events)
{
this.events = events;
num_estimated_matches = events.length;
cursor = 0;
}
public SimpleResultSet.with_num_matches (
GenericArray<Event> events, uint matches)
{
this.events = events;
num_estimated_matches = matches;
cursor = 0;
}
public uint size ()
{
return events.length;
}
public uint estimated_matches ()
{
return num_estimated_matches;
}
public uint tell ()
{
return cursor;
}
public bool has_next ()
{
return cursor < events.length;
}
public Event? next_value ()
{
if (!has_next ())
return null;
return events.get (cursor++);
}
public void reset ()
{
cursor = 0;
}
}
}
// vim:expandtab:ts=4:sw=4
|
