pub struct SasFile {
pub use_metric: bool,
pub variables: Vec<SasVariable>,
pub mutex_groups: Vec<Vec<Fact>>,
pub initial: Vec<Value>,
pub goal: Vec<Fact>,
pub operators: Vec<SasOperator>,
pub axioms: Vec<SasAxiom>,
}Fields§
§use_metric: boolfalse means unit costs: every operator costs 1 whatever its cost field says.
variables: Vec<SasVariable>§mutex_groups: Vec<Vec<Fact>>§initial: Vec<Value>§goal: Vec<Fact>§operators: Vec<SasOperator>§axioms: Vec<SasAxiom>Implementations§
Source§impl SasFile
impl SasFile
pub fn parse(text: &str) -> Result<Self, ParseError>
Sourcepub fn operator_cost(&self, op: OpId) -> u32
pub fn operator_cost(&self, op: OpId) -> u32
The cost search should use for operator op.
Sourcepub fn to_task(&self) -> Result<Task, ConversionError>
pub fn to_task(&self) -> Result<Task, ConversionError>
Converts to a plain SAS+ task. Prevail conditions and effect preconditions become operator preconditions; costs follow the metric.
Examples found in repository?
examples/load.rs (line 22)
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}Sourcepub fn format_plan(&self, plan: &[OpId]) -> String
pub fn format_plan(&self, plan: &[OpId]) -> String
Formats a plan the way Fast Downward writes sas_plan, for use with
plan validators such as VAL.
Trait Implementations§
impl Eq for SasFile
impl StructuralPartialEq for SasFile
Auto Trait Implementations§
impl Forget for SasFile
impl Freeze for SasFile
impl Move for SasFile
impl RefUnwindSafe for SasFile
impl Send for SasFile
impl Sync for SasFile
impl Unpin for SasFile
impl UnsafeUnpin for SasFile
impl UnwindSafe for SasFile
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