1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
/// Seconds in a minute, used when converting a parsed timestamp.
pub const SECONDS_PER_MINUTE: i64 = 60;
/// Seconds in an hour, used when converting a parsed timestamp.
pub const SECONDS_PER_HOUR: i64 = 60 * SECONDS_PER_MINUTE;
/// Seconds in a day, used when converting a parsed timestamp.
pub const SECONDS_PER_DAY: i64 = 24 * SECONDS_PER_HOUR;
/// Separator between the fields of an RFC 2822 clock.
pub const CLOCK_FIELD_SEPARATOR: char = ':';
/// Trailing punctuation on a day-of-month token, as in `Tue, 29 Sep 2026`.
pub const DAY_FIELD_SUFFIX: char = ',';
/// Divisor rounding the March-based month position into a day of year.
pub const MONTH_POSITION_DIVISOR: i64 = 5;
/// Rounding term in the March-based day-of-year formula.
pub const MONTH_POSITION_ROUNDING: i64 = 2;
/// Days in a common year, before leap days are added back.
pub const DAYS_PER_YEAR: i64 = 365;
/// Years in the leap-year cycle.
pub const LEAP_CYCLE_YEARS: i64 = 4;
/// Years in a century, which the leap-year cycle skips.
pub const CENTURY_YEARS: i64 = 100;
/// Years in the 400-year era the civil-date algorithm counts in.
pub const ERA_YEARS: i64 = 400;
/// Days in the 400-year era, which carries 97 leap days.
pub const ERA_DAYS: i64 = 146_097;
/// Days between 0000-03-01 and 1970-01-01 in the era-based day count.
pub const CIVIL_EPOCH_OFFSET_DAYS: i64 = 719_468;
/// Multiplier carrying a month into its March-based position.
pub const MONTH_POSITION_SCALE: i64 = 153;
/// Fallback wait when a rate limit carries no readable deadline.
///
/// Only used when the registry's message could not be parsed. A parsed
/// deadline is honoured as given — see `RATE_LIMIT_SKEW_SECS` — so this
/// never inflates a window the registry was precise about. Ten minutes is
/// the registry's new-crate refill interval, so an unreadable refusal gets
/// one full interval instead of a guess that would only earn a second one.
pub const RATE_LIMIT_FLOOR_SECS: u64 = 11 * SECONDS_PER_MINUTE as u64;
/// Added to the wait crates.io asks for, absorbing clock skew between the
/// publishing runner and the registry.
///
/// This is also the shortest wait a refusal can produce. A named deadline
/// is waited out exactly, so a registry that opens the window in thirty
/// seconds costs thirty seconds rather than a guessed interval.
pub const RATE_LIMIT_SKEW_SECS: u64 = 30;
/// Ceiling on how many rate-limit deadlines a single package may wait out.
///
/// A limit that never lifts must fail the job rather than hold a runner
/// until it is killed. The ceiling only matters while a workspace is
/// publishing several new names in one run: each name costs the registry's
/// refill interval, so this covers a large first release and still stops.
pub const RATE_LIMIT_MAX_WAITS: u32 = 24;
/// Ceiling on a single wait, in seconds.
///
/// The registry's own refill interval is about ten minutes, so no genuine
/// deadline is anywhere near this bound. It exists because the wait is
/// derived from a parsed timestamp: a mis-parsed or far-future deadline
/// would otherwise sleep the runner for days, and a wrong parse must fail
/// visibly rather than stall the release. Five hours still spans a
/// generous outage, and a workspace that needs longer fails fast enough to
/// be re-run.
pub const RATE_LIMIT_MAX_WAIT_SECS: u64 = 5 * 60 * 60;
/// Month abbreviations in the RFC 2822 timestamp format crates.io emits.
pub const MONTH_ABBREVIATIONS: = ;