gnu.trove.decorator.TObjectShortMapDecorator Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of trove4j Show documentation
Show all versions of trove4j Show documentation
The Trove library provides high speed regular and primitive
collections for Java.
The newest version!
///////////////////////////////////////////////////////////////////////////////
// Copyright (c) 2002, Eric D. Friedman All Rights Reserved.
// Copyright (c) 2009, Robert D. 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.decorator;
import gnu.trove.map.TObjectShortMap;
import gnu.trove.iterator.TObjectShortIterator;
import java.io.*;
import java.util.*;
//////////////////////////////////////////////////
// THIS IS A GENERATED CLASS. DO NOT HAND EDIT! //
//////////////////////////////////////////////////
/**
* Wrapper class to make a TObjectShortMap conform to the java.util.Map API.
* This class simply decorates an underlying TObjectShortMap and translates the Object-based
* APIs into their Trove primitive analogs.
*
* Note that wrapping and unwrapping primitive values is extremely inefficient. If
* possible, users of this class should override the appropriate methods in this class
* and use a table of canonical values.
*
* Created: Mon Sep 23 22:07:40 PDT 2002
*
* @author Eric D. Friedman
* @author Robert D. Eden
* @author Jeff Randall
*/
public class TObjectShortMapDecorator extends AbstractMap
implements Map, Externalizable, Cloneable {
static final long serialVersionUID = 1L;
/**
* the wrapped primitive map
*/
protected TObjectShortMap _map;
/**
* FOR EXTERNALIZATION ONLY!!
*/
public TObjectShortMapDecorator() {}
/**
* Creates a wrapper that decorates the specified primitive map.
*
* @param map the TObjectShortMap to wrap.
*/
public TObjectShortMapDecorator( TObjectShortMap map ) {
super();
this._map = map;
}
/**
* Returns a reference to the map wrapped by this decorator.
*
* @return the wrapped TObjectShortMap instance.
*/
public TObjectShortMap getMap() {
return _map;
}
/**
* Inserts a key/value pair into the map.
*
* @param key an Object value
* @param value an Short value
* @return the previous value associated with key,
* or Integer(0) if none was found.
*/
public Short put( K key, Short value ) {
if ( value == null ) return wrapValue( _map.put( key, _map.getNoEntryValue() ) );
return wrapValue( _map.put( key, unwrapValue( value ) ) );
}
/**
* Retrieves the value for key
*
* @param key an Object value
* @return the value of key or null if no such mapping exists.
*/
public Short get( Object key ) {
short v = _map.get( key );
// There may be a false positive since primitive maps
// cannot return null, so we have to do an extra
// check here.
if ( v == _map.getNoEntryValue() ) {
return null;
} else {
return wrapValue( v );
}
}
/**
* Empties the map.
*/
public void clear() {
this._map.clear();
}
/**
* Deletes a key/value pair from the map.
*
* @param key an Object value
* @return the removed value, or Integer(0) if it was not found in the map
*/
public Short remove( Object key ) {
short v = _map.remove( key );
// There may be a false positive since primitive maps
// cannot return null, so we have to do an extra
// check here.
if ( v == _map.getNoEntryValue() ) {
return null;
} else {
return wrapValue( v );
}
}
/**
* Returns a Set view on the entries of the map.
*
* @return a Set value
*/
public Set> entrySet() {
return new AbstractSet>() {
public int size() {
return _map.size();
}
public boolean isEmpty() {
return TObjectShortMapDecorator.this.isEmpty();
}
public boolean contains( Object o ) {
if ( o instanceof Map.Entry ) {
Object k = ( ( Map.Entry ) o ).getKey();
Object v = ( ( Map.Entry ) o ).getValue();
return TObjectShortMapDecorator.this.containsKey( k ) &&
TObjectShortMapDecorator.this.get( k ).equals( v );
} else {
return false;
}
}
public Iterator> iterator() {
return new Iterator>() {
private final TObjectShortIterator it = _map.iterator();
public Map.Entry next() {
it.advance();
final K key = it.key();
final Short v = wrapValue( it.value() );
return new Map.Entry() {
private Short val = v;
public boolean equals( Object o ) {
return o instanceof Map.Entry &&
( ( Map.Entry ) o ).getKey().equals( key ) &&
( ( Map.Entry ) o ).getValue().equals( val );
}
public K getKey() {
return key;
}
public Short getValue() {
return val;
}
public int hashCode() {
return key.hashCode() + val.hashCode();
}
public Short setValue( Short value ) {
val = value;
return put( key, value );
}
};
}
public boolean hasNext() {
return it.hasNext();
}
public void remove() {
it.remove();
}
};
}
public boolean add( Map.Entry o ) {
throw new UnsupportedOperationException();
}
public boolean remove( Object o ) {
boolean modified = false;
if ( contains( o ) ) {
//noinspection unchecked
K key = ( ( Map.Entry ) o ).getKey();
_map.remove( key );
modified = true;
}
return modified;
}
public boolean addAll(Collection> c) {
throw new UnsupportedOperationException();
}
public void clear() {
TObjectShortMapDecorator.this.clear();
}
};
}
/**
* Checks for the presence of val in the values of the map.
*
* @param val an Object value
* @return a boolean value
*/
public boolean containsValue( Object val ) {
return val instanceof Short && _map.containsValue( unwrapValue( val ) );
}
/**
* Checks for the present of key in the keys of the map.
*
* @param key an Object value
* @return a boolean value
*/
public boolean containsKey( Object key ) {
return _map.containsKey( key );
}
/**
* Returns the number of entries in the map.
*
* @return the map's size.
*/
public int size() {
return this._map.size();
}
/**
* Indicates whether map has any entries.
*
* @return true if the map is empty
*/
public boolean isEmpty() {
return this._map.size() == 0;
}
/**
* Copies the key/value mappings in map into this map.
* Note that this will be a deep copy, as storage is by
* primitive value.
*
* @param map a Map value
*/
public void putAll( Map map ) {
Iterator> it = map.entrySet().iterator();
for ( int i = map.size(); i-- > 0; ) {
Entry e = it.next();
this.put( e.getKey(), e.getValue() );
}
}
/**
* Wraps a value
*
* @param k value in the underlying map
* @return an Object representation of the value
*/
protected Short wrapValue( short k ) {
return Short.valueOf( k );
}
/**
* Unwraps a value
*
* @param value wrapped value
* @return an unwrapped representation of the value
*/
protected short unwrapValue( Object value ) {
return ( ( Short ) value ).shortValue();
}
// Implements Externalizable
public void readExternal(ObjectInput in)
throws IOException, ClassNotFoundException {
// VERSION
in.readByte();
// MAP
//noinspection unchecked
_map = ( TObjectShortMap ) in.readObject();
}
// Implements Externalizable
public void writeExternal(ObjectOutput out) throws IOException {
// VERSION
out.writeByte( 0 );
// MAP
out.writeObject( _map );
}
} // TObjectShortMapDecorator