ExampleSemantics

grabapl::semantics::example

Struct ExampleSemantics

pub struct ExampleSemantics;

Trait Implementations§

impl Semantics for ExampleSemantics

type NodeConcrete = NodeValue

A data graph’s nodes contain values of this type. PL analogy: values.

type NodeAbstract = NodeType

An operation can define patterns for nodes using this type. PL analogy: types.

type EdgeConcrete = String

A data graph’s edges contain values of this type. PL analogy: values.

type EdgeAbstract = EdgeType

An operation can define patterns for edges using this type. PL analogy: types.

type NodeMatcher = NodeMatcher

The specific matching process for nodes.

type EdgeMatcher = EdgeMatcher

The specific matching process for edges.

type NodeJoin = NodeJoiner

The specific join process for nodes.

type EdgeJoin = EdgeJoiner

The specific join process for edges.

type NodeConcreteToAbstract = NodeConcreteToAbstract

type EdgeConcreteToAbstract = EdgeConcreteToAbstract

type BuiltinOperation = ExampleOperation

Builtin operations are of this type.

type BuiltinQuery = ExampleQuery

Queries are of this type

fn top_node_abstract() -> Option<Self::NodeAbstract>

Returns the top node of the abstract graph, if the semantics defines one. This is mainly used for added ergonomics on LibBuiltinOperations, since they require explicit parameters. If a semantics defines a top abstract node value, some of the LibBuiltinOperations can default to that abstract value.

fn top_edge_abstract() -> Option<Self::EdgeAbstract>

Returns the top edge of the abstract graph, if the semantics defines one. This is mainly used for added ergonomics on LibBuiltinOperations, since they require explicit parameters. If a semantics defines a top abstract edge value, some of the LibBuiltinOperations can default to that abstract value.

fn new_concrete_graph() -> ConcreteGraph<Self>

fn new_abstract_graph() -> AbstractGraph<Self>

fn join_edges( a: &Self::EdgeAbstract, b: &Self::EdgeAbstract, ) -> Option<Self::EdgeAbstract>

fn join_nodes( a: &Self::NodeAbstract, b: &Self::NodeAbstract, ) -> Option<Self::NodeAbstract>

fn concrete_to_abstract(c: &ConcreteGraph<Self>) -> AbstractGraph<Self>

Auto Trait Implementations§

impl Freeze for ExampleSemantics

impl RefUnwindSafe for ExampleSemantics

impl Send for ExampleSemantics

impl Sync for ExampleSemantics

impl Unpin for ExampleSemantics

impl UnwindSafe for ExampleSemantics

Blanket Implementations§

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

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more

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

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more

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

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

Mutably borrows from an owned value. Read more

impl<T> From<T> for T

fn from(t: T) -> T

Returns the argument unchanged.

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

fn into(self) -> U

Calls U::from(self).

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

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

type Error = Infallible

The type returned in the event of a conversion error.

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.

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

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

The type returned in the event of a conversion error.

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

Performs the conversion.