- java.lang.Object
-
- com.sun.net.httpserver.Headers
-
public class Headers extends Object implements Map<String,List<String>>
HTTP request and response headers are represented by this class which implements the interfaceMap
<String
,List
<String
>>. The keys are case-insensitive Strings representing the header names and the value associated with each key is aList
<String
> with one element for each occurrence of the header name in the request or response.For example, if a response header instance contains one key "HeaderName" with two values "value1 and value2" then this object is output as two header lines:
HeaderName: value1 HeaderName: value2
All the normal
Map
methods are provided, but the following additional convenience methods are most likely to be used:getFirst(String)
returns a single valued header or the first value of a multi-valued header.add(String,String)
adds the given header value to the list for the given keyset(String,String)
sets the given header field to the single value given overwriting any existing values in the value list.
All methods in this class accept
null
values for keys and values. However, null keys will never will be present in HTTP request headers, and will not be output/sent in response headers. Null values can be represented as either a null entry for the key (i.e. the list is null) or where the key has a list, but one (or more) of the list's values is null. Null values are output as a header line containing the key but no associated value.- Since:
- 1.6
-
-
Constructor Summary
Constructors Constructor Description Headers()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
add(String key, String value)
adds the given value to the list of headers for the given key.void
clear()
Removes all of the mappings from this map (optional operation).boolean
containsKey(Object key)
Returnstrue
if this map contains a mapping for the specified key.boolean
containsValue(Object value)
Returnstrue
if this map maps one or more keys to the specified value.Set<Map.Entry<String,List<String>>>
entrySet()
Returns aSet
view of the mappings contained in this map.boolean
equals(Object o)
Indicates whether some other object is "equal to" this one.List<String>
get(Object key)
Returns the value to which the specified key is mapped, ornull
if this map contains no mapping for the key.String
getFirst(String key)
returns the first value from the List of String values for the given key (if at least one exists).int
hashCode()
Returns a hash code value for the object.boolean
isEmpty()
Returnstrue
if this map contains no key-value mappings.Set<String>
keySet()
Returns aSet
view of the keys contained in this map.List<String>
put(String key, List<String> value)
Associates the specified value with the specified key in this map (optional operation).void
putAll(Map<? extends String,? extends List<String>> t)
Copies all of the mappings from the specified map to this map (optional operation).List<String>
remove(Object key)
Removes the mapping for a key from this map if it is present (optional operation).void
set(String key, String value)
sets the given value as the sole header value for the given key.int
size()
Returns the number of key-value mappings in this map.Collection<List<String>>
values()
Returns aCollection
view of the values contained in this map.-
Methods inherited from interface java.util.Map
compute, computeIfAbsent, computeIfPresent, entry, forEach, getOrDefault, merge, of, of, of, of, of, of, of, of, of, of, of, ofEntries, putIfAbsent, remove, replace, replace, replaceAll
-
-
-
-
Method Detail
-
size
public int size()
Description copied from interface:Map
Returns the number of key-value mappings in this map. If the map contains more thanInteger.MAX_VALUE
elements, returnsInteger.MAX_VALUE
.
-
isEmpty
public boolean isEmpty()
Description copied from interface:Map
Returnstrue
if this map contains no key-value mappings.
-
containsKey
public boolean containsKey(Object key)
Description copied from interface:Map
Returnstrue
if this map contains a mapping for the specified key. More formally, returnstrue
if and only if this map contains a mapping for a keyk
such thatObjects.equals(key, k)
. (There can be at most one such mapping.)- Specified by:
containsKey
in interfaceMap<String,List<String>>
- Parameters:
key
- key whose presence in this map is to be tested- Returns:
true
if this map contains a mapping for the specified key
-
containsValue
public boolean containsValue(Object value)
Description copied from interface:Map
Returnstrue
if this map maps one or more keys to the specified value. More formally, returnstrue
if and only if this map contains at least one mapping to a valuev
such thatObjects.equals(value, v)
. This operation will probably require time linear in the map size for most implementations of theMap
interface.- Specified by:
containsValue
in interfaceMap<String,List<String>>
- Parameters:
value
- value whose presence in this map is to be tested- Returns:
true
if this map maps one or more keys to the specified value
-
get
public List<String> get(Object key)
Description copied from interface:Map
Returns the value to which the specified key is mapped, ornull
if this map contains no mapping for the key.More formally, if this map contains a mapping from a key
k
to a valuev
such thatObjects.equals(key, k)
, then this method returnsv
; otherwise it returnsnull
. (There can be at most one such mapping.)If this map permits null values, then a return value of
null
does not necessarily indicate that the map contains no mapping for the key; it's also possible that the map explicitly maps the key tonull
. ThecontainsKey
operation may be used to distinguish these two cases.
-
getFirst
public String getFirst(String key)
returns the first value from the List of String values for the given key (if at least one exists).- Parameters:
key
- the key to search for- Returns:
- the first string value associated with the key
-
put
public List<String> put(String key, List<String> value)
Description copied from interface:Map
Associates the specified value with the specified key in this map (optional operation). If the map previously contained a mapping for the key, the old value is replaced by the specified value. (A mapm
is said to contain a mapping for a keyk
if and only ifm.containsKey(k)
would returntrue
.)- Specified by:
put
in interfaceMap<String,List<String>>
- Parameters:
key
- key with which the specified value is to be associatedvalue
- value to be associated with the specified key- Returns:
- the previous value associated with
key
, ornull
if there was no mapping forkey
. (Anull
return can also indicate that the map previously associatednull
withkey
, if the implementation supportsnull
values.)
-
add
public void add(String key, String value)
adds the given value to the list of headers for the given key. If the mapping does not already exist, then it is created- Parameters:
key
- the header namevalue
- the header value to add to the header
-
set
public void set(String key, String value)
sets the given value as the sole header value for the given key. If the mapping does not already exist, then it is created- Parameters:
key
- the header namevalue
- the header value to set.
-
remove
public List<String> remove(Object key)
Description copied from interface:Map
Removes the mapping for a key from this map if it is present (optional operation). More formally, if this map contains a mapping from keyk
to valuev
such thatObjects.equals(key, k)
, that mapping is removed. (The map can contain at most one such mapping.)Returns the value to which this map previously associated the key, or
null
if the map contained no mapping for the key.If this map permits null values, then a return value of
null
does not necessarily indicate that the map contained no mapping for the key; it's also possible that the map explicitly mapped the key tonull
.The map will not contain a mapping for the specified key once the call returns.
-
putAll
public void putAll(Map<? extends String,? extends List<String>> t)
Description copied from interface:Map
Copies all of the mappings from the specified map to this map (optional operation). The effect of this call is equivalent to that of callingput(k, v)
on this map once for each mapping from keyk
to valuev
in the specified map. The behavior of this operation is undefined if the specified map is modified while the operation is in progress.
-
clear
public void clear()
Description copied from interface:Map
Removes all of the mappings from this map (optional operation). The map will be empty after this call returns.
-
keySet
public Set<String> keySet()
Description copied from interface:Map
Returns aSet
view of the keys contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's ownremove
operation), the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via theIterator.remove
,Set.remove
,removeAll
,retainAll
, andclear
operations. It does not support theadd
oraddAll
operations.
-
values
public Collection<List<String>> values()
Description copied from interface:Map
Returns aCollection
view of the values contained in this map. The collection is backed by the map, so changes to the map are reflected in the collection, and vice-versa. If the map is modified while an iteration over the collection is in progress (except through the iterator's ownremove
operation), the results of the iteration are undefined. The collection supports element removal, which removes the corresponding mapping from the map, via theIterator.remove
,Collection.remove
,removeAll
,retainAll
andclear
operations. It does not support theadd
oraddAll
operations.
-
entrySet
public Set<Map.Entry<String,List<String>>> entrySet()
Description copied from interface:Map
Returns aSet
view of the mappings contained in this map. The set is backed by the map, so changes to the map are reflected in the set, and vice-versa. If the map is modified while an iteration over the set is in progress (except through the iterator's ownremove
operation, or through thesetValue
operation on a map entry returned by the iterator) the results of the iteration are undefined. The set supports element removal, which removes the corresponding mapping from the map, via theIterator.remove
,Set.remove
,removeAll
,retainAll
andclear
operations. It does not support theadd
oraddAll
operations.
-
equals
public boolean equals(Object o)
Description copied from class:Object
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 returntrue
. - It is symmetric: for any non-null reference values
x
andy
,x.equals(y)
should returntrue
if and only ify.equals(x)
returnstrue
. - It is transitive: for any non-null reference values
x
,y
, andz
, ifx.equals(y)
returnstrue
andy.equals(z)
returnstrue
, thenx.equals(z)
should returntrue
. - It is consistent: for any non-null reference values
x
andy
, multiple invocations ofx.equals(y)
consistently returntrue
or consistently returnfalse
, provided no information used inequals
comparisons on the objects is modified. - For any non-null reference value
x
,x.equals(null)
should returnfalse
.
The
equals
method for classObject
implements the most discriminating possible equivalence relation on objects; that is, for any non-null reference valuesx
andy
, this method returnstrue
if and only ifx
andy
refer to the same object (x == y
has the valuetrue
).Note that it is generally necessary to override the
hashCode
method whenever this method is overridden, so as to maintain the general contract for thehashCode
method, which states that equal objects must have equal hash codes. - It is reflexive: for any non-null reference value
-
hashCode
public int hashCode()
Description copied from class:Object
Returns a hash code value for the object. This method is supported for the benefit of hash tables such as those provided byHashMap
.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 inequals
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(Object)
method, then calling thehashCode
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
Object.equals(java.lang.Object)
method, then calling thehashCode
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.
As much as is reasonably practical, the hashCode method defined by class
Object
does return distinct integers for distinct objects. (The hashCode may or may not be implemented as some function of an object's memory address at some point in time.)- Specified by:
hashCode
in interfaceMap<String,List<String>>
- Overrides:
hashCode
in classObject
- Returns:
- a hash code value for this object.
- See Also:
Object.equals(java.lang.Object)
,System.identityHashCode(java.lang.Object)
- Whenever it is invoked on the same object more than once during
an execution of a Java application, the
-
-