Struct libparted::Constraint

pub struct Constraint<'a> { /* fields omitted */ }

Implementations

impl<'a> Constraint<'a>

pub fn new(
    start_align: &Alignment<'_>,
    end_align: &Alignment<'_>,
    start_range: &Geometry<'_>,
    end_range: &Geometry<'_>,
    min_size: i64,
    max_size: i64
) -> Result<Constraint<'a>>

A convenience wrapper for Constraint::init().

Allocates a new piece of memory and initializes the constraint.

pub fn new_from_max(max: &Geometry<'_>) -> Result<Constraint<'a>>

Return a constraint that requires a region to be entirely contained inside max.

pub fn new_from_min(min: &Geometry<'_>) -> Result<Constraint<'a>>

Return a constraint that requires a region to be entirely contained inside min.

pub fn new_from_min_max(
    min: &Geometry<'_>,
    max: &Geometry<'_>
) -> Result<Constraint<'a>>

Return a constraint that requires a region to be entirely contained inside min and `max’.

pub fn init(
    &mut self,
    start_align: &Alignment<'_>,
    end_align: &Alignment<'_>,
    start_range: &Geometry<'_>,
    end_range: &Geometry<'_>,
    min_size: i64,
    max_size: i64
) -> Result<()>

Initializes a pre-allocated piece of memory to contain a constraint with the supplied default values.

pub fn start_align(&self) -> Alignment<'_>

pub fn end_align(&self) -> Alignment<'_>

pub fn start_range(&self) -> Geometry<'_>

pub fn end_range(&self) -> Geometry<'_>

pub fn min_size(&'a self) -> i64

pub fn max_size(&'a self) -> i64

pub fn duplicate<'b>(&self) -> Result<Constraint<'b>>

Duplicates a constraint, if possible.

pub fn intersect(&self, other: &Constraint<'_>) -> Option<Constraint<'a>>

If the supplied constraint intersects with our constraint, a constraint will be returned with the computed solution.

pub fn is_solution(&self, geometry: &Geometry<'_>) -> bool

Check whether geometry satisfies the constraint.

pub fn solve_max(&self) -> Option<Geometry<'a>>

Find the largest region that satisfies a constraint.Alignment

There might be more than one solution. This function makes no guarantees about which solutions it will choose in this case.

pub fn solve_nearest(&self, geom: &Geometry<'_>) -> Option<Geometry<'a>>

Return the nearest region to geom that satisfies the constraint.

Note:

Nearest is somewhat ambiguous. This function makes no guarantees about how this ambiguity is resolved.

Trait Implementations

impl<'a> Drop for Constraint<'a>

fn drop(&mut self)

Executes the destructor for this type.