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
impl Task
Sourcepub fn validate(&self) -> Result<(), TaskError>
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}pub fn num_variables(&self) -> usize
pub fn is_applicable(&self, op: OpId, state: &State) -> bool
pub fn apply(&self, op: OpId, state: &State) -> State
pub fn applicable_operators<'a>( &'a self, state: &'a State, ) -> impl Iterator<Item = OpId> + 'a
pub fn is_goal(&self, state: &State) -> bool
Sourcepub fn costs(&self) -> Vec<u64>
pub fn costs(&self) -> Vec<u64>
Operator costs indexed by operator id (the label cost function).
Sourcepub fn validate_plan(&self, plan: &[OpId]) -> Option<u64>
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.
Sourcepub fn perfect_heuristic(&self) -> impl Fn(&State) -> Option<u64> + '_
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§
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> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more