Fetch the repository succeeded.
This action will force synchronization from dromara/carbon, which will overwrite any changes that you have made since you forked the repository, and can not be recovered!!!
Synchronous operation will process in the background and will refresh the page when finishing processing. Please be patient.
type_interface.go
to interfaces.go
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
}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。