mirror of
https://github.com/fxkt-tech/liv
synced 2025-09-26 20:11:20 +08:00
31 lines
482 B
Go
31 lines
482 B
Go
package math
|
||
|
||
import "golang.org/x/exp/constraints"
|
||
|
||
// 最接近n的最小偶数
|
||
// eg： CeilOdd(41) is 40, CeilOdd(30) is also 30.
|
||
func CeilOdd[T constraints.Integer](n T) T {
|
||
if n%2 == 0 {
|
||
return n
|
||
}
|
||
return n - 1
|
||
}
|
||
|
||
func CeilOddInt32(n int32) int32 {
|
||
if n%2 == 0 {
|
||
return n
|
||
}
|
||
return n - 1
|
||
}
|
||
|
||
type Rational[T constraints.Integer] struct {
|
||
Num, Den T
|
||
}
|
||
|
||
func Fraction[T constraints.Integer](num, den T) *Rational[T] {
|
||
return &Rational[T]{
|
||
Num: num,
|
||
Den: den,
|
||
}
|
||
}
|