hilbert alternatives and similar packages
Based on the "Data Structures" category.
Alternatively, view hilbert alternatives based on common mentions on social networks and blogs.
-
gocache
A complete Go cache library with mutiple stores (memory, memcache, redis, ...), chainable, loadable, metrics cache and more. -
hyperloglog
HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction. -
merkletree
Implementation of a merkle tree providing an efficient and secure verification of the contents of data structures. -
Bloomfilter
Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go -
gostl
Data structure and algorithm library for go, designed to provide functions similar to C++ STL. -
go-adaptive-radix-tree
A Go implementation of Adaptive Radix Tree. -
remember-go
A universal interface for caching slow database queries (backed by redis, memcached, ristretto, or in-memory). -
count-min-log
A Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory). -
nan
Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers. -
cmap
a thread-safe concurrent map for go, support using interface{} as key and auto scale up shards.
Get performance insights in less than 4 minutes
Do you think we are missing an alternative of hilbert or a related project?
Popular Comparisons
|
SaaSHub - Software Alternatives and Reviews
Sponsored
www.saashub.com
|
README
Hilbert 
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
[Image of 8 by 8 Hilbert curve](images/hilbert.png)
This is not an official Google product (experimental or otherwise), it is just code that happens to be owned by Google.
How to use
Install:
go get github.com/google/hilbert
Example:
import "github.com/google/hilbert"
// Create a Hilbert curve for mapping to and from a 16 by 16 space.
s, err := hilbert.NewHilbert(16)
// Create a Peano curve for mapping to and from a 27 by 27 space.
//s, err := hilbert.NewPeano(27)
// Now map one dimension numbers in the range [0, N*N-1], to an x,y
// coordinate on the curve where both x and y are in the range [0, N-1].
x, y, err := s.Map(t)
// Also map back from (x,y) to t.
t, err := s.MapInverse(x, y)
Demo
The demo directory contains an example on how to draw an images of Hilbert and Peano curves, as well as animations of varying sizes for both.
go run $GOPATH/src/github.com/google/hilbert/demo/demo.go
and the following images are generated.
Simple 8x8 Hibert curve:
[8x8 Hilbert curve image](images/hilbert.png)
Simple 9x9 Peano curve:
[9x9 Hilbert curve image](images/peano.png)
Animation of Hibert curve with N in the range 1..8:
[Hilbert curve animation](images/hilbert_animation.gif)
Animation of Peano curve with N in the range 1..6:
[Peano curve animation](images/peano_animation.gif)
Licence (Apache 2)
Copyright 2015 Google Inc. All Rights Reserved.
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*Note that all licence references and agreements mentioned in the hilbert README section above
are relevant to that project's source code only.