|
48861
|
1 |
/*
|
|
|
2 |
* Copyright (c) 2017, 2017, Oracle and/or its affiliates. All rights reserved.
|
|
|
3 |
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
|
|
4 |
*
|
|
|
5 |
* This code is free software; you can redistribute it and/or modify it
|
|
|
6 |
* under the terms of the GNU General Public License version 2 only, as
|
|
|
7 |
* published by the Free Software Foundation. Oracle designates this
|
|
|
8 |
* particular file as subject to the "Classpath" exception as provided
|
|
|
9 |
* by Oracle in the LICENSE file that accompanied this code.
|
|
|
10 |
*
|
|
|
11 |
* This code is distributed in the hope that it will be useful, but WITHOUT
|
|
|
12 |
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
|
|
13 |
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
|
|
14 |
* version 2 for more details (a copy is included in the LICENSE file that
|
|
|
15 |
* accompanied this code).
|
|
|
16 |
*
|
|
|
17 |
* You should have received a copy of the GNU General Public License version
|
|
|
18 |
* 2 along with this work; if not, write to the Free Software Foundation,
|
|
|
19 |
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
|
|
20 |
*
|
|
|
21 |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
|
|
22 |
* or visit www.oracle.com if you need additional information or have any
|
|
|
23 |
* questions.
|
|
|
24 |
*/
|
|
|
25 |
package org.graalvm.collections;
|
|
|
26 |
|
|
|
27 |
/**
|
|
|
28 |
* Unmodifiable memory efficient set data structure.
|
|
|
29 |
*
|
|
|
30 |
* @since 1.0
|
|
|
31 |
*/
|
|
|
32 |
public interface UnmodifiableEconomicSet<E> extends Iterable<E> {
|
|
|
33 |
|
|
|
34 |
/**
|
|
|
35 |
* Returns {@code true} if this set contains a mapping for the {@code element}.
|
|
|
36 |
*
|
|
|
37 |
* @since 1.0
|
|
|
38 |
*/
|
|
|
39 |
boolean contains(E element);
|
|
|
40 |
|
|
|
41 |
/**
|
|
|
42 |
* Returns the number of elements in this set.
|
|
|
43 |
*
|
|
|
44 |
* @since 1.0
|
|
|
45 |
*/
|
|
|
46 |
int size();
|
|
|
47 |
|
|
|
48 |
/**
|
|
|
49 |
* Returns {@code true} if this set contains no elements.
|
|
|
50 |
*
|
|
|
51 |
* @since 1.0
|
|
|
52 |
*/
|
|
|
53 |
boolean isEmpty();
|
|
|
54 |
|
|
|
55 |
/**
|
|
|
56 |
* Stores all of the elements in this set into {@code target}. An
|
|
|
57 |
* {@link UnsupportedOperationException} will be thrown if the length of {@code target} does not
|
|
|
58 |
* match the size of this set.
|
|
|
59 |
*
|
|
|
60 |
* @return an array containing all the elements in this set.
|
|
|
61 |
* @throws UnsupportedOperationException if the length of {@code target} does not equal the size
|
|
|
62 |
* of this set.
|
|
|
63 |
* @since 1.0
|
|
|
64 |
*/
|
|
|
65 |
default E[] toArray(E[] target) {
|
|
|
66 |
if (target.length != size()) {
|
|
|
67 |
throw new UnsupportedOperationException("Length of target array must equal the size of the set.");
|
|
|
68 |
}
|
|
|
69 |
|
|
|
70 |
int index = 0;
|
|
|
71 |
for (E element : this) {
|
|
|
72 |
target[index++] = element;
|
|
|
73 |
}
|
|
|
74 |
|
|
|
75 |
return target;
|
|
|
76 |
}
|
|
|
77 |
}
|