4f2b97be90
go-radix provides the `radix` package that implements a 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 For an immutable variant, see go-immutable-radix.
7 lines
344 B
Text
7 lines
344 B
Text
@comment $NetBSD: PLIST,v 1.1 2020/04/18 15:51:55 nikita Exp $
|
|
gopkg/pkg/${GO_PLATFORM}/github.com/armon/go-radix.a
|
|
gopkg/src/github.com/armon/go-radix/LICENSE
|
|
gopkg/src/github.com/armon/go-radix/README.md
|
|
gopkg/src/github.com/armon/go-radix/go.mod
|
|
gopkg/src/github.com/armon/go-radix/radix.go
|
|
gopkg/src/github.com/armon/go-radix/radix_test.go
|