pddl 0.1.0

A PDDL 3.1 parser, strongly typed
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55

//! Contains literals via the [`Literal`] type.

use crate::types::AtomicFormula;

/// An [`AtomicFormula`] or its negated value.
///
/// ## Usage
/// Used by [`GoalDefinition`](crate::GoalDefinition) and [`InitElement`](crate::InitElement).
#[derive(Debug, Clone, Eq, PartialEq)]
pub enum Literal<T> {
    AtomicFormula(AtomicFormula<T>),
    NotAtomicFormula(AtomicFormula<T>),
}

impl<'a, T> Literal<T> {
    pub const fn new(atomic_formula: AtomicFormula<T>) -> Self {
        Self::AtomicFormula(atomic_formula)
    }

    pub const fn new_not(atomic_formula: AtomicFormula<T>) -> Self {
        Self::NotAtomicFormula(atomic_formula)
    }

    pub const fn is_negated(&self) -> bool {
        matches!(self, Self::NotAtomicFormula(..))
    }
}

impl<'a, T> From<AtomicFormula<T>> for Literal<T> {
    fn from(value: AtomicFormula<T>) -> Self {
        Literal::new(value)
    }
}

#[cfg(test)]
mod tests {
    use super::*;
    use crate::parsers::{atomic_formula, parse_term, Span};
    use crate::Term;

    #[test]
    fn from_works() {
        let input = "(= x y)";
        let (_, effect) = atomic_formula(parse_term)(Span::new(input)).unwrap();

        let literal: Literal<Term> = effect.into();
        assert_eq!(
            literal,
            Literal::AtomicFormula(AtomicFormula::new_equality(
                Term::new_name("x".into()),
                Term::new_name("y".into()),
            ))
        )
    }
}