Data

Tools

Indexes

Applications

Experiments

Repos

An open API service providing repository metadata for many open source software ecosystems.

GitHub topics: hamt

persidastricl/persidastricl

persistent data structures in common lisp "pers-i-DAH-strick-el"

Language: Common Lisp - Size: 353 KB - Last synced at: 7 days ago - Pushed at: 7 days ago - Stars: 4 - Forks: 0

liyue201/gostl

Data structure and algorithm library for go, designed to provide functions similar to C++ STL

Language: Go - Size: 368 KB - Last synced at: 16 days ago - Pushed at: 4 months ago - Stars: 1,082 - Forks: 112

arximboldi/immer

Postmodern immutable and persistent data structures for C++ — value semantics at scale

Language: C++ - Size: 2.86 MB - Last synced at: 16 days ago - Pushed at: 7 months ago - Stars: 2,545 - Forks: 185

MagicStack/immutables

A high-performance immutable mapping type for Python.

Language: C - Size: 354 KB - Last synced at: 7 days ago - Pushed at: 7 months ago - Stars: 1,145 - Forks: 56

raviqqe/hamt

Immutable and Memory-Efficient Maps and Sets in Go

Language: Go - Size: 133 KB - Last synced at: 18 days ago - Pushed at: about 1 month ago - Stars: 240 - Forks: 13

wdamron/amt

Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)

Language: Go - Size: 38.1 KB - Last synced at: 21 days ago - Pushed at: almost 3 years ago - Stars: 67 - Forks: 4

homonoidian/permafrost

Permafrost implements a (relatively) fast unordered persistent map, set, bidirectional map for Crystal

Language: Crystal - Size: 1.34 MB - Last synced at: 27 days ago - Pushed at: 3 months ago - Stars: 0 - Forks: 0

paoda/hamt

Hash Array Mapped Trie as defined in Phil Bagwell (2001). Ideal Hash Tries

Language: Zig - Size: 26.4 KB - Last synced at: about 9 hours ago - Pushed at: 7 months ago - Stars: 7 - Forks: 0

benibela/hamt

Mutable and immutable persistent maps and sets as hash array mapped trie (HAMT) for FreePascal

Language: Pascal - Size: 110 KB - Last synced at: about 2 months ago - Pushed at: about 5 years ago - Stars: 17 - Forks: 5

fsprojects/fsharp-hashcollections

Library providing fast hash based immutable map and set

Language: F# - Size: 132 KB - Last synced at: 9 months ago - Pushed at: about 1 year ago - Stars: 59 - Forks: 3

palatable/shoki

Purely functional data structures in Java

Language: Java - Size: 642 KB - Last synced at: about 1 year ago - Pushed at: almost 4 years ago - Stars: 37 - Forks: 11

TylorS/typed-hashmap 📦

Persistent HashMap for TypeScript

Language: TypeScript - Size: 101 KB - Last synced at: 11 days ago - Pushed at: over 6 years ago - Stars: 43 - Forks: 6

raviqqe/hamt-rs

HAMT implementation whose sub-trees can be shared over threads

Language: Rust - Size: 115 KB - Last synced at: 11 days ago - Pushed at: over 1 year ago - Stars: 10 - Forks: 1

fp4php/data-structures

PHP immutable persistent data structures library

Language: PHP - Size: 37.1 KB - Last synced at: almost 2 years ago - Pushed at: almost 2 years ago - Stars: 0 - Forks: 0

reactivego/immutable

Immutable Persistent Map for Go

Language: Go - Size: 107 KB - Last synced at: 10 months ago - Pushed at: almost 2 years ago - Stars: 1 - Forks: 1

js-choi/proposal-popcount

Draft specification for bit popcount in JavaScript.

Language: HTML - Size: 85.9 KB - Last synced at: about 1 month ago - Pushed at: almost 3 years ago - Stars: 3 - Forks: 0

mootable/hashmap

Providing fast at scale HashMap, LinkedHashMap, and Higher Order Functions to any iterable, such as Array, Map or Set. Tested, and Benchmarked, Issues & PRs welcomed.

Language: JavaScript - Size: 8.06 MB - Last synced at: 8 days ago - Pushed at: almost 4 years ago - Stars: 6 - Forks: 0

eonil/swift-hamt

An implementation of HAMT data-structure in Swift

Language: Swift - Size: 3.61 MB - Last synced at: about 2 years ago - Pushed at: over 5 years ago - Stars: 47 - Forks: 2

eifil/amt-ipld

Array Mapped Trie (Persistent Vector) implementation using IPLD.

Language: TypeScript - Size: 1.05 MB - Last synced at: 3 days ago - Pushed at: about 4 years ago - Stars: 0 - Forks: 1

blitzcode/lru-bounded-map

Haskell implementations of associative containers (maps / dictionaries) which retire elements in least recently used (LRU) order when growing past a specified limit

Language: HTML - Size: 475 KB - Last synced at: about 2 years ago - Pushed at: over 9 years ago - Stars: 3 - Forks: 2

Related Keywords
hamt 20 immutable 10 hashmap 7 map 6 persistent-data-structure 5 immutable-datastructures 4 persistent 4 go 3 immutable-collections 3 data-structures 3 hash-array-mapped-trie 3 hashset 3 set 3 trie 3 queue 2 multiset 2 stack 2 functional 2 iterator 1 succinct-data-structure 1 typescript 1 arc 1 popcount 1 popcnt 1 math 1 rust 1 send 1 sync 1 binary 1 javascript 1 hamming-code 1 bitwise 1 lru 1 haskell 1 hash 1 caching 1 ipld 1 dag 1 cbor 1 array 1 amt 1 swift-library 1 swift 1 associative-array 1 reduce 1 native-js-map 1 linkedhashmap 1 higher-order-functions 1 hashing 1 filter 1 defered-execution 1 concat 1 tc39 1 curry 1 value-semantics 1 rrb-tree 1 postmodernism 1 modern-cpp 1 cpp14 1 vector 1 stl 1 sort 1 skiplist 1 rbtree 1 list 1 ketama 1 deque 1 bloomfilterr 1 bitmap 1 lazy 1 common-lisp 1 purelyfunctionaldatastructures 1 purely-functional-data-structures 1 okasaki 1 java 1 fsharp 1 collections 1 hat-trie 1 zig-package 1 zig-library 1 crystal 1 unsafe 1 hash-set 1 hash-map 1 functional-programming 1 python3 1 python 1 frozen 1