Skip to main content

Task

Struct Task 

Source
pub struct Task {
    pub variables: Vec<Variable>,
    pub operators: Vec<Operator>,
    pub initial: State,
    pub goal: Vec<Fact>,
}

Fields§

§variables: Vec<Variable>§operators: Vec<Operator>§initial: State§goal: Vec<Fact>

Implementations§

Source§

impl Task

Source

pub fn validate(&self) -> Result<(), TaskError>

Examples found in repository?
examples/load.rs (line 23)
12fn main() -> Result<(), Box<dyn std::error::Error>> {
13    let path = std::env::args().nth(1).ok_or("usage: load <output.sas>")?;
14    let file: SasFile = std::fs::read_to_string(&path)?.parse()?;
15    println!(
16        "{path}: {} variables, {} operators, {} axioms, metric {}",
17        file.variables.len(),
18        file.operators.len(),
19        file.axioms.len(),
20        u8::from(file.use_metric)
21    );
22    let task = file.to_task()?;
23    task.validate()?;
24    // perfect_heuristic() stores one transition per operator and state.
25    let transitions = task
26        .variables
27        .iter()
28        .try_fold(task.operators.len().max(1), |n, v| {
29            n.checked_mul(v.domain_size as usize)
30        });
31    match transitions {
32        Some(n) if n <= MAX_TRANSITIONS => match task.perfect_heuristic()(&task.initial) {
33            Some(cost) => println!("optimal plan cost: {cost}"),
34            None => println!("unsolvable"),
35        },
36        _ => println!("too large for exhaustive search, skipping the optimal cost"),
37    }
38    Ok(())
39}
Source

pub fn num_variables(&self) -> usize

Source

pub fn is_applicable(&self, op: OpId, state: &State) -> bool

Source

pub fn apply(&self, op: OpId, state: &State) -> State

Source

pub fn applicable_operators<'a>( &'a self, state: &'a State, ) -> impl Iterator<Item = OpId> + 'a

Source

pub fn is_goal(&self, state: &State) -> bool

Source

pub fn costs(&self) -> Vec<u64>

Operator costs indexed by operator id (the label cost function).

Source

pub fn validate_plan(&self, plan: &[OpId]) -> Option<u64>

Checks that plan is applicable from the initial state and reaches the goal. Returns the plan cost.

Source

pub fn perfect_heuristic(&self) -> impl Fn(&State) -> Option<u64> + '_

Optimal plan cost from state, by exhaustive projection onto all variables. Exponential; intended for tests on tiny tasks.

Examples found in repository?
examples/load.rs (line 32)
12fn main() -> Result<(), Box<dyn std::error::Error>> {
13    let path = std::env::args().nth(1).ok_or("usage: load <output.sas>")?;
14    let file: SasFile = std::fs::read_to_string(&path)?.parse()?;
15    println!(
16        "{path}: {} variables, {} operators, {} axioms, metric {}",
17        file.variables.len(),
18        file.operators.len(),
19        file.axioms.len(),
20        u8::from(file.use_metric)
21    );
22    let task = file.to_task()?;
23    task.validate()?;
24    // perfect_heuristic() stores one transition per operator and state.
25    let transitions = task
26        .variables
27        .iter()
28        .try_fold(task.operators.len().max(1), |n, v| {
29            n.checked_mul(v.domain_size as usize)
30        });
31    match transitions {
32        Some(n) if n <= MAX_TRANSITIONS => match task.perfect_heuristic()(&task.initial) {
33            Some(cost) => println!("optimal plan cost: {cost}"),
34            None => println!("unsolvable"),
35        },
36        _ => println!("too large for exhaustive search, skipping the optimal cost"),
37    }
38    Ok(())
39}

Trait Implementations§

Source§

impl Clone for Task

Source§

fn clone(&self) -> Self

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

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

Performs copy-assignment from source. Read more
Source§

impl Debug for Task

Source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl Forget for Task

§

impl Freeze for Task

§

impl Move for Task

§

impl RefUnwindSafe for Task

§

impl Send for Task

§

impl Sync for Task

§

impl Unpin for Task

§

impl UnsafeUnpin for Task

§

impl UnwindSafe for Task

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = !

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, !>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.