On Thu, 15 Jul 2021 17:51:58 GMT, Clive Verghese <[email protected]> wrote:
>> Right. But calling `containsKey` and then `get` results in two hash map >> lookups. If we cache the result of `get`, we only need one lookup, which >> should be a tiny bit faster. See https://stackoverflow.com/q/14601016 > > I feel that by checking for null, we can reduce one lookup at the Hashtable. > Will update the pull request. Updated in the new revision. ------------- PR: https://git.openjdk.java.net/jdk/pull/4783
