Version:

$Revision: 600891 $

Version:

$Revision: 632961 $

java.lang.IllegalArgumentException - if fromKey is greater than toKey.

java.lang.IllegalArgumentException - if fromKey is greater than toKey; or if this map is itself a subMap, headMap, or tailMap, and fromKey or toKey are not within the specified range of the subMap, headMap, or tailMap

The ISO 639-2 language codes can be found on-line at ftp://dkuug.dk/i18n/iso-639-2.txt

The ISO 639-2 language codes can be found on-line at http://www.loc.gov/standards/iso639-2/englangn.html

Parameters

coll - the collection whose maximum element is to be determined.

Parameters

coll - the collection whose maximum element is to be determined.

comp - the comparator with which to determine the maximum element. A null value indicates that the elements' natural ordering should be used.

Returns

true if this collection contains the specified element.

Returns

true if the specified element is present; false otherwise.

Ensures that this collection contains the specified element (optional operation). Returns true if the collection changed as a result of the call. (Returns false if this collection does not permit duplicates and already contains the specified element.) Collections that support this operation may place limitations on what elements may be added to the collection. In particular, some collections will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. Collection classes should clearly specify in their documentation any restrictions on what elements may be added.

This implementation always throws an UnsupportedOperationException.

Ensures that this collection contains the specified element (optional operation). Returns true if this collection changed as a result of the call. (Returns false if this collection does not permit duplicates and already contains the specified element.)

Collections that support this operation may place limitations on what elements may be added to this collection. In particular, some collections will refuse to add null elements, and others will impose restrictions on the type of elements that may be added. Collection classes should clearly specify in their documentation any restrictions on what elements may be added.

If a collection refuses to add a particular element for any reason other than that it already contains the element, it must throw an exception (rather than returning false). This preserves the invariant that a collection always contains the specified element after this call returns.

This implementation always throws an UnsupportedOperationException.

Deprecated. Will be removed in Lucene 3.1. The doc is relative to the current reader, which is unknown to CustomScoreQuery when using per-segment search (since Lucene 2.9). Please override getCustomScoreProvider(org.apache.lucene.index.IndexReader) and return a subclass of CustomScoreProvider for the given IndexReader.

Explain the custom score.

Explain the custom score. Whenever overriding customScore(int, float, float), this method should also be overridden to provide the correct explanation for the part of the custom scoring.

Week 1 for a year is the first week that contains at least getMinimalDaysInFirstWeek() days from that year.

Week 1 for a year is the earliest seven day period starting on getFirstDayOfWeek() that contains at least getMinimalDaysInFirstWeek() days from that year.

Parameters

index - the index of the element to removed

Parameters

index - the index of the element to be removed

Set the cookiesName which if matche will allow the cookie to be injected into action, could be comma-separated string.

Set the cookiesName which if matched will allow the cookie to be injected into action, could be comma-separated string.

Note that the set method reverses the order of the parameters, to more closely match array usage.

Note that the set method reverses the order of the parameters, to more closely match array usage.

Java's builtin ThreadLocal has a serious flaw: it can take an arbitrarily long amount of time to dereference the things you had stored in it, even once the ThreadLocal instance itself is no longer referenced. This is because there is single, master map stored for each thread, which all ThreadLocals share, and that master map only periodically purges "stale" entries. While not technically a memory leak, because eventually the memory will be reclaimed, it can take a long time and you can easily hit OutOfMemoryError because from the GC's standpoint the stale entries are not reclaimable. This class works around that, by only enrolling WeakReference values into the ThreadLocal, and separately holding a hard reference to each stored value. When you call close(), these hard references are cleared and then GC is freely able to reclaim space by objects stored in it.

Java's builtin ThreadLocal has a serious flaw: it can take an arbitrarily long amount of time to dereference the things you had stored in it, even once the ThreadLocal instance itself is no longer referenced. This is because there is single, master map stored for each thread, which all ThreadLocals share, and that master map only periodically purges "stale" entries. While not technically a memory leak, because eventually the memory will be reclaimed, it can take a long time and you can easily hit OutOfMemoryError because from the GC's standpoint the stale entries are not reclaimable. This class works around that, by only enrolling WeakReference values into the ThreadLocal, and separately holding a hard reference to each stored value. When you call close(), these hard references are cleared and then GC is freely able to reclaim space by objects stored in it. We can not rely on ThreadLocal.remove() as it only removes the value for the caller thread, whereas close() takes care of all threads. You should not call close() until all threads are done using the instance.

hashCode = 1;

  Iterator i = list.iterator();

  while (i.hasNext()) {

      Object obj = i.next();

      hashCode = 31*hashCode + (obj==null ? 0 : obj.hashCode());

  }

int hashCode = 1;

  Iterator<E> i = list.iterator();

  while (i.hasNext()) {

      E obj = i.next();

      hashCode = 31*hashCode + (obj==null ? 0 : obj.hashCode());

  }

See class description.

Returns an array in which each item is a pair of objects in an Object array. The first element of each pair is the key, which must be a String, and the second element is the value associated with that key. See the class description for details.

Return��

an array of an Object array representing a key-value pair.

Library

version

Level

Anotation

Literal polish

Programming tips