NullPointerException

v 為null，報(bào)空指針錯(cuò)誤

k為null， 運(yùn)行正常。

以往的認(rèn)知：HashMap中k,v都是可以存null值的。在上面的測(cè)試用例中可以看到，v為null其實(shí)會(huì)報(bào)錯(cuò)。

查看API可以看到

publicstatic<T,K,U,MextendsMap<K,U>>Collector<T,?,M>toMap(Function<?superT,?extendsK>keyMapper,Function<?superT,?extendsU>valueMapper,BinaryOperator<U>mergeFunction,Supplier<M>mapSupplier){BiConsumer<M,T>accumulator=(map,element)->map.merge(keyMapper.apply(element),valueMapper.apply(element),mergeFunction);returnnewCollectorImpl<>(mapSupplier,accumulator,mapMerger(mergeFunction),CH_ID);}

@OverridepublicVmerge(Kkey,Vvalue,BiFunction<?super V,?super V,?extends V>remappingFunction){if(value==null)thrownewNullPointerException();if(remappingFunction==null)thrownewNullPointerException();inthash=hash(key);Node<K,V>[]tab;Node<K,V>first;intn,i;intbinCount=0;TreeNode<K,V>t=null;Node<K,V>old=null;if(size>threshold||(tab=table)==null||(n=tab.length)==0)n=(tab=resize()).length;if((first=tab[i=(n-1)&hash])!=null){if(first instanceof TreeNode)old=(t=(TreeNode<K,V>)first).getTreeNode(hash,key);else{Node<K,V>e=first;Kk;do{if(e.hash==hash&&((k=e.key)==key||(key!=null&&key.equals(k)))){old=e;break;}++binCount;}while((e=e.next)!=null);}}if(old!=null){Vv;if(old.value!=null)v=remappingFunction.apply(old.value,value);elsev=value;if(v!=null){old.value=v;afterNodeAccess(old);}elseremoveNode(hash,key,null,false,true);returnv;}if(value!=null){if(t!=null)t.putTreeVal(this,tab,hash,key,value);else{tab[i]=newNode(hash,key,value,first);if(binCount>=TREEIFY_THRESHOLD-1)treeifyBin(tab,hash);}++modCount;++size;afterNodeInsertion(true);}returnvalue;}

從代碼中可以看到，HashMap.merge 會(huì)對(duì)v進(jìn)行判空。

目前我的解決辦法是在流中加上判空過(guò)濾

System.out.println(list.stream().filter(t->t.getName()!=null).collect(Collectors.toMap(TestDO::getId,TestDO::getName,(k1,k2)->k1)));

Duplicate key

查看toMap的API及相關(guān)注釋

/*

* <p>If the mapped keys contains duplicates (according to

? ? * {@link Object#equals(Object)}), an {@code IllegalStateException} is

? ? * thrown when the collection operation is performed.? If the mapped keys

? ? * may have duplicates, use {@link #toMap(Function, Function, BinaryOperator)}

? ? * instead.

*/publicstatic<T,K,U>Collector<T,?,Map<K,U>>toMap(Function<?superT,?extendsK>keyMapper,Function<?superT,?extendsU>valueMapper){returntoMap(keyMapper,valueMapper,throwingMerger(),HashMap::new);}

如果有重復(fù)的key，使用toMap(Function, Function）會(huì)拋異常，可以使用toMap(Function, Function, BinaryOperator)來(lái)解決。

優(yōu)化后的代碼是

publicclassMailTest{publicstaticvoidmain(String[]args){List<TestDO>list=Lists.newArrayList();TestDO t1=newTestDO(1,"a");TestDO t2=newTestDO(1,"b");list.add(t1);list.add(t2);System.out.println(list.stream().collect(Collectors.toMap(TestDO::getId,TestDO::getName,(k1,k2)->k1)));System.out.println(list.stream().collect(Collectors.toMap(TestDO::getId,TestDO::getName,(k1,k2)->k2)));System.out.println(list.stream().collect(Collectors.toMap(TestDO::getId,TestDO::getName,(k1,k2)->k1+k2)));}}

從執(zhí)行結(jié)果來(lái)看，對(duì)于重復(fù)的key,對(duì)他的value可以有三種取值情況：

(k1, k2) -> k1，取第一個(gè)值

(k1, k2) -> k2)，取第二個(gè)值

(k1, k2) -> k1 + k2)，對(duì)兩個(gè)值做某些操作后取結(jié)果。（例如基本類(lèi)型可以進(jìn)行加減乘除）。

作者：snoweek

鏈接：http://www.lxweimin.com/p/6a37e245ff46

來(lái)源：簡(jiǎn)書(shū)

著作權(quán)歸作者所有。商業(yè)轉(zhuǎn)載請(qǐng)聯(lián)系作者獲得授權(quán)，非商業(yè)轉(zhuǎn)載請(qǐng)注明出處。