Skip to content

Latest commit

 

History

History
474 lines (405 loc) · 21.9 KB

data-structures.md

File metadata and controls

474 lines (405 loc) · 21.9 KB

Bookmarks tagged [data-structures]

https://dev.to/iuliagroza/complete-introduction-to-the-30-most-essential-data-structures-algorithms-...

Data Structures & Algorithms (DSA) is often considered to be an intimidating topic - a common mis... Tagged with computerscience, cpp, python, productivity.


https://github.com/bluss/rust-itertools


https://github.com/contain-rs

Extension of Rust's std::collections


https://github.com/danielpclark/array_tool

Array helpers for Rust. Some of the most common methods you would use on Arrays made available on Vectors. Polymorphic implementations for handling most of your use cases. [<img src="https://api.travi...


https://github.com/fizyk20/generic-array

Generic array types in Rust. Contribute to fizyk20/generic-array development by creating an account on GitHub.


https://github.com/Nemo157/roaring-rs

Roaring bitmap implementation for Rust. Contribute to Nemo157/roaring-rs development by creating an account on GitHub.


https://github.com/pop-os/progress-streams

Progress callbacks for types which implement dyn io::Read or dyn io::Write.


https://github.com/shady831213/algorithms

Algorithms and data structures.CLRS study.


https://github.com/zhuangsirui/binpacker

Binary packer and unpacker helps user build custom binary stream.


https://github.com/yourbasic/bit

Golang set data structure with bonus bit-twiddling functions.


https://github.com/willf/bitset

Go package implementing bitsets.


https://github.com/zhenjl/bloom

Bloom filters implemented in Go.


https://github.com/yourbasic/bloom

Golang Bloom filter implementation.


https://github.com/tylertreat/BoomFilters

Probabilistic data structures for processing continuous, unbounded streams.


https://github.com/free/concurrent-writer

Highly concurrent drop-in replacement for bufio.Writer.


https://github.com/InVisionApp/conjungo

A small, powerful and flexible merge library.


https://github.com/seiflotfy/count-min-log

Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory).


https://github.com/superwhiskers/crunch

Go package implementing buffers for handling various datatypes easily.


https://github.com/seiflotfy/cuckoofilter

Cuckoo filter: a good alternative to a counting bloom filter implemented in Go.


https://github.com/edwingeng/deque

A highly optimized double-ended queue.


https://github.com/gammazero/deque

Fast ring-buffer deque (double-ended queue).


https://github.com/srfrog/dict

Python-like dictionaries (dict) for Go.


https://github.com/zhenjl/encoding

Integer Compression Libraries for Go.


https://github.com/plar/go-adaptive-radix-tree

Go implementation of Adaptive Radix Tree.


https://github.com/Workiva/go-datastructures

Collection of useful, performant, and thread-safe data structures.


https://github.com/amallia/go-ef

A Go implementation of the Elias-Fano encoding.


https://github.com/hailocab/go-geoindex

In-memory geo index.


https://github.com/OrlovEvgeny/go-mcache

Fast in-memory key:value store/cache library. Pointer caches.


https://github.com/aurelien-rainone/go-rquad

Region quadtrees with efficient point location and neighbour finding.


https://github.com/enriquebris/goconcurrentqueue

Concurrent FIFO queue.


https://github.com/emirpasic/gods

Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.


https://github.com/deckarep/golang-set

Thread-Safe and Non-Thread-Safe high-performance sets for Go.


https://github.com/zoumo/goset

A useful Set collection implementation for Go.


https://github.com/ryszard/goskiplist

Skip list implementation in Go.


https://github.com/kniren/gota

Implementation of dataframes, series, and data wrangling methods for Go.


https://github.com/emvi/hide

ID type with marshalling to/from hash to prevent sending IDs to clients.


https://github.com/google/hilbert

Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.


https://github.com/axiomhq/hyperloglog

HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction.


https://github.com/agext/levenshtein

Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.


https://github.com/agnivade/levenshtein

Implementation to calculate levenshtein distance in Go.


https://github.com/smartystreets/mafsa

MA-FSA implementation with Minimal Perfect Hashing.


https://github.com/cbergoon/merkletree

Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures.


https://github.com/BlackRabbitt/mspm

Multi-String Pattern Matching Algorithm for information retrieval.


https://github.com/emvi/null

Nullable Go types that can be marshalled/unmarshalled to/from JSON.


https://github.com/MonaxGT/parsefields

Tools for parse JSON-like logs for collecting unique fields and events.


https://github.com/hyfather/pipeline

An implementation of pipelines with fan-in and fan-out.


https://github.com/TheTannerRyan/ring

Go implementation of a high performance, thread safe bloom filter.


https://github.com/RoaringBitmap/roaring

Go package implementing compressed bitsets.


https://github.com/StudioSol/set

Simple set data structure implementation in Go using LinkedHashMap.


https://github.com/MauriceGit/skiplist

Very fast Go Skiplist implementation.


https://github.com/gansidui/skiplist

Skiplist implementation in Go.


https://github.com/zekroTJA/timedmap

Map with expiring key-value pairs.


https://github.com/perdata/treap

Persistent, fast ordered map using tree heaps.


https://github.com/derekparker/trie

Trie implementation in Go.


https://github.com/diegobernardes/ttlcache

In-memory LRU string-interface{} map with expiration for golang.


https://github.com/gurukami/typ

Null Types, Safe primitive type conversion and fetching value from complex structures.


https://github.com/willf/bloom

Go package implementing Bloom filters.


https://avro.apache.org

Data interchange format with dynamic typing, untagged data, and absence of manually assigned IDs.


https://orc.apache.org

Fast and efficient columnar storage format for Hadoop-based workloads.


https://parquet.apache.org

Columnar storage format based on assembly algorithms from Google's paper on Dremel.


https://thrift.apache.org

Data interchange format that originated at Facebook.


https://github.com/bulldog2011/bigqueue

A big, fast and persistent queue based on memory-mapped files.


https://github.com/LiveRamp/HyperMinHash-java

Probabilistic data structure for computing union, intersection, and set cardinality in loglog space.


https://pcollections.org

Persistent and immutable analogue of the Java Collections Framework.


https://github.com/google/protobuf

Google's data interchange format.


https://github.com/real-logic/simple-binary-encoding

Simple Binary Encoding, one of the fastest message formats around.


https://github.com/square/tape

A lightning-fast, transactional, file-based FIFO.


https://github.com/square/wire

Clean, lightweight protocol buffers.