Modifier and Type	Class and Description
public static class	QNameMap.Entry<V>
private class	QNameMap.EntryIterator
private class	QNameMap.EntrySet
private abstract class	QNameMap.HashIterator<E>

Modifier and Type	Field and Description
private static final int	DEFAULT_INITIAL_CAPACITY The default initial capacity - MUST be a power of two.
private static final float	DEFAULT_LOAD_FACTOR The load factor used when none specified in constructor.
private Set<QNameMap.Entry<V>>	entrySet Gives an entrySet view of this map
private static final int	MAXIMUM_CAPACITY The maximum capacity, used if a higher value is implicitly specified by either of the constructors with arguments.
pack-priv transient int	size The number of key-value mappings contained in this identity hash map.
pack-priv transient QNameMap.Entry<V>[]	table The table, resized as necessary.
private int	threshold The next size value at which to resize .

Access	Constructor and Description
public	QNameMap()

Method Summary

Modifier and Type	Method and Description
private void	addEntry(int hash, String nsUri, String localName, V value, int bucketIndex) Add a new entry with the specified keys, value and hash code to the specified bucket.
public boolean	containsKey(String nsUri, String localName)
public Set<QNameMap.Entry<V>>	entrySet()
public V	Returns: the value to which this map maps the specified set of keya, or `null` if the map contains no mapping for this set of keys. get(String the namespaceUri key whose associated value is to be returned. nsUri, String the localPart key whose associated value is to be returned. localPart) Returns the value to which the specified keys are mapped in this QNameMap, or `null` if the map contains no mapping for this key.
public V	get(QName name)
private QNameMap.Entry<V>	getEntry(String nsUri, String localName)
public QNameMap.Entry<V>	getOne() Returns one random item in the map.
private static int	hash(String x) Returns a hash value for the specified object.The hash value is computed for the localName.
private static int	indexFor(int h, int length) Returns index for hash code h.
public boolean	isEmpty() Returns true if this map is empty.
public Collection<QName>	keySet()
private Iterator<QNameMap.Entry<V>>	newEntryIterator()
public void	put(String First key with which the specified value is to be associated. namespaceUri, String Second key with which the specified value is to be associated. localname, V value to be associated with the specified key. value) Associates the specified value with the specified keys in this map.
public void	put(QName name, V value)
public void	put(Name name, V value)
public QNameMap<V>	putAll(QNameMap<? extends V> mappings to be stored in this map. map) Copies all of the mappings from the specified map to this map These mappings will replace any mappings that this map had for any of the keys currently in the specified map.
private void	resize(int newCapacity) Rehashes the contents of this map into a new array with a larger capacity.
public int	Returns: the number of keys-value mappings in this map. size() Returns the number of keys-value mappings in this map.
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.
private void	transfer(QNameMap.Entry<V>[] newTable) Transfer all entries from current table to newTable.

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll wait wait wait

DEFAULT_INITIAL_CAPACITY	back to summary
private static final int DEFAULT_INITIAL_CAPACITY The default initial capacity - MUST be a power of two.

DEFAULT_LOAD_FACTOR	back to summary
private static final float DEFAULT_LOAD_FACTOR The load factor used when none specified in constructor.

entrySet	back to summary
private Set<QNameMap.Entry<V>> entrySet Gives an entrySet view of this map

MAXIMUM_CAPACITY	back to summary
private static final int MAXIMUM_CAPACITY The maximum capacity, used if a higher value is implicitly specified by either of the constructors with arguments. MUST be a power of two <= 1<<30.

size	back to summary
pack-priv transient int size The number of key-value mappings contained in this identity hash map.

table	back to summary
pack-priv transient QNameMap.Entry<V>[] table The table, resized as necessary. Length MUST Always be a power of two.

threshold	back to summary
private int threshold The next size value at which to resize . Taking it as MAXIMUM_CAPACITY

Constructor Detail

QNameMap	back to summary
public QNameMap()

Method Detail

addEntry	back to summary
private void addEntry(int hash, String nsUri, String localName, V value, int bucketIndex) Add a new entry with the specified keys, value and hash code to the specified bucket. It is the responsibility of this method to resize the table if appropriate.

containsKey	back to summary
public boolean containsKey(String nsUri, String localName)

entrySet	back to summary
public Set<QNameMap.Entry<V>> entrySet()

get back to summary

get	back to summary
public V get(String nsUri, String localPart) Returns the value to which the specified keys are mapped in this QNameMap, or `null` if the map contains no mapping for this key. Parameters nsUri:String the namespaceUri key whose associated value is to be returned. localPart:String the localPart key whose associated value is to be returned. Returns:V the value to which this map maps the specified set of keya, or `null` if the map contains no mapping for this set of keys. See Also `put(String, String, Object)`

public V get(String nsUri, String localPart)

Returns the value to which the specified keys are mapped in this QNameMap, or null if the map contains no mapping for this key.

Parameters

nsUri:String: the namespaceUri key whose associated value is to be returned.
localPart:String: the localPart key whose associated value is to be returned.

Returns:V

the value to which this map maps the specified set of keya, or null if the map contains no mapping for this set of keys.

See Also

put(String, String, Object)

get	back to summary
public V get(QName name)

getEntry	back to summary
private QNameMap.Entry<V> getEntry(String nsUri, String localName)

getOne	back to summary
public QNameMap.Entry<V> getOne() Returns one random item in the map. If this map is empty, return null. This method is useful to obtain the value from a map that only contains one element.

getOne

back to summary

public QNameMap.Entry<V> getOne()

Returns one random item in the map. If this map is empty, return null.

This method is useful to obtain the value from a map that only contains one element.

hash	back to summary
private static int hash(String x) Returns a hash value for the specified object.The hash value is computed for the localName.

indexFor	back to summary
private static int indexFor(int h, int length) Returns index for hash code h.

isEmpty	back to summary
public boolean isEmpty() Returns true if this map is empty.

keySet	back to summary
public Collection<QName> keySet()

newEntryIterator	back to summary
private Iterator<QNameMap.Entry<V>> newEntryIterator()

put	back to summary
public void put(String namespaceUri, String localname, V value) Associates the specified value with the specified keys in this map. If the map previously contained a mapping for this key, the old value is replaced. Parameters namespaceUri:String First key with which the specified value is to be associated. localname:String Second key with which the specified value is to be associated. value:V value to be associated with the specified key.

put

back to summary

public void put(String namespaceUri, String localname, V value)

Associates the specified value with the specified keys in this map. If the map previously contained a mapping for this key, the old value is replaced.

Parameters

namespaceUri:String: First key with which the specified value is to be associated.
localname:String: Second key with which the specified value is to be associated.
value:V: value to be associated with the specified key.

put	back to summary
public void put(QName name, V value)

put	back to summary
public void put(Name name, V value)

putAll	back to summary
public QNameMap<V> putAll(QNameMap<? extends V> map) Copies all of the mappings from the specified map to this map These mappings will replace any mappings that this map had for any of the keys currently in the specified map. Parameters map:QNameMap<? extends V> mappings to be stored in this map.

putAll

back to summary

public QNameMap<V> putAll(QNameMap<? extends V> map)

Copies all of the mappings from the specified map to this map These mappings will replace any mappings that this map had for any of the keys currently in the specified map.

Parameters

map:QNameMap<? extends V>: mappings to be stored in this map.

resize	back to summary
private void resize(int newCapacity) Rehashes the contents of this map into a new array with a larger capacity. This method is called automatically when the number of keys in this map reaches its threshold.

size	back to summary
public int size() Returns the number of keys-value mappings in this map. Returns:int the number of keys-value mappings in this map.

size

back to summary

public int size()

Returns the number of keys-value mappings in this map.

Returns:int: the number of keys-value mappings in this map.

toString back to summary

toString	back to summary
public String toString() Overrides java.lang.Object.toString. Doc from java.lang.Object.toString. Returns a string representation of the object. Satisfying this method's contract implies a non-`null` result must be returned. Annotations @Override

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

Annotations

@Override

transfer	back to summary
private void transfer(QNameMap.Entry<V>[] newTable) Transfer all entries from current table to newTable.

org.glassfish.jaxb.runtime.v2.util back to summary

public final Class QNameMap.Entry<V>

Class Inheritance

extends Object

java.lang.Object
org.glassfish.jaxb.runtime.v2.util.QNameMap.Entry

Field Summary

Modifier and Type	Field and Description
pack-priv final int	hash
public final String	localName The localPart.
pack-priv QNameMap.Entry<V>	next
public final String	nsUri The namespace URI.
pack-priv V	value

Constructor Summary

Access	Constructor and Description
pack-priv	Entry(int h, String nsUri, String localName, V v, QNameMap.Entry<V> n) Create new entry.

Method Summary

Modifier and Type	Method and Description
public QName	createQName() Creates a new QName object from `nsUri` and `localName`.
public boolean	equals(Object o) Overrides java.lang.Object.equals. Indicates whether some other object is "equal to" this one.
public V	getValue()
public int	hashCode() Overrides java.lang.Object.hashCode. Returns a hash code value for this object.
public V	setValue(V newValue)
public String	toString() Overrides java.lang.Object.toString. Returns a string representation of the object.

Inherited from java.lang.Object:: clone finalize getClass notify notifyAll wait wait wait

Field Detail

hash	back to summary
pack-priv final int hash

localName	back to summary
public final String localName The localPart.

next	back to summary
pack-priv QNameMap.Entry<V> next

nsUri	back to summary
public final String nsUri The namespace URI.

value	back to summary
pack-priv V value

Constructor Detail

Entry	back to summary
pack-priv Entry(int h, String nsUri, String localName, V v, QNameMap.Entry<V> n) Create new entry.

Method Detail

createQName	back to summary
public QName createQName() Creates a new QName object from `nsUri` and `localName`.

equals back to summary

equals	back to summary
public boolean equals(Object o) Overrides java.lang.Object.equals. Doc from java.lang.Object.equals. Indicates whether some other object is "equal to" this one. The `equals` method implements an equivalence relation on non-null object references: It is reflexive: for any non-null reference value `x`, `x.equals(x)` should return `true`. It is symmetric: for any non-null reference values `x` and `y`, `x.equals(y)` should return `true` if and only if `y.equals(x)` returns `true`. It is transitive: for any non-null reference values `x`, `y`, and `z`, if `x.equals(y)` returns `true` and `y.equals(z)` returns `true`, then `x.equals(z)` should return `true`. It is consistent: for any non-null reference values `x` and `y`, multiple invocations of `x.equals(y)` consistently return `true` or consistently return `false`, provided no information used in `equals` comparisons on the objects is modified. For any non-null reference value `x`, `x.equals(null)` should return `false`. An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes. Annotations @Override

public boolean equals(Object o)

Overrides java.lang.Object.equals.

Doc from java.lang.Object.equals.

Indicates whether some other object is "equal to" this one.

The equals method implements an equivalence relation on non-null object references:

It is reflexive: for any non-null reference value x, x.equals(x) should return true.
It is symmetric: for any non-null reference values x and y, x.equals(y) should return true if and only if y.equals(x) returns true.
It is transitive: for any non-null reference values x, y, and z, if x.equals(y) returns true and y.equals(z) returns true, then x.equals(z) should return true.
It is consistent: for any non-null reference values x and y, multiple invocations of x.equals(y) consistently return true or consistently return false, provided no information used in equals comparisons on the objects is modified.
For any non-null reference value x, x.equals(null) should return false.

An equivalence relation partitions the elements it operates on into equivalence classes; all the members of an equivalence class are equal to each other. Members of an equivalence class are substitutable for each other, at least for some purposes.

Annotations

@Override

getValue	back to summary
public V getValue()

hashCode back to summary

hashCode	back to summary
public int hashCode() Overrides java.lang.Object.hashCode. Doc from java.lang.Object.hashCode. Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by `java.util.HashMap`. The general contract of `hashCode` is: Whenever it is invoked on the same object more than once during an execution of a Java application, the `hashCode` method must consistently return the same integer, provided no information used in `equals` comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application. If two objects are equal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce the same integer result. It is not required that if two objects are unequal according to the `equals` method, then calling the `hashCode` method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables. Annotations @Override

public int hashCode()

Overrides java.lang.Object.hashCode.

Doc from java.lang.Object.hashCode.

Returns a hash code value for this object. This method is supported for the benefit of hash tables such as those provided by java.util.HashMap.

The general contract of hashCode is:

Whenever it is invoked on the same object more than once during an execution of a Java application, the hashCode method must consistently return the same integer, provided no information used in equals comparisons on the object is modified. This integer need not remain consistent from one execution of an application to another execution of the same application.
If two objects are equal according to the equals method, then calling the hashCode method on each of the two objects must produce the same integer result.
It is not required that if two objects are unequal according to the equals method, then calling the hashCode method on each of the two objects must produce distinct integer results. However, the programmer should be aware that producing distinct integer results for unequal objects may improve the performance of hash tables.

Annotations

@Override

setValue	back to summary
public V setValue(V newValue)

toString back to summary

toString	back to summary
public String toString() Overrides java.lang.Object.toString. Doc from java.lang.Object.toString. Returns a string representation of the object. Satisfying this method's contract implies a non-`null` result must be returned. Annotations @Override

public String toString()

Overrides java.lang.Object.toString.

Doc from java.lang.Object.toString.

Returns a string representation of the object. Satisfying this method's contract implies a non-null result must be returned.

Annotations

@Override

org.glassfish.jaxb.runtime.v2.util back to summary

private Class QNameMap.EntryIterator

Class Inheritance

extends QNameMap<V>.HashIterator<QNameMap.Entry<V>>

java.lang.Object
org.glassfish.jaxb.runtime.v2.util.QNameMap.HashIterator
org.glassfish.jaxb.runtime.v2.util.QNameMap.EntryIterator

Field Summary

Inherited from org.glassfish.jaxb.runtime.v2.util.QNameMap.HashIterator:: index next

Constructor Summary

Access	Constructor and Description
private	EntryIterator()

Method Summary

Modifier and Type	Method and Description
public QNameMap.Entry<V>	next() Implements java.util.Iterator.next. Returns the next element in the iteration.

Inherited from org.glassfish.jaxb.runtime.v2.util.QNameMap.HashIterator:: hasNext nextEntry remove

Constructor Detail

EntryIterator	back to summary
private EntryIterator()

Method Detail

back to summary

public QNameMap.Entry<V> next()

Implements java.util.Iterator.next.

Doc from java.util.Iterator.next.

Returns the next element in the iteration.

Annotations

@Override

org.glassfish.jaxb.runtime.v2.util back to summary

private Class QNameMap.EntrySet

Class Inheritance

extends AbstractSet<QNameMap.Entry<V>>

java.lang.Object
java.util.AbstractCollection
java.util.AbstractSet
org.glassfish.jaxb.runtime.v2.util.QNameMap.EntrySet

Constructor Summary

Access	Constructor and Description
private	EntrySet()

Method Summary

Modifier and Type	Method and Description
public boolean	contains(Object o) Overrides java.util.AbstractCollection.contains. Implements java.util.Set.contains, java.util.Collection.contains. Returns `true` if this set contains the specified element.
public Iterator<QNameMap.Entry<V>>	iterator() Implements abstract java.util.AbstractCollection.iterator. Implements java.util.Set.iterator, java.util.Collection.iterator. Returns an iterator over the elements in this set.
public boolean	remove(Object o) Overrides java.util.AbstractCollection.remove. Implements java.util.Set.remove, java.util.Collection.remove. Removes the specified element from this set if it is present (optional operation).
public int	size() Implements abstract java.util.AbstractCollection.size. Implements java.util.Set.size, java.util.Collection.size. Returns the number of elements in this set (its cardinality).

Inherited from java.util.AbstractSet:: equals hashCode removeAll

Constructor Detail

EntrySet	back to summary
private EntrySet()

Method Detail

contains back to summary

public boolean contains(Object o)

Overrides java.util.AbstractCollection.contains.

Implements java.util.Set.contains, java.util.Collection.contains.

Doc from java.util.Set.contains.

Returns true if this set contains the specified element. More formally, returns true if and only if this set contains an element e such that Objects.equals(o, e).

Annotations

@Override

iterator

back to summary

public Iterator<QNameMap.Entry<V>> iterator()

Implements abstract java.util.AbstractCollection.iterator.

Implements java.util.Set.iterator, java.util.Collection.iterator.

Doc from java.util.Set.iterator.

Returns an iterator over the elements in this set. The elements are returned in no particular order (unless this set is an instance of some class that provides a guarantee).

Annotations

@Override

remove back to summary

public boolean remove(Object o)

Overrides java.util.AbstractCollection.remove.

Implements java.util.Set.remove, java.util.Collection.remove.

Doc from java.util.Set.remove.

Removes the specified element from this set if it is present (optional operation). More formally, removes an element e such that Objects.equals(o, e), if this set contains such an element. Returns true if this set contained the element (or equivalently, if this set changed as a result of the call). (This set will not contain the element once the call returns.)

Annotations

@Override

size back to summary

public int size()

Implements abstract java.util.AbstractCollection.size.

Implements java.util.Set.size, java.util.Collection.size.

Doc from java.util.Set.size.

Returns the number of elements in this set (its cardinality). If this set contains more than Integer.MAX_VALUE elements, returns Integer.MAX_VALUE.

Annotations

@Override

org.glassfish.jaxb.runtime.v2.util back to summary

private abstract Class QNameMap.HashIterator<E>

Class Inheritance

extends Object
implements Iterator<E>

java.lang.Object
org.glassfish.jaxb.runtime.v2.util.QNameMap.HashIterator

All Implemented Interfaces

java.util.Iterator

Known Direct Subclasses

org.glassfish.jaxb.runtime.v2.util.QNameMap.EntryIterator

Field Summary

Modifier and Type	Field and Description
pack-priv int	index
pack-priv QNameMap.Entry<V>	next

Constructor Summary

Access	Constructor and Description
pack-priv	HashIterator()

Method Summary

Modifier and Type	Method and Description
public boolean	hasNext() Implements java.util.Iterator.hasNext. Returns `true` if the iteration has more elements.
pack-priv QNameMap.Entry<V>	nextEntry()
public void	remove() Overrides default java.util.Iterator.remove. Removes from the underlying collection the last element returned by this iterator (optional operation).

Inherited from java.lang.Object:: clone equals finalize getClass hashCode notify notifyAll toString wait wait wait

Field Detail

index	back to summary
pack-priv int index

next	back to summary
pack-priv QNameMap.Entry<V> next

Constructor Detail

HashIterator	back to summary
pack-priv HashIterator()

Method Detail

hasNext back to summary

public boolean hasNext()

Implements java.util.Iterator.hasNext.

Doc from java.util.Iterator.hasNext.

Returns true if the iteration has more elements. (In other words, returns true if next would return an element rather than throwing an exception.)

Annotations

@Override

nextEntry	back to summary
pack-priv QNameMap.Entry<V> nextEntry()

remove back to summary

public void remove()

Overrides default java.util.Iterator.remove.

Doc from java.util.Iterator.remove.

Removes from the underlying collection the last element returned by this iterator (optional operation). This method can be called only once per call to next.

The behavior of an iterator is unspecified if the underlying collection is modified while the iteration is in progress in any way other than by calling this method, unless an overriding class has specified a concurrent modification policy.

The behavior of an iterator is unspecified if this method is called after a call to the forEachRemaining method.

Annotations

@Override

public final Class QNameMap<V>

Nested and Inner Type Summary

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

public final Class QNameMap.Entry<V>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail

private Class QNameMap.EntryIterator

Field Summary

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private Class QNameMap.EntrySet

Constructor Summary

Method Summary

Constructor Detail

Method Detail

private abstract Class QNameMap.HashIterator<E>

Field Summary

Constructor Summary

Method Summary

Field Detail

Constructor Detail

Method Detail