Displaying 1 to 20 from 21 results

OpenDHT - A C++11 Distributed Hash Table implementation

  •    C++

A lightweight C++11 Distributed Hash Table implementation. OpenDHT provides an easy to use distributed in-memory data store. Every node in the network can read and write values to the store. Values are distributed over the network, with redundancy.

A Concurrent Hashtable

  •    DotNet

A hashtable implementation that allows simultaneous reads and writes from multiple threads. Also offering a concurrent Dictionary and WeakDictionary as hashtable specializations.

Convert Hashtable Rows into DataTable Columns in C#

  •    CSharp

Simplest way to convert a Hashtable into a DataTable with all the Hashtable rows converted into DataTable columns.

L4 - L4 (Lock-Free on Read) Hashtable is a C++ library that implements hash table with arbitray byte stream keys/values

  •    C++

L4 (Lock-Free on Read) Hashtable is a C++ library that provides a fixed-size hashtable, where keys and values are arbitrary bytes.L4 HashTable is optimized for lookup operations. It uses Epoch Queue (deterministic garbage collector) to achieve lock-free lookup operations.

diskhash - Diskbased (persistent) hashtable

  •    C

A simple disk-based hash table (i.e., persistent hash table). It is a hashtable implemented on memory-mapped disk, so that it can be loaded with a single mmap() system call and used in memory directly (being as fast as an in-memory hashtable once it is loaded from disk).

libdict - C library of key-value data structures.

  •    C

All data structures in this library support insert, search, and remove, and have bidirectional iterators. The sorted data structures (everything but hash tables) support near-search operations: searching for the key greater or equal to, strictly greater than, lesser or equal to, or strictly less than, a given key. The tree data structures also support the selecting the nth element, which generally takes linear time, but only takes logarithmic time in path-reduction and weight-balanced trees. The API is designed with efficiency as a primary concern. For example, an insert call returns a boolean indicating whether or not the key was already present in the dictionary (i.e. whether there was an insertion or a collision), and a pointer to the location of the associated data. Thus, an insert-or-update operation can be supported with a single traversal of the data structure. In addition, the code is written to be very efficient, and almost all recursive algorithms have been rewritten to use iteration instead.

data-structures - Go datastructures.

  •    Go

Copyright 2013, Licensed under the GPL version 2. Please reach out to me directly if you require another licensing option. I am willing to work with you. To collect many important data structures for usage in go programs. Golang's standard library lacks many useful and important structures. This library attempts to fill the gap. I have implemented data-structure's as I have needed them. If there is a missing structure or even just a missing (or incorrect) method open an issue, send a pull request, or send an email patch.

js-hashtable - Javascript hashtables. Use *anything* as a key, not just strings.

  •    CoffeeScript

An easy way to use anything you need/want as a key to a hash. The npm module name used to be hashtable, but I renamed it because someone else requested to use it and I haven't updated this project in a couple years.

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.

solidity-utils - solidity utils to make your life easier

  •    Javascript

This library has some basic missing utils in Solidity. mapping + keys iteration. Inspired by Dictionary in python or 'Objectin javascript,Dictionaryis an improved and faster mapping data-structure that allows you to retrieve all the keys in a mapping object while minimizing storage usage. The data-stucture combines linked-list iteration style with soliditymapping` hash-table.

lds - Memory limits in v8 is limited to somewhere around ~1

  •    CoffeeScript

Update: LDS2 written in Typescript with more unit tests and better API is WIP at https://github.com/chethiya/lds2. I use CoffeeScript (Node.js) extensively to analyze large data sets. Time to time I run out of available memory provided by v8 for JS Objects and Arrays.

hashtable - Async hash table server in C

  •    C

Simple async hash table server with text protocol. The project was built for learning purpose only.

map - A type-safe hash map implementation for C

  •    C

A type-safe generic hashmap implementation for C. The map.c and map.h files can be dropped into an existing C project and compiled along with it.

indexmap - A hash table with consistent order and fast iteration; NOTE: old name of crate was ordermap; it was renamed with no change in functionality

  •    Rust

A safe, pure-Rust hash table which preserves insertion order. This crate implements compact map and set data-structures, where the iteration order of the keys is independent from their hash or value. It preserves insertion order (except after removals), and it allows lookup of entries by either hash table key or numerical index.


  •    Jupyter

Benchmarks for comparing hashtable implementations. Note that -c opt is the default.

fortran_hash_table - "<string,string>" hash table in Fortran 2008

  •    Fortran

The module dictionary_m implements a "<string,string>" hash table based on the djb2 hash function. The hash table is based on plain allocatable arrays and the base data is stored in (len=:), allocatable character variables. Buckets are extended arbitrarily by reallocation, thus collisions will slow down this implementation with respect to others using better data structures.

str - A SIMD optimized fixed-length string class along with an adaptive hash table for fast searching

  •    C++

Str is a char array wrapper providing some frequently used operations in the most efficient way(supporting AVX512 SIMD optimization), including string comparisons and conversion to/from integers. StrHash is an adaptive open addressing hash table template taking Str as key and providing a find function in the most efficient way. It's adaptive in that it can extract features from the keys contained in the table and train its hashing parameters dynamically to distribute the keys for avoiding collision.

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.