mirror of
https://github.com/charmbracelet/lipgloss.git
synced 2024-09-11 22:17:12 +03:00
65 lines
1.0 KiB
Go
65 lines
1.0 KiB
Go
package table
|
|
|
|
import (
|
|
"sort"
|
|
)
|
|
|
|
// btoi converts a boolean to an integer, 1 if true, 0 if false.
|
|
func btoi(b bool) int {
|
|
if b {
|
|
return 1
|
|
}
|
|
return 0
|
|
}
|
|
|
|
// max returns the greater of two integers.
|
|
func max(a, b int) int {
|
|
if a > b {
|
|
return a
|
|
}
|
|
return b
|
|
}
|
|
|
|
// min returns the greater of two integers.
|
|
func min(a, b int) int {
|
|
if a < b {
|
|
return a
|
|
}
|
|
return b
|
|
}
|
|
|
|
// sum returns the sum of all integers in a slice.
|
|
func sum(n []int) int {
|
|
var sum int
|
|
for _, i := range n {
|
|
sum += i
|
|
}
|
|
return sum
|
|
}
|
|
|
|
// median returns the median of a slice of integers.
|
|
func median(n []int) int {
|
|
sort.Ints(n)
|
|
|
|
if len(n) <= 0 {
|
|
return 0
|
|
}
|
|
if len(n)%2 == 0 {
|
|
h := len(n) / 2 //nolint:gomnd
|
|
return (n[h-1] + n[h]) / 2 //nolint:gomnd
|
|
}
|
|
return n[len(n)/2]
|
|
}
|
|
|
|
// largest returns the largest element and it's index from a slice of integers.
|
|
func largest(n []int) (int, int) { //nolint:unparam
|
|
var largest, index int
|
|
for i, e := range n {
|
|
if n[i] > n[index] {
|
|
largest = e
|
|
index = i
|
|
}
|
|
}
|
|
return index, largest
|
|
}
|