File: control

package info (click to toggle)
golang-github-armon-go-radix 1.0.0-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye, buster, buster-backports, experimental, sid
  • size: 100 kB
  • sloc: makefile: 2
file content (35 lines) | stat: -rw-r--r-- 1,306 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
Source: golang-github-armon-go-radix
Section: devel
Priority: optional
Maintainer: Debian Go Packaging Team <team+pkg-go@tracker.debian.org>
Uploaders: Tianon Gravi <tianon@debian.org>,
           Tim Potter <tpot@hpe.com>,
Build-Depends: debhelper (>= 11),
               dh-golang,
               golang-any,
Standards-Version: 4.2.1
Homepage: https://github.com/armon/go-radix
Vcs-Browser: https://salsa.debian.org/go-team/packages/golang-github-armon-go-radix
Vcs-Git: https://salsa.debian.org/go-team/packages/golang-github-armon-go-radix.git
XS-Go-Import-Path: github.com/armon/go-radix
Testsuite: autopkgtest-pkg-go

Package: golang-github-armon-go-radix-dev
Architecture: all
Depends: ${misc:Depends},
         ${shlibs:Depends},
Description: Golang implementation of Radix trees
 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.
 .
 This package contains the source.