Download all versions of smoothie-map JAR files with all dependencies
smoothie-map from group net.openhft (version 1.3)
SmoothieMap is a java.util.Map implementation with worst put(k, v) operation
latencies more than 100 times smaller than in ordinary hash table implementations like
java.util.HashMap.
Artifact smoothie-map
Group net.openhft
Version 1.3
Last update 31. March 2016
Tags: ordinary with hash worst implementations table like smaller operation latencies more times implementation than java smoothiemap hashmap util
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies asm,
There are maybe transitive dependencies!
Group net.openhft
Version 1.3
Last update 31. March 2016
Tags: ordinary with hash worst implementations table like smaller operation latencies more times implementation than java smoothiemap hashmap util
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies asm,
There are maybe transitive dependencies!
smoothie-map from group net.openhft (version 1.2)
SmoothieMap is a java.util.Map implementation with worst put(k, v) operation
latencies more than 100 times smaller than in ordinary hash table implementations like
java.util.HashMap.
Artifact smoothie-map
Group net.openhft
Version 1.2
Last update 30. March 2016
Tags: ordinary with hash worst implementations table like smaller operation latencies more times implementation than java smoothiemap hashmap util
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies asm,
There are maybe transitive dependencies!
Group net.openhft
Version 1.2
Last update 30. March 2016
Tags: ordinary with hash worst implementations table like smaller operation latencies more times implementation than java smoothiemap hashmap util
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies asm,
There are maybe transitive dependencies!
smoothie-map from group net.openhft (version 1.1)
SmoothieMap is a java.util.Map implementation with worst put(k, v) operation
latencies more than 100 times smaller than in ordinary hash table implementations like
java.util.HashMap.
Artifact smoothie-map
Group net.openhft
Version 1.1
Last update 02. December 2015
Tags: ordinary with hash worst implementations table like smaller operation latencies more times implementation than java smoothiemap hashmap util
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies asm,
There are maybe transitive dependencies!
Group net.openhft
Version 1.1
Last update 02. December 2015
Tags: ordinary with hash worst implementations table like smaller operation latencies more times implementation than java smoothiemap hashmap util
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies asm,
There are maybe transitive dependencies!
smoothie-map from group net.openhft (version 1.0)
SmoothieMap is a java.util.Map implementation with worst put(k, v) operation
latencies more than 100 times smaller than in ordinary hash table implementations like
java.util.HashMap.
Artifact smoothie-map
Group net.openhft
Version 1.0
Last update 04. September 2015
Tags: ordinary with hash worst implementations table like smaller operation latencies more times implementation than java smoothiemap hashmap util
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies asm,
There are maybe transitive dependencies!
Group net.openhft
Version 1.0
Last update 04. September 2015
Tags: ordinary with hash worst implementations table like smaller operation latencies more times implementation than java smoothiemap hashmap util
Organization not specified
URL Not specified
License not specified
Dependencies amount 1
Dependencies asm,
There are maybe transitive dependencies!
Page 1 from 1 (items total 4)