src/org/ohmage/query/impl/QueryResultsMap.java
public S addResult(final T key, final S value) {
			if(key == null) {
				throw new IllegalArgumentException("The key cannot be null.");
			}
			
			S oldValue = results.put(key, value);
			increaseTotalNumResults();
			
			return oldValue;
		}
/**
		 * Adds a result to the current map of results. This will increase the
		 * total number of results by 1 regardless of whether an existing value
		 * is replaced by this value. Null is an acceptable value, but not an
		 * acceptable key. All keys must be distinct, therefore, if a second 
		 * pair is added with the same key as an existing pair, the old value
		 * will be removed and returned and the new value will replace it. The
		 * total count will be automatically incremented because there were
		 * clearly two distinct pairs even if only the latter can be returned.
		 * 
		 * @param key The key for a new pair.
		 * 
		 * @param value The value for a new pair.
		 * 
		 * @return The previous element associated with 'key'; null if no such
		 * 		   key previously existed.
		 */
Adds a result to the current map of results. This will increase the
total number of results by 1 regardless of whether an existing value
is replaced by this value. Null is an acceptable value, but not an
acceptable key. All keys must be distinct, therefore, if a second
pair is added with the same key as an existing pair, the old value
will be removed and returned and the new value will replace it. The
total count will be automatically incremented because there were
clearly two distinct pairs even if only the latter can be returned.

@param key The key for a new pair.

@param value The value for a new pair.

@return The previous element associated with 'key'; null if no such
key previously existed.
Adds a result to the current map of results . This will increase the total number of results by 1 regardless of whether an existing value is replaced by this value . Null is an acceptable value but not an acceptable key . All keys must be distinct therefore if a second pair is added with the same key as an existing pair the old value will be removed and returned and the new value will replace it . The total count will be automatically incremented because there were clearly two distinct pairs even if only the latter can be returned . @param key The key for a new pair . @param value The value for a new pair . @return The previous element associated with ' key ' ; null if no such key previously existed .
public S addResult(final T key, final S value) {
			if(key == null) {
				throw new IllegalArgumentException("The key cannot be null.");
			}
			S oldValue = results.put(key, value);
			increaseTotalNumResults();
			return oldValue;
		}
public S addResult ( final T key , final S value ) { if ( key == null ) { throw new IllegalArgumentException ( "The key cannot be null." ) ; } S oldValue = results . put ( key , value ) ; increaseTotalNumResults ( ) ; return oldValue ; }
Adds a result to the current map of results.
Adds a result to the current map of results .