2 Star 0 Fork 70

golang-package/carbon

forked from dromara/carbon 
Create your Gitee Account
Explore and code with more than 13.5 million developers,Free private repositories !:)
Sign up
文件
Clone or Download
extremum.go 2.69 KB
Copy Edit Raw Blame History
package carbon
import "time"
const (
minDuration Duration = -1 << 63
maxDuration Duration = 1<<63 - 1
)
// ZeroValue returns the zero value of Carbon instance.
func ZeroValue() *Carbon {
return MinValue()
}
// EpochValue returns the unix epoch value of Carbon instance.
func EpochValue() *Carbon {
return NewCarbon(time.Date(EpochYear, time.January, 1, 0, 0, 0, 0, time.UTC))
}
// MaxValue returns the maximum value of Carbon instance.
func MaxValue() *Carbon {
return NewCarbon(time.Date(9999, time.December, 31, 23, 59, 59, 999999999, time.UTC))
}
// MinValue returns the minimum value of Carbon instance.
func MinValue() *Carbon {
return NewCarbon(time.Date(1, time.January, 1, 0, 0, 0, 0, time.UTC))
}
// MaxDuration returns the maximum value of duration instance.
func MaxDuration() Duration {
return maxDuration
}
// MinDuration returns the minimum value of duration instance.
func MinDuration() Duration {
return minDuration
}
// Max returns the maximum Carbon instance from some given Carbon instances.
func Max(c1 *Carbon, c2 ...*Carbon) (c *Carbon) {
c = c1
if c.IsInvalid() {
return
}
if len(c2) == 0 {
return
}
for i := range c2 {
if c2[i].IsInvalid() {
return c2[i]
}
if c2[i].Gte(c) {
c = c2[i]
}
}
return
}
// Min returns the minimum Carbon instance from some given Carbon instances.
func Min(c1 *Carbon, c2 ...*Carbon) (c *Carbon) {
c = c1
if c.IsInvalid() {
return
}
if len(c2) == 0 {
return
}
for i := range c2 {
if c2[i].IsInvalid() {
return c2[i]
}
if c2[i].Lte(c) {
c = c2[i]
}
}
return
}
// Closest returns the closest Carbon instance from some given Carbon instances.
func (c *Carbon) Closest(c1 *Carbon, c2 ...*Carbon) *Carbon {
if c.IsInvalid() {
return c
}
if c1.IsInvalid() {
return c1
}
if len(c2) == 0 {
return c1
}
args := append([]*Carbon{c1}, c2...)
for i := range args {
if args[i].IsInvalid() {
return args[i]
}
}
closest := args[0]
minDiff := c.DiffAbsInSeconds(closest)
for i := range args[1:] {
arg := args[1:][i]
diff := c.DiffAbsInSeconds(arg)
if diff < minDiff {
minDiff = diff
closest = arg
}
}
return closest
}
// Farthest returns the farthest Carbon instance from some given Carbon instances.
func (c *Carbon) Farthest(c1 *Carbon, c2 ...*Carbon) *Carbon {
if c.IsInvalid() {
return c
}
if c1.IsInvalid() {
return c1
}
if len(c2) == 0 {
return c1
}
args := append([]*Carbon{c1}, c2...)
for i := range args {
if args[i].IsInvalid() {
return args[i]
}
}
farthest := args[0]
maxDiff := c.DiffAbsInSeconds(farthest)
for i := range args[1:] {
arg := args[1:][i]
diff := c.DiffAbsInSeconds(arg)
if diff > maxDiff {
maxDiff = diff
farthest = arg
}
}
return farthest
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
Go
1
https://gitee.com/golang-package/carbon.git
git@gitee.com:golang-package/carbon.git
golang-package
carbon
carbon
master

Search