f039becb97
- ArrayList contains() + add() is faster than HashSet add() for small collections - A heap allocation of the iterator is required when iterating HashSet while iterating ArrayList can do with a stack allocation Signed-off-by: Ludovic Orban <lorban@bitronix.be> |
||
---|---|---|
.. | ||
http2-alpn-tests | ||
http2-client | ||
http2-common | ||
http2-hpack | ||
http2-http-client-transport | ||
http2-server | ||
pom.xml |