Popularity

3.2

Growing

Activity

0.0

Stable

Stars 54

Watchers 5

Forks 6

Last Commit almost 2 years ago

Programming language: Go

License: MIT License

Tags: Data Structures

Latest version: v1.1.1

hide alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view hide alternatives based on common mentions on social networks and blogs.

gods

9.7 3.9 hide VS gods

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

9.5 6.6 hide VS go-datastructures

A collection of useful, performant, and threadsafe Go datastructures.

Learn any GitHub repo in 59 seconds

Onboard AI learns any GitHub repo in minutes and lets you chat with it to locate functionality, understand different parts, and generate new code. Use it for free at www.getonboard.dev.

Promo getonboard.dev

golang-set

8.7 0.0 hide VS golang-set

A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
gota

8.6 0.0 hide VS gota

Gota: DataFrames and data wrangling in Go (Golang)
FSM for Go

8.5 0.0 hide VS FSM for Go

Finite State Machine for Go
roaring

8.3 0.0 hide VS roaring

Roaring bitmaps in Go (golang)
willf/bloom

8.3 0.0 hide VS willf/bloom

Go package implementing Bloom filters
gocache

8.2 0.0 hide VS gocache

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

7.9 0.0 hide VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.7 0.0 hide VS bitset

Go package implementing bitsets
gostl

7.4 0.0 hide VS gostl

Data structure and algorithm library for go, designed to provide functions similar to C++ STL
cuckoofilter

7.4 0.0 hide VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
algorithms

7.3 0.0 hide VS algorithms

CLRS study. Codes are written with golang.
hyperloglog

7.2 0.0 hide VS hyperloglog

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
trie

7.1 0.0 hide VS trie

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
merkletree

6.7 0.0 hide VS merkletree

A Merkle Tree implementation written in Go.
go-geoindex

6.6 0.0 hide VS go-geoindex

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

6.5 6.4 hide VS ttlcache

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

6.2 0.0 hide VS conjungo

A small flexible merge library in go
hilbert

6.0 0.0 hide VS hilbert

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

6.0 0.0 hide VS mafsa

MA-FSA implementation with Minimal Perfect Hashing
Bloomfilter

6.0 0.0 hide VS Bloomfilter

Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go
go-adaptive-radix-tree

6.0 0.0 hide VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
goconcurrentqueue

5.9 0.0 hide VS goconcurrentqueue

Go concurrent-safe, goroutine-safe, thread-safe queue
goskiplist

5.9 0.0 hide VS goskiplist

A skip list implementation in Go
levenshtein

5.7 0.0 hide VS levenshtein

Go implementation to calculate Levenshtein Distance.
cuckoo-filter

5.6 0.0 hide VS cuckoo-filter

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化
binpacker

5.5 0.0 hide VS binpacker

A binary stream packer and unpacker
bitmap

5.4 0.0 hide VS bitmap

Simple dense bitmap index in Go with binary operators
bit

5.1 0.0 hide VS bit

Bitset data structure
iter

5.0 0.0 hide VS iter

Go implementation of C++ STL iterators and algorithms.
bloom

4.9 0.0 hide VS bloom

Bloom filters implemented in Go.
encoding

4.7 0.0 hide VS encoding

Integer Compression Libraries for Go
remember-go

4.6 0.0 hide VS remember-go

Cache Slow Database Queries
ring

4.6 0.0 hide VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
deque

4.6 0.0 hide VS deque

A highly optimized double-ended queue
go-rquad

4.4 0.0 hide VS go-rquad

:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go
skiplist

4.4 0.0 hide VS skiplist

skiplist for golang
go-mcache

4.2 0.0 hide VS go-mcache

Fast in-memory key:value store/cache with TTL
memlog

4.0 0.0 hide VS memlog

A Kafka log inspired in-memory and append-only data structure
crunch

4.0 0.0 hide VS crunch

take bytes out of things easily ✨🍪
set

3.9 0.0 hide VS set

A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
nan

3.7 0.0 hide VS nan

Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers
goset

3.5 0.0 hide VS goset

Set is a useful collection but there is no built-in implementation in Go lang.
timedmap

3.5 0.0 hide VS timedmap

A thread safe map which has expiring key-value pairs.
cmap

3.3 0.0 hide VS cmap

a thread-safe concurrent map for go
count-min-log

3.3 0.0 hide VS count-min-log

Go implementation of Count-Min-Log
go-tuple

3.2 0.0 hide VS go-tuple

Go 1.18 generic tuples
ptrie

3.1 0.0 hide VS ptrie

A prefix tree implementation in go
pipeline

3.1 0.0 hide VS pipeline

Pipelines using goroutines

Do you think we are missing an alternative of hide or a related project?

Add another 'Data Structures' Package

Popular Comparisons

README

Hide IDs

Hide is a simple package to provide an ID type that is marshalled to/from a hash string. This prevents sending technical IDs to clients and converts them on the API layer. Hide uses hashids as its default hash function. But you can provide your own by implementing the Hash interface and configure it using hide.UseHash.

Read our full article on Medium.

Installation

go get github.com/emvi/hide

Example

Consider the following struct:

type User struct {
    Id       int64  `json:"id"`
    Username string `json:"username"`
}

When marshalling this struct to JSON, the ID will be represented by a number:

{
    "id": 123,
    "username": "foobar"
}

In this case you expose the technical user ID to your clients. By changing the type of the ID, you get a better result:

type User struct {
    Id       hide.ID `json:"id"`
    Username string  `json:"username"`
}

Notice that the int64 ID got replaced by the hide.ID, which internally is represented as an int64 as well, but implements the marshal interface. This allows you to cast between them and use hide.ID as a replacement. The resulting JSON changes to the following:

{
  "id": "beJarVNaQM",
  "username": "foobar"
}

If you send the new ID (which is a string now) back to the server and unmarshal it into the hide.ID type, you'll get the original technical ID back. It's also worth mentioning that a value of 0 is translated to null when an ID is marshalled to JSON or stored in database.

View the full demo