Struct EvrSortKey 

pub struct EvrSortKey(/* private fields */);

Encode an EVR (epoch, version, release) as a memcmp-sortable binary key.

The returned Vec<u8> produces correct RPM version ordering when compared byte-by-byte, matching the semantics of rpmvercmp().

This property is extremely useful, because it means that the value can be stored in a database and used to perform in-database RPM version comparisons, provided the database is capable of memcmp-style order comparisons across collections of raw bytes.

The key layout is: [4-byte big-endian epoch] [version sortkey] [release sortkey]

Empty or unparseable epochs are treated as 0, matching RPM semantics.

Implementations

impl EvrSortKey

pub fn from_values(epoch: &str, version: &str, release: &str) -> Self

Create a sortkey from individual epoch, version, and release strings.

pub fn parse(evr: &str) -> Self

Parse an EVR string (e.g. "1:2.3.4-5") and create a sortkey.

pub fn as_bytes(&self) -> &[u8]

Return a reference to the underlying bytes.

Trait Implementations

impl AsRef<[u8]> for EvrSortKey

fn as_ref(&self) -> &[u8]

Converts this type into a shared reference of the (usually inferred) input type.

impl Clone for EvrSortKey

fn clone(&self) -> EvrSortKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for EvrSortKey

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

Formats the value using the given formatter.

impl From<EvrSortKey> for Vec<u8>

fn from(k: EvrSortKey) -> Self

Converts to this type from the input type.

impl From<Vec<u8>> for EvrSortKey

fn from(v: Vec<u8>) -> Self

Converts to this type from the input type.

impl Hash for EvrSortKey

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 Ord for EvrSortKey

fn cmp(&self, other: &EvrSortKey) -> 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.

impl PartialEq for EvrSortKey

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl PartialOrd for EvrSortKey

fn partial_cmp(&self, other: &EvrSortKey) -> 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 Eq for EvrSortKey

impl StructuralPartialEq for EvrSortKey