SmoothieMap
Map
An implementation of an efficient and low-latency map data structure
A gulp of low latency Java
296 stars
20 watching
30 forks
Language: Java
last commit: over 6 years agoLinked from 1 awesome list
collectionshashmapjavajava-collectionslow-latencyopenhft
deephacks/awesome-jvmRelated projects:
| Repository | Description | Stars |
|---|---|---|
 zekrotja/timedmap | A package implementing a thread-safe map with expiring key-value pairs | 72 |
 malabarba/lazy-map-clojure | Creates maps with values computed on demand from data or Java objects | 49 |
 simplegeo/polymaps | A JavaScript library for creating dynamic and interactive maps in modern web browsers. | 1,602 |
 flesler/hashmap | A JavaScript class implementation of a key-value map data structure | 382 |
 greg7mdp/sparsepp | A high-performance hash map implementation for C++ with low memory usage and efficient resizing | 1,257 |
 fw42/honeymap | Visualizes real-time GPS event streams on an interactive world map | 219 |
 z3tt/30daymapchallenge2019 | A collection of spatial visualizations and maps created using various tools and techniques. | 200 |
 packet-clearing-house/maptable | An interactive visualization library for converting any dataset into a customizable map, table, and filter components. | 58 |
 sharpmap/sharpmap | A mapping library for creating interactive maps with geospatial data in web and desktop applications. | 837 |
 r-tmap/tmaptools | Provides tools for creating and processing thematic maps | 42 |
 ploomber/dash-react-simple-maps | A React-based mapping library for creating interactive maps with custom styling and annotations | 7 |
 preshing/compareintegermaps | Generates benchmark data and graphs for two different associative map implementations | 112 |
 rstudio/leaflet | An R interface to a popular JavaScript library for creating interactive maps. | 812 |
 goossaert/hashmap | An implementation of hash table algorithms for efficient data storage and retrieval | 254 |
 mljs/som | An implementation of a self-organizing map algorithm for mapping high-dimensional data to lower-dimensional spaces. | 23 |