prometheus/vendor/github.com/hashicorp/go-immutable-radix
Simon Pasquier 2833ad490b
vendor: bump github.com/hashicorp/serf (#5378)
hashicorp/serf is only required as a dependency of hashicorp/consul so
bumping the version has no direct consequence for Prometheus itself. The
net gain is that we don't depend anymore on launchpad.net/gocheck which
required the bzr binary to be installed.

Signed-off-by: Simon Pasquier <spasquie@redhat.com>
2019-03-20 16:36:55 +01:00
..
.gitignore vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00
.travis.yml vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00
edges.go vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00
go.mod vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00
go.sum vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00
iradix.go vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00
iter.go vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00
LICENSE vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00
node.go vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00
raw_iter.go vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00
README.md vendor: bump github.com/hashicorp/serf (#5378) 2019-03-20 16:36:55 +01:00

go-immutable-radix Build Status

Provides the iradix package that implements an immutable radix tree. The package only provides a single Tree implementation, optimized for sparse nodes.

As a radix tree, it provides the following:

  • O(k) operations. In many cases, this can be faster than a hash table since the hash function is an O(k) operation, and hash tables have very poor cache locality.
  • Minimum / Maximum value lookups
  • Ordered iteration

A tree supports using a transaction to batch multiple updates (insert, delete) in a more efficient manner than performing each operation one at a time.

For a mutable variant, see go-radix.

Documentation

The full documentation is available on Godoc.

Example

Below is a simple example of usage

// Create a tree
r := iradix.New()
r, _, _ = r.Insert([]byte("foo"), 1)
r, _, _ = r.Insert([]byte("bar"), 2)
r, _, _ = r.Insert([]byte("foobar"), 2)

// Find the longest prefix match
m, _, _ := r.Root().LongestPrefix([]byte("foozip"))
if string(m) != "foo" {
    panic("should be foo")
}