forked from open-osrs/runelite
-
Notifications
You must be signed in to change notification settings - Fork 1
/
QueryResults.java
171 lines (146 loc) · 3.65 KB
/
QueryResults.java
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
/*
* Copyright (c) 2019, tha23rd <https://https://github.com/tha23rd>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
* ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package net.runelite.api;
import java.util.ArrayList;
import java.util.Collection;
import java.util.Iterator;
import java.util.List;
import javax.annotation.Nullable;
public class QueryResults<EntityType> implements Collection<EntityType>
{
public final ArrayList<EntityType> list;
public QueryResults(Collection<? extends EntityType> results)
{
if (results == null)
{
list = new ArrayList<>();
}
else
{
if (results instanceof ArrayList)
{
list = (ArrayList<EntityType>) results;
}
else
{
list = new ArrayList<>(results);
}
}
}
@Override
public int size()
{
return list.size();
}
@Override
public boolean isEmpty()
{
return this.size() == 0;
}
@Override
public boolean contains(Object o)
{
return list.contains(o);
}
@Override
public Iterator<EntityType> iterator()
{
return list.iterator();
}
@Override
public Object[] toArray()
{
return list.toArray();
}
@Override
public <entityType> entityType[] toArray(entityType[] a)
{
return (entityType[]) this.list.toArray();
}
@Override
public boolean add(EntityType entityType)
{
return list.add(entityType);
}
@Override
public boolean remove(Object o)
{
return list.remove(o);
}
@Override
public boolean containsAll(Collection<?> c)
{
return list.containsAll(c);
}
@Override
public boolean addAll(Collection<? extends EntityType> c)
{
return list.addAll(c);
}
@Override
public boolean removeAll(Collection<?> c)
{
return list.removeAll(c);
}
@Override
public boolean retainAll(Collection<?> c)
{
return list.retainAll(c);
}
@Override
public void clear()
{
list.clear();
}
@Nullable
public final EntityType first()
{
return this.size() == 0 ? null : this.get(0);
}
@Nullable
public final EntityType last()
{
int size;
return (size = this.size()) == 0 ? null : this.get(size - 1);
}
public EntityType get(int index)
{
return list.get(index);
}
public final QueryResults limit(int entries)
{
return this.limit(0, entries);
}
public final QueryResults limit(int startIndex, int amount)
{
List<EntityType> limitedList = new ArrayList<>(amount);
for (int i = startIndex; i < this.size() && i - startIndex < amount; i++)
{
limitedList.add(this.get(i));
}
this.list.retainAll(limitedList);
return this;
}
}