| 1670 | const Je = new Date(), |
| 1671 | Ze = new Date(); |
| 1672 | function Qe(t, e, n, r) { |
| 1673 | function i(e) { |
| 1674 | return (t((e = 0 === arguments.length ? new Date() : new Date(+e))), e); |
| 1675 | } |
| 1676 | return ( |
| 1677 | (i.floor = (e) => (t((e = new Date(+e))), e)), |
| 1678 | (i.ceil = (n) => (t((n = new Date(n - 1))), e(n, 1), t(n), n)), |
| 1679 | (i.round = (t) => { |
| 1680 | const e = i(t), |
| 1681 | n = i.ceil(t); |
| 1682 | return t - e < n - t ? e : n; |
| 1683 | }), |
| 1684 | (i.offset = (t, n) => ( |
| 1685 | e((t = new Date(+t)), null == n ? 1 : Math.floor(n)), |
| 1686 | t |
| 1687 | )), |
| 1688 | (i.range = (n, r, o) => { |
| 1689 | const a = []; |
| 1690 | if ( |
| 1691 | ((n = i.ceil(n)), |
| 1692 | (o = null == o ? 1 : Math.floor(o)), |
| 1693 | !(n < r && o > 0)) |
| 1694 | ) |
| 1695 | return a; |
| 1696 | let s; |
| 1697 | do { |
| 1698 | (a.push((s = new Date(+n))), e(n, o), t(n)); |
| 1699 | } while (s < n && n < r); |
| 1700 | return a; |
| 1701 | }), |
| 1702 | (i.filter = (n) => |
| 1703 | Qe( |
| 1704 | (e) => { |
| 1705 | if (e >= e) for (; t(e), !n(e); ) e.setTime(e - 1); |
| 1706 | }, |
| 1707 | (t, r) => { |
| 1708 | if (t >= t) |
| 1709 | if (r < 0) for (; ++r <= 0; ) for (; e(t, -1), !n(t); ); |
| 1710 | else for (; --r >= 0; ) for (; e(t, 1), !n(t); ); |
| 1711 | }, |
| 1712 | )), |
| 1713 | n && |
| 1714 | ((i.count = (e, r) => ( |
| 1715 | Je.setTime(+e), |
| 1716 | Ze.setTime(+r), |
| 1717 | t(Je), |
| 1718 | t(Ze), |
| 1719 | Math.floor(n(Je, Ze)) |
| 1720 | )), |
| 1721 | (i.every = (t) => ( |
| 1722 | (t = Math.floor(t)), |
| 1723 | isFinite(t) && t > 0 |
| 1724 | ? t > 1 |
| 1725 | ? i.filter( |
| 1726 | r ? (e) => r(e) % t == 0 : (e) => i.count(0, e) % t == 0, |
| 1727 | ) |
| 1728 | : i |
| 1729 | : null |