Struct SchedPriority 

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

A bounded integer value with range checking at construction time.

See the module-level documentation for the valid range for each type.

Implementations

impl SchedPriority

pub const MIN: u8 = 0

The minimum valid value for this type.

pub const MAX: u8 = 100

The maximum valid value for this type.

pub fn new(value: u8) -> Result<Self, ValueError>

Creates a new value, returning an error if out of range.

Examples

use chrony_confile::values::PollInterval;

let val = PollInterval::new(6)?;
assert_eq!(val.get(), 6);

let err = PollInterval::new(100);
assert!(err.is_err());

pub const fn new_unchecked(value: u8) -> Self

Creates a new value without bounds checking.

This is safe because an out-of-range value is not undefined behavior; the caller is responsible for ensuring the value is within MIN..=MAX.

pub fn get(&self) -> u8

Returns the inner numeric value.

Trait Implementations

impl Clone for SchedPriority

fn clone(&self) -> SchedPriority

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SchedPriority

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

Formats the value using the given formatter.

impl Display for SchedPriority

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

Formats the value using the given formatter.

impl From<SchedPriority> for u8

fn from(v: SchedPriority) -> Self

Converts to this type from the input type.

impl Hash for SchedPriority

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 SchedPriority

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

fn eq(&self, other: &SchedPriority) -> 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 SchedPriority

fn partial_cmp(&self, other: &SchedPriority) -> 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 TryFrom<i32> for SchedPriority

type Error = ValueError

The type returned in the event of a conversion error.

fn try_from(v: i32) -> Result<Self, Self::Error>

Performs the conversion.

impl Copy for SchedPriority

impl Eq for SchedPriority

impl StructuralPartialEq for SchedPriority