File: control

package info (click to toggle)
golang-pault-go-topsort 0.0~git20150602.0.a54e6e0-2
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 56 kB
  • ctags: 20
  • sloc: makefile: 2
file content (27 lines) | stat: -rw-r--r-- 1,021 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
Source: golang-pault-go-topsort
Section: devel
Priority: extra
Maintainer: pkg-go <pkg-go-maintainers@lists.alioth.debian.org>
Uploaders: Paul Tagliamonte <paultag@debian.org>
Build-Depends: debhelper (>= 9),
               dh-golang (>= 0.10~),
               golang-go
Standards-Version: 3.9.6
Homepage: https://pault.ag/go/topsort
Vcs-Browser: http://anonscm.debian.org/gitweb/?p=pkg-go/packages/golang-pault-go-topsort.git;a=summary
Vcs-Git: git://anonscm.debian.org/pkg-go/packages/golang-pault-go-topsort.git
XS-Go-Import-Path: pault.ag/go/topsort

Package: golang-pault-go-topsort-dev
Architecture: all
Depends: ${shlibs:Depends},
         ${misc:Depends},
         golang-go
Built-Using: ${misc:Built-Using}
Description: library to topologically sort a DAG
 This package containers a few helper routines to help with sorting a DAG
 (directed acyclic graphs) such that nodes with no inbound edges will be
 returned first.
 .
 This is particularly useful for things like ordering tasks, and handling
 dependencies.