C++ implementation of a fast and memory efficient HAT-trie
Repository Index
47,133 repositories indexed
49–72 of 92 · Most stars
C++ implementation of a fast hash map and hash set using hopscotch hashing
Algorithm is a library of tools that is used to create intelligent applications.
Throw in the towel.
Algorithms resolution in Javascript. Leetcode - Geeksforgeeks - Careercup
Graph algorithms and data structures
🤠 Object property paths with wildcards and regexps 🌵
C++ hash map and hash set which preserve the order of insertion
Data Structures and Algorithms in Java (useful in interview process)
Functional programming, immutable collections and FP constructs for typescript and javascript
A Haxe library containing data structures for games.
A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
High-performance immutable data structures for modern JavaScript and TypeScript applications. Functional interfaces, deep/composite operations API, mixed mutability API, TypeScript definitions, ES2015 module exports.
No description provided by the repository host.
Thread-safe, persistent, immutable collections for the Crystal language
LibraDB is a simple, persistent key/value store written in pure Go in less than 1000 lines for learning purposes.
An extended core library for F#.
Erlang Priority Queues
Bitset data structure
Generic graph data structures and algorithms for Go (Golang): dependency graphs (DAGs) with cycle checks and topological sort, BFS and DFS traversal, Dijkstra and other shortest paths, connectivity and partitioning. No dependencies.
Erlang Trie Implementation
pure functional and generic programming for Erlang
A fast and flexible c++ template class for tree data structures
🎀 Just the cutest and tiniest queue/deque implementation!