Java Doc for IntKeyOpenHashMap.java in » Web-Framework » rife-1.6.1 » com » uwyn » rife » pcj » map » Java Source Code / Java DocumentationJava Source Code and Java Documentation

Java Source Code / Java Documentation

1.	6.0 JDK Core
2.	6.0 JDK Modules
3.	6.0 JDK Modules com.sun
4.	6.0 JDK Modules com.sun.java
5.	6.0 JDK Modules sun
6.	6.0 JDK Platform
7.	Ajax
8.	Apache Harmony Java SE
9.	Aspect oriented
10.	Authentication Authorization
11.	Blogger System
12.	Build
13.	Byte Code
14.	Cache
15.	Chart
16.	Chat
17.	Code Analyzer
18.	Collaboration
19.	Content Management System
20.	Database Client
21.	Database DBMS
22.	Database JDBC Connection Pool
23.	Database ORM
24.	Development
25.	EJB Server geronimo
26.	EJB Server GlassFish
27.	EJB Server JBoss 4.2.1
28.	EJB Server resin 3.1.5
29.	ERP CRM Financial
30.	ESB
31.	Forum
32.	GIS
33.	Graphic Library
34.	Groupware
35.	HTML Parser
36.	IDE
37.	IDE Eclipse
38.	IDE Netbeans
39.	Installer
40.	Internationalization Localization
41.	Inversion of Control
42.	Issue Tracking
43.	J2EE
44.	JBoss
45.	JMS
46.	JMX
47.	Library
48.	Mail Clients
49.	Net
50.	Parser
51.	PDF
52.	Portal
53.	Profiler
54.	Project Management
55.	Report
56.	RSS RDF
57.	Rule Engine
58.	Science
59.	Scripting
60.	Search Engine
61.	Security
62.	Sevlet Container
63.	Source Control
64.	Swing Library
65.	Template Engine
66.	Test Coverage
67.	Testing
68.	UML
69.	Web Crawler
70.	Web Framework
71.	Web Mail
72.	Web Server
73.	Web Services
74.	Web Services apache cxf 2.0.1
75.	Web Services AXIS2
76.	Wiki Engine
77.	Workflow Engines
78.	XML
79.	XML UI

Java

Java Tutorial

Illustrator Tutorials

GIMP Tutorials

C# / C Sharp

C# / CSharp Tutorial

C# / CSharp Open Source

SQL Server / T-SQL Tutorial

Oracle PL / SQL

Oracle PL/SQL Tutorial

Flash / Flex / ActionScript

VBA / Excel / Access / Word

XML

XML Tutorial

Microsoft Office PowerPoint 2007 Tutorial

Microsoft Office Excel 2007 Tutorial

Microsoft Office Word 2007 Tutorial

Java Source Code / Java Documentation » Web Framework » rife 1.6.1 » com.uwyn.rife.pcj.map

Source Cross Reference Class Diagram Java Document (Java Doc)

com.uwyn.rife.pcj.map .IntKeyOpenHashMap

IntKeyOpenHashMap
public class IntKeyOpenHashMap extends AbstractIntKeyMap implements IntKeyMap<E>,Cloneable,Serializable(Code)
	This class represents open addressing hash table based maps from int values to objects. See Also: java.util.Map author: Søren Bak version: 1.3 21-08-2003 19:45 since: 1.0

Field Summary
final public static int	DEFAULT_CAPACITY The default capacity of this map.
final public static int	DEFAULT_GROWTH_CHUNK The default chunk size with which to increase the capacity of this map.
final public static double	DEFAULT_GROWTH_FACTOR The default factor with which to increase the capacity of this map.
final public static double	DEFAULT_LOAD_FACTOR The default load factor of this map.

Constructor Summary
public	IntKeyOpenHashMap() Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%.
public	IntKeyOpenHashMap(IntKeyMap map) Creates a new hash map with the same mappings as a specified map.
public	IntKeyOpenHashMap(int capacity) Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%.
public	IntKeyOpenHashMap(double loadFactor) Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor.
public	IntKeyOpenHashMap(int capacity, double loadFactor) Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0.
public	IntKeyOpenHashMap(int capacity, double loadFactor, double growthFactor) Creates a new hash map with a specified capacity, load factor, and relative growth factor.
public	IntKeyOpenHashMap(int capacity, double loadFactor, int growthChunk) Creates a new hash map with a specified capacity, load factor, and absolute growth factor. The map capacity increases to `capacity()+growthChunk`. This strategy is good for avoiding wasting memory.
public	IntKeyOpenHashMap(IntHashFunction keyhash) Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%.
public	IntKeyOpenHashMap(IntHashFunction keyhash, int capacity) Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%.
public	IntKeyOpenHashMap(IntHashFunction keyhash, double loadFactor) Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor.
public	IntKeyOpenHashMap(IntHashFunction keyhash, int capacity, double loadFactor) Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0.
public	IntKeyOpenHashMap(IntHashFunction keyhash, int capacity, double loadFactor, double growthFactor) Creates a new hash map with a specified capacity, load factor, and relative growth factor.
public	IntKeyOpenHashMap(IntHashFunction keyhash, int capacity, double loadFactor, int growthChunk) Creates a new hash map with a specified capacity, load factor, and absolute growth factor. The map capacity increases to `capacity()+growthChunk`. This strategy is good for avoiding wasting memory.

Method Summary
public void	clear()
public IntKeyOpenHashMap	clone() Returns a clone of this hash map.
public boolean	containsKey(int key)
public boolean	containsValue(Object value)
public IntKeyMapIterator<E>	entries()
public E	get(int key)
public boolean	isEmpty()
public IntSet	keySet()
public E	put(int key, E value)
public E	remove(int key)
public int	size()
public Collection<E>	values()

Field Detail

DEFAULT_CAPACITY
final public static int DEFAULT_CAPACITY(Code)
	The default capacity of this map.

DEFAULT_GROWTH_CHUNK
final public static int DEFAULT_GROWTH_CHUNK(Code)
	The default chunk size with which to increase the capacity of this map.

DEFAULT_GROWTH_FACTOR
final public static double DEFAULT_GROWTH_FACTOR(Code)
	The default factor with which to increase the capacity of this map.

DEFAULT_LOAD_FACTOR
final public static double DEFAULT_LOAD_FACTOR(Code)
	The default load factor of this map.

Constructor Detail

IntKeyOpenHashMap
public IntKeyOpenHashMap()(Code)
	Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%.

IntKeyOpenHashMap
public IntKeyOpenHashMap(IntKeyMap map)(Code)
	Creates a new hash map with the same mappings as a specified map. Parameters: map - the map whose mappings to put into the new map. throws: NullPointerException - if `map` is `null`.

IntKeyOpenHashMap
public IntKeyOpenHashMap(int capacity)(Code)
	Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%. Parameters: capacity - the initial capacity of the map. throws: IllegalArgumentException - if `capacity` is negative.

IntKeyOpenHashMap
public IntKeyOpenHashMap(double loadFactor)(Code)
	Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor. Parameters: loadFactor - the load factor of the map. throws: IllegalArgumentException - if `capacity` is negative;if `loadFactor` is not positive.

IntKeyOpenHashMap
public IntKeyOpenHashMap(int capacity, double loadFactor)(Code)
	Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0. Parameters: capacity - the initial capacity of the map. Parameters: loadFactor - the load factor of the map. throws: IllegalArgumentException - if `capacity` is negative;if `loadFactor` is not positive.

IntKeyOpenHashMap
public IntKeyOpenHashMap(int capacity, double loadFactor, double growthFactor)(Code)
	Creates a new hash map with a specified capacity, load factor, and relative growth factor. The map capacity increases to `capacity()(1+growthFactor)`. This strategy is good for avoiding many capacity increases, but the amount of wasted memory is approximately the size of the map. Parameters:* capacity - the initial capacity of the map. Parameters: loadFactor - the load factor of the map. Parameters: growthFactor - the relative amount with which to increase thethe capacity when a capacity increase is needed. throws: IllegalArgumentException - if `capacity` is negative;if `loadFactor` is not positive;if `growthFactor` is not positive.

IntKeyOpenHashMap
public IntKeyOpenHashMap(int capacity, double loadFactor, int growthChunk)(Code)
	Creates a new hash map with a specified capacity, load factor, and absolute growth factor. The map capacity increases to `capacity()+growthChunk`. This strategy is good for avoiding wasting memory. However, an overhead is potentially introduced by frequent capacity increases. Parameters: capacity - the initial capacity of the map. Parameters: loadFactor - the load factor of the map. Parameters: growthChunk - the absolute amount with which to increase thethe capacity when a capacity increase is needed. throws: IllegalArgumentException - if `capacity` is negative;if `loadFactor` is not positive;if `growthChunk` is not positive.

IntKeyOpenHashMap
public IntKeyOpenHashMap(IntHashFunction keyhash)(Code)
	Creates a new hash map with capacity 11, a relative growth factor of 1.0, and a load factor of 75%. Parameters: keyhash - the hash function to use when hashing keys. throws: NullPointerException - if `keyhash` is `null`.

IntKeyOpenHashMap
public IntKeyOpenHashMap(IntHashFunction keyhash, int capacity)(Code)
	Creates a new hash map with a specified capacity, a relative growth factor of 1.0, and a load factor of 75%. Parameters: keyhash - the hash function to use when hashing keys. Parameters: capacity - the initial capacity of the map. throws: IllegalArgumentException - if `capacity` is negative. throws: NullPointerException - if `keyhash` is `null`.

IntKeyOpenHashMap
public IntKeyOpenHashMap(IntHashFunction keyhash, double loadFactor)(Code)
	Creates a new hash map with a capacity of 11, a relative growth factor of 1.0, and a specified load factor. Parameters: keyhash - the hash function to use when hashing keys. Parameters: loadFactor - the load factor of the map. throws: IllegalArgumentException - if `capacity` is negative;if `loadFactor` is not positive. throws: NullPointerException - if `keyhash` is `null`.

IntKeyOpenHashMap
public IntKeyOpenHashMap(IntHashFunction keyhash, int capacity, double loadFactor)(Code)
	Creates a new hash map with a specified capacity and load factor, and a relative growth factor of 1.0. Parameters: keyhash - the hash function to use when hashing keys. Parameters: capacity - the initial capacity of the map. Parameters: loadFactor - the load factor of the map. throws: IllegalArgumentException - if `capacity` is negative;if `loadFactor` is not positive. throws: NullPointerException - if `keyhash` is `null`.

IntKeyOpenHashMap
public IntKeyOpenHashMap(IntHashFunction keyhash, int capacity, double loadFactor, double growthFactor)(Code)
	Creates a new hash map with a specified capacity, load factor, and relative growth factor. The map capacity increases to `capacity()(1+growthFactor)`. This strategy is good for avoiding many capacity increases, but the amount of wasted memory is approximately the size of the map. Parameters:* keyhash - the hash function to use when hashing keys. Parameters: capacity - the initial capacity of the map. Parameters: loadFactor - the load factor of the map. Parameters: growthFactor - the relative amount with which to increase thethe capacity when a capacity increase is needed. throws: IllegalArgumentException - if `capacity` is negative;if `loadFactor` is not positive;if `growthFactor` is not positive. throws: NullPointerException - if `keyhash` is `null`.

IntKeyOpenHashMap
public IntKeyOpenHashMap(IntHashFunction keyhash, int capacity, double loadFactor, int growthChunk)(Code)
	Creates a new hash map with a specified capacity, load factor, and absolute growth factor. The map capacity increases to `capacity()+growthChunk`. This strategy is good for avoiding wasting memory. However, an overhead is potentially introduced by frequent capacity increases. Parameters: keyhash - the hash function to use when hashing keys. Parameters: capacity - the initial capacity of the map. Parameters: loadFactor - the load factor of the map. Parameters: growthChunk - the absolute amount with which to increase thethe capacity when a capacity increase is needed. throws: IllegalArgumentException - if `capacity` is negative;if `loadFactor` is not positive;if `growthChunk` is not positive. throws: NullPointerException - if `keyhash` is `null`.

Method Detail

clear
public void clear()(Code)

clone
public IntKeyOpenHashMap clone()(Code)
	Returns a clone of this hash map. a clone of this hash map. since: 1.1

containsKey
public boolean containsKey(int key)(Code)

containsValue
public boolean containsValue(Object value)(Code)

entries
public IntKeyMapIterator<E> entries()(Code)

get
public E get(int key)(Code)

isEmpty
public boolean isEmpty()(Code)

keySet
public IntSet keySet()(Code)

put
public E put(int key, E value)(Code)

remove
public E remove(int key)(Code)

size
public int size()(Code)

values
public Collection<E> values()(Code)

www.java2java.com | Contact Us

All other trademarks are property of their respective owners.