HashMap中put()与compute()返回值差异及设计原因探究
HashMap的put()与compute()返回值差异的设计逻辑问询
方法定义与返回值说明
put()方法
/** * Associates the specified value with the specified key in this map. * If the map previously contained a mapping for the key, the old * value is replaced. * * @param key key with which the specified value is to be associated * @param value value to be associated with the specified key * @return the previous value associated with <tt>key</tt>, or * <tt>null</tt> if there was no mapping for <tt>key</tt>. * (A <tt>null</tt> return can also indicate that the map * previously associated <tt>null</tt> with <tt>key</tt>.) */ public V put(K key, V value) { return putVal(hash(key), key, value, false, true); }
put()方法返回与指定key关联的旧值,无映射或旧值为null时返回null。
compute()方法
/** * Attempts to compute a mapping for the specified key and its current * mapped value (or {@code null} if there is no current mapping). For * example, to either create or append a {@code String} msg to a value * mapping: * * <pre> {@code * map.compute(key, (k, v) -> (v == null) ? msg : v.concat(msg))}</pre> * (Method {@link #merge merge()} is often simpler to use for such purposes.) * * <p>If the function returns {@code null}, the mapping is removed (or * remains absent if initially absent). If the function itself throws an * (unchecked) exception, the exception is rethrown, and the current mapping * is left unchanged. * * @implSpec * The default implementation is equivalent to performing the following * steps for this {@code map}, then returning the current value or * {@code null} if absent: * * <pre> {@code * V oldValue = map.get(key); * V newValue = remappingFunction.apply(key, oldValue); * if (oldValue != null ) { * if (newValue != null) * map.put(key, newValue); * else * map.remove(key); * } else { * if (newValue != null) * map.put(key, newValue); * else * return null; * } * }</pre> * * <p>The default implementation makes no guarantees about synchronization * or atomicity properties of this method. Any implementation providing * atomicity guarantees must override this method and document its * concurrency properties. In particular, all implementations of * subinterface {@link java.util.concurrent.ConcurrentMap} must document * whether the function is applied once atomically only if the value is not * present. * * @param key key with which the specified value is to be associated * @param remappingFunction the function to compute a value * @return the new value associated with the specified key, or null if none * @throws NullPointerException if the specified key is null and * this map does not support null keys, or the * remappingFunction is null * @throws UnsupportedOperationException if the {@code put} operation * is not supported by this map * (<a href="{@docRoot}/java/util/Collection.html#optional-restrictions">optional</a>) * @throws ClassCastException if the class of the specified key or value * prevents it from being stored in this map * (<a href="{@docRoot}/java/util/Collection.html#optional-restrictions">optional</a>) * @since 1.8 */ default V compute(K key, BiFunction<? super K, ? super V, ? extends V> remappingFunction) {
compute()方法返回与指定key关联的新值,若映射被移除(函数返回null)则返回null。
核心问题
为何HashMap的put()与compute()方法会被设计为返回不同的值?
设计逻辑分析
这两个方法的返回值差异,本质是由它们的核心定位和使用场景决定的:
1. put():聚焦"替换/插入"操作的副作用反馈
put()是Map最基础的写入操作,核心行为是"把给定值绑定到key上,不管之前是什么"。返回旧值的设计,是为了给调用者提供操作前的状态反馈——比如:
- 可以结合
containsKey()判断这个key之前是否存在映射(区分"无映射"和"旧值为null"的情况) - 能直接拿到被替换掉的旧值,方便后续资源释放、日志记录等处理
- 符合早期集合API的设计习惯:类似
Collection.add()返回是否修改集合,put()返回旧值是更具体的状态反馈
2. compute():聚焦"基于旧值计算新值"的结果交付
compute()是Java 8引入的函数式API,核心行为是"用旧值(或null)计算出新值,再决定映射的存/删"。返回新值的设计,是因为它的使用场景通常是:
- 调用者关心的是计算后的最终结果,比如示例里的字符串拼接,调用后直接拿到拼接后的新字符串
- 函数式编程风格下,方法更倾向于返回操作的产出物,而非操作前的状态
- 配合
remappingFunction的逻辑:如果函数返回null会移除映射,此时返回null也能直接告知调用者最终映射不存在,无需额外判断
3. 避免语义混淆
如果两个方法返回值类型一致(比如都返回旧值或都返回新值),反而会增加调用者的认知负担:
- 若
compute()返回旧值,调用者想要新值还得额外get()一次,违背它"计算即获取"的设计初衷 - 若
put()返回新值,那想要旧值的场景就得先get()再put(),多一次IO操作,效率降低
简单来说,put()是"我给你新值,把旧的还给我",compute()是"我告诉你怎么算,把算好的结果给你",两者的返回值都是为了贴合各自最常用的场景,让代码更简洁高效。
内容的提问来源于stack exchange,提问作者Tom Taylor
相关产品推荐
相关产品推荐

