rank

package module

v0.6.1-0...-c4151a7 Latest Latest Go to latest Published: Feb 4, 2021 License: MIT Imports: 4 Imported by: 1

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

This section is empty.

This section is empty.

This section is empty.

type Counts []genome

func InsertSort(m map[string]map[string]bool) Counts

func MapToCounts(m map[string]map[string]bool) Counts

func SliceToCounts(id []string, ct []float64) Counts

Requires to slices of equal lengths The first contains the identifiers for the elements of the second Return a Counts struct for the given slices

func SortAbundance(id []string, ct []float64) Counts

Simple sorting of abundance table These slices are used to create the Counts type, which will be sorted.

func SortCounts(m map[string]map[string]bool) Counts

func (c Counts) InsertAt(elem genome, pos int) Counts

func (c Counts) Len() int

Sort interface definition to sort our Counts struct

func (c Counts) Less(i, j int) bool

func (c Counts) Swap(i, j int)

type Ranks []rank

func InsertSortRanks(m map[string]float64) Ranks

func MapToRanks(m map[string]float64) Ranks

func SortRanks(m map[string]float64) Ranks

func (r Ranks) InsertAt(elem rank, pos int) Ranks

func (r Ranks) Len() int

Sort interface definition to sort our Ranks struct

func (r Ranks) Less(i, j int) bool

func (r Ranks) Pretty(nb int)

func (r Ranks) Swap(i, j int)

func (r Ranks) Write(d, o string) error