gods
levenshtein
Our great sponsors
| gods | levenshtein | |
|---|---|---|
| 9 | 2 | |
| 15,418 | 319 | |
| - | - | |
| 3.1 | 0.0 | |
| 14 days ago | about 1 year ago | |
| Go | Go | |
| GNU General Public License v3.0 or later | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
gods
-
How do you go about the lack of built in data structure like stack, queue for LeetCode
for len(stack) > 0 { n := len(stack) - 1 // Top element fmt.Print(stack[n]) stack = stack[:n] // Pop } ``` Another solution would be to import a package like https://github.com/emirpasic/gods
-
Go Structures - Custom made generic data structures for Golang
What is the goal of this project? A learning exercise? There are many fairly matured solutions already available like https://github.com/emirpasic/gods. It also does not look implemented effectively. For example Stack uses for its push/pop operations costly List methods.
- Golang & Data Structures
-
Hash Array Mapped Trie (HAMT) implemented in Go (1.18+ generics)
Doesn't say why it's here instead of trying to get into GoDS or something else.
-
Are there implementations of data structures with generics? Are they needed?
I've found GoDS (https://github.com/emirpasic/gods) but it is not using generics, it's using "interface{}" as a type for everything.
- Gods Go Data Structures
- Experimental generic implementations of various data structures (map, b-tree, AVL tree, rope, and more)
-
Have you used a trie in Go?
You may want to try this implementation
levenshtein
- Levenshtein Distance
-
find the difference between two strings ?
Wow, the original post has been deleted but replying still as somebody might hear about Levenshtein distance for the first time. https://github.com/agnivade/levenshtein
What are some alternatives?
go-datastructures - A collection of useful, performant, and threadsafe Go datastructures.
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
golang-set - A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
bitset - Go package implementing bitsets
gomarkdoc - Generate markdown documentation for Go (golang) code
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
gota - Gota: DataFrames and data wrangling in Go (Golang)
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
encoding - Integer Compression Libraries for Go
bloom - Bloom filters implemented in Go.
go-geoindex - Go native library for fast point tracking and K-Nearest queries