d1f0dd612d
git-svn-id: https://osmand.googlecode.com/svn/trunk@602 e29c36b1-1cfa-d876-8d93-3434fc2bb7b8
320 lines
10 KiB
Java
320 lines
10 KiB
Java
///////////////////////////////////////////////////////////////////////////////
|
|
// Copyright (c) 2001, Eric D. Friedman All Rights Reserved.
|
|
// Copyright (c) 2009, Rob Eden All Rights Reserved.
|
|
// Copyright (c) 2009, Jeff Randall All Rights Reserved.
|
|
//
|
|
// This library 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 library 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, write to the Free Software
|
|
// Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
|
|
///////////////////////////////////////////////////////////////////////////////
|
|
|
|
package gnu.trove.set;
|
|
|
|
|
|
//////////////////////////////////////////////////
|
|
// THIS IS A GENERATED CLASS. DO NOT HAND EDIT! //
|
|
//////////////////////////////////////////////////
|
|
|
|
import gnu.trove.iterator.TLongIterator;
|
|
import gnu.trove.procedure.TLongProcedure;
|
|
import gnu.trove.TLongCollection;
|
|
|
|
import java.util.Collection;
|
|
import java.util.Set;
|
|
import java.io.Serializable;
|
|
|
|
/**
|
|
* An implementation of the <tt>Set</tt> interface that uses an
|
|
* open-addressed hash table to store its contents.
|
|
*
|
|
* Created: Sat Nov 3 10:38:17 2001
|
|
*
|
|
* @author Eric D. Friedman, Rob Eden, Jeff Randall
|
|
* @version $Id: _E_Set.template,v 1.1.2.5 2009/09/15 02:38:31 upholderoftruth Exp $
|
|
*/
|
|
|
|
public interface TLongSet extends TLongCollection, Serializable {
|
|
|
|
|
|
/**
|
|
* Returns the value that is used to represent null. The default
|
|
* value is generally zero, but can be changed during construction
|
|
* of the collection.
|
|
*
|
|
* @return the value that represents null
|
|
*/
|
|
long getNoEntryValue();
|
|
|
|
|
|
/**
|
|
* Returns the number of elements in this set (its cardinality). If this
|
|
* set contains more than <tt>Integer.MAX_VALUE</tt> elements, returns
|
|
* <tt>Integer.MAX_VALUE</tt>.
|
|
*
|
|
* @return the number of elements in this set (its cardinality)
|
|
*/
|
|
int size();
|
|
|
|
|
|
/**
|
|
* Returns <tt>true</tt> if this set contains no elements.
|
|
*
|
|
* @return <tt>true</tt> if this set contains no elements
|
|
*/
|
|
boolean isEmpty();
|
|
|
|
|
|
/**
|
|
* Returns <tt>true</tt> if this set contains the specified element.
|
|
*
|
|
* @param entry an <code>long</code> value
|
|
* @return true if the set contains the specified element.
|
|
*/
|
|
boolean contains( long entry );
|
|
|
|
|
|
/**
|
|
* Creates an iterator over the values of the set. The iterator
|
|
* supports element deletion.
|
|
*
|
|
* @return an <code>TLongIterator</code> value
|
|
*/
|
|
TLongIterator iterator();
|
|
|
|
|
|
/**
|
|
* Returns an array containing all of the elements in this set.
|
|
* If this set makes any guarantees as to what order its elements
|
|
* are returned by its iterator, this method must return the
|
|
* elements in the same order.
|
|
*
|
|
* <p>The returned array will be "safe" in that no references to it
|
|
* are maintained by this set. (In other words, this method must
|
|
* allocate a new array even if this set is backed by an array).
|
|
* The caller is thus free to modify the returned array.
|
|
*
|
|
* <p>This method acts as bridge between array-based and collection-based
|
|
* APIs.
|
|
*
|
|
* @return an array containing all the elements in this set
|
|
*/
|
|
long[] toArray();
|
|
|
|
|
|
/**
|
|
* Returns an array containing elements in this set.
|
|
*
|
|
* <p>If this set fits in the specified array with room to spare
|
|
* (i.e., the array has more elements than this set), the element in
|
|
* the array immediately following the end of the set is set to
|
|
* <tt>{@link #getNoEntryValue()}</tt>. (This is useful in determining
|
|
* the length of this set <i>only</i> if the caller knows that this
|
|
* set does not contain any elements representing null.)
|
|
*
|
|
* <p>If the native array is smaller than the set size,
|
|
* the array will be filled with elements in Iterator order
|
|
* until it is full and exclude the remainder.
|
|
*
|
|
* <p>If this set makes any guarantees as to what order its elements
|
|
* are returned by its iterator, this method must return the elements
|
|
* in the same order.
|
|
*
|
|
* @param dest the array into which the elements of this set are to be
|
|
* stored.
|
|
* @return an <tt>long[]</tt> containing all the elements in this set
|
|
* @throws NullPointerException if the specified array is null
|
|
*/
|
|
long[] toArray( long[] dest );
|
|
|
|
|
|
/**
|
|
* Inserts a value into the set.
|
|
*
|
|
* @param entry a <code>long</code> value
|
|
* @return true if the set was modified by the add operation
|
|
*/
|
|
boolean add( long entry );
|
|
|
|
|
|
/**
|
|
* Removes <tt>entry</tt> from the set.
|
|
*
|
|
* @param entry an <code>long</code> value
|
|
* @return true if the set was modified by the remove operation.
|
|
*/
|
|
boolean remove( long entry );
|
|
|
|
|
|
/**
|
|
* Tests the set to determine if all of the elements in
|
|
* <tt>collection</tt> are present.
|
|
*
|
|
* @param collection a <code>Collection</code> value
|
|
* @return true if all elements were present in the set.
|
|
*/
|
|
boolean containsAll( Collection<?> collection );
|
|
|
|
|
|
/**
|
|
* Tests the set to determine if all of the elements in
|
|
* <tt>TLongCollection</tt> are present.
|
|
*
|
|
* @param collection a <code>TLongCollection</code> value
|
|
* @return true if all elements were present in the set.
|
|
*/
|
|
boolean containsAll( TLongCollection collection );
|
|
|
|
|
|
/**
|
|
* Tests the set to determine if all of the elements in
|
|
* <tt>array</tt> are present.
|
|
*
|
|
* @param array as <code>array</code> of long primitives.
|
|
* @return true if all elements were present in the set.
|
|
*/
|
|
boolean containsAll( long[] array );
|
|
|
|
|
|
/**
|
|
* Adds all of the elements in <tt>collection</tt> to the set.
|
|
*
|
|
* @param collection a <code>Collection</code> value
|
|
* @return true if the set was modified by the add all operation.
|
|
*/
|
|
boolean addAll( Collection<? extends Long> collection );
|
|
|
|
|
|
/**
|
|
* Adds all of the elements in the <tt>TLongCollection</tt> to the set.
|
|
*
|
|
* @param collection a <code>TLongCollection</code> value
|
|
* @return true if the set was modified by the add all operation.
|
|
*/
|
|
boolean addAll( TLongCollection collection );
|
|
|
|
|
|
/**
|
|
* Adds all of the elements in the <tt>array</tt> to the set.
|
|
*
|
|
* @param array a <code>array</code> of long primitives.
|
|
* @return true if the set was modified by the add all operation.
|
|
*/
|
|
boolean addAll( long[] array );
|
|
|
|
|
|
/**
|
|
* Removes any values in the set which are not contained in
|
|
* <tt>collection</tt>.
|
|
*
|
|
* @param collection a <code>Collection</code> value
|
|
* @return true if the set was modified by the retain all operation
|
|
*/
|
|
boolean retainAll( Collection<?> collection );
|
|
|
|
|
|
/**
|
|
* Removes any values in the set which are not contained in
|
|
* <tt>TLongCollection</tt>.
|
|
*
|
|
* @param collection a <code>TLongCollection</code> value
|
|
* @return true if the set was modified by the retain all operation
|
|
*/
|
|
boolean retainAll( TLongCollection collection );
|
|
|
|
|
|
/**
|
|
* Removes any values in the set which are not contained in
|
|
* <tt>array</tt>.
|
|
*
|
|
* @param array an <code>array</code> of long primitives.
|
|
* @return true if the set was modified by the retain all operation
|
|
*/
|
|
boolean retainAll( long[] array );
|
|
|
|
|
|
/**
|
|
* Removes all of the elements in <tt>collection</tt> from the set.
|
|
*
|
|
* @param collection a <code>Collection</code> value
|
|
* @return true if the set was modified by the remove all operation.
|
|
*/
|
|
boolean removeAll( Collection<?> collection );
|
|
|
|
|
|
/**
|
|
* Removes all of the elements in <tt>TLongCollection</tt> from the set.
|
|
*
|
|
* @param collection a <code>TLongCollection</code> value
|
|
* @return true if the set was modified by the remove all operation.
|
|
*/
|
|
boolean removeAll( TLongCollection collection );
|
|
|
|
|
|
/**
|
|
* Removes all of the elements in <tt>array</tt> from the set.
|
|
*
|
|
* @param array an <code>array</code> of long primitives.
|
|
* @return true if the set was modified by the remove all operation.
|
|
*/
|
|
public boolean removeAll( long[] array );
|
|
|
|
|
|
/**
|
|
* Empties the set.
|
|
*/
|
|
void clear();
|
|
|
|
|
|
/**
|
|
* Executes <tt>procedure</tt> for each element in the set.
|
|
*
|
|
* @param procedure a <code>TLongProcedure</code> value
|
|
* @return false if the loop over the set terminated because
|
|
* the procedure returned false for some value.
|
|
*/
|
|
boolean forEach( TLongProcedure procedure );
|
|
|
|
|
|
// Comparison and hashing
|
|
|
|
/**
|
|
* Compares the specified object with this set for equality. Returns
|
|
* <tt>true</tt> if the specified object is also a set, the two sets
|
|
* have the same size, and every member of the specified set is
|
|
* contained in this set (or equivalently, every member of this set is
|
|
* contained in the specified set). This definition ensures that the
|
|
* equals method works properly across different implementations of the
|
|
* set interface.
|
|
*
|
|
* @param o object to be compared for equality with this set
|
|
* @return <tt>true</tt> if the specified object is equal to this set
|
|
*/
|
|
boolean equals( Object o );
|
|
|
|
|
|
/**
|
|
* Returns the hash code value for this set. The hash code of a set is
|
|
* defined to be the sum of the hash codes of the elements in the set.
|
|
* This ensures that <tt>s1.equals(s2)</tt> implies that
|
|
* <tt>s1.hashCode()==s2.hashCode()</tt> for any two sets <tt>s1</tt>
|
|
* and <tt>s2</tt>, as required by the general contract of
|
|
* {@link Object#hashCode}.
|
|
*
|
|
* @return the hash code value for this set
|
|
* @see Object#equals(Object)
|
|
* @see Set#equals(Object)
|
|
*/
|
|
int hashCode();
|
|
|
|
|
|
} // THashSet
|