goskiplist VS levenshtein

Compare goskiplist vs levenshtein and see what are their differences.

goskiplist

A skip list implementation in Go (by ryszard)

levenshtein

Go implementation to calculate Levenshtein Distance. (by agnivade)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
goskiplist levenshtein
- 2
240 319
- -
0.0 0.0
over 4 years ago about 1 year ago
Go Go
Apache License 2.0 MIT License
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.

goskiplist

Posts with mentions or reviews of goskiplist. We have used some of these posts to build our list of alternatives and similar projects.

We haven't tracked posts mentioning goskiplist yet.
Tracking mentions began in Dec 2020.

levenshtein

Posts with mentions or reviews of levenshtein. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-04-07.

What are some alternatives?

When comparing goskiplist and levenshtein you can also consider the following projects:

gota - Gota: DataFrames and data wrangling in Go (Golang)

gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more

boomfilters - Probabilistic data structures for processing continuous, unbounded streams.

ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]

go-geoindex - Go native library for fast point tracking and K-Nearest queries

bitset - Go package implementing bitsets

cuckoofilter - Cuckoo Filter: Practically Better Than Bloom

go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go

bit - Bitset data structure

willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.

gocache - ☔️ A complete Go cache library that brings you multiple ways of managing your caches

bloom - Bloom filters implemented in Go.