Filter By
302 Resources
Golang Data Structures
GoDS (Go Data Structures). Containers (Sets, Lists, Stacks, Maps, Trees), Sets (HashSet, TreeSet, LinkedHashSet), Lists (ArrayList, SinglyLinkedList, DoublyLinkedList), Stacks (LinkedListStack, ArrayStack), Maps (HashMap, TreeMap, HashBidiMap, TreeBidiMap, LinkedHashMap), Trees (RedBlackTree, AVLTree, BTree, BinaryHeap), Comparators, Iterators, Enumerables, Sort, JSON
GoDS (Go Data Structures) Implementation of various data structures and algorithms in Go. Data Structures Containers Lists ArrayList SinglyLinkedList
Golang library for reading and writing Microsoft Excel™ (XLSX) files.
Excelize Introduction Excelize is a library written in pure Go providing a set of functions that allow you to write to and read from XLSX / XLSM / XLT
Concurrent data structures for Go
xsync Concurrent data structures for Go. An extension for the standard sync package. This library should be considered experimental, so make sure to r
Roaring bitmaps in Go (golang)
roaring This is a go version of the Roaring bitmap data structure. Roaring bitmaps are used by several major systems such as Apache Lucene and derivat
A simple set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
golang-set The missing set collection for the Go language. Until Go has sets built-in...use this. Coming from Python one of the things I miss is the s
An interesting go struct tag expression syntax for field validation, etc.
An interesting go struct tag expression syntax for field validation, etc.
An in-memory string-interface{} map with various expiration options for golang
TTLCache - an in-memory cache with expiration TTLCache is a simple key/value cache in golang with the following functions: Expiration of items based o
A fast (5x) string keyed read-only map for Go - particularly good for keys using a small set of nearby runes.
faststringmap faststringmap is a fast read-only string keyed map for Go (golang). For our use case it is approximately 5 times faster than using Go's
skipmap is a high-performance concurrent sorted map based on skip list. Up to 3x ~ 10x faster than sync.Map in the typical pattern.
Introduction skipmap is a high-performance concurrent map based on skip list. In typical pattern(one million operations, 90%LOAD 9%STORE 1%DELETE), th
A go implementation of Verkle trees
go-verkle A very experimental implementation of Verkle trees. When production-ready, the code is to be split between go-kzg and go-ethereum. Notes Nod
Gota: DataFrames and data wrangling in Go (Golang)
Gota: DataFrames, Series and Data Wrangling for Go This is an implementation of DataFrames, Series and data wrangling methods for the Go programming l
Type-safe, zero-allocation sets for Go
Set Package set is a type-safe, zero-allocation port of the excellent package fatih/set. It contains sets for most of the basic types and you can gene
慕课 liuyubobobo「玩转数据结构」课程的 Go 语言实现版本
Play-with-Data-Structures 简介 本仓库基于 go 语言实现常用的数据结构。 感谢 liuyubobobo 老师在慕课网上推出的实战课程《玩儿转数据结构》，Java 版本的 Github 仓库地址请访问: https://github.com/liuyubobobo/Play
Go Solution for LeetCode algorithms problems, 100% coverage.
LeetCode 的 Go 解答 进度 统计规则：1.免费题，2.算法题，3.能提交 Go 解答 Easy Medium Hard Total Accepted 265 456 187 908 Total 267 472 197 936 题解 题号 题目 通过率 难度 收藏 1250 * Check
Go (golang) library for reading and writing XLSX files.
XLSX Introduction xlsx is a library to simplify reading and writing the XML format used by recent version of Microsoft Excel in Go programs. Tutorial
A Merkle Tree implementation written in Go.
Merkle Tree in Golang An implementation of a Merkle Tree written in Go. A Merkle Tree is a hash tree that provides an efficient way to verify the cont
A feature complete and high performance multi-group Raft library in Go.
Dragonboat - A Multi-Group Raft library in Go / 中文版 News 2021-01-20 Dragonboat v3.3 has been released, please check CHANGELOG for all changes. 2020-03
succinct provides several static succinct data types
succinct provides several static succinct data types Succinct Set Synopsis Performance Implementation License Succinct Set
Converts PDF, DOC, DOCX, XML, HTML, RTF, etc to plain text
docconv A Go wrapper library to convert PDF, DOC, DOCX, XML, HTML, RTF, ODT, Pages documents and images (see optional dependencies below) to plain tex
Cuckoo Filter: Practically Better Than Bloom
Cuckoo Filter Cuckoo filter is a Bloom filter replacement for approximated set-membership queries. While Bloom filters are well-known space-efficient
Go implementation of Count-Min-Log
Count-Min-Log Count-Min-Log sketch: Approximately counting with approximate counters - Guillaume Pitel & Geoffroy Fouquier TL;DR: Count-Min-Log Sketch
Mapreduce - A in-process MapReduce tool to help you to optimize service response time.
mapreduce English | 简体中文 Why we have this repo? mapreduce is part of go-zero, but a few people asked if mapreduce can be used separately. But I recomm
Simple dense bitmap index in Go with binary operators
This package contains a bitmap index which is backed by uint64 slice, easily encodable to/from a []byte without copying memory around so it can be present in both disk and memory. As opposed to something as roaring bitmaps, this is a simple implementation designed to be used for small to medium dense collections.
indexing library for Go
Bluge modern text indexing in go - blugelabs.com Features Supported field types: Text, Numeric, Date, Geo Point Supported query types: Term, Phrase, M
an R-Tree library for Go
rtreego A library for efficiently storing and querying spatial data in the Go programming language. About The R-tree is a popular data structure for e
DataFrames for Go: For statistics, machine-learning, and data manipulation/exploration
Dataframes are used for statistics, machine-learning, and data manipulation/exploration. You can think of a Dataframe as an excel spreadsheet. This pa
Fast golang queue using ring-buffer
Queue A fast Golang queue using a ring-buffer, based on the version suggested by Dariusz Górecki. Using this instead of other, simpler, queue implemen
Graph algorithms and data structures
Your basic graph Golang library of basic graph algorithms Topological ordering, image by David Eppstein, CC0 1.0. This library offers efficient and we
Data Structures and Algorithms implementation in Go
Data Structures and Algorithms Clean and simple implementation in Go Implementation There are several data structures and algorithms implemented in th
Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).
Slim - surprisingly space efficient data types in Golang Slim is collection of surprisingly space efficient data types, with corresponding serializati
Go iter tools (for iterating , mapping, filtering, reducing streams -represented as channels-)
Go iter tools (for iterating , mapping, filtering, reducing streams -represented as channels-)
Dasel - Select, put and delete data from JSON, TOML, YAML, XML and CSV files with a single tool.
Select, put and delete data from JSON, TOML, YAML, XML and CSV files with a single tool. Supports conversion between formats and can be used as a Go package.
☔️ A complete Go cache library that brings you multiple ways of managing your caches
Gocache Guess what is Gocache? a Go cache library. This is an extendable cache library that brings you a lot of features for caching data. Overview He
Go package implementing bitsets
bitset Go language library to map between non-negative integers and boolean values Description Package bitset implements bitsets, a mapping between no
PartyGateRDF - PartyGate tools for linked-data scientists
PartyGateRDF - PartyGate tools for linked-data scientists Introduction This is a data set containing references to information published by the media
101+ coding interview problems in Go
116+ Coding Interview Problems with Detailed Solutions The Ultimate Go Study Guide eBook version → Join my mailing list to get the latest updates here
Go concurrent-safe, goroutine-safe, thread-safe queue
goconcurrentqueue - Concurrent safe queues The package goconcurrentqueue offers a public interface Queue with methods for a queue. It comes with multi
flexible data type for Go
Generic flexible data type for Go support: Go 1.12+ Install standard go get: go get -u github.com/usk81/generic/v2 Usage encode/decode: package main
HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction)
An improved version of HyperLogLog for the count-distinct problem, approximating the number of distinct elements in a multiset using 33-50% less space
B-tree implementation for Go
btree btree is a Go implementation of a B-Tree. This project is intended for learning purposes so the code is relatively small (500LOC) and highly do
Go library implementing xor filters
xorfilter: Go library implementing xor filters Bloom filters are used to quickly check whether an element is part of a set. Xor filters are a faster a
Adaptive Radix Trees implemented in Go
An Adaptive Radix Tree Implementation in Go This library provides a Go implementation of the Adaptive Radix Tree (ART). Features: Lookup performance s
parse and generate XML easily in go
etree The etree package is a lightweight, pure go package that expresses XML in the form of an element tree. Its design was inspired by the Python Ele
Golang implementation of Radix trees
go-radix Provides the radix package that implements a radix tree. The package only provides a single Tree implementation, optimized for sparse nodes.
A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist
Fast Skiplist Implementation This Go-library implements a very fast and efficient Skiplist that can be used as direct substitute for a balanced tree o
Go package implementing Bloom filters
Bloom filters A Bloom filter is a representation of a set of n items, where the main requirement is to make membership queries; i.e., whether an item
Cross-platform beanstalkd queue server admin console.
Overview aurora is a web-based Beanstalkd queue server console written in Go and works on macOS, Linux, and Windows machines. The main idea behind usi
A Golang lock-free thread-safe HashMap optimized for fastest read access.
hashmap Overview A Golang lock-free thread-safe HashMap optimized for fastest read access. Usage Set a value for a key in the map: m := &HashMap{} m.S
Probabilistic data structures for processing continuous, unbounded streams.
Boom Filters Boom Filters are probabilistic data structures for processing continuous, unbounded streams. This includes Stable Bloom Filters, Scalable
Go datastructures.
Go Data Structures by Tim Henderson ([email protected]) Copyright 2013, Licensed under the GPL version 2. Please reach out to me directly if you requ
BTree provides a simple, ordered, in-memory data structure for Go programs.
BTree implementation for Go This package provides an in-memory B-Tree implementation for Go, useful as an ordered, mutable data structure. The API is
Golang LRU cache
golang-lru This provides the lru package which implements a fixed-size thread safe LRU cache. It is based on the cache in Groupcache. Documentation Fu
Most comprehensive list :clipboard: of tech interview questions :blue_book: of companies scraped from Geeksforgeeks, CareerCup and Glassdoor.
Companies* Companies E Expedia G Grab M MobiKwik N NEC Technologies P PayPal S Samsung Research Institute U Uber Y Yatra.com Z Zomato Announcements 👐