* {@code
* public boolean save(ModelCache modelCache) {
@@ -128,7 +128,7 @@ public static CachedModel find(ModelCache modelCache, String id,
* }
* }
*
- *
+ *
* @param modelCache
* Cache to save to.
* @return Whether or not saving to the cache was successful.
@@ -140,7 +140,7 @@ public boolean save(ModelCache modelCache) {
/**
* Attempts to save the object in the cache using a given key. Generally only used for saving
* subclasses over the top of separate superclass cache stores.
- *
+ *
* @param modelCache
* Cache to save to.
* @param saveKey
@@ -158,7 +158,7 @@ protected boolean save(ModelCache modelCache, String saveKey) {
/**
* Attempts to reload any new data from cache.
- *
+ *
* @param modelCache
* Cache to be reloaded from.
* @return Whether or not newer data was found in the cache.
@@ -181,7 +181,7 @@ public boolean reload(ModelCache modelCache) {
/**
* Method called to determine a key in the cache using the object's id e.g.:
- *
+ *
*
* {@code
* public String createKey(String id) {
@@ -189,7 +189,7 @@ public boolean reload(ModelCache modelCache) {
* }
* }
*
- *
+ *
* @param id
* ID of object to be stored.
* @return Key that object with given ID should be stored in cache under.
@@ -198,7 +198,7 @@ public boolean reload(ModelCache modelCache) {
/**
* Method called to reload any data from a more recently stored object e.g.:
- *
+ *
*
* {@code
* public boolean reloadFromCachedModel(ModelCache modelCache, CachedModel cachedModel) {
@@ -208,9 +208,9 @@ public boolean reload(ModelCache modelCache) {
* }
* }
*
- *
+ *
* Can also be used to reload internal cached objects. e.g.:
- *
+ *
*
* {@code
* public boolean reloadFromCachedModel(ModelCache modelCache, CachedModel cachedModel) {
@@ -220,7 +220,7 @@ public boolean reload(ModelCache modelCache) {
* }
* }
*
- *
+ *
* @param modelCache
* Cache that is currently being reloaded from.
* @param cachedModel
@@ -249,7 +249,7 @@ public void writeToParcel(Parcel dest, int flags) {
/**
* Saves data to parcel.
- *
+ *
* @param source
* Parcel to save to.
* @throws IOException
diff --git a/src/main/java/com/github/droidfu/cachefu/HttpResponseCache.java b/src/main/java/com/github/droidfu/cachefu/HttpResponseCache.java
index 68ae395..96f0ca6 100644
--- a/src/main/java/com/github/droidfu/cachefu/HttpResponseCache.java
+++ b/src/main/java/com/github/droidfu/cachefu/HttpResponseCache.java
@@ -13,9 +13,9 @@
* Allows caching HTTP responses (only status code and payload at the moment) using the features
* provided by {@link AbstractCache}. The key into the cache will be the request URL used to
* retrieve the HTTP response in the first place.
- *
+ *
* @author Matthias Kaeppler
- *
+ *
*/
public class HttpResponseCache extends AbstractCacheCharacter.LOWERCASE_LETTER will belong to the
* following token rather than to the preceding, if any,
* Character.UPPERCASE_LETTER token.
- *
+ *
*
* StringUtils.splitByCharacterTypeCamelCase(null) = null
* StringUtils.splitByCharacterTypeCamelCase("") = []
@@ -42,7 +42,7 @@ public static String underscore(String camelCaseString) {
* StringUtils.splitByCharacterTypeCamelCase("foo200Bar") = ["foo", "200", "Bar"]
* StringUtils.splitByCharacterTypeCamelCase("ASFRules") = ["ASF", "Rules"]
*
- *
+ *
* @param str
* the String to split, may be null
* @return an array of parsed Strings, null if null String
@@ -64,7 +64,7 @@ public static String[] splitByCharacterTypeCamelCase(String str) {
* Character.LOWERCASE_LETTER will belong to the following
* token rather than to the preceding, if any,
* Character.UPPERCASE_LETTER token.
- *
+ *
* @param str
* the String to split, may be null
* @param camelCase
diff --git a/src/main/java/com/github/droidfu/testsupport/DroidFuAssertions.java b/src/main/java/com/github/droidfu/testsupport/DroidFuAssertions.java
index 587a310..2015998 100644
--- a/src/main/java/com/github/droidfu/testsupport/DroidFuAssertions.java
+++ b/src/main/java/com/github/droidfu/testsupport/DroidFuAssertions.java
@@ -47,7 +47,7 @@ public static
* Implementations which may cause side effects upon evaluation are strongly
* encouraged to state this fact clearly in their API documentation.
- *
+ *
* @param
* For example, the following strategy emulates the behavior of
* {@link java.util.concurrent.ConcurrentHashMap}:
- *
+ *
*
* The value can be retrieved by calling the {@code get} method with a
* key that is equal to the original key.
- *
+ *
* @param key
* key with which the specified value is to be associated
* @param value
@@ -1475,7 +1475,7 @@ public V put(K key, V value) {
/**
* {@inheritDoc}
- *
+ *
* @return the previous value associated with the specified key, or
* {@code null} if there was no mapping for the key
* @throws NullPointerException
@@ -1496,7 +1496,7 @@ public V putIfAbsent(K key, V value) {
* Copies all of the mappings from the specified map to this one. These
* mappings replace any mappings that this map had for any of the keys
* currently in the specified map.
- *
+ *
* @param m
* mappings to be stored in this map
*/
@@ -1510,7 +1510,7 @@ public void putAll(Map m) {
/**
* Removes the key (and its corresponding value) from this map. This
* method does nothing if the key is not in the map.
- *
+ *
* @param key
* the key that needs to be removed
* @return the previous value associated with {@code key}, or {@code
@@ -1529,7 +1529,7 @@ public V remove(Object key) {
/**
* {@inheritDoc}
- *
+ *
* @throws NullPointerException
* if the specified key is null
*/
@@ -1543,7 +1543,7 @@ public boolean remove(Object key, Object value) {
/**
* {@inheritDoc}
- *
+ *
* @throws NullPointerException
* if any of the arguments are null
*/
@@ -1563,7 +1563,7 @@ public boolean replace(K key, V oldValue, V newValue) {
/**
* {@inheritDoc}
- *
+ *
* @return the previous value associated with the specified key, or
* {@code null} if there was no mapping for the key
* @throws NullPointerException
@@ -2155,7 +2155,7 @@ public V get(Object k) {
* {@link SimpleInternalEntry}. Intended to be subclassed to provide
* customized behavior. For example, the following creates a map that uses
* byte arrays as keys:
- *
+ *
*
* public int hashCode() {
* return Objects.hashCode(getX(), getY(), getZ());
* }
*
- *
+ *
* Warning: When a single object is supplied, the returned hash code
* does not equal the hash code of that object.
*/
diff --git a/src/main/java/com/google/common/collect/AbstractMapEntry.java b/src/main/java/com/google/common/collect/AbstractMapEntry.java
index 63da3da..eb4b117 100644
--- a/src/main/java/com/google/common/collect/AbstractMapEntry.java
+++ b/src/main/java/com/google/common/collect/AbstractMapEntry.java
@@ -18,7 +18,7 @@
/**
* Implementation of the {@code equals}, {@code hashCode}, and {@code toString}
* methods of {@code Entry}.
- *
+ *
* @author Jared Levy
*/
abstract class AbstractMapEntry
* @code
* class ConcurrentHashMapStrategy<K, V>
@@ -108,17 +108,17 @@
* }
* }
*
- *
+ *
* To create a {@link java.util.concurrent.ConcurrentMap} using the strategy
* above:
- *
+ *
*
* @code
* ConcurrentMap<K, V> map = new CustomConcurrentHashMap.Builder()
* .build(new ConcurrentHashMapStrategy<K, V>());
* }
*
- *
+ *
* @author Bob Lee
* @author Doug Lea
*/
@@ -146,7 +146,7 @@ static final class Builder {
* other kind of hash table is a relatively slow operation, so, when
* possible, it is a good idea to provide estimates of expected table
* sizes.
- *
+ *
* @throws IllegalArgumentException
* if initialCapacity < 0
*/
@@ -175,7 +175,7 @@ public Builder initialCapacity(int initialCapacity) {
* magnitude do not usually have much noticeable impact. A value of one
* is appropriate when it is known that only one thread will modify and
* all others will only read. Defaults to {@literal 16}.
- *
+ *
* @throws IllegalArgumentException
* if concurrencyLevel < 0
*/
@@ -193,7 +193,7 @@ public Builder concurrencyLevel(int concurrencyLevel) {
/**
* Creates a new concurrent hash map backed by the given strategy.
- *
+ *
* @param strategy
* used to implement and manipulate the entries
* @param
* @code
* return new CustomConcurrentHashMap.Builder().buildMap(
@@ -2168,7 +2168,7 @@ public V get(Object k) {
* }
* });}
*
- *
+ *
* With nothing overridden, it yields map behavior equivalent to that of
* {@link ConcurrentHashMap}.
*/
diff --git a/src/main/java/com/google/common/collect/MapMaker.java b/src/main/java/com/google/common/collect/MapMaker.java
index 87231f0..6943470 100644
--- a/src/main/java/com/google/common/collect/MapMaker.java
+++ b/src/main/java/com/google/common/collect/MapMaker.java
@@ -36,7 +36,7 @@
* {@linkplain SoftReference soft} or {@linkplain WeakReference weak} keys, soft
* or weak values, timed expiration, and on-demand computation of values. Usage
* example:
- *
+ *
*
* @code
* ConcurrentMap<Key, Graph> graphs = new MapMaker()
@@ -51,7 +51,7 @@
* }
* });}
*
- *
+ *
* These features are all optional; {@code new MapMaker().makeMap()} returns a
* valid concurrent map that behaves exactly like a {@link ConcurrentHashMap}.
* The returned map is implemented as a hash table with similar performance
@@ -82,7 +82,7 @@
* drop-in replacement for {@link java.util.WeakHashMap}, adding concurrency,
* asynchronous cleanup, identity-based equality for keys, and great
* flexibility.
- *
+ *
* @author Bob Lee
* @author Kevin Bourrillion
*/
@@ -104,7 +104,7 @@ public MapMaker() {
* Sets a custom initial capacity (defaults to 16). Resizing this or any
* other kind of hash table is a relatively slow operation, so, when
* possible, it is a good idea to provide estimates of expected table sizes.
- *
+ *
* @throws IllegalArgumentException
* if {@code initialCapacity} is negative
* @throws IllegalStateException
@@ -128,7 +128,7 @@ public MapMaker initialCapacity(int initialCapacity) {
* noticeable impact. A value of one is appropriate when it is known that
* only one thread will modify and all others will only read. Defaults to
* 16.
- *
+ *
* @throws IllegalArgumentException
* if {@code concurrencyLevel} is nonpositive
* @throws IllegalStateException
@@ -148,7 +148,7 @@ public MapMaker concurrencyLevel(int concurrencyLevel) {
* example, storing a key in the map and then attempting a lookup using a
* different but {@link Object#equals(Object) equals}-equivalent key will
* always fail.
- *
+ *
* @throws IllegalStateException
* if the key strength was already set
* @see WeakReference
@@ -166,7 +166,7 @@ public MapMaker weakKeys() {
* example, storing a key in the map and then attempting a lookup using a
* different but {@link Object#equals(Object) equals}-equivalent key will
* always fail.
- *
+ *
* @throws IllegalStateException
* if the key strength was already set
* @see SoftReference
@@ -197,7 +197,7 @@ private MapMaker setKeyStrength(Strength strength) {
* of {@link Map#containsValue(Object) containsValue},
* {@link ConcurrentMap#remove(Object, Object) remove(Object, Object)}, and
* {@link ConcurrentMap#replace(Object, Object, Object) replace(K, V, V)}.
- *
+ *
* @throws IllegalStateException
* if the key strength was already set
* @see WeakReference
@@ -219,7 +219,7 @@ public MapMaker weakValues() {
* of {@link Map#containsValue(Object) containsValue},
* {@link ConcurrentMap#remove(Object, Object) remove(Object, Object)}, and
* {@link ConcurrentMap#replace(Object, Object, Object) replace(K, V, V)}.
- *
+ *
* @throws IllegalStateException
* if the value strength was already set
* @see SoftReference
@@ -241,7 +241,7 @@ private MapMaker setValueStrength(Strength strength) {
/**
* Specifies that each entry should be automatically removed from the map
* once a fixed duration has passed since the entry's creation.
- *
+ *
* @param duration
* the length of time after an entry is created that it should be
* automatically removed
@@ -269,7 +269,7 @@ public MapMaker expiration(long duration, TimeUnit unit) {
* Builds the final map, without on-demand computation of values. This
* method does not alter the state of this {@code MapMaker} instance, so it
* can be invoked again to create multiple independent maps.
- *
+ *
* @param