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>,
    pub axioms: Vec<Axiom>,
}

Fields§

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

As in Fast Downward, the values of derived variables here are their defaults, which hold unless an axiom derives otherwise. Use Task::initial_state for the state with axioms evaluated.

§goal: Vec<Fact>§axioms: Vec<Axiom>

Implementations§

Source§

impl Task

Source

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

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

The successor state. Effect conditions are evaluated in state; derived variables are then re-evaluated.

Like Task::is_applicable and Task::is_goal, this reads derived variables from state as given, so state must have them evaluated: start from Task::initial_state (not Task::initial) or call Task::evaluate_axioms first. States returned by apply are.

Source

pub fn evaluate_axioms(&self, state: &mut State)

Recomputes all derived variables of state from its state variables: each derived variable is reset to its default (its value in Task::initial), then the axioms fire layer by layer until nothing changes, as in Fast Downward. A variable keeps the first non-default value derived for it.

This allocates nothing but rescans the rules of a layer until none fires; search code that needs speed on axiom-heavy tasks should index the rules itself.

Source

pub fn initial_state(&self) -> State

The initial state with derived variables evaluated.

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 (with derived variables evaluated), by building the full state space over all state variables. Exponential; intended for tests on tiny tasks.

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
Source§

impl<'de> Deserialize<'de> for Task

Source§

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>
where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer. Read more
Source§

impl Eq for Task

Source§

impl PartialEq for Task

Source§

fn eq(&self, other: &Self) -> bool

Equality operator ==. Read more
1.0.0 (const: unstable) · Source§

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=. Read more
Source§

impl Serialize for Task

Source§

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>
where __S: Serializer,

Serialize this value into the given Serde serializer. Read more
Source§

impl StructuralPartialEq for Task

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> DeserializeOwned for T
where T: for<'de> Deserialize<'de>,

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.