Displaying 1 to 20 from 28 results

Koloboke - Java Collections till the last breadcrumb of memory and performance

  •    Java

Koloboke aims to replace the standard Java collections and streams with more efficient implementations. The current version of Koloboke focuses on replacing java.util.HashSet and java.util.HashMap. It provides a complete set of primitive type implementations for each collection. Its able to avoid the expensive boxing/unboxing of primitives and saves memory for boxed primitive objects. It is the fastest and the most memory efficient library implementing hash maps and sets.

Koloboke - Java Collections till the last breadcrumb of memory and performance

  •    Java

A family of projects around collections in Java (so far). A carefully designed extension of the Java Collections Framework with primitive specializations and more. Java 6+. Apache 2.0 license.




sparsepp - A fast, memory efficient hash map for C++

  •    C++

We believe Sparsepp provides an unparalleled combination of performance and memory usage, and will outperform your compiler's unordered_map on both counts. Only Google's dense_hash_map is consistently faster, at the cost of much greater memory usage (especially when the final size of the map is not known in advance, and insertions cause a resizing). This hash map. like Google's dense_hash_map, uses open addressing (meaning that the hash table entries are conceptually stored in a big array, and collisions are not resolved using a linked list, but by probing). A big drawback of open addressing is that when the array needs to be resized larger, the high mark for memory usage is typically 3 times the current map size (as we allocate a new array twice as big as the current one, and copy from the old array to the new one). Sparsepp's implementation resolves this memory usage issue, and the memory usage high mark shows only a small bump when resizing.

gs-collections - A supplement or replacement for the Java Collections Framework

  •    Java

GS Collections is a collections framework for Java. It has JDK-compatible List, Set and Map implementations with a rich API and set of utility classes that work with any JDK compatible Collections, Arrays, Maps or Strings. The iteration protocol was inspired by the Smalltalk collection framework. It provides replacements for ArrayList, HashSet, and HashMap optimized for performance and memory usage.

hashmap - A Golang lock-free thread-safe HashMap optimized for fastest read access.

  •    Go

A Golang lock-free thread-safe HashMap optimized for fastest read access. The benchmarks were run with Golang 1.10.1 on MacOS.

Redisson - Redis based In-Memory Data Grid for Java

  •    Java

Redisson - distributed Java objects and services (Set, Multimap, SortedSet, Map, List, Queue, BlockingQueue, Deque, BlockingDeque, Semaphore, Lock, AtomicLong, Map Reduce, Publish / Subscribe, Bloom filter, Spring Cache, Executor service, Tomcat Session Manager, Scheduler service, JCache API) on top of Redis server. Rich Redis client.


HPPC - High Performance Primitive Collections for Java

  •    Java

HPPC provides template-generated implementations of typical collections, such as lists, sets and maps, for all Java primitive types. The primary driving force behind HPPC is optimization for highest performance and memory efficiency.

scalacache - Simple caching in Scala

  •    Scala

A facade for the most popular cache implementations, with a simple, idiomatic Scala API.Use ScalaCache to add caching to any Scala app with the minimum of fuss.

scaffeine - Thin Scala wrapper for Caffeine

  •    Scala

Caffeine is an awesome Java caching library. It has an impressive performance and a neat Java 8 API. However the API does not play very well with Scala. So this is the thinner wrapper we can came with to make Caffeine easy and idiomatic to use in Scala.

capsule - The Capsule Hash Trie Collections Library

  •    Java

More extensive tests and performance benchmarks will be added soon. The preliminary API for the immutable interfaces will be reworked as soon as possible as well. Snippets for other build tools and dependency management systems may vary slightly.

SmoothieMap - A gulp of low latency Java

  •    Java

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.

stringmap - Fast and robust stringmap for JavaScript

  •    Javascript

A fast and robust stringmap implementation that can hold any string keys, including __proto__, with minimal overhead compared to a plain object. Works in node and browsers.The API is created to be as close to the ES6 Map API as possible. Prefer sm.remove("key") for deleting a key. ES6 Map uses map.delete("key") instead and for that reason sm['delete']("key") is available as a stringmap alias as well. Never do sm.delete("key") unless you're certain to be in the land of ES5 or later.

rust-evmap - A lock-free, eventually consistent, concurrent multi-value map.

  •    Rust

A lock-free, eventually consistent, concurrent multi-value map. This map implementation allows reads and writes to execute entirely in parallel, with no implicit synchronization overhead. Reads never take locks on their critical path, and neither do writes assuming there is a single writer (multi-writer is possible using a Mutex), which significantly improves performance under contention.

node-hashtable - Native hashtable interface for when V8 objects can't take the heat

  •    C++

Sometimes you need to store so much data in memory that V8 can get a bit clogged up. This Node.js module provides an interface to a native hashmap data structure that exists outside of V8's memory constraints. V8 is great, but was never really meant for driving large software systems. Try adding a few million non-integer keys to an object and you'll start to see things bog down. This module is not intended to be a general replacement for javascript objects (that would be silly). Instead, it is meant to be used when you need maps larger than V8's virtual machine can handle.

HashMap - An open addressing linear probing hash table, tuned for delete heavy workloads

  •    C++

A hash table mostly compatible with the C++11 std::unordered_map interface, but with much higher performance for many workloads. This hash table uses open addressing with linear probing and backshift deletion. Open addressing and linear probing minimizes memory allocations and achives high cache effiency. Backshift deletion keeps performance high for delete heavy workloads by not clobbering the hash table with tombestones.

ok-lib - Generic vector, hash map, and concurrent queue for C

  •    C

Generic vector, hash map, and concurrent queue for C. The ok_vec is implemented as a structure containing an array that is reallocated as needed.





We have large collection of open source products. Follow the tags from Tag Cloud >>


Open source products are scattered around the web. Please provide information about the open source projects you own / you use. Add Projects.