302 Resources
boyermoore Implementation of Boyer-Moore fast string search algorithm in Go
pipeline This package provides a simplistic implementation of Go pipelines as outlined in Go Concurrency Patterns: Pipelines and cancellation. Docs Go
n-bit engine This repository is a Go software graphics rendering library implementation that is focused on the indexed color and pixel graphics. It us
GOHTML An encoder for a Go struct to HTML Using the "reflect" package and recursion this package is able to convert a complex go struct into HTML Feat
Iter tools for Go(Golang) The stable version has been moved to : https://github.com/serge-hulne/go_iter Defines: Filter Map Reduce Range Take on colle
Set Set is a simple Set data structure implementation in Go (Golang) using LinkedHashMap. This library allow you to get a set of int64 or string witho
goset Set is a useful collection but there is no built-in implementation in Go lang. Why? The only one pkg which provides set operations now is golang
Typ Typ is a library providing a powerful interface to impressive user experience with conversion and fetching data from built-in types in Golang Feat
Learning Golang Language In Clean Structure At this example project, I'm trying to learn Golang with Clean structure and come up with a reusable, nice
Goéland Goéland is an automated theorem prover using the tableau method for firs
About This is a library implementing skip lists for the Go programming language (http://golang.org/). Skip lists are a data structure that can be used
Algorithms In this repository, some algorithms are implemented in go language. GoDoc link: ed maxflow About Max-flow problem: A flow network is repres
1.1 数组/链表 前缀和数组 303 区域和检索 - 数组不可变 304 二维区域和检索 - 矩阵不可变 560 和为 K 的子数组 差分数组 370 区间加法 1109 航班预订统计
Collection Collection library using generics in Go Overview This is a library to provide useful collection data structures and methods for Gophers. Th
big-o-notation-go Examples of algorithms and explanation for each Big O Notation category. Some examples are based in this video. If you didn't manage
go.fifo Description go.fifo provides a simple FIFO thread-safe queue. *fifo.Queue supports pushing an item at the end with Add(), and popping an item
gap Custom generic HTTP handler providing automatic JSON decoding/encoding of HTTP request/response to your concrete types. gap.Wrap allows to use the
Leaked password check With this library you can check the password is probably leaked or not. Pre generated bitset DB includes 6 Million leaked passwo
Defaults Enforce default values on struct fields. type User struct { Name string `default:"Goku"` Power float64 `default:"9000.01"` } var u
refreturn Find functions that return a reference and cause allocations. When a function allocates a value and returns a reference to it, the value has
GoStruct2Table format your struct like a table. Installing $ go get -u -v github.com/runningzyp/GoStruct2Table Simple Example import parser "github.c
Some data structures and algorithms using golang
Queue A Go library for managing queues on top of Redis. It is based on a hiring exercise but later I found it useful for myself in a custom task proce
go-merkle go-merkle implements a simple merkle tree in Golang. It allows to obta
Skipfilter This package provides a data structure that combines a skiplist with a roaring bitmap cache. This library was created to efficiently filter
trie.go Go library for implementations of tries (radix trees), state commitments and proof of inclusion for large data sets. It implements a generic 2
zermelo A radix sorting library for Go. Trade memory for speed! import "github.com/shawnsmithdev/zermelo" func foo(large []uint64) zermelo.Sort(l
Hybro Drink Up Homie! App To Remind Myself To Drink Water. Probably also will ke
fim fim is a collection of some popular frequent itemset mining algorithms implemented in Go. fim contains the implementations of the following algori
distMergeSort An implementation of mergesort distributed across nodes used to sort large sets. Introduction Merge sort partitions sets so that they ca
ZeroToMastery Data Structures & Algorithms course This repo includes all the data structure and algorithm exercises solutions and implementations. Ins
A Go implementation of a bloom filter, with support for boltdb and badgerdb as optional in-memory persistent storage.
Sprout A bloom filter is a probabilistic data structure that is used to determine if an element is present in a set. Bloom filters are fast and space
Data Structures and Algorithms for Interview Preparation in Go Data Structures K
PACKAGE package skiplist import "github.com/glenn-brown/skiplist" Package skiplist implements fast indexable ordered multimaps. This sk
collections Summary Basic data structures represent a great opportunity to learn a new langauge. These are some of the data structures that I have bui
A parser generator where rules defined as go structs and code generation is optional. The concepts are introduced in the simple example below.
Introduction LifeLongLearner project consists of two different parts. My English Vocabulary My Technical Book Notes All of them provided by me within
Overview Archivist generates data structure definitions from JSON files for any kind of programming language. It also provides a library for golang to
Gotri Gotri is an Unicode character based Trie/prefix tree implementation in Go, with the suggestion/auto-complete feature for character searching. Si
bsegtree Segment tree for bytes in Go Based on Thomas Oberndörfer's int range segment tree with fixing/optimization/modification for bytes ranges. For
go-binaryheap A slice backed binary heap where the order can be customized by a comparison function. The main branch now requires go 1.18 because the
PrefixMap PrefixMap is a prefix-enhanced map that eases the retrieval of values based on key prefixes. Quick Start Creating a PrefixMap // creates the
The YYDZ (Yi Yan Ding Zhen / One Eye Ding Zhen) dataset This dataset is only for academic purposes. The majority of them are collected by 山风酱 on Baidu
Graphoscope A solution to access multiple independent data sources from a common UI and show data relations as a graph: Contains a list of by default
Fehrist Fehrist is a pure Go library for indexing different types of documents. Currently it supports only CSV and JSON but flexible architecture give
concwg Description This package provides a version of sync.WaitGroup that allows calling Add and Wait in different goroutines. Motivation sync.WaitGro
Character counter | ▮▮▮▮▮▮▮▮ Simple code just to try out and Binary Tree on Golang. Count characters to train openning a file and reading it, as well
Is this the simplest sorting algorithm
go-stree go-stree is a package for Go that can be used to process a large number of intervals. The main purpose of this module is to solve the followi
A faster method to get elements from an interface (Struct or Slice type) for Go.
Structured Data Templates Structured data templates are a templating engine that takes a simplified set of input parameters and transforms them into a
Vinshop expression tree Exp-tree is go library for parsing expression tree Installation go get -u github.com/vinshop/exp-tree Quick start Format Expre
Go Data Structures Course 👋 Welcome Gophers! This is the official repository that contains all of the data structures we cover in the Go Data Structu