/usr/share/gluegen2/src/java/com/jogamp/common/util/ArrayHashSet.java is in libgluegen2-build-java 2.0-rc3-6.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 | /**
* Copyright 2010 JogAmp Community. 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 JogAmp Community ``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 JogAmp Community 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.
*
* The views and conclusions contained in the software and documentation are those of the
* authors and should not be interpreted as representing official policies, either expressed
* or implied, of JogAmp Community.
*/
package com.jogamp.common.util;
import java.util.ArrayList;
import java.util.Collection;
import java.util.HashMap;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
/**
* Hashed ArrayList implementation of the List and Collection interface.
*
* Implementation properties are:
* <ul>
* <li> Unique elements utilizing {@link java.lang.Object#hashCode()} for O(1) operations, see below.</li>
* <li> Provides {@link java.util.List} functionality,
* ie {@link java.util.List#indexOf(java.lang.Object)}
* and {@link java.util.List#get(int)}, hence object identity can be implemented.</li>
* <li> Object identity via {@link #get(java.lang.Object)}</li>
* <li> Java 1.5 compatible</li>
* </ul>
*
* O(1) operations:
* <ul>
* <li> adding new element(s) </li>
* <li> test for containment </li>
* <li> identity </li>
* <li> trying to remove non existent elements </li>
* </ul>
*
* O(n) operations:
* <ul>
* <li> removing existing elements</li>
* </ul>
*
* For thread safety, the application shall decorate access to instances via
* {@link com.jogamp.common.util.locks.RecursiveLock}.
*
*/
public class ArrayHashSet<E>
implements Cloneable, Collection<E>, List<E>
{
HashMap<E,E> map = new HashMap<E,E>(); // object -> object
ArrayList<E> data = new ArrayList<E>(); // list of objects
public ArrayHashSet() {
clear();
}
//
// Cloneable
//
/**
* @return a shallow copy of this ArrayHashSet, elements are not copied.
*/
public final Object clone() {
ArrayList<E> clonedList = (ArrayList<E>)data.clone();
ArrayHashSet<E> newObj = new ArrayHashSet<E>();
newObj.addAll(clonedList);
return newObj;
}
//
// Collection
//
public final void clear() {
data.clear();
map.clear();
}
/**
* Add element at the end of this list, if it is not contained yet.
* <br>
* This is an O(1) operation
*
* @return true if the element was added to this list,
* otherwise false (already contained).
*/
public final boolean add(E element) {
boolean exists = map.containsKey(element);
if(!exists) {
if(null != map.put(element, element)) {
throw new InternalError("Already existing, but checked before: "+element);
}
if(!data.add(element)) {
throw new InternalError("Couldn't add element: "+element);
}
}
return !exists;
}
/**
* Remove element from this list.
* <br>
* This is an O(1) operation, in case it does not exist,
* otherwise O(n).
*
* @return true if the element was removed from this list,
* otherwise false (not contained).
*/
public final boolean remove(Object element) {
if ( null != map.remove(element) ) {
if ( ! data.remove(element) ) {
throw new InternalError("Couldn't remove prev mapped element: "+element);
}
return true;
}
return false;
}
/**
* Add all elements of given {@link java.util.Collection} at the end of this list.
* <br>
* This is an O(n) operation, over the given Collection size.
*
* @return true if at least one element was added to this list,
* otherwise false (completely container).
*/
public final boolean addAll(Collection<? extends E> c) {
boolean mod = false;
for (Iterator<? extends E> iter = c.iterator(); iter.hasNext(); ) {
mod = mod || add(iter.next()) ;
}
return mod;
}
/**
* Test for containment
* <br>
* This is an O(1) operation.
*
* @return true if the given element is contained by this list using fast hash map,
* otherwise false.
*/
public final boolean contains(Object element) {
return map.containsKey(element);
}
/**
* Test for containment of given {@link java.util.Collection}
* <br>
* This is an O(n) operation, over the given Collection size.
*
* @return true if the given Collection is completly contained by this list using hash map,
* otherwise false.
*/
public final boolean containsAll(Collection<?> c) {
for (Iterator<?> iter = c.iterator(); iter.hasNext(); ) {
if (! this.contains(iter.next()) ) {
return false;
}
}
return true;
}
/**
* Remove all elements of given {@link java.util.Collection} from this list.
* <br>
* This is an O(n) operation.
*
* @return true if at least one element of this list was removed,
* otherwise false.
*/
public final boolean removeAll(Collection<?> c) {
boolean mod = false;
for (Iterator<?> iter = c.iterator(); iter.hasNext(); ) {
mod = this.remove(iter.next()) || mod;
}
return mod;
}
/**
* Retain all elements of the given {@link java.util.Collection} c, ie
* remove all elements not contained by the given {@link java.util.Collection} c.
* <br>
* This is an O(n) operation.
*
* @return true if at least one element of this list was removed,
* otherwise false.
*/
public final boolean retainAll(Collection<?> c) {
boolean mod = false;
for (Iterator<?> iter = this.iterator(); iter.hasNext(); ) {
Object o = iter.next();
if (! c.contains(o) ) {
mod = this.remove(o) || mod;
}
}
return mod;
}
/**
* This is an O(n) operation.
*
* @return true if arrayHashSet is of type ArrayHashSet and all entries are equal
* Performance: arrayHashSet(1)
*/
public final boolean equals(Object arrayHashSet) {
if ( !(arrayHashSet instanceof ArrayHashSet) ) {
return false;
}
return data.equals(((ArrayHashSet<?>)arrayHashSet).data);
}
/**
* This is an O(n) operation over the size of this list.
*
* @return the hash code of this list as define in {@link java.util.List#hashCode()},
* ie hashing all elements of this list.
*/
public final int hashCode() {
return data.hashCode();
}
public final boolean isEmpty() {
return data.isEmpty();
}
public final Iterator<E> iterator() {
return data.iterator();
}
public final int size() {
return data.size();
}
public final Object[] toArray() {
return data.toArray();
}
public final <T> T[] toArray(T[] a) {
return data.toArray(a);
}
//
// List
//
public final E get(int index) {
return data.get(index);
}
public final int indexOf(Object element) {
return data.indexOf(element);
}
/**
* Add element at the given index in this list, if it is not contained yet.
* <br>
* This is an O(1) operation
*
* @throws IllegalArgumentException if the given element was already contained
*/
public final void add(int index, E element) {
if ( map.containsKey(element) ) {
throw new IllegalArgumentException("Element "+element+" is already contained");
}
if(null != map.put(element, element)) {
throw new InternalError("Already existing, but checked before: "+element);
}
data.add(index, element);
}
/**
* @throws UnsupportedOperationException
*/
public final boolean addAll(int index, Collection<? extends E> c) {
throw new UnsupportedOperationException("Not supported yet.");
}
/**
* @throws UnsupportedOperationException
*/
public final E set(int index, E element) {
E old = remove(index);
if(null!=old) {
add(index, element);
}
return old;
}
/**
* Remove element at given index from this list.
* <br>
* This is an O(n) operation.
*
* @return the removed object
*/
public final E remove(int index) {
E o = get(index);
if( null!=o && remove(o) ) {
return o;
}
return null;
}
/**
* Since this list is unique, equivalent to {@link #indexOf(java.lang.Object)}.
* <br>
* This is an O(n) operation.
*
* @return index of element, or -1 if not found
*/
public final int lastIndexOf(Object o) {
return indexOf(o);
}
public final ListIterator<E> listIterator() {
return data.listIterator();
}
public final ListIterator<E> listIterator(int index) {
return data.listIterator(index);
}
public final List<E> subList(int fromIndex, int toIndex) {
return data.subList(fromIndex, toIndex);
}
//
// ArrayHashSet
//
/**
* @return a shallow copy of this ArrayHashSet's ArrayList, elements are not copied.
*/
public final ArrayList<E> toArrayList() {
return (ArrayList<E>) data.clone();
}
/**
* Identity method allowing to get the identical object, using the internal hash map.
* <br>
* This is an O(1) operation.
*
* @param key hash source to find the identical Object within this list
* @return object from this list, identical to the given <code>key</code> hash code,
* or null if not contained
*/
public final E get(Object key) {
return map.get(key);
}
/**
* Identity method allowing to get the identical object, using the internal hash map.<br>
* If the <code>key</code> is not yet contained, add it.
* <br>
* This is an O(1) operation.
*
* @param key hash source to find the identical Object within this list
* @return object from this list, identical to the given <code>key</code> hash code,
* or add the given <code>key</code> and return it.
*/
public final E getOrAdd(E key) {
E identity = get(key);
if(null == identity) {
// object not contained yet, add it
if(!this.add(key)) {
throw new InternalError("Key not mapped, but contained in list: "+key);
}
identity = key;
}
return identity;
}
/**
* Test for containment
* <br>
* This is an O(n) operation, using equals operation over the list.
* <br>
* You may utilize this method to verify your hash values,<br>
* ie {@link #contains(java.lang.Object)} and {@link #containsSafe(java.lang.Object)}
* shall have the same result.<br>
*
* @return true if the given element is contained by this list using slow equals operation,
* otherwise false.
*/
public final boolean containsSafe(Object element) {
return data.contains(element);
}
}
|