Struct CaseId 

pub struct CaseId(pub Ulid);

A long-lived, correlated business fact spanning many runs and weeks.

One spelling, everywhere

Prefixed (case_01J8Z…) in every direction: Display, Serialize, the store key, the column. An id is self-describing wherever it lands — a log line, a URL, a JSON field, a SIEM — and grepping one against another finds it whichever way round you do it.

What this rules out is a store spelling one id two ways — prefixed in its keys and bare in its payloads — which costs a consumer an afternoon and looks like two ids until it does.

Deserialize and parse accept a bare ULID too, because one arrives from somewhere else often enough. The prefix is checked rather than stripped blindly, so a case_… string is refused where a RunId is wanted instead of silently becoming one.

Tuple Fields

0: Ulid

Implementations

impl CaseId

pub fn generate() -> Self

Mint a fresh id from the ambient clock and a random tail.

Reserved for the runtime’s admission path, which journals the result. Skills must never call this — see clippy.toml.

Sorted to the millisecond, not beyond it. Ordering comes from the timestamp prefix, so two ids minted in the same millisecond order by their random tails — arbitrarily, and differently on each instance. A range scan over one run’s records is exact because the run id is a prefix; “cases sort by creation time” is true between milliseconds and a coin flip inside one.

pub fn parse(s: &str) -> Result<Self, DecodeError>

Reconstruct from a stored string.

Accepts both the prefixed form produced by std::fmt::Display and a bare ULID, so ids round-trip through logs, URLs, and database columns without the caller having to know which form it is holding.

Only the canonical spelling: uppercase Crockford base32 whose first character is at most 7. The decoder also reads lowercase, and a first character past 7 overflows 128 bits and wraps, so without this one id would have many spellings — and every index keyed on the string would hold a different run for each.

Errors

If what remains after the prefix is not a ULID in its canonical spelling.

Trait Implementations

impl Clone for CaseId

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for CaseId

impl Debug for CaseId

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for CaseId

Through parse, so a bare ULID from somewhere else still reads.

A refusal names the type and the input: ulid’s own error is invalid length, which says nothing about which field was wrong or what it wanted.

fn deserialize<D: Deserializer<'de>>(d: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer.

impl Display for CaseId

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Eq for CaseId

impl FromStr for CaseId

The trait an id arrives through: an axum path segment, a clap argument, a TOML key, a serde field with #[serde(with = …)].

.parse() is where every consumer reaches first, and its absence made parse something each of them had to find.

type Err = DecodeError

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self, Self::Err>

Parses a string s to return a value of this type.

impl Hash for CaseId

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl JsonSchema for CaseId

The written form: the prefix, an underscore, and a ULID.

fn inline_schema() -> bool

Whether JSON Schemas generated for this type should be included directly in parent schemas, rather than being re-used where possible using the $ref keyword.

fn schema_name() -> Cow<'static, str>

The name of the generated JSON Schema.

fn json_schema(_: &mut SchemaGenerator) -> Schema

Generates a JSON Schema for this type.

fn schema_id() -> Cow<'static, str>

Returns a string that uniquely identifies the schema produced by this type.

impl Ord for CaseId

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

fn clamp_to<R>(self, range: R) -> Self

where Self: Sized, R: ClampBounds<Self>,

🔬This is a nightly-only experimental API. (clamp_to)

Restrict a value to a certain range.

impl PartialEq for CaseId

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl PartialOrd for CaseId

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for CaseId

The written form, so a record says which kind of id it holds.

fn serialize<S: Serializer>(&self, s: S) -> Result<S::Ok, S::Error>

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for CaseId