mirror of
https://github.com/avelino/awesome-go.git
synced 2024-12-12 17:13:58 +00:00
Add hilbert - Mapping values to and from space-filling curves. (#1075)
Such as Hilbert and Peano curves.
This commit is contained in:
parent
00b52b4597
commit
10c1e6ca54
@ -217,6 +217,7 @@ Please take a quick gander at the [contribution guidelines](https://github.com/a
|
|||||||
* [gods](https://github.com/emirpasic/gods) - Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.
|
* [gods](https://github.com/emirpasic/gods) - Go Data Structures. Containers, Sets, Lists, Stacks, Maps, BidiMaps, Trees, HashSet etc.
|
||||||
* [golang-set](https://github.com/deckarep/golang-set) - Thread-Safe and Non-Thread-Safe high-performance sets for Go.
|
* [golang-set](https://github.com/deckarep/golang-set) - Thread-Safe and Non-Thread-Safe high-performance sets for Go.
|
||||||
* [goskiplist](https://github.com/ryszard/goskiplist) - A skip list implementation in Go.
|
* [goskiplist](https://github.com/ryszard/goskiplist) - A skip list implementation in Go.
|
||||||
|
* [hilbert](https://github.com/google/hilbert) - Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
|
||||||
* [levenshtein](https://github.com/agnivade/levenshtein) - Implementation to calculate levenshtein distance in Go.
|
* [levenshtein](https://github.com/agnivade/levenshtein) - Implementation to calculate levenshtein distance in Go.
|
||||||
* [mafsa](https://github.com/smartystreets/mafsa) - MA-FSA implementation with Minimal Perfect Hashing
|
* [mafsa](https://github.com/smartystreets/mafsa) - MA-FSA implementation with Minimal Perfect Hashing
|
||||||
* [roaring](https://github.com/RoaringBitmap/roaring) - Go package implementing compressed bitsets.
|
* [roaring](https://github.com/RoaringBitmap/roaring) - Go package implementing compressed bitsets.
|
||||||
|
Loading…
Reference in New Issue
Block a user