rdwrmap.java

Java Communicating Agents是一个用于开发网络反应式信息agent的框架

/*
 * $Source: /home/data/cvsroot/src/jacomma/util/RdWrMap.java,v $
 * $Revision: 1.4 $
 * $Date: 2000/10/28 20:09:08 $
 *
 * This file is part of the jacomma framework
 * Copyright (c) 2000 	Dimitrios Vyzovitis
 *			mailto:[e-mail]
 *			
 *
 *			
 *			
 *			
 *
 *	This library is free software; you can redistribute it and/or modify
 *	it under the terms of the GNU Library General Public License as published by
 *	the Free Software Foundation; either version 2 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 Library General Public License for more details.
 *
 *	You should have received a copy of the GNU Library General Public License
 *	along with this library; if not, write to the Free Software
 *	Foundation, Inc., 59 Temple Place, Suite 330, 
 *	Boston, MA  02111-1307  USA
 */

package jacomma.util;

/**
 * TBA
 **/
public final class RdWrMap {
	
	java.util.Map map_ = new java.util.HashMap();
	
	// The lock is public to allow external lock control
	public RdWrLock lock = new RdWrLock();

	public RdWrMap() {}
	
	public Object put( Object key, Object entry ) {
		lock.wrlock();
		try {
			return map_.put( key, entry );
		} finally {
			lock.unlock();
		}
			
	}
	

	public Object try_put( Object key, Object entry ) {
		lock.wrlock();
		try {
			Object r;
			if ( (r = map_.get( key ) ) == null ) {
				map_.put( key, entry );
				return entry;
			} else
				return r;
		} finally {
			lock.unlock();
		}
			
	}
	
	public Object get( Object key ) {
		lock.rdlock();
		try {
			return map_.get( key );
		} finally {
			lock.unlock();
		}
	}
	
	public boolean containsKey( Object key ) {
		lock.rdlock();
		try {
			return map_.containsKey( key );
		} finally {
			lock.unlock();
		}
	}
		
	public int size() {
		lock.rdlock();
		try {
			return map_.size();
		} finally {
			lock.unlock();
		}
	}

	public boolean isEmpty() {
		lock.rdlock();
		try {
			return map_.isEmpty();
		} finally {
			lock.unlock();
		}
	}

	public void clear() {
		lock.wrlock();
		try {
			map_.clear();
		} finally {
			lock.unlock();
		}
	}
	
	public Object remove( Object key ) {
		lock.wrlock();
		try {
			return map_.remove( key );
		} finally {
			lock.unlock();
		}
			
	}

	public void removeValue( Object entry ) {
		lock.wrlock();
		try {
			map_.values().remove( entry );
		} finally {
			lock.unlock();
		}
			
	}

	
	public void dump() {
		lock.rdlock();
		try {
			StringBuffer buf = new StringBuffer();
			buf.append( toString() )
				.append( " Contents : \n" );
			for ( java.util.Iterator it = map_.entrySet().iterator();
				  it.hasNext(); ) {
				java.util.Map.Entry entry = (java.util.Map.Entry)it.next();
				buf.append( entry.getKey() )
					.append( " : " )
					.append( entry.getValue() )
					.append( "\n" );
			}
			System.err.println( buf.toString() );
		} finally {
			lock.unlock();
		}
	}
}